Optimal Anycast Technique for Delay-Sensitive Energy-Constrained Asynchronous Sensor Networks
Er. Jagdish Patil1, Er. Pratik Gite2, Sanjay Thakur3
1Jagdish patil, Computer Engineering Department, R.G.P.V., Bhopal, Lord Krishna Collage of Technology, Indore, India.
2Pratik Gite, Computer Engineering Department, Pacific Academy of Higher Education and Research University, Udaipur, India.
3Dr. Sanjay Thakur, Computer Engineering Department, Lord Krishna College of Technology, Indore, India.
Manuscript received on May 27, 2013. | Revised Manuscript received on June 08, 2013. | Manuscript published on June 30, 2013. | PP: 192-196 | Volume-2, Issue-5, June 2013. | Retrieval Number: E1763062513/2013©BEIESP

Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols, by using single-path routing metrics to assign to each node a group of candidate relays for a particular destination. This paper addresses the least-cost anypath routing (LCAR) problem: how to assign a set of candidate relays at each node for a given destination such that the expected cost of forwarding a packet to the destination is minimized. The key is the following tradeoff: on one hand, increasing the number of candidate relays decreases the forwarding cost, but on the other, it increases the likelihood of “veering” away from the shortest-path route. Prior proposals based on single-path routing metrics or geographic coordinates do not explicitly consider this tradeoff, and a s aresult do not always make optimal choices. The LCAR algorithm and its framework are general and an be applied to a variety of networks and cost models. We show how LCAR can incorporate different aspects of underlying coordination protocols, for example a link-layer protocol that randomly selects which receiving node will forward a packet, or the possibility that multiple nodes mistakenly forward a packet. In either case, the LCAR algorithm finds the optimal choice of candidate relays that takes into account these properties of the link layer. Finally, we apply LCAR to low-power, low-rate wireless communication and introduce a new wireless link-layer technique to decrease energy transmission costs in conjunction with anypath routing. Simulations show significant reductions in transmission cost to opportunistic routing using single-path metrics. Furthermore LCAR routes are more robust and stable than those based on single-path distances, due to the integrative nature of the LCAR’s route cost metric.
Keywords: Ad-hoc, MANET, Cooperative Caching.