ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
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
An upper bound on multi-hop wireless network performance
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
The capacity of wireless networks
IEEE Transactions on Information Theory
An Aloha protocol for multihop mobile wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Approximating maximum directed flow in a large wireless network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On the achievable forwarding capacity of an infinite wireless network
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
| Hi-index | 0.00 |
We study the maximal forwarding capacity of a massively dense wireless multi-hop network where a typical path consists of a vast number of hops. In such a network, the macroscopic level, corresponding to the scale of an end-to-end path, and the microscopic level, corresponding to the scale of a single hop, can be separated. At the macroscopic level the task is that of routing, while at the microscopic level the packets are forwarded based on the information received from the macroscopic level. We give a formulation for the forwarding problem and devise simulation algorithms based on an augmentation of the max-flow min-cut theorem for obtaining upper bounds for the maximal forwarding capacity. We compare the upper bounds with feasible forwarding methods and find out that the tightest bound is about three times the highest achieved performance.