Top k-leader election in wireless ad hoc networks

Vaskar Raychoudhury, Jiannong Cao, Weigang Wu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

14 Citations (Scopus)

Abstract

In this paper, we propose a distributed algorithm to elect the top K leaders among the nodes in a wireless ad hoc network. Leader election is a fundamental distributed coordination problem arising from many applications, e.g. token regeneration, directory service. However, there is no deterministic algorithm proposed for electing k leaders. In our algorithm, election is based on the weight values of the nodes, which can represent any performance related attribute such as the node's battery power, computational capabilities etc. To achieve message efficiency, coordinator nodes are first selected locally and then the coordinator nodes collect the weight information of other nodes using a diffusing computation approach. The coordinator nodes collaborate with each other to further reduce the message cost. Node failures are also considered in our design. The simulation results show that, compared with a naive solution, our proposed algorithm can elect top K leaders with much less message cost.
Original languageEnglish
Title of host publication2008 Proceedings of 17th International Conference on Computer Communications and Networks, ICCCN 2008
Pages87-92
Number of pages6
DOIs
Publication statusPublished - 26 Dec 2008
Event17th International Conference on Computer Communications and Networks, ICCCN 2008 - St. Thomas, Virgin Islands, U.S.
Duration: 3 Aug 20087 Aug 2008

Conference

Conference17th International Conference on Computer Communications and Networks, ICCCN 2008
Country/TerritoryVirgin Islands, U.S.
CitySt. Thomas
Period3/08/087/08/08

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this