English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Wireless communication enables a broad spectrum of applications, ranging fromcommodity to tactical systems. Neighbor discovery (ND), that is, determiningwhich devices are within direct radio communication, is a building block ofnetwork protocols and applications, and its vulnerability can severelycompromise their functionalities. A number of proposals to secure ND have beenpublished, but none have analyzed the problem formally. In this paper, wecontribute such an analysis: We build a formal model capturing salientcharacteristics of wireless systems, most notably obstacles and interference,and we provide a specification of a basic variant of the ND problem. Then, wederive an impossibility result for a general class of protocols we term"time-based protocols," to which many of the schemes in the literature belong.We also identify the conditions under which the impossibility result is lifted.Moreover, we explore a second class of protocols we term "time- andlocation-based protocols," and prove they can secure ND.

Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility