Change search
ReferencesLink to record
Permanent link

Direct link
Secure Neighbor Discovery in Wireless Networks: Is It Possible?
2007 (English)Report (Other academic)
Abstract [en]

Wireless communication enables a broad spectrum of appli-cations, ranging from commodity to tactical systems.Neigh-bor discovery(ND), that is, determining which devices arewithin direct radio communication, is a building block ofnetwork protocols and applications, and its vulnerability canseverely compromise their functionalities. A number of pro-posals tosecureND have been published, but none haveanalyzed the problem formally. In this paper, we contributesuch an analysis: We build a formal model capturing salientcharacteristics of wireless systems, most notably obstaclesand interference, and we provide a speci├ścation of a basicvariant of the ND problem. Then, we derive animpossibilityresultfor a general class of protocols we term \time-basedprotocols," to which many of the schemes in the literaturebelong. We also identify the conditions under which the im-possibility result is lifted.┬á Moreover, we explore a secondclass of protocols we term \time- and location-based proto-cols," and prove they can secure ND

Place, publisher, year, edition, pages
Ecole Polytechnique Fedrale de Lausanne , 2007. , 14 p.
, EPFL-LCA Report, 2007-004
Keyword [en]
wireless networks security, secure neighbor discovery, relay attack
National Category
Engineering and Technology
URN: urn:nbn:se:kth:diva-116118OAI: diva2:591670

QC 20130619

Available from: 2013-01-21 Created: 2013-01-15 Last updated: 2013-06-19Bibliographically approved

Open Access in DiVA

No full text

Other links

Search in DiVA

By author/editor
Papadimitratos, P.
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 13 hits
ReferencesLink to record
Permanent link

Direct link