Data networks
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Trajectory based forwarding and its applications
Proceedings of the 9th annual international conference on Mobile computing and networking
Geometry of information propagation in massively dense ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
On traffic load distribution and load balancing in dense wireless multihop networks
EURASIP Journal on Wireless Communications and Networking
Balancing traffic load in wireless networks with curveball routing
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
On optimality of single-path routes in massively dense wireless multi-hop networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal deployment of large wireless sensor networks
IEEE Transactions on Information Theory
Scalable geographic routing algorithms for wireless ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Routing in Large-Scale Wireless Mesh Networks Using Temperature Fields
IEEE Network: The Magazine of Global Internetworking
Continuum equilibria and global optimization for routing in dense static ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multidirectional forwarding capacity in a massively dense wireless network
Proceedings of the 24th International Teletraffic Congress
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 by applying the continuum approximation. The task is to find routes, geometric curves, such that the maximal traffic load in the network is minimized. In finite fixed networks, multi-path routes generally yield a lower congestion and thus allow higher throughput. In contrast, we show that in dense wireless multi-hop networks, the optimal load balancing can be achieved by a destination based single-path routing referred to as field-line routing. This is because any routing can be transformed to the corresponding field-line routing with the same or better performance, by using as paths, the field lines of the so-called destination flow associated with the original routing. The concepts are illustrated with two examples. In the case of a unit disk with unit traffic, the maximal load of 0.389 of a multi-path routing system is reduced to 0.343 by using the field-line routing. Similar improvements are also demonstrated for the unit square.