Collaborative resource discovery in mobile peer-to-peer networks

dc.contributor.advisorOhm Sornilth
dc.contributor.authorAjay Arunachalamth
dc.descriptionThesis (Ph.D. (Computer Science and Information Systems))--National Institute of Development Administration, 2015th
dc.description.abstractResource discovery is the process to find the queried object also referred as resource searching. With the rapid development of mobile hardware and wireless internet access, it became feasible to use mobile devices in P2P network. Deploying unstructured Peer-to-Peer (P2P) applications over Mobile Ad-hoc Network (MANET) has seen a decade effort, but still has many limitations and challenges. Searching in such resultant networks are not efficient and further ineffective mainly due to mobility, peer discovery and connectivity issues. Typical resource searching algorithms rely on flooding, random walk or probabilistic forwarding methods in P2P systems over MANET to discover the object of interest which incurs remarkable network traffic, relatively high query delay, consumes extra processing power and network bandwidth. While the recently proposed schemes are able to reduce the search time, but then due to network dynamics these protocols have low hit rate and high network overhead. To address these issues, a cross-layered search architecture with collaborative model for resource discovery is proposed to suit such a highly dynamic network
dc.description.abstractIn this research, efficient resource discovery algorithms are proposed to better meet the mobility requirements of ad hoc networks. We start by studying the behaviour of P2P protocols on MANET focusing on end-to-end resource discovery. Further, we address ways to improve these algorithms to suit better and work well under MANET using the idea of addressed broadcast mechanism, i.e., we propose a simple and light weight resource discovery technique to suit the characteristics of mobile
dc.description.abstractIn general, most researchers blame that message duplication is one of the major concern for causing low search efficiency. Generally in flooding and other resource discovery schemes, the problem is that every node will receive duplicates of the same message over different paths. To minimize the redundant messages and improve the search efficiency, we propose a novel neighbor’s density based model. In this scheme, the nodes collaborate with each other by passing the local neighborhood density information from one node to another improving the overall performance. Finally, we provide analytical models measuring the performance of flooding-based search techniques and our proposed schemes. Both analytical and simulation results indicate that our proposed schemes have better performance than the widely used
dc.format.extent208 leavesth
dc.publisherNational Institute of Development Administrationth
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
dc.subject.otherMobile communication systemsth
dc.subject.otherPeer-to-peer architecture (Computer networks)th
dc.titleCollaborative resource discovery in mobile peer-to-peer networksth
dc.typetext--thesis--doctoral thesisth
mods.physicalLocationNational Institute of Development Administration. Library and Information Centerth of Applied Statisticsth Science and Information Systemsth Institute of Development Administrationth of Philosophyth
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
9.07 MB
Adobe Portable Document Format