less cost any routing with energy cost optimization
R.Jegadeesan,Dr.N.Sankar Ram,M.Naveen Kumar
Published in International Journal of Advanced Research in Computer Networking,Wireless and Mobile Communications
ISSN: 2320-7248 Impact Factor:1.8 Volume:1 Issue:3 Year: 08 November,2013 Pages:65-69
Abstract
The traditional routing is based on shortest path routing schemes where the packets are transmitted in the pre-determined path which usually suits for wired networks. Whereas the wireless networks are based on broadcast (any cast) nature of routing schemes where the packets are transmitted to any node in the set of neighbours instead of one specific node. This is the motivation behind the opportunistic routing. In Opportunistic routing the route (next hop) is selected after the packets are transmitted, which combines multiple week links into one strong links. The motivation is with unreliable wireless links, the probability of a packet successfully being received by at least one node in a set of neighbours is greater than one specific node receiving it. The OR copes very well with unreliable and unpredictable wireless links. The Any path Routing is the generalization of opportunistic routing which selects optimal number of candidate relays and prioritizes them in the distributed way. The Least Cost Any path Routing algorithm is used to select the optimal number of candidate relays and prioritize it. The algorithm is general and can be applied to any wired or wireless networks. The algorithm shall be implemented as a protocol which sits in the layer-3 (network layer) of the OSI reference model that selects the optimal number of candidate relay nodes for every node which takes care of sending the packets to the destination.
Kewords
Topology Construction Nodes Linker Candidate Relay Set Selector Route Selector Any path Packet Transmitter Packe
Reference
[1] G. Schaefer, F. Ingelrest and M. Vetterli, ―Potentials of Opportunistic Routing in EnergyConstrained Wireless Sensor Networks‖ in Ecole Polytechnique Federale de Lausanne (EPFL) Switzerland. [2] Henri Dubois-Ferrière, Matthias Grossglauer, and Martin Vetterli, ―Least-cost opportunistic routing,‖ in School of Computer and Communication Sciences EPFL, 1015 Lausanne, Switzerland. [3] S. Biswas and R. Morris, ―Opportunistic routing in multi-hop wireless networks,‖ in Proc. ACM SIGCOMM, Philadelphia, PA, 2005, pp. 133– 144. [4] R. R. Choudhury and N. H. Vaidya, ―MAClayer anycasting in ad hoc networks,‖ SIGCOMM Comput. Commun. Rev., vol. 34, no. 1, pp. 75–80, 2004. [5] S. Jain and S. R. Das, ―Exploiting path diversity in the link layer in wireless ad hoc networks,‖ in Proc. IEEE WoWMoM, 2005, pp. 22– 30. [6] Eric Rozner, Jayesh Seshadri, Yogita Mehta and Lli Qiu, ―Simple Opportunistic Routing Protocol for Wireless Mesh Networks‖ in The University of Texas at Austin. [7] Henri Dubois-Ferrière, ―Anypath routing‖ Ph.D. dissertation #3636, School of Comput. & Commun. Sci., EPFL, Lausanne, Switzerland,2006.
