DocumentCode :
2303686
Title :
A simple load-balancing approach in cheat-proof ad hoc networks
Author :
Yoo, Younghwan ; Ahn, Sanghyun
Author_Institution :
Sch. of Comput. Sci. & Eng, Seoul Nat. Univ., South Korea
Volume :
6
fYear :
2004
fDate :
29 Nov.-3 Dec. 2004
Firstpage :
3573
Abstract :
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).
Keywords :
ad hoc networks; mobile radio; packet switching; routing protocols; telecommunication congestion control; telecommunication network topology; AODV; DSR; PIFA; RREQ; SLA; ad hoc routing protocols; cheat-proof ad hoc networks; load-balancing; mobile nodes; network topology; node battery power; node mobility; node traffic concentration; packet forwarding; payment scheme; protocol-independent fairness algorithm; route request; simple load-balancing approach; traffic load; Ad hoc networks; Batteries; Computer networks; Delay; Intelligent networks; Load management; Mobile ad hoc networks; Network topology; Routing protocols; Telecommunication traffic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE
Print_ISBN :
0-7803-8794-5
Type :
conf
DOI :
10.1109/GLOCOM.2004.1379032
Filename :
1379032
Link To Document :
بازگشت