A load-balancing approach in ad-hoc networks

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the case of link congestion, most of the existing ad hoc routing protocols like AODV and DSR do not try to discover a new route if there is no change in the network topology. Hence, with low mobility, traffic may get concentrated on some specific nodes. Since mobile devices have low battery power and low computing capability, traffic concentration on a specific node is not a desirable phenomenon. Therefore, in this paper, we propose a new routing approach called SLAR (Simple Load-balancing Ad hoc Routing) which resolves the traffic concentration problem by letting each node check its own load situation and give up its role as a packet forwarder gracefully in the case of high traffic load. We compare the performance of SLAR with that of AODV and DSR in terms of the forwarding traffic distribution. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Ahn, S., Lim, Y., & Choe, J. (2003). A load-balancing approach in ad-hoc networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2662, 672–681. https://doi.org/10.1007/978-3-540-45235-5_66

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free