In Reputation We Believe: Query Processing in Mobile Ad-Hoc Networks

Simple item page
dc.contributor.authorPerich, Filip
dc.contributor.authorKagal, Lalana
dc.contributor.authorJoshi, Anupam
dc.contributor.authorFinin, Tim
dc.contributor.authorYesha, Yelena
dc.date.accessioned2018-12-13T15:21:44Z
dc.date.available2018-12-13T15:21:44Z
dc.date.issued2004-08-22
dc.descriptionInternational Conference on Mobile and Ubiquitous Systems: Networking and Servicesen_US
dc.description.abstractCurrent research on data management in mobile ad-hoc networks focuses on discovering sources and acquiring information. In this mode of operation, mobile devices assume answers to be correct and do not verify the veracity of the information or their providers. This assumption is suitable for most client-server environments; however, peer-to-peer environments lack the intrinsic stability of ``anchored'' sources. In mobile peer-to-peer environments, some sources may provide faulty information, which can lead to incorrect conclusions. Consequently, devices need a mechanism to evaluate the integrity of their peers and the accuracy of peer provided information. To address this problem we propose a query processing model that relies on distributed trust and belief. In our model, each device maintains and shares beliefs regarding the degree of trust it has for its peers -- where trust is determined by experience and reputation. Additionally, each device associates a value indicating its belief in the accuracy of the information the device holds. Each device, when querying its peers, uses the trust it has placed in the peers, in conjunction with the peers' accuracy belief of their information, to determine the reliability of the responses to its query. We have implemented our model in GloMoSim and provide experimental results for different combinations of trust and accuracy algorithms.en_US
dc.description.sponsorshipThis work was supported in part by NSF awards IIS 9875433 and 0209001, and DARPA contract F30602-00-2-0591en_US
dc.description.urihttps://ieeexplore.ieee.org/document/1331739en_US
dc.format.extent9 pagesen_US
dc.genreconference papers and proceedings preprintsen_US
dc.identifierdoi:10.13016/M2CV4BW3F
dc.identifier.citationFilip Perich, Lalana Kagal, Anupam Joshi, Tim Finin, and Yelena Yesha, In Reputation We Believe: Query Processing in Mobile Ad-Hoc Networks, The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2004. MOBIQUITOUS 2004. , DOI: 10.1109/MOBIQ.2004.1331739en_US
dc.identifier.uri10.1109/MOBIQ.2004.1331739
dc.identifier.urihttp://hdl.handle.net/11603/12247
dc.language.isoen_USen_US
dc.publisherIEEEen_US
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Computer Science and Electrical Engineering Department Collection
dc.relation.ispartofUMBC Faculty Collection
dc.relation.ispartofUMBC Student Collection
dc.rightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
dc.rights© 2004 IEEE
dc.subjectquery processingen_US
dc.subjectmobile ad-hoc networken_US
dc.subjectdata managementen_US
dc.subjectclient-server environmentsen_US
dc.subjectpeer-to-peer environmentsen_US
dc.subjectsecurity of dataen_US
dc.subjectUMBC Ebiquity Research Groupen_US
dc.titleIn Reputation We Believe: Query Processing in Mobile Ad-Hoc Networksen_US
dc.typeTexten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
106.pd.pdf
Size:
215.63 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.56 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

UMBC Computer Science and Electrical Engineering Department
UMBC Faculty Collection
UMBC Student Collection