Please use this identifier to cite or link to this item:
|Title:||Top k-leader election in wireless ad hoc networks|
|Keywords:||Ad hoc networks|
Distributed coordination problem
|Source:||ICCCN 2008 : 17th International Conference on Computer Communications and Networks, Aug. 3-7, 2008, St. Thomas, US Virgin Islands, USA, p. 87-92 (Invited Paper) How to cite?|
|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|
|Rights:||© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||Conference Paper|
Show full item record
Citations as of Apr 30, 2016
Checked on Feb 19, 2017
Checked on Feb 19, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.