Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26946
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorRaychoudhury, V-
dc.creatorCao, J-
dc.creatorWu, W-
dc.creatorLai, Y-
dc.creatorChen, C-
dc.creatorMa, J-
dc.date.accessioned2014-12-19T07:09:40Z-
dc.date.available2014-12-19T07:09:40Z-
dc.identifier.issn1574-1192-
dc.identifier.urihttp://hdl.handle.net/10397/26946-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectDirectory electionen_US
dc.subjectFault-toleranceen_US
dc.subjectMANETen_US
dc.subjectQuorumen_US
dc.subjectService discovery protocolen_US
dc.titleK-directory community : reliable service discovery in MANETen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage140-
dc.identifier.epage158-
dc.identifier.volume7-
dc.identifier.issue1-
dc.identifier.doi10.1016/j.pmcj.2010.10.004-
dcterms.abstractEnsuring service availability is a key fault tolerance issue in service discovery for mobile ad hoc networks (MANET). Availability can be affected by sudden failure of service providers or directory nodes or even by network disconnection due to node mobility. So, to ensure network-wide service availability, services must be replicated cautiously, so that, the storage, update and discovery costs can be minimized. Achieving service availability in a resource efficient manner is both desirable and challenging in MANET. Existing works have not addressed these issues adequately. In this paper, we propose a distributed directory-based service discovery protocol (SDP) for MANET which works by electing the top K directory nodes considering rich resources. Resource-based election ensures high reliability for the directory nodes. The community of directory nodes then divides itself into multiple quorums. Services registered with a directory are replicated among its quorum members. This approach, while controlling replication and update costs, can guarantee network-wide service availability by the quorum intersection property. To further reduce the service discovery cost, we divide the entire network into one or more tree-structured domains. Since, the K-directory community is the heart of our approach, to keep the directory community intact, we consider substituting failed directories using an incremental election policy. Our protocol can also cope with dynamic and frequent topological changes caused by network partitioning as well as partition merges. To evaluate the performance of our proposed protocol, we have conducted extensive simulations and developed a prototype system. The results show that, compared with similar works, our protocol significantly reduces message cost and discovery delay, while improving system robustness.-
dcterms.bibliographicCitationPervasive and mobile computing, 2011, v. 7, no. 1, p. 140-158-
dcterms.isPartOfPervasive and mobile computing-
dcterms.issued2011-
dc.identifier.scopus2-s2.0-79551689325-
dc.identifier.eissn1873-1589-
dc.identifier.rosgroupidr52188-
dc.description.ros2010-2011 > 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

16
Last Week
0
Last month
0
Citations as of Sep 6, 2020

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
0
Citations as of Sep 19, 2020

Page view(s)

147
Last Week
3
Last month
Citations as of Oct 25, 2020

Google ScholarTM

Check

Altmetric


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