Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Hot-Spot Congestion Relief in Public-Area Wireless Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Hi-index | 0.00 |
In this paper, we consider a multi-hop network where a mobile node can operate as a host as well as a router, helping other mobile nodes to connect to the access point. We propose a network reconfiguration algorithm to re-establish connections between mobile nodes, to achieve load-balancing for wireless access network. The current network topology is ignored, and by taking into consideration the mobility of nodes and the traffic load at access points, the destination node selects the best route to reach the access point. The proposed algorithm also aims to allow every node in the network to find a route to at least one of the access point. In this paper, we present a grid-representation that illustrates the distribution of nodes in the network based on the number of hops each node is away from the access points. This representation better illustrates the relationship between nodes in different regions in the network. We also define a new metric known as 'Index' for measuring the quality of each possible parent node, to which a node can connect to reach the access point. After reconfiguration is done using the proposed algorithm, NS2 network simulator is used to perform the simulations of the ad hoc network of 22 wireless mobile nodes. The performance of the algorithm will be evaluated based on the average throughput and average end-to-end delay.