Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Mesh-based content routing using XML
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
UCAN: a unified cellular and ad-hoc network architecture
Proceedings of the 9th annual international conference on Mobile computing and networking
Data dissemination in mobile peer-to-peer networks
Proceedings of the 6th international conference on Mobile data management
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Self-stabilization protocols, and distributed protocols in mobile ad hoc networks
Self-stabilization protocols, and distributed protocols in mobile ad hoc networks
A Spatio-Temporal Approach to Selective Data Dissemination in Mobile Peer-to-Peer Networks
ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing
IEEE Transactions on Computers
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
IEEE Transactions on Parallel and Distributed Systems
Nearest neighbor queries with peer-to-peer data sharing in mobile environments
Pervasive and Mobile Computing
Collaborative spatial data sharing among mobile lightweight devices
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
| Hi-index | 0.00 |
In this paper, we propose a novel peer-to-peer based information diffusion scheme for mobile ad hoc networks. Due to mobility and bandwidth constraints, it is not always possible to share a complete content within a single transmission from one mobile device to another. To address this problem, we introduce segmentation of contents into smaller pieces for efficient information exchange. In mobile ad hoc networks, since it is impossible for a node to know the content of every other node in the network, we propose a Spatial-Popularity based Information Diffusion (SPID) scheme that determines urgency of dissemination of content according to the necessity in a neighborhood. Substantially, the segmentation policy and popularity based information dissemination reduce content acquiring time for each peer. Extensive simulation studies demonstrate that the proposed scheme is efficient in data distribution in mobile ad hoc networks, and prove superiority to other existing methods.