Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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)
Sufficient rate constraints for QoS flows in ad-hoc networks
Ad Hoc Networks
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
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
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
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 study the maximum forwarding capacity for the relay traffic that can be transmitted through a wireless multihop network in a single direction. The problem appears as the microscopic level problem in a dense multihop network where the routing and forwarding tasks can be considered independently (separation of scales). Ultimately, the problem of finding the maximum forwarding capacity involves solving a maxflow problem in an infinite plane with an infinite dimensional scheduling vector as an additional parameter to be optimized. In this paper, we approximate the infinite network by a finite but large network consisting of nodes distributed as a spatial Poisson process, and give the problem an LP formulation assuming a Boolean interference model. The computational complexity is further reduced by relaxing the necessary and sufficient constraints and solving the LP problem with a reduced set of necessary clique constraints. This gives a new significantly tighter upper bound on the achievable forwarding capacity compared with our previous (non-achievable) upper bound corresponding to the maximum capacity in one time slot.