DocumentCode :
3005429
Title :
A relay node selection technique for opportunistic routing in mobile Ad Hoc networks
Author :
Zhi, Nie ; Jing, Liu ; Botong, Li ; Hanchun, Liu ; Youyun, Xu
Author_Institution :
Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China
fYear :
2009
fDate :
8-10 Oct. 2009
Firstpage :
665
Lastpage :
668
Abstract :
In this paper, we propose a new relay node selection algorithm: relay node selection considering future path (CFP) for opportunistic routings in mobile Ad Hoc networks, aiming to provide enhanced performance of successful delivery ratio. CFP based on the shortest distance algorithm and it not only considers the current distance towards the destination but also considers the future hops and estimates whether through the current node can a packet arrive at the destination. CFP can enhance the performance of successful delivery ratio by solving the potential problem of no forwarding relays in the shortest distance algorithm. Simulation results show that contrast against the shortest distance algorithm in opportunistic routing protocol GeRaF, CFP has better performance on both delivery ratio and goodput.
Keywords :
ad hoc networks; mobile radio; telecommunication network routing; CFP; GeRaF; mobile ad hoc networks; opportunistic routing protocol; relay node selection technique; shortest distance algorithm; Communications technology; Delay; Intserv networks; Mobile ad hoc networks; Mobile communication; Protective relaying; Relays; Routing protocols; Throughput; Wireless communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2009. APCC 2009. 15th Asia-Pacific Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-4784-8
Electronic_ISBN :
978-1-4244-4785-5
Type :
conf
DOI :
10.1109/APCC.2009.5375512
Filename :
5375512
Link To Document :
بازگشت