Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Oblivious Neighbor Discovery for Wireless Devices with Directional Antennas
Laboratorie Recherche Informatique (LRI-CNRS UMR 8623), Université Paris-Sud.
Department of Electronic Engineering, Tsinghua University, Bejing.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.ORCID iD: 0000-0003-1902-9877
Number of Authors: 3
2016 (English)In: IEEE INFOCOM 2016: The 35th Annual IEEE International Conference on Computer Communications, San Francisco, 10-14 April 2016, Piscataway, NJ: IEEE Communications Society, 2016, 7524570Conference paper, Published paper (Refereed)
Abstract [en]

Neighbor discovery, the process of discovering all neighbors in a device's communication range, is one of the bootstrapping networking primitives of paramount importance and is particularly challenging when devices have directional antennas instead of omni-directional ones. In this paper, we study the following fundamental problem which we term as oblivious neighbor discovery: How can neighbor nodes with heterogeneous antenna configurations and without clock synchronization discover each other within a bounded delay in a fully decentralised manner without any prior coordination? We first establish a theoretical framework on oblivious neighbor discovery and establish the performance bound of any neighbor discovery protocol achieving oblivious discovery. Guided by the theoretical results, we then design an oblivious neighbor discovery protocol and prove that it achieves guaranteed oblivious discovery with order-minimal worst-case discovery delay in the asynchronous and heterogeneous environment. We further demonstrate how our protocol can be configured to achieve a desired trade-off between average and worst-case performance

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE Communications Society, 2016. 7524570
Series
I E E E Infocom. Proceedings, ISSN 0743-166X
National Category
Media and Communication Technology
Research subject
Mobile and Pervasive Computing
Identifiers
URN: urn:nbn:se:ltu:diva-39768DOI: 10.1109/INFOCOM.2016.7524570ISI: 000390154400241Scopus ID: 2-s2.0-84983365290Local ID: ea4477db-7183-4f39-8d4a-dd7f1c7b1e3cISBN: 9781467399531 (electronic)OAI: oai:DiVA.org:ltu-39768DiVA: diva2:1013286
Conference
IEEE International Conference on Computer Communications : 10/04/2016 - 14/04/2016
Note

Validerad; 2016; Nivå 1; 2016-08-19 (andbra)

Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2017-06-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Vasilakos, Athanasios
By organisation
Computer Science
Media and Communication Technology

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 5 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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