A relay node selection technique for opportunistic routing in mobile ad hoc networks

Authors:
Nie Zhi;Liu Jing;Li Botong;Liu Hanchun;Xu Youyun
Affiliations:
Institute of Wireless Communication Technology, Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China and The State Key Lab of Integrated Service Networks, Xidian Un ...;Institute of Wireless Communication Technology, Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China and The State Key Lab of Integrated Service Networks, Xidian Un ...;Institute of Wireless Communication Technology, Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China;Institute of Wireless Communication Technology, Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China;Institute of Wireless Communication Technology, Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Year:
2009

Citing 8
Cited 0

DSR: the dynamic source routing protocol for multihop wireless ad hoc networks

Ad hoc networking
Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geographic routing for wireless networks

Geographic routing for wireless networks
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A high-throughput path metric for multi-hop wireless routing

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Evaluating opportunistic routing protocols with large realistic contact traces

Proceedings of the second ACM workshop on Challenged networks
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

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.