Data networks
Geometry of information propagation in massively dense ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Traffic load in a dense wireless multihop network
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
On traffic load distribution and load balancing in dense wireless multihop networks
EURASIP Journal on Wireless Communications and Networking
Optimal deployment of large wireless sensor networks
IEEE Transactions on Information Theory
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the optimality of field-line routing in massively dense wireless multi-hop networks
Performance Evaluation
Performance evaluation of multi-path routing in reservation-based wireless networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
A distributed routing algorithm for sensor networks derived from macroscopic models
Computer Networks: The International Journal of Computer and Telecommunications Networking
Gauss-seidel correction algorithm: A macroscopic model-derived routing algorithm for WSNs
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
We consider the load balancing problem in large wireless multi-hop networks, often referred to as massively dense wireless multi-hop networks. A network is considered to be massively dense if there are nodes practically everywhere and a typical distance between two nodes is much larger than the transmission range necessitating communication over a large number of hops. The task is to choose the routes in such a way that the maximum relayed traffic load in the network is minimized. In fixed networks the multi-path routes generally yield a lower congestion and thus allow higher throughput. In contrast, we show that in the case of massively dense wireless multi-hop networks the optimal load balancing can be achieved by single-path routing. In particular, we show how any given multi-path routing can be transformed to a single-path routing with at least the same level of performance. The concepts are illustrated by numerical examples where the network nodes are assumed to reside inside a unit disk with uniform traffic demands. The shortest path routes, corresponding to straight line segments, yield a maximum traffic load of 0.637, whereas the single-path routes obtained by numerical optimization yield 0.343, corresponding to 46% reduction in the traffic load.