• Title/Summary/Keyword: Multi-hop Look-ahead

Search Result 2, Processing Time 0.018 seconds

RREM : Multi-hop Information Based Real-Time Routing Protocol to Support Event Mobility in Wireless Sensor Networks (무선 센서 망에서 실시간 응용의 이벤트 이동성을 지원하기 위한 라우팅 기법)

  • Lee, Soyeon;Lee, Jeongcheol;Park, Hosung;Kong, Jonguk;Kim, Sangha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.8
    • /
    • pp.688-696
    • /
    • 2013
  • In wireless sensor networks, real-time applications have to ensure the timely delivery of real-time data. Recently, OMLRP (On-demand Multi-hop Look-ahead Routing Protocol) has been proposed to improve the timeliness of wireless sensor networks. The protocol needs initialization time to establish multi-hop information based routing path because it performs incremental look-ahead of the information. Consequently, the protocol deteriorates DDSR (Deadline Delivery Success Ratio) as an event moves because it takes little consideration of event mobility. In this paper, we proposed a Real-time Routing for Events Mobility (RREM) which exploits a data redirection in order to improve the DDSR of moving events. Instead of recollecting muti-hop look-ahead information, the RREM redirects the data to a sensor node holding the information collected in a previous round. We verify the timeliness and energy efficiency of RREM using various MatLab simulations.

Performance Evaluation of On-Demand Routing Protocol using Look-ahead Selective Flooding in Ad-hoc Network (Ad-hoc 네트워크에서 Look-ahead Selective Flooding을 이용한 On-Demand 라우팅 프로토콜 성능 개선)

  • Yo-chan Ahn
    • Journal of Information Technology Applications and Management
    • /
    • v.10 no.2
    • /
    • pp.61-71
    • /
    • 2003
  • Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

  • PDF