• 제목/요약/키워드: Route life time

Search Result 80, Processing Time 0.031 seconds

An Entropy-Based Routing Protocol for Supporting Stable Route Life-Time in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 안정된 경로의 Life-Time을 지원하기 위한 엔트로피 기반의 라우팅 프로토콜)

  • An, Beong Ku;Lee, Joo Sang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.1
    • /
    • pp.31-37
    • /
    • 2008
  • In this paper, we propose an entropy-based routing protocol to effectively support both stable route construction and route lifetime in Mobile Ad-hoc Wireless Sensor Networks (MAWSN). The basic idea and feature of the proposed routing protocol are as follows. First, we construct the stable routing routes based on entropy concept using mobility of mobile nodes. Second, we consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation using OPNET(Optimized Network Engineering Tool) and analysis. The results of the performance evaluation show that the proposed routing protocol can efficiently support both the construction of stable route and route lifetime in mobile ad-hoc wireless networks.

  • PDF

Multiple Path Based Vehicle Routing in Dynamic and Stochastic Transportation Networks

  • Park, Dong-joo
    • Proceedings of the KOR-KST Conference
    • /
    • 2000.02a
    • /
    • pp.25-47
    • /
    • 2000
  • In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.

  • PDF

A Suitable Packet Time-To-Live Value for ZigBee Packets (지그비 패킷을 위한 최적의 패킷유지시간 설정 방법)

  • Lee, Kwang-Koog;Jeon, Yeong-Ho;Shin, Jin-Gyu;Park, Hong-Seong
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.154-156
    • /
    • 2006
  • These days wireless sensor networks receive much attention from industry and researchers on various fields. The challenge is that wireless sensor networks have limited resources. Nevertheless, the route discovery in ZigBee sensor networks is performed by simple flooding when the original racket is rebroadcasted at least once by every node in a network. Such uncontrolled flooding generates an excessive number of packets competing for the media and causes a high collision rate. In this article, we propose a suitable packet Time-To-Live value to solve problems of uncontrolled flooding in ZigBee networks. It is shown that more sufficient route discovery in a ZigBee network can save network resources and lengthen the life of a sensor network.

  • PDF

A RF Energy Harvesting Based Routing Protocol in Mobile Ad-hoc Wireless Sensor Networks (모바일 애드혹 무선 센서 네트워크에서 RF 에너지 하베스팅 기반 라우팅 프로토콜)

  • Shim, KyuHyun;An, Beongku
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.4
    • /
    • pp.87-93
    • /
    • 2016
  • In this paper, we propose a RF energy harvesting based routing protocol in mobile ad-hoc wireless sensor networks. The main features and contributions of the proposed routing protocol are as follows. First, establishment of routing route based on both remaining energy of mobile sensor nodes and RF energy harvesting. Second, establishment of routing route by considering availability and stability of route based on energy of mobile sensor nodes to increase lifetime of networks and route. The performance evaluation of the proposed routing protocol using OPNET shows that the routing method considering both route availability and route stability based on RF energy harvesting can increase efficiently route lifetime.

Development of Disaster Risk Analysis System for Environment Friendly Road (친환경 도로노선의 재해위험도 평가시스템 개발)

  • Song, Min-Tae;Kang, Ho-Geun;Kim, Heung-Rae;Lee, Tae-Ock;Lee, Han-Joo
    • International Journal of Highway Engineering
    • /
    • v.14 no.5
    • /
    • pp.123-132
    • /
    • 2012
  • PURPOSES: This study is to investigate the consideration which relates with a disaster from route alignment process and proposed the method it will be able to evaluate a disaster danger fixed quantity. METHODS: Use the landslide disaster probabilistic map of GIS based and in about landslide occurrence of the route alignment at the time of neighboring area after evaluating a risk fixed quantity, it compared LCC expense in about each alternative route. It developed the system it will be able to analyze a LCC and a disaster risk in about the alternative route. In order to verify a risk analytical algorithm and the system which are developed it selected national road 59 lines on the demonstrative route and it analyzed a disaster risk. RESULTS: Demonstrative route not only the disaster risk to be it will be able to compare a disaster risk fixed quantity like the economical efficiency degree in compliance with LCC expense productions it compared and there being the designer will be able to decide the alternative route, it confirmed. CONCLUSIONS: Roads can be designed by considering occurs repeatedly landslides and debris flow caused by disasters in advance and expect to be able to effect that can reduce the overall cost to recover losses caused by the disaster, and temporally loss is expected.

Design of a machine learning based mobile application with GPS, mobile sensors, public GIS: real time prediction on personal daily routes

  • Shin, Hyunkyung
    • International journal of advanced smart convergence
    • /
    • v.7 no.4
    • /
    • pp.27-39
    • /
    • 2018
  • Since the global positioning system (GPS) has been included in mobile devices (e.g., for car navigation, in smartphones, and in smart watches), the impact of personal GPS log data on daily life has been unprecedented. For example, such log data have been used to solve public problems, such as mass transit traffic patterns, finding optimum travelers' routes, and determining prospective business zones. However, a real-time analysis technique for GPS log data has been unattainable due to theoretical limitations. We introduced a machine learning model in order to resolve the limitation. In this paper presents a new, three-stage real-time prediction model for a person's daily route activity. In the first stage, a machine learning-based clustering algorithm is adopted for place detection. The training data set was a personal GPS tracking history. In the second stage, prediction of a new person's transient mode is studied. In the third stage, to represent the person's activity on those daily routes, inference rules are applied.

A Cooperative-Aided Routing Protocol for Supporting Stable Route Life-Time in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 안정된 경로의 Life-Time 을 지원하기 위한 협력 도움 라우팅 프로토콜)

  • Lee, Joo-Sang;An, Beongku;Kong, Hyung-Yun;Ahn, Hongyoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.3
    • /
    • pp.47-55
    • /
    • 2008
  • 본 논문에서는 모바일 ad-hoc 무선 센서 네트워크[1]에서 안정된 경로의 설정 및 설정된 경로의 lifetime 을 효과적으로 지원하여 데이터 전송효율을 향상시키기 위한 협력 도움 라우팅 프로토콜(CARP: Cooperative_Aided Routing Protocol) 을 제안한다. 제안된 라우팅 프로토콜의 기본 아이디어 및 특징은 다음과 같다. 첫째, 소스노드와 목적지 노드 사이의 안정된 라우팅 경로의 설정이다. 본 연구에서는 모바일 노드들의 이동성 정보를 이용한 엔트로피 기반의 안정된 경로 설정방법을 제안 사용한다. 둘째, 협력도움 전송 방법이다[3][4][5]. 설정된 경로 위로 데이터 패킷을 전송 할 때 경로 lifetime과 SNR의 효과적인 지원으로 데이터 전송률을 증가시키기 위해 이웃 노드들로부터 협력 도움을 받는다. 셋째, 기존의 센서 네트워크는 주로 고정된 노드 환경에서 많은 연구가 되어 왔지만, 본 연구에서는 노드들의 이동성을 고려한 환경에서 연구가 이루어진다. 제안된 CARP 의 성능평가는 OPNET(Optimized Network Engineering Tool)을 사용하여 이루어졌으며 성능평가를 통하여 제안한 프로토콜은 안정된 경로의 설정 및 데이터 전송효율을 효과적으로 증가 시킬 수 있음을 알 수 있다.

  • PDF

A Study on the Minimum Route Cost Routing Protocol for 6LoWPAN (6LoWPAN을 위한 최소경로비용 라우팅 프로토콜에 관한 연구)

  • Kim, Won-Geun;Kim, Jung-Gyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.1
    • /
    • pp.1-14
    • /
    • 2010
  • It is recently issued scalability, mobility and external internet connection on Wire-less sensor network. The low power wireless sensor networks based on IPv6 technology 6LoWPAN technology is being standardized in the IETF. This paper for the 6LoWPAN environment based on the routing protocol LOAD, route cost applied the packet re-transmission rate which follows in Link Qualities price which uses at course expense and packet transmission Minimum route Cost routing protocol where does on the course wherethe smallest packet re-transmission becomes accomplished proposed. The technique which proposes compared and LOAD and AODV that about 13%, about 16% energy consumption is few respectively averagely, Energy of the entire network equally, used and energy effectiveness and improvement of network life time experiment led and confirmed.

A study on Railway Network Modernization (경쟁력강화를 위한 철도망 현대화 방향에 관한 연구)

  • Kim, Hyun-Woong
    • Proceedings of the KSR Conference
    • /
    • 2004.10a
    • /
    • pp.1618-1623
    • /
    • 2004
  • A holistic approach is needed in railway network modernization. What matters is that each route is developed optimally throughout its life to meet business needs - whether the answer at a given point in time is a rail repair or an redevelopment scheme. Modernization of railway network will bring railway systems up-to-date, enabling them to deliver optimal performance. As the result, the railway network modernization for revitalise the railway is based on seeking out optimum conditions for financially efficient infrastructure management, developing infrastructure fully in line with market needs and last but not least, improving railway business.

  • PDF