TY - GEN
T1 - A contention-based beaconless geographic routing protocol for mobile ad hoc networks
AU - Shi, Xuan
AU - Liu, Kai
PY - 2008
Y1 - 2008
N2 - A contention-based beaconless geographic routing (CBGR) protocol for mobile ad hoc networks is proposed, which includes a basic mode and an optional mode. In the basic mode, when receiving a data packet from upstream node, intermediate nodes in the forwarding area contend to relay it by waiting a dynamic forwarding delay (DFD), which is computed based on its relative position with the upstream node and destination node. The intermediate node with minimum DFD transmits the data packet first and other nodes cancel their scheduled transmission for the same data packet by overhearing its packet forwarding. In the optional mode, upstream node can send data packets to its specified downstream node as long as the communication link between them is valid. An accurate link forecast scheme is used to calculate the valid time based on location and mobility information of upstream node and downstream node. In addition, a one-hop flooding method is introduced to overcome communication void problem. Finally, simulation results show that the CBGR protocol outperforms the LARI and BLR protocols in terms of end-to-end delay and packet delivery ratio.
AB - A contention-based beaconless geographic routing (CBGR) protocol for mobile ad hoc networks is proposed, which includes a basic mode and an optional mode. In the basic mode, when receiving a data packet from upstream node, intermediate nodes in the forwarding area contend to relay it by waiting a dynamic forwarding delay (DFD), which is computed based on its relative position with the upstream node and destination node. The intermediate node with minimum DFD transmits the data packet first and other nodes cancel their scheduled transmission for the same data packet by overhearing its packet forwarding. In the optional mode, upstream node can send data packets to its specified downstream node as long as the communication link between them is valid. An accurate link forecast scheme is used to calculate the valid time based on location and mobility information of upstream node and downstream node. In addition, a one-hop flooding method is introduced to overcome communication void problem. Finally, simulation results show that the CBGR protocol outperforms the LARI and BLR protocols in terms of end-to-end delay and packet delivery ratio.
KW - Dynamic forwarding delay
KW - Link forecast
KW - Mobile ad hoc networks
KW - One-hop flooding
KW - Routing
UR - https://www.scopus.com/pages/publications/58049149780
U2 - 10.1109/CHINACOM.2008.4685155
DO - 10.1109/CHINACOM.2008.4685155
M3 - 会议稿件
AN - SCOPUS:58049149780
SN - 9781424423736
T3 - 3rd International Conference on Communications and Networking in China, ChinaCom 2008
SP - 840
EP - 843
BT - 3rd International Conference on Communications and Networking in China, ChinaCom 2008
PB - IEEE Computer Society
T2 - 3rd International Conference on Communications and Networking in China, ChinaCom 2008
Y2 - 25 August 2008 through 27 August 2008
ER -