Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Routing with load balancing in wireless Ad hoc networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
| Hi-index | 0.00 |
In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, existing load balancing schemes just avoid the congested route in the route discovery procedure or find an alternative route during a communication session. To solve this problem, we propose a new scheme which uses the packet bursting mechanism in congested nodes. The packet bursting, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets after channel acquisition. Thus, congested node can forward buffered packets quickly and prevent bottleneck. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through a experimental simulation study, we compare our protocol with normal on demand routing protocols and show that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.