• Skip to navigation (Press Enter).
  • Skip to main content (Press Enter).
Forschergruppe an der RWTH Aachen
RWTH logo
  • Home
  • Research Group
    • ComNets®
    • News
    • New ComNets Building
    • Prof. Walke
    • Alumni
    • Spin Offs
    • FFV
    • CN-Marketing
    • Championship
  • Research
    • Methods and Applications
    • Visions
    • Projects
    • Tools
    • Conferences
  • Teaching
  • Publications
    • Books: Recent publications since 2002
    • Dissertations
    • Complete Lists
    • Awards
    • Annual Reports
You are here: ComNets > Publications > Complete Lists > 
  • Sitemap  
  • Imprint   
  • Contact   

Distributed Algorithms for Spectrum Sharing in Wireless Mesh Networks

Authors: Max, Sebastian and Hiertz, Guido R. and Denteneer, Dee
Department of Communication Networks (ComNets), Faculty 6, RWTH Aachen University
: Sebastian Max In Proceedings of The Philips Symposium On Intelligent Algorithms (SOIA) 2006, p.p. 287--298, High Tech Campus, Eindhoven, The Netherlands, 2006. Publication Date: Dec, 2006
On page(s):287--298
ISBN:


Abstract Future wireless systems will employ many techniques to serve the user’s demand of a ubiquitous Internet access. On the one hand, newest amendments to the WLAN standard IEEE 802.11 allow data rates of 100 Mb/s and more between two nodes. On the other hand, the growing-up of mesh technology allows a transparent extension of the network coverage using relays. In this work, we concentrate on mesh networks and one of their crucial capabilities: The ability to share the available spectrum among the participating nodes in a highly efficient way, i. e. with a maximum of spatial divided channel reuse. After an introduction of two possible MAC protocols for wireless mesh networks, we show the capabilities of an intelligent channel reuse by a theoretic, off-line scheduling algorithm which takes advantage of an omniscient knowledge of the interference conditions. The model provides an upper limit for the following distributed mechanisms. A comparison of two protocols with the WARP2 simulation engine quantifies the benefits of spectrum sharing under real life conditions. Finally, we conclude with a competitive analysis of the distributed, on-line vs. the optimal, off-line algorithm which provides insights to further optimisation potential.


Author Keywords
Mesh Networks, Spectrum, Distributed Algorithm


 Download


Bibtex

@INPROCEEDINGS{MaHiDe_SOIA2006,
AUTHOR = {Max, S. and Hiertz, G. and Denteneer, D.},
TITLE = {Distributed Algorithms for Spectrum Sharing in Wireless Mesh Networks},
YEAR = {2006},
MONTH = {Dec},
PAGES = {287--298},
ADDRESS = {High Tech Campus, Eindhoven, The Netherlands},
BOOKTITLE = {Proceedings of The Philips Symposium On Intelligent Algorithms (SOIA)
2006},
AFFILIATION = {Department of Communication Networks (ComNets), Faculty 6, RWTH Aachen University},
KEYWORDS = {Mesh Networks, Spectrum, Distributed Algorithm},
LANGUAGE = {english},
LOCATION = {Eindhoven, The Netherlands},
URL = {https://www.comnets.rwth-aachen.de}
}
Signature in CN-Library = {Fh 091}



  • Books: Recent publications since 2002
  • Dissertations
  • Complete Lists
    • by Date
    • by author
    • Bibtex
  • Awards
  • Annual Reports
 
  • Layout based on YAML
  • © Copyright ComNets® 2009  
  • Disclaimer