Impact of interference on multi-hop wireless network performance
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
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
IEEE Transactions on Mobile Computing
On traffic load distribution and load balancing in dense wireless multihop networks
EURASIP Journal on Wireless Communications and Networking
Forwarding capacity of an infinite wireless network
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Approximating maximum directed flow in a large wireless network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
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
Position-based routing in ad hoc networks
IEEE Communications Magazine
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Optimal transmission modes by simulated annealing
Proceedings of the 6th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Multidirectional forwarding capacity in a massively dense wireless network
Proceedings of the 24th International Teletraffic Congress
| Hi-index | 0.00 |
We consider the problem of finding the maximum directed packet flow that can be sustained in an infinite wireless multihop network. This ability of the network to relay traffic is called the forwarding capacity, and the problem appears when the spatial scales corresponding to the end-to-end paths (routing) and the neighboring nodes (forwarding) are strongly separated in a massively dense network. We assume a Boolean interference model. The infinite network is approximated with a finite but large network where the node locations form a spatial Poisson process. We study two constructive approaches to tighten the lower bound for the forwarding capacity by a significant amount. In path scheduling the packets traverse the network using predefined paths that do not interfere with each other, and coordination is thus required only between the nodes of a path. In greedy maximum weight scheduling, the transmissions are scheduled greedily according to queue-length based weights of the links. In addition to a fixed transmission radius, we consider greedy maximum weight scheduling with a transmission radius adjustable up to a given maximum. We are able to produce numerical results that characterize the achievable forwarding capacity under global coordination of the transmissions, providing, e.g., concrete points of reference for practical distributed implementations.