Load Balancing for Greedy Forwarding of Geographic Routing in Wireless Networks

Ki-Il KIM  Min-Jung BAEK  Tae-Eung SUNG  

IEICE TRANSACTIONS on Communications   Vol.E93-B   No.8   pp.2184-2187
Publication Date: 2010/08/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E93.B.2184
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
greedy forwarding,  congestion control,  

Full Text: PDF(185.2KB)
>>Buy this Article

In this letter, we propose three algorithms to reduce congestion for greedy forwarding, which is one of common principles in geographic routing. The new algorithms take geographic position information and network congestion metrics to balance traffic. When these algorithms are combined with well-known GPSR protocol [1], packet delivery ratio is enhanced by reducing number of lost packets in a buffer. In addition, end-to-end delay is reduced by bypassing congested nodes. These features are evaluated and analyzed through several simulation results.