Data networks
Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
A cross-layer framework for multiple access and routing design in wireless multi-hop networks
Wireless Communications & Mobile Computing
Joint scheduling and power control for wireless ad hoc networks
IEEE Transactions on Wireless Communications
On the feasibility of the link abstraction in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
Semi-flooding location service: a cross-layer design
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Channel assignment in virtual cut-through switching based wireless mesh networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Hi-index | 0.00 |
In this paper we address the problem of interference-aware routing that tightly couples the design of the lower three layers of the ISO Open Systems Interconnection (OSI) protocol stack. This is primarily motivated by the observation that shortest path routing could potentially lead to degrading the single-hop throughput which constitutes an upper bound on the end-to-end multi-hop throughput. We introduce the concept of set-based routing in an attempt to incorporate interference into the routing decision as well as reduce the problem complexity. Towards this objective, we propose a novel algorithm that takes routing, scheduling and power control decisions for a set of interference-coupled transmitters. Furthermore, we discuss set coordination schemes for combating inter-set interference. Finally, we conduct a simulation study that shows considerable throughput improvement over a reference system that uses minimum hop routing and collision-free scheduling.