Abstract
A quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+epsilon)-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.
Highlights
Wireless sensor nodes can be applied to build many reallife applications [1]
We have addressed a challenging problem that caused by a large hole of complicated shape in wireless sensor networks
We have proposed a load-balancing, (1 þ )-stretch routing scheme k-MLP routing that achieves k almostparallel routes with stretch at most 1 þ from the shortest routes for any constant [ 0 and a given network-hole scenario, The main idea is to construct k almost parallel lanes between source s and a destination d such that this kwidth strip always aligns itself with the shortest path between s and t
Summary
Wireless sensor nodes can be applied to build many reallife applications (medical and health, environmental monitoring, transportation and logistics, etc.) [1]. Sensor nodes for environmental monitoring may be deployed in areas with obstacles (holes), such as waterlogged areas, that poses a challenge for the design of geographic routing. We propose a load-balancing, constantstretch routing scheme to deal with caverns around a large hole of complicated shape. Since the kwidth strip is aligned with the shortest path between s and t, any almost-parallel lane to this k-strip would have a length not far-off from the shortest path This technique is termed k-multi-lane path routing, or k-MLP routing in this paper. We propose k-MLP routing technique with the combination of small stretch routing and load-balancing to solve the issue of traffic hotspots completely. It is worth emphasizing that our k-MLP routing proposal can be further developed to solve the problem of planning short paths with clearance through a crowded environment This problem of planning short path with.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
