Adaptive Load Control of the Central Processor in a Distributed System with a Star Topology
IEEE Transactions on Computers
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Nomadic computing—an opportunity
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
A distributed routing algorithm for mobile wireless networks
Wireless Networks
Routing in communications networks
Experimental queueing analysis with long-range dependent packet traffic
IEEE/ACM Transactions on Networking (TON)
Movement-based location update and selective paging for PCS networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Dynamic hashing + quorum = efficient location management for mobile computing systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A survey of routing techniques for mobile communications networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Self-Similar Network Traffic and Performance Evaluation
Self-Similar Network Traffic and Performance Evaluation
A Cluster-based Approach for Routing in Ad-Hoc Networks
MLICS '95 Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing
A General Model for Optimal Static Load Balancing in Star Network Configurations
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Comparative Performance Evaluation of Routing Protocols for Mobile, Ad hoc
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
This paper develops a common solution to the problems of discovery, maintenance, and use of multiple routes in ad hoc networks. The performance criterion is the average time taken by a packet to reach its destination through multiple hops. A source node considers each of its neighbors (reachable by direct wireless transmission) as a next-hop for every possible destination. The effect of delay at a next-hop and beyond, until the packet reaches its destination, is approximately modeled as an equivalent M/M/1 queuing system. Available neighbors at every node provide multiple routes. Multiple routes are statistically multiplexed to distribute the load as well as to deal with changes in data rates and network configuration. The potential of each next-hop neighbor of a node in providing a viable route is estimated on-line and the proportions of traffic routed through these multiple neighbors are also updated adaptively.We study this approach and conduct extensive experiments over a network with two extreme cases of simulated traffic patterns, the Poisson, and the self-similar types. Even when the network topology is static, our algorithm responds to bursts in the traffic pattern and reduces buffer losses through the use of alternative, less congested routes. We also present simulation experiments and results to demonstrate the effectiveness of our algorithm in the presence of mobility, using self-similar traffic. Mobility is simulated by means of the random waypoint model in which nodes move with varying speeds. Results show that our simple unified approach handles the problems of mobility as well as network congestion very well.