liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Managing a dynamic broadcast infrastructure in mobile ad hoc networks through distributed and asynchronous update of a virtual backbone
Linköping University, The Institute of Technology. Linköping University, Department of Science and Technology.
Linköping University, The Institute of Technology. Linköping University, Department of Science and Technology, Communications and Transport Systems.
2006 (English)In: The 25th IEEE Military Communications Conference MILCOM 2006,2006, Washington, DC: IEEE , 2006Conference paper, Published paper (Refereed)
Abstract [en]

Broadcast communication in wireless ad hoc networks can be implemented by means of a virtual backbone. Backbone nodes forward broadcast messages for others. A classical way of constructing such a backbone is to find a connected dominating set in the underlying graph. Based on this concept, a great amount of research has been devoted to backbone formation in static networks. In contrast, distributed backbone management in the presence of node mobility has been explored to a less extent. We present a distributed algorithm for managing a dynamic broadcast infrastructure in mobile ad hoc networks. The algorithm relies on neither location information nor any kind of global knowledge of the network. What's more, the algorithm does not require time synchronization between nodes. Decisions of joining and leaving the backbone are made locally at nodes. A node joins the backbone if connectivity between some neighbors is seemingly broken. To keep the size of the backbone small, a backbone node applies randomized pruning if its neighbors are connected through other backbone nodes. In our simulation experiments we examine backbone size and connectivity with respect to node mobility. The results demonstrate the effectiveness of the algorithm. 

Place, publisher, year, edition, pages
Washington, DC: IEEE , 2006.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-35335Local ID: 26370OAI: oai:DiVA.org:liu-35335DiVA: diva2:256183
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2012-06-25

Open Access in DiVA

No full text

Authority records BETA

Siomina, IanaYuan, Di

Search in DiVA

By author/editor
Siomina, IanaYuan, Di
By organisation
The Institute of TechnologyDepartment of Science and TechnologyCommunications and Transport Systems
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 52 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf