Dang Tu Nguyen
ABSTRACT
Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the network may be intermittently connected. In light of this, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding latency. Recently, Lu Su et al. have proposed an ODML routing scheme that finds low latency routes in intermittently-connected sensor networks by using RREQ and RREP messages [9]. Nevertheless, ODML does not consider the latency of RREP and has a high routing overhead. This paper proposes a novel Multicandidate Greedy Routing (MGR) scheme that makes the best effort to find minimum latency routes in wireless sensor networks. In MGR, each source node sends an RREQ to a set of first wake-up forwarder candidates and selects a route with minimum estimated delivery latency based on their replies. Simulation results demonstrate that our proposed scheme performs better than the distance-based greedy forwarding and ODML in terms of delivery latency and routing overhead.
- I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. A survey on sensor networks. In IEEE Communications Magazine, vol. 40, pages 102--114, 2002. Google Scholar
Digital Library
- Q. Cao, T. Abdelzaher, T. He, and J. Stankovic. Towards optimal sleep scheduling in sensor networks for rare-event detection. In IPSN '05, pages 20--27, 2005. Google ScholarDigital Library
- M. Cardei, M. Thai, Y. Li, and W. Wu. Energy-efficient target coverage in wireless sensor networks. In INFOCOM, pages 1976--1984, 2005.Google ScholarCross Ref
- G. Finn. Routing and addressing problems in large: metropolitan-scale internetworks. Tech. rep., Information Science Institute, University of Southern California, 1987.Google Scholar
- C. Gui and P. Mohapatra. Power conservation and quality of surveillance in target tracking sensor networks. In MobiCom '04, pages 129--143, 2004. Google ScholarDigital Library
- M. T. Ha, T. D. Le, and H. Choo. Employing a Novel Two Tiered Network Structure to Extend the Lifetime of WSNs. In WCNC, pages 1--6, 2009. Google ScholarDigital Library
- S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network. In SIGCOMM, pages 145--158, 2004. Google ScholarDigital Library
- H. Liu, P. Wan, C.-W. Yi, X. Jia, S. Makki, and P. Niki. Maximal lifetime scheduling in sensor surveillance networks. In INFOCOM, pages 2482--2491, 2005.Google Scholar
- L. Su, C. Liu, H. Song, and G. Cao. Routing in Intermittently Connected Sensor Networks. In IEEE ICNP, pages 278--287, 2008.Google Scholar
- X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill. Integrated coverage and connectivity configuration in wireless sensor networks. In SenSys '03, pages 28--39, 2003. Google ScholarDigital Library
- T. Yan, T. He, and J. A. Stankovic. Differentiated surveillance for sensor networks. In SenSys '03, pages 51--62, 2003. Google ScholarDigital Library
Recommendations
MGR: multi-level global router
ICCAD '11: Proceedings of the International Conference on Computer-Aided DesignGlobal routing faces an increasing problem size and urgent demand on improvement in solution quality. Despite of the recent developments of global routers, there exist only two types of choices: slow 3D routers with good solution quality or efficient 2D ...
MGR: Multi-level global router
ICCAD '11: Proceedings of the 2011 IEEE/ACM International Conference on Computer-Aided DesignGlobal routing faces an increasing problem size and urgent demand on improvement in solution quality. Despite of the recent developments of global routers, there exist only two types of choices: slow 3D routers with good solution quality or efficient 2D ...
A weight-based clustering multicast routing protocol for mobile ad hoc networks
In mobile ad hoc networks, the mobile nodes can move arbitrarily without any centralised management mechanism. The topology of these networks can be very dynamic due to the mobility of mobile nodes. Under such changeable network topology, multicasting ...
Comments