Poster: Neighbor discovery with distributed quorum system

Desheng Zhang, Tian He, Yunhuai Liu, Yu Gu, Fan Ye, Raghu K. Ganti, Hui Lei

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

Quorum-based schemes, e.g., GQS, can ensure asynchronous neighbors to discover each other within bounded time under low-duty-cycle operations. But they are tightly based on the assumption that duty cycles of devices fit some specific prefixed patterns. We tackle this problem by proposing a distributed quorum system to speed up the discovery.

Original languageEnglish (US)
Title of host publicationSenSys 2011 - Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems
Pages369-370
Number of pages2
DOIs
StatePublished - 2011
Event9th ACM Conference on Embedded Networked Sensor Systems, SenSys 2011 - Seattle, WA, United States
Duration: Nov 1 2011Nov 4 2011

Publication series

NameSenSys 2011 - Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems

Other

Other9th ACM Conference on Embedded Networked Sensor Systems, SenSys 2011
Country/TerritoryUnited States
CitySeattle, WA
Period11/1/1111/4/11

Keywords

  • neighbor discovery
  • protocol
  • rendezvous

Fingerprint

Dive into the research topics of 'Poster: Neighbor discovery with distributed quorum system'. Together they form a unique fingerprint.

Cite this