Show simple item record

dc.contributor.authorLee, Young J.
dc.contributor.authorRiley, George F.
dc.date.accessioned2006-10-24T18:52:31Z
dc.date.available2006-10-24T18:52:31Z
dc.date.issued2005-03
dc.identifier.urihttp://hdl.handle.net/1853/12280
dc.description©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en
dc.descriptionPresented at the IEEE Wireless Communications and Networking Conference (WCNC), March 2005
dc.description.abstractA novel load-balancing technique for ad hoc on-demand routing protocols is presented. Currently, ad hoc routing protocols lack load-balancing capabilities, and thus, they often fail to provide good performance especially in the presence of a large volume of traffic. We present a simple but very effective method to achieve load balance and congestion alleviation. The new scheme is motivated by the observation that ad hoc on-demand routing protocols flood route request (RREQ) messages to acquire routes, and only nodes that respond to those messages have a potential to serve as intermediate forwarding nodes. If a node ignores RREQ messages within a specific period, it can completely be excluded from the additional communications that might have occurred for that period otherwise. Thus, a node can decide not to serve a traffic flow by dropping the RREQ for that flow. In the new scheme, RREQ messages are forwarded selectively according to the load status of each node so that overloaded nodes can be excluded from the requested paths. Each node begins to allow additional traffic flows again whenever its overloaded status is dissolved. The new scheme utilizes interface queue occupancy and workload to control RREQ messages adaptively. The enhanced versions of protocols with this scheme are compared to the base protocols. Simulation results reveal that the new scheme greatly reduces packet latency as well as routing overhead without adversely affecting the network throughput, and it successfully balances the network load among nodes.en
dc.format.extent1830239 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen
dc.publisherGeorgia Institute of Technologyen
dc.subjectLoad balancingen
dc.subjectAd hoc networksen
dc.subjectMobile computingen
dc.titleA Workload-Based Adaptive Load-Balancing Technique for Mobile Ad Hoc Networksen
dc.typeProceedingsen
dc.contributor.corporatenameGeorgia Institute of Technology. School of Electrical and Computer Engineering
dc.publisher.originalInstitute of Electrical and Electronics Engineers, Inc., New York


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • MANIACS Publications [35]
    Papers, Pre/Post-Prints, and Presentations by Faculty and Students in the MANIACS program.

Show simple item record