• Title/Summary/Keyword: 최종목적지

Search Result 73, Processing Time 0.023 seconds

An Adaptive Flooding Scheme using N-hop Look-ahead in MANET (MANET에서 N-hop 사전조사를 이용한 적응적인 플러딩 기법)

  • Jong, Jong-Hyeok;Oh, Im-Geol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.4
    • /
    • pp.32-39
    • /
    • 2006
  • MANET is a dynamically reconfigurable wireless network with no fixed infrastructure (base station, or AP). In order to provide the data service in MANET, we need an efficient routing protocol to deliver the data to the wanted destination at a mobile node. A method of routing protocols called reactive routing protocol has recently got attention because of their low routing overhead. But a method of flooding broadcasts the packet to all of its neighbors. For this reason, each of the node has high routing overhead to route and keep path discovery. Accordingly in this paper, I propose an adaptive flooding scheme using N-hop look-ahead in MANET, md an optimal N value of doing flooding the packet to limited area. Because of being basically ignorant about topological changes, each of the node did not spontaneously cope with path alteration. But an efficient flooding scheme applying N-hop look-ahead is more resilient to topology changes than traditional algorithms. And also with this efficient flooding scheme, the simulation results demonstrate excellent reduction of routing overhead.

  • PDF

A Bursty Traffics Friendly MAC Protocol in Wireless Sensor Networks (무선센서 네트워크에서 버스티 트래픽에 적합한 MAC 프로토콜)

  • Lee, Jin-young;Kim, Seong-cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.5
    • /
    • pp.772-778
    • /
    • 2018
  • Due to the recent advances in computing, communication and micro-electromechanical technology, Wireless Sensor Networks (WSNs) applications have been extended from military to many commercial areas such as object tracking, wire detection, and vehicular sensor networks. In some applications bursty data from many sensor nodes may be generated and the generated data from the monitoring area may be sent in a limited time to the final destination, sink node. In this paper, we present a BTF-MAC protocol adequate for WSNs applications in which bursty data packets are required to be transmitted in a limited time. The BTF-MAC is a synchronous duty-cycle MAC protocol and uses a slot-reserved and operational period extension mechanism adapted to the traffics. Our numerical analysis and simulation results show that BTF-MAC outperforms other related protocols such as DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

Demand Estimation Methodology for a New Air Route (신규 항공노선에 대한 수요 예측 모델 연구)

  • Choi, Jong Haea;Yoo, Kwang Yui;Lee, Sang Yong
    • Journal of Korean Society of Transportation
    • /
    • v.33 no.2
    • /
    • pp.145-158
    • /
    • 2015
  • A network connectivity has been regarded as a key element to strengthen a business competitive power in the aviation industry, so many airport authorities try to attract the new airlines and scheme out new air routes. With this trend, a study for an induced travel demand estimation methodology is needed. This study introduces a demand estimation method, especially for a new air route to a promising destination. With the results of previous studies, the derived demand is classified into four types - Local, Beyond, Behind and Bridge. The explanatory variables are established for each type of demand and the main independent variables are composed of distance, ratio of detour, and relative capacity compared with other airports. The equations using such variables and statistically significant coefficients are suggested as the model to make an estimation of derived demand for a new route. Therefore this study will be expected to take an initial step for all related parties to be involved more deeply into developing new air routes to enhance network connectivity.

A Study on the Management System of the New Address -Grant Scheme of Road Name and Building Number in Cheongju City- (새주소 관리시스템에 관한 연구 -청주시 도로명 및 건물번호 부여체계-)

  • Lee, Min-Young;Oh, Min-Soo;Lee, Ji-Young;Shin, Young-Chul
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.4 no.1
    • /
    • pp.47-56
    • /
    • 2001
  • Present address system in korea was originally applied as a lot number system for the purpose of collecting taxes since 1910's, which has been changed irregularly by development of the urban areas. This unreasonable address system has disadvantaged the social welfare and the industrial structure, such as visiting, communication, delivery, sightseeing, marketing, transportation, etc. Therefore the new system, which would be rational and scientific, has been deeply demanded for the better services of spatial information and administrative efficiency of government. Korean government has launched the new address project as part of strengthening measures for national competitiveness since 1996. This paper would discuss the grant scheme of road name and building number in Cheongju city and evaluate the construction process of the new address management system.

  • PDF

Performance analysis of Hierarchical Mobile IPv6 depending on the paging size (페이징 영역크기에 따른 계층적 이동 IPv6 의 성능분석)

  • 정계갑;이상욱;김준년
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.12A
    • /
    • pp.964-974
    • /
    • 2003
  • With increasing use of a personal mobile computer. the Mobile IPv6 is one of the main protocols that support mobility and complies with IPv6 specification. Similar to the mobile IPv6, the mobile IPv6 also has limitations on fast moving condition. The Hierarchical Mobile IPv6 is a solution that overcomes these limitations. The Hierarchical Mobile IPv6 is a micro mobility protocol that supports fast mobile IP handover and reduces signaling overhead with Mobility Anchor Point(MAP). But until now no paging method is applied to the Hierarchical Mobile IPv6 to reduce unnecessary signaling overhead and power consumption of mobile nodes. So, the paging mechanism for the Hierarchical Mobile IPv6 is proposed in this paper. the mechanism is implemented by making use of the destination option header and extension function and the last location algorithm. The results show that the Hierarchical Mobile IPv6 with the paging ability reduces the traffic of mobile networks by removing unnecessary binding update packet generated whenever handover takes place. Also, the larger the paging size is. the less the number of BU(Binding Update) massage generated.

Development of Road Guide Sign Management System Based on National Digital Base Maps (국가수치기본도를 활용한 도로안내표지판 관리시스템 개발)

  • Kim, Si-Gon
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.6 no.2 s.12
    • /
    • pp.35-44
    • /
    • 1998
  • Road guide sign is one of important traffic facility, which guides a driver a direction to go. A road is being newly built and/or an existing road can be temporarily closed very often at metropolitan area. Such information has to be linked to a road guide sign and to be updated in time. Otherwise, it might cause not only confusion to a driver but also traffic accident and/or traffic congestion. However, road guide signs are not properly managed at this time since the amounts of information are huge and they are being managed through paper maps manually. A decision-making framework has been developed to manage a variety of information of road guide signs based on the concept of GIS(Geographic Information Systems). Especially, it is designed on the fact that the existing national digital base maps under the NGIS(National Geographic Information Systems) program can be utilized. This framework has several functions such as the manipulation of statistics, landmark linkages along the selected traffic corridor and automatic design of signboard's content. This system is applied to the Kangnam district in Seoul Metropolitan area (SMA) for a case study.

  • PDF

Region Segmentation from MR Brain Image Using an Ant Colony Optimization Algorithm (개미 군집 최적화 알고리즘을 이용한 뇌 자기공명 영상의 영역분할)

  • Lee, Myung-Eun;Kim, Soo-Hyung;Lim, Jun-Sik
    • The KIPS Transactions:PartB
    • /
    • v.16B no.3
    • /
    • pp.195-202
    • /
    • 2009
  • In this paper, we propose the regions segmentation method of the white matter and the gray matter for brain MR image by using the ant colony optimization algorithm. Ant Colony Optimization (ACO) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. This algorithm finds the expected pixel for image as the real ant finds the food from nest to food source. Then ants deposit pheromone on the pixels, and the pheromone will affect the motion of next ants. At each iteration step, ants will change their positions in the image according to the transition rule. Finally, we can obtain the segmentation results through analyzing the pheromone distribution in the image. We compared the proposed method with other threshold methods, viz. the Otsu' method, the genetic algorithm, the fuzzy method, and the original ant colony optimization algorithm. From comparison results, the proposed method is more exact than other threshold methods for the segmentation of specific region structures in MR brain image.

A study on User Experience of Automatic Ticket Vending Machine UI :Focused on Seoul Metro Line 9 (지하철 무인 승차권 발매기 UI 사용 경험 연구 :서울시 지하철 9호선 1회용 발매기 중심으로)

  • Hwang, Shin-Hye;Choe, Jong-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.6
    • /
    • pp.54-61
    • /
    • 2015
  • The ATVM(Automatic Ticket Vending Machine) of Seoul Metropolitan is a Kiosk which is called Ticket Vending and Reload Device at the subway station. It is implemented for integrating transportation card system which is separated from a paper subway ticket and replacing ticket selling employees. However, since the automatic ticket vending machine was accepted in 2009, there has been confusion of purchasing a ticket. Therefore, it requires improvement of usability. This study, conducts a literature search. Also, the interface of ATVM is analyzed. Finally user observation proceeded at Sinnonhyeon Station of Seoul Metro line 9. The results show that selecting a destination and section fares is confusing process for user. Based on this survey the improvements of UI are proposed to expect advanced directions of the ATVM.

Implementation of Autonomous Mobile Wheeled Robot for Path Correction through Deep Learning Object Recognition (딥러닝 객체인식을 통한 경로보정 자율 주행 로봇의 구현)

  • Lee, Hyeong-il;Kim, Jin-myeong;Lee, Jai-weun
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.12
    • /
    • pp.164-172
    • /
    • 2019
  • In this paper, we implement a wheeled mobile robot that accurately and autonomously finds the optimal route from the starting point to the destination point based on computer vision in a complex indoor environment. We get a number of waypoints from the starting point to get the best route to the target through deep reinforcement learning. However, in the case of autonomous driving, the majority of cases do not reach their destination accurately due to external factors such as surface curvature and foreign objects. Therefore, we propose an algorithm to deepen the waypoints and destinations included in the planned route and then correct the route through the waypoint recognition while driving to reach the planned destination. We built an autonomous wheeled mobile robot controlled by Arduino and equipped with Raspberry Pi and Pycamera and tested the planned route in the indoor environment using the proposed algorithm through real-time linkage with the server in the OSX environment.

A Study on the Shortest Path Algorithm With Direction of the Postal Route Optimization System (방향성을 고려한 우편 경로 최적화 시스템의 최단 경로 생성 알고리즘 연구)

  • Nam, Sang-U;Park, Mun-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.491-498
    • /
    • 1997
  • Geographic Infprmation System(GIS)is being apply to extended from specified ppkication to general purpose deu to the omprovement of computing power.As one part of postal Integarated Information Servies, Postalroute Optimication system(PROS) is comprsed of the composed of the shortest pathe genrator for providing fast and shortest route of postal delivery, the ischronal area generator, the boudary relacation generator, GIS engine, road map, and rdelational database , etc.This paper is related to creation algorithm of the shortest path generation (SPAWD;Shortest Path Algorithm With Direction)from PEOS model.To differ from the exsting shortest path generating methods, this paper suggests SPAWD alforithm for searching destinations of fast time between start and destination points with dirdstion.It comapares and analyzes the new algorithm with existion algorithms, and suggests directions of future studies.

  • PDF