A simple load-balancing approach in cheat-proof ad hoc networks

Younghwan Yoo, Sanghyun Ahn

Research output: Contribution to conferencePaperpeer-review

22 Scopus citations


Ad hoc routing protocols such as AODV and DSR do not try to search for new routes until the network topology changes. Hence, with low node mobility, traffic may concentrate on just a few nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are used for a long time, their battery power may be rapidly exhausted. To resolve this traffic concentration problem, we propose a load balancing scheme called Simple Load-balancing Approach (SLA) that allows each node to drop RREQ or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes may deliberately give up packet forwarding to save their own energy. To make nodes volunteer in packet forwarding we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIFA).

Original languageEnglish
Number of pages5
StatePublished - 2004
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: 29 Nov 20043 Dec 2004


ConferenceGLOBECOM'04 - IEEE Global Telecommunications Conference
Country/TerritoryUnited States
CityDallas, TX


Dive into the research topics of 'A simple load-balancing approach in cheat-proof ad hoc networks'. Together they form a unique fingerprint.

Cite this