Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
A Spatiotemporal Communication Protocol for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Transmitting streaming data in wireless multimedia sensor networks with holes
Proceedings of the 6th international conference on Mobile and ubiquitous multimedia
Mobile Networks and Applications
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 2009
Hole reshaping routing in large-scale mobile ad-hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Lifetime extension for surveillance wireless sensor networks with intelligent redeployment
Journal of Network and Computer Applications
Hi-index | 0.00 |
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.