Contention for opportunistic relay selection in mobile ad hoc networks

Authors:
Inhyeok Jang;Hyuk Lim
Affiliations:
Gwangju Institute of Science and Technology (GIST), Gwangju, Republic of Korea;Gwangju Institute of Science and Technology (GIST), Gwangju, Republic of Korea
Venue:
Proceedings of the 6th International Conference on Future Internet Technologies
Year:
2011

Citing 5
Cited 0

Cost- and Collision-Minimizing Forwarding Schemes for Wireless Sensor Networks: Design, Analysis and Experimental Validation

IEEE Transactions on Mobile Computing
Optimal timer based selection schemes

IEEE Transactions on Communications
An opportunistic relay protocol for vehicular road-side access with fading channels

ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
Cooperative communication in wireless networks

IEEE Communications Magazine
A simple Cooperative diversity method based on network path selection

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Contention based relay selection has been widely employed and currently plays an important role in wireless ad hoc networks. According to how much a node can expedite the relay of a packet toward its destination, each node has a different priority, and the contention window of the node is set inversely proportional to this priority. In this paper, we derive an optimal value for the maximum contention window size required to achieve both a high successful selection probability and a low relay delay for mobile ad hoc networks. The results show that we can achieve a successful selection probability with a low constant delay regardless of the number of competing candidate nodes by using the optimal maximum contention window size.