• Title/Summary/Keyword: Multi-hop Routing

Search Result 310, Processing Time 0.029 seconds

Development of Energy Efficiency Routing Technique for Mobile Ad-hoc Sensor Network (모바일 에드-혹 센서 네트워크를 위한 에너지 효율적 라우팅 기법 개발)

  • Lee, YangMin;Lee, KwangYong;Lee, JaeKee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.547-548
    • /
    • 2009
  • The development of USN(Ubiquitous Sensor Network) technology is creating numerous application areas. Although a network configuration with fixed sensors was the norm in the past, the coexistence of mobile and fixed sensor nodes is a new trend. Fixed sensor networks focused on the energy efficiency of nodes, but the latest studies consider guaranteeing the mobility of nodes and maintaining their connectivity, while remaining energy efficient at the same time. This paper proposes a routing protocol for a mobile ad-hoc sensor network that improves the mobility, connectivity and energy efficiency of nodes while allowing for the management and maintenance of a large number of nodes even in a complex communication environment where mobile and fixed nodes coexist. An algorithm for multi-hop multi-paths, a technique for topology reconfiguration by node movement prediction and vibration sensors, path setting for a large number of nodes, and efficient data transfer technology have been introduced to implement the modified LEAHC-AOMDV protocol. Furthermore, the excellence of this protocol was verified through a comparative experiment with the conventional LEACH protocol.

An Efficient Addressing Scheme Using (x, y) Coordinates in Environments of Smart Grid (스마트 그리드 환경에서 (x, y) 좌표값을 이용한 효율적인 주소 할당 방법)

  • Cho, Yang-Hyun;Lim, Song-Bin;Kim, Gyung-Mok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.1
    • /
    • pp.61-69
    • /
    • 2012
  • Smart Grid is the next-generation intelligent power grid that maximizes energy efficiency with the convergence of IT technologies and the existing power grid. Smart Grid is created solution for standardization and interoperability. Smart Grid industry enables consumers to check power rates in real time for active power consumption. It also enables suppliers to measure their expected power generation load, which stabilizes the operation of the power system. Smart industy was ecolved actively cause Wireless communication is being considered for AMI system and wireless communication using ZigBee sensor has been applied in various industly. In this paper, we proposed efficient addressing scheme for improving the performance of the routing algorithm using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm has wasted address space. Therefore proposing x, y coordinate axes from divide address space of 16 bit to solve this problem. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verify performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduce multi hop than ZigBee distributed address assignment and another.

Implementation of LMPR on TinyOS for Wireless Sensor Network (전송 부하를 분산하는 무선 센서 네트워크 구축을 위한 TinyOS 기반 LMPR 구현)

  • Oh, Yong-Taek;Kim, Pung-Hyeok;Jeong, Kug-Sang;Choi, Deok-Jai
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.12
    • /
    • pp.136-146
    • /
    • 2006
  • In Wireless Sensor Network(WSN) a sensor node transfers sensing data to the base-node through multi-hop because of the limited transmission range. Also because of the limited energy of the sensor node, the sensor nodes are required to consume their energy evenly to prolong the lifetime of the network. LMPR is a routing protocol for WSN, LMPR configures the network autonomously based on level which is the depth from the base-node, and distributes the transmission and computation load of the network to each sensor node. This paper implements LMPR on TinyOS and experiments on the performance of LMPR in WSN. As the result, the average of the received rate of LMPR is 91.39% and LMPR distributes the load of the transmission and computation about 4.6 times compare to the shortest cost routing protocol. We expect LMPR evenly distributes the transmission and computation load of the network to each node, and the lifetime of the network will be longer than it used to be.

  • PDF

Studying Route Optimality in Multi-Hop Wireless Mesh Networks (다중 홉 무선 메쉬 네트워크에서 최적 경로에 관한 연구)

  • Kim, Seong-Kwan;Lee, Ok-Hwan;Lee, Sung-Ju;Choi, Sung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.16-23
    • /
    • 2009
  • This paper investigates how many optimal routes can be established in terms of a given wireless mesh routing metric. Although many of routing metrics have been devised to precisely derive the wireless link quality in mesh, most (if not all) metrics have not been evaluated their optimality along with routing protocols. We consider stateof-the-art routing metrics and a widely accepted routing protocol in order to observe the optimality of established routes varying the number of source nodes. Also, we propose a unidirectional routing to deal with possible link asymmetry feature in wireless links. Through comparative simulation evaluations, we show that the portion of optimally established routes becomes less as the network traffic load increases, regardless of employed metrics, network topologies, and routing protocols.

A Routing Scheme based on Normalized Location and Transmission Characteristics (NLTCR) for Multi-Carrier MANETs at Sea (다중캐리어 해상자율망을 위한 위치와 전송특성 정규값 기반 경로배정방식)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.36 no.2
    • /
    • pp.302-308
    • /
    • 2012
  • Self-configuration network model is to overcome the limits of data communications at sea. As a research for enhancing the connectivity and scalability of data networks at sea using the diversity and heterogeneity of the data networks on land, in this paper, a routing scheme (NLTCR) based on not conventional hop counts but distances to destination ships is introduced. The NLTCR seeks an optimal route by normalized distances to a destination, and transmission characteristics of applications and carriers. Performance is evaluated and compared with those of the max-win (MWR) and the normalized transmission characteristics (NTCR) based schemes.

WSN-based Coastal Environment Monitoring System Using Flooding Routing Protocol (플러딩 라우팅 프로토콜을 이용한 WSN 기반의 연안 환경 모니터링 시스템)

  • Yoo, Jae-Ho;Lee, Chang-Hee;Ock, Young-Seok;Chung, Wan-Young
    • Journal of Sensor Science and Technology
    • /
    • v.21 no.1
    • /
    • pp.46-52
    • /
    • 2012
  • The rapid water pollution in stream, river, lake and sea in recent years raises an urgent need for continuous monitoring and policymaking to conserve the global clean environment. In particular, the increasing water pollution in coastal marine areas adds to the importance of the environmental monitoring systems. In this paper, the mobile server is designed to gathers information of the water quality at coastal areas. The obtained data by the server is transmitted from field servers to the base station via multi-hop communication in wireless sensor network. The information collected includes dissolved oxygen(DO), hydrogen ion exponent(pH), temperature, etc. By the information provided the real-time monitoring of water quality at the coastal marine area. In addition, wireless sensor network-based flooding routing protocol was designed and used to transfer the measured water quality information efficiently. Telosb sensor node is programmed using nesC language in TinyOS platform for small scale wireless sensor network monitoring from a remote server.

Congestion Aware Fast Link Failure Recovery of SDN Network Based on Source Routing

  • Huang, Liaoruo;Shen, Qingguo;Shao, Wenjuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5200-5222
    • /
    • 2017
  • The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

  • Yousofi, Ahmad;Sabaei, Masoud;Hosseinzadeh, Mehdi
    • ETRI Journal
    • /
    • v.40 no.5
    • /
    • pp.613-623
    • /
    • 2018
  • The instability of operational channels on cognitive radio networks (CRNs), which is due to the stochastic behavior of primary users (PUs), has increased the complexity of the design of the optimal routing criterion (ORC) in CRNs. The exploitation of available opportunities in CRNs, such as the channel diversity, as well as alternative routes provided by the intermediate nodes belonging to routes (internal backup routes) in the route-cost (or weight) determination, complicate the ORC design. In this paper, to cover the channel diversity, the CRN is modeled as a multigraph in which the weight of each edge is determined according to the behavior of PU senders and the protection of PU receivers. Then, an ORC for CRNs, which is referred to as the stability probability of communication between the source node and the destination node (SPC_SD), is proposed. SPC_SD, which is based on the obtained model, internal backup routes, and probability theory, calculates the precise probability of communication stability between the source and destination. The performance evaluation is conducted using simulations, and the results show that the end-to-end performance improved significantly.

Analysis of MANET Protocols Using OPNET (OPNET을 이용한 MANET 프로토콜 분석)

  • Zhang, Xiao-Lei;Wang, Ye;Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.87-97
    • /
    • 2009
  • A Mobile Ad hoc Network (MANET) is characterized by multi-hop wireless connectivity, frequently changing network topology with mobile nodes and the efficiency of the dynamic routing protocol plays an important role in the performance of the network. In this paper, the performance of five routing protocols for MANET is compared by using OPNET modeler: AODV, DSR, GRP, OLSR and TORA. The various performance metrics are examined, such as packet delivery ratio, end-to-end delay and routing overhead with varying data traffic, number of nodes and mobility. In our simulation results, OLSR shows the best performance in terms of data delivery ratio in static networks, while AODV has the best performance in mobile networks with moderate data traffic. When comparing proactive protocols (OLSR, GRP) and reactive protocols (AODV, DSR) with varying data traffic in the static networks, proactive protocols consistently presents almost constant overhead while the reactive protocols show a sharp increase to some extent. When comparing each of proactive protocols in static and mobile networks, OLSR is better than GRP in the delivery ratio while overhead is more. As for reactive protocols, DSR outperforms AODV under the moderate data traffic in static networks because it exploits caching aggressively and maintains multiple routes per destination. However, this advantage turns into disadvantage in high mobility networks since the chance of the cached routes becoming stale increases.

  • PDF

Implementation of Image Transmission System in Ad-Hoc Network Using AODV Routing Protocol (Ad hoc 네트워크에서 AODV 라우팅 프로토콜을 이용한 영상 전송 시스템 구현)

  • Lee, Sung-Hun;Lee, Hyung-Keun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.6
    • /
    • pp.92-100
    • /
    • 2008
  • Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base stations. Recently, Ad-hoc networks are evolving to support multimedia contents according to expansion of ad hoc multi-hop communication system. Wireless ad-hoc network is different from the conventional wired network by frequent changes in network topology, number of routers and resources, there are a number of problems in applying conventional routing protocol to ad-hoc network. The AODV routing protocol is proposed for mobile node in ad-hoc networks. AODV protocol that provides to guarantee QoS for data transmission in ad hoc networks that link break frequently occurs. In this paper, AODV routing protocol based NDIS(Network Driver Interface Specification) is implemented. We design high performance image transmission that can operate with software(AODV) for ad-hoc networks without degradation. and verify operation of AODV routing protocol on the test bed.

  • PDF