Paper Info
Title
Contention for opportunistic relay selection in mobile ad hoc networks
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.
Year
DOI
Venue
2011
10.1145/2002396.2002414
CFI
Keywords
Field
DocType
optimal value,important role,maximum contention window size,optimal maximum contention window,low constant delay,high successful selection probability,different priority,candidate node,successful selection probability,contention window,mobile ad hoc network,wireless ad hoc network
Mobile ad hoc network,Computer science,Collision probability,Network packet,Computer network,Ad hoc wireless distribution service,Optimized Link State Routing Protocol,Wireless ad hoc network,Vehicular ad hoc network,Relay,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
10
Authors
2
Name
Order
Citations
PageRank
Inhyeok Jang150.80
Hyuk Lim267351.93