Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/13196
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorRaychoudhury, V-
dc.creatorCao, J-
dc.creatorNiyogi, R-
dc.creatorWu, W-
dc.creatorLai, Y-
dc.date.accessioned2014-12-19T07:09:31Z-
dc.date.available2014-12-19T07:09:31Z-
dc.identifier.issn1574-1192-
dc.identifier.urihttp://hdl.handle.net/10397/13196-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectDistributed algorithmsen_US
dc.subjectFault toleranceen_US
dc.subjectLeader electionen_US
dc.subjectMobile ad hoc networksen_US
dc.titleTop K-leader election in mobile ad hoc networksen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage181-
dc.identifier.epage202-
dc.identifier.volume13-
dc.identifier.doi10.1016/j.pmcj.2013.10.003-
dcterms.abstractMany applications in mobile ad hoc networks (MANETs) require multiple nodes to act as leaders. Given the resource constraints of mobile nodes, it is desirable to elect resource-rich nodes with higher energy or computational capabilities as leaders. In this paper, we propose a novel distributed algorithm to elect top-K weighted leaders in MANETs where weight indicates available node resources. Frequent topology changes, limited energy supplies, and variable message delays in MANETs make the weight-based K leader election a non-trivial task. So far, there is no algorithm for weight-based K leader election in distributed or mobile environments. Moreover, existing single leader election algorithms for ad hoc networks are either unsuitable of extending to elect weight-based K leaders or they perform poorly under dynamic network conditions. In our proposed algorithm, initially few coordinator nodes are selected locally which collect the weights of other nodes using the diffusing computation approach. The coordinator nodes then collaborate together, so that, finally the highest weight coordinator collects weights of all the nodes in the network. Besides simulation we have also implemented our algorithm on a testbed and conducted experiments. The results prove that our proposed algorithm is scalable, reliable, message-efficient, and can handle dynamic topological changes in an efficient manner.-
dcterms.bibliographicCitationPervasive and mobile computing, 2014, v. 13, p. 181-202-
dcterms.isPartOfPervasive and mobile computing-
dcterms.issued2014-
dc.identifier.scopus2-s2.0-84904668844-
dc.identifier.eissn1873-1589-
dc.identifier.rosgroupid2014002197-
dc.description.ros2014-2015 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

13
Last Week
0
Last month
0
Citations as of Aug 28, 2020

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of Oct 14, 2020

Page view(s)

132
Last Week
3
Last month
Citations as of Oct 20, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.