Fucai Yu
ABSTRACT
Void areas (holes) are hardly avoided in sensor networks either because of various actual geographical environments, e.g., puddles, buildings or obstacles, or uneven energy consumption. To bypass holes, most existing geographic routing protocols tend to route data packets along the boundaries of holes. Generally, a data packet will be either forwarded along a hole boundary by the right hand rule or pushed back to find another route to its destination when the data packet encounters the hole boundary. The right hand rule, on one hand, consumes more of the nodes' energy on the boundaries of holes, thus possibly enlarging the holes; on the other hand, it may incur data collisions if multiple communication sessions share the same boundaries of holes simultaneously. In this paper, we will propose a hole geometric modeling to solve hole problem in wireless sensor networks. Our hole geometric modeling has two goals: one is to prevent data packets from traveling along the boundaries of holes; the other is to avoid the problem of local minimum phenomenon. By achieving the first goal we can not only reduce the energy consumption of the nodes on the boundaries of holes, thus preventing holes' diffusion, but also reduce the data collisions in the nodes on the boundaries of holes. The second goal can reduce the packets rerouting overhead.
- Karp B, Kung H. GPSR: Greedy perimeter stateless routing for wireless networks. In Proc. of the 6th Annual Int'l Conf. on Mobile Computing and Networking. Boston: ACM Press, 2000. pp.243--254. Google Scholar
Digital Library
- Q. Fang, J. Gao, und L. J. Guibas, "Locating and bypassing routing holes in sensor networks". In Proc. of INFOCOM 2004, vol.4, March 2004 pp.2458--2468.Google ScholarCross Ref
- P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. "Routing with guaranteed delivery in ad hoc wireless networks", In Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'99), 1999, pp.48--55. Google ScholarDigital Library
- T. He, J.A. Stankovic, C. Lu and T.F. Abdelzaher, "A Spatiotemporal Communication Protocol for Wireless Sensor Networks", IEEE Transactions on Parallel and Distributed Systems, VOL. 16, NO. 10, October 2005, pp.995--1006. Google ScholarDigital Library
- D. S. J. De Couto and R. Morris, "Location proxies and intermediate node. forwarding for practical geographic forwarding," Tech. Rep. MIT-LCS-. TR-824, MIT Laboratory for Computer Science, June 2001.Google Scholar
- J. Li, J. Jannotti, D. DeCouto, D. Karger, and R. Morris, "A scalable location service for geographic ad-hoc routing." in Proc. of the 6th Annual ACM/IEEE Int'l Conf. on Mobile Computing and Networking, 2000, pp.120--130. Google ScholarDigital Library
- S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, "A Geographic Hash Table for Data-centric Storage," In the First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA). 2002, pp. 78--87. Google ScholarDigital Library
- J. Hightower and G. Borriello, "Location Systems for Ubiquitous Computing". IEEE Computer, vol. 34, no. 8, August 2001, pp. 57--66. Google ScholarDigital Library
- A. Savvides, C.-C. Han, and M. B. Srivastava, "Dynamic Fine-grained Localization in ad-hoc networks of Sensors". In Proc. MobiCom, 2001, pp.166--179. Google ScholarDigital Library
- A. Savvides and M. B. Strivastava, "Distributed Fine-grained localization in ad-hoc networks", IEEE Transactions of Mobile Computing, 2003.Google Scholar
- A. Ward, A. Jones, and A. Hopper, "A new location technique for the active office," IEEE Personnel Communications, vol. 4, no. 5, October 1997, pp. 42--47.Google ScholarCross Ref
- J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Elsevier North-Holland, 1976). Google ScholarDigital Library
Index Terms
- A modeling for hole problem in wireless sensor networks
Recommendations
Virtual Convex Polygon Based Hole Boundary Detection and Time Delay Based Hole Detour Scheme in WSNs
Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009In wireless sensor networks, an important issue often faced in geographic routing is the "local minimum phenomenon." To mitigate the local minimum issue, when the routing process becomes stuck at hole boundary nodes, the existing perimeter routing tends ...
Efficient hole bypass routing scheme using observer packets for geographic routing in wireless sensor networks
Greedy forwarding fails due to void area (called hole) where no nodes can be deployed in realistic wireless sensor networks. This is known as the local minimum problem. In this paper, we propose BHOP-GR(Bypassing Hole Scheme Using Observer Packets for ...
An adaptive hole-bypassing algorithm for wireless sensor networks
SAC '16: Proceedings of the 31st Annual ACM Symposium on Applied ComputingIn this paper, we propose an adaptive, local hole-bypassing algorithm for geographic routing in Wireless Sensor Networks (WSNs). Void areas exist in WSNs mainly because of low-density sensor-node distribution or the drain of a sensor node's energy ...
Comments