TY - GEN
T1 - CGR
T2 - 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008
AU - Xianchang, Li
AU - Jun, Zhang
AU - Xuan, Shi
PY - 2008
Y1 - 2008
N2 - A contention-based geographic routing (CGR) protocol for mobile ad hoc networks is proposed, which operates in two schemes: greedy-forwarding scheme and void-handling scheme. The greedy-forwarding scheme consists of basic mode and optional mode. In the basic mode, when receiving a data packet from upstream node, intermediate nodes within its forwarding area contend to relay it by waiting for a dynamic forwarding delay (DFD), which is computed based on its own position relative to 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 compute the valid time based on location and mobility information of upstream and downstream nodes. In the void-handling scheme, a one-hop flooding method is introduced to overcome communication void problem. Finally, simulation results show that CGR outperforms LAR1 and BLR protocols in terms of end-to-end delay and packet delivery ratio.
AB - A contention-based geographic routing (CGR) protocol for mobile ad hoc networks is proposed, which operates in two schemes: greedy-forwarding scheme and void-handling scheme. The greedy-forwarding scheme consists of basic mode and optional mode. In the basic mode, when receiving a data packet from upstream node, intermediate nodes within its forwarding area contend to relay it by waiting for a dynamic forwarding delay (DFD), which is computed based on its own position relative to 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 compute the valid time based on location and mobility information of upstream and downstream nodes. In the void-handling scheme, a one-hop flooding method is introduced to overcome communication void problem. Finally, simulation results show that CGR outperforms LAR1 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 - Void-handing scheme
UR - https://www.scopus.com/pages/publications/58049094696
U2 - 10.1109/WiCom.2008.619
DO - 10.1109/WiCom.2008.619
M3 - Conference contribution
AN - SCOPUS:58049094696
SN - 9781424421084
T3 - 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008
BT - 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008
Y2 - 12 October 2008 through 14 October 2008
ER -