DocumentCode :
499161
Title :
Expected path length for angle and distance-based localized routing
Author :
Haque, Israat Tanzeena ; Nikolaidis, Ioanis ; Gburzynski, Pawel
Author_Institution :
Dept. of Comput. Sci., Univ. of Alberta, Edmonton, AB, Canada
Volume :
41
fYear :
2009
fDate :
13-16 July 2009
Firstpage :
137
Lastpage :
141
Abstract :
We give analytical solutions for the expected path length in ad-hoc wireless networks employing distance-based or angle-based based greedy routing schemes. Such schemes underlay many practical routing protocols for ad-hoc wireless networks in which nodes are aware of their geographical locations and can use that information to simplify (localize) the routing rules. As the two paradigms, i.e., minimizing the distance towards the destination, and minimizing the angular deviation from the straight path towards the destination, lie at the heart of practically all location-based routing protocols, our solutions can be viewed as generic and applicable to a variety of realistic schemes.
Keywords :
ad hoc networks; greedy algorithms; radio direction-finding; routing protocols; ad-hoc wireless network; angle-based based greedy routing scheme; angular deviation minimisation; distance-based localized routing; expected path length analysis; location-based routing protocol; Computer networks; Costs; Euclidean distance; Global Positioning System; Heart; Joining processes; Routing protocols; Scalability; Wireless networks; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Performance Evaluation of Computer & Telecommunication Systems, 2009. SPECTS 2009. International Symposium on
Conference_Location :
Istanbul
Print_ISBN :
978-1-4244-4165-5
Electronic_ISBN :
978-1-56555-328-6
Type :
conf
Filename :
5224132
Link To Document :
بازگشت