Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Beaconing in wireless mobile networks
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-3704-1338
2009 (English)In: IEEE Wireless Communications and Networking Conference, 2009, Vol. WCNC, 1-6 p.Conference paper, Published paper (Refereed)
Abstract [en]

One of the intrinsic problems posed by mobility in wireless networks is the discovery of other nodes in the vicinity of a node to establish new links with them as well as detecting a link breakage. A widely used solution for this problem is to use different variations of beaconing. Here, we study the effect of the beacon settings on the link reliability and probability of link establishment. A poorly adjusted rate of beacon transmissions may lead to vast resource usage (power and bandwidth) on one side, or may lead to poor throughput on the other side. We use a general model without assuming a particular mobility model. The model is instantiated for periodic and exponential beaconing and it is then applied to compare two-way beaconing with one-way beaconing. Then, it is used to analyze the effect of connection setup time. Moreover, it is analytically proven that widely used periodic beaconing is not only the simplest beaconing scheme but also the optimal one in terms of beacon hit efficiency. Finally, the model is applied to a case study in delay-tolerant networks to study the effect of beacon interval on the capacity and the energy consumption of the network. Finally, a practical thumb of rule for beacon rate adjustment is suggested to bypass heavy computations.

Place, publisher, year, edition, pages
2009. Vol. WCNC, 1-6 p.
Keyword [en]
Beacon, Neighbor discovery, Palm's theorem, Stochastic process, Wireless mobile network, Random processes, Wireless telecommunication systems, Wireless networks
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-35968DOI: 10.1109/WCNC.2009.4917610Scopus ID: 2-s2.0-70349164445ISBN: 978-1-4244-2947-9 (print)OAI: oai:DiVA.org:kth-35968DiVA: diva2:429974
Conference
2009 IEEE Wireless Communications and Networking Conference, WCNC 2009; Budapes
Note
QC 20110706Available from: 2011-07-06 Created: 2011-07-06 Last updated: 2013-09-09Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopushttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349164445&partnerID=40&md5=af13d0c01f2b74dc966983461acfd547

Authority records BETA

Karlsson, Gunnar

Search in DiVA

By author/editor
Karlsson, Gunnar
By organisation
Communication Networks
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 59 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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