Load Balanced Congestion Adaptive Routing for Randomly Distributed Mobile Adhoc Networks

In mobile ad hoc networks, congestion occurs due to limited sources of the network, which leads to packet losses, bandwidth degradation and wastes time and energy on congestion recovery. Various techniques have been developed in attempt to minimize congestion in uniformly distributed networks. In th...

Full description

Saved in:
Bibliographic Details
Published inWireless personal communications Vol. 77; no. 4; pp. 2723 - 2733
Main Authors Tomar, Geetam Singh, Shrivastava, Laxmi, Bhadauria, Sarita Singh
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.08.2014
Springer
Subjects
Access methods and protocols, osi model
Algorithms
Applied sciences
Communications Engineering
Computer Communication Networks
Computer networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Congestion
Density
Engineering
Equipments and installations
Exact sciences and technology
Load balancing (computing)
Mobile radiocommunication systems
Networks
Radiocommunications
Routing (telecommunications)
Signal,Image and Speech Processing
Software
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Traffic engineering
Traffic flow
Load balance
Routing
Ad hoc networks
LBCAR
Congestion adaptive
Mobile ad hoc network
Energy consumption
Packet switching
Adaptive algorithm
Energy recovery
Traffic load
Adaptive method
Bandwidth
Wireless network
Metric
Load balancing
Transmission loss
Ad hoc network
Mobile computing
Online AccessGet full text

Cover

More Information
Summary:In mobile ad hoc networks, congestion occurs due to limited sources of the network, which leads to packet losses, bandwidth degradation and wastes time and energy on congestion recovery. Various techniques have been developed in attempt to minimize congestion in uniformly distributed networks. In this paper, a load balanced congestion adaptive routing algorithm has been proposed for randomly distributed networks. In the proposed algorithm two metrics: traffic load density and life time associated with a routing path, have been used to determine the congestion status and weakest node of the route. The route with low traffic load density and maximum life time is selected for packet transmission.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0929-6212
1572-834X
DOI:10.1007/s11277-014-1663-9