Bandwidth reservation in multihop wireless networks

Complexity and mechanisms

Leonidas Georgiadis*, Philippe Jacquet, Bernard Mans

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

20 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 24th International Conference on Distributed Computing Systems Workshops
EditorsN.-F. Tzeng, M. Takizawa
Place of PublicationLos Alamitos, CA
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages762-767
Number of pages6
Volume24
ISBN (Print)0769520863
Publication statusPublished - 2004
EventProceedings - 24th International Conference on Distributed Computing Systems Workshops - Hachioji, Japan
Duration: 23 Mar 200424 Mar 2004

Other

OtherProceedings - 24th International Conference on Distributed Computing Systems Workshops
CountryJapan
CityHachioji
Period23/03/0424/03/04

Fingerprint Dive into the research topics of 'Bandwidth reservation in multihop wireless networks: Complexity and mechanisms'. Together they form a unique fingerprint.

  • Cite this

    Georgiadis, L., Jacquet, P., & Mans, B. (2004). Bandwidth reservation in multihop wireless networks: Complexity and mechanisms. In N-F. Tzeng, & M. Takizawa (Eds.), Proceedings - 24th International Conference on Distributed Computing Systems Workshops (Vol. 24, pp. 762-767). Los Alamitos, CA: Institute of Electrical and Electronics Engineers (IEEE).