Abstract-We show that link interferences in multihop wireless networks make the problem of selecting a path satisfying bandwidth requirements an NP-complete problem, even under simplified rules for bandwidth reservation. This is in sharp contrast to path selection in wireline networks where efficient polynomial algorithms exist. We also describe a distributed mechanism for the problem of slot allocation according to bandwidth reservation in a wireless slotted environment.
In a wireless network, this problem is the Remaining Capacity problem (RC) defined in REF .
Bandwidth reservation in multihop wireless networks: complexity and mechanisms
24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings.
24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings.
Computer Science