Simulating and implementing geospatially-based binding mechanisms for mobile peering
Proceedings of the 1st international conference on Ambient media and systems
Enabling location specific real-time mobile applications
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
Maintaining Spatial-Temporal Knowledge through Human Interaction
Bio-Inspired Computing and Communication
Efficient information retrieval in mobile peer-to-peer networks
Proceedings of the 18th ACM conference on Information and knowledge management
Improving data dissemination in MANET
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
SPID: a novel P2P-based information diffusion scheme for mobile networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Demand-driven publish/subscribe in mobile environments
Wireless Networks
Supporting multi-dimensional queries in mobile P2P network
Information Sciences: an International Journal
Hi-index | 0.00 |
We examine data dissemination in mobile peer-to-peer networks, where moving objects communicate with each other via short-range wireless technologies such as IEEE 802.11 or Bluetooth. Given the memory and bandwidth/energy constraints at moving objects, the ideal mobile peer-to-peer dissemination method is for each moving object to store and transmit only the reports that are new to other objects encountered in the future. However, in practice no object can know the states of all the other objects due to the distributed and dynamic nature of mobile peer-to-peer networks. Thus, predicting the novelty probability of a report is important for efficient data dissemination in mobile peer-to-peer networks. In this paper we propose a decentralized spatio-temporal approach to selective data dissemination. In this approach, the novelty probability of a report is estimated based on both spatial and temporal attributes (AGE and DISTANCE) of the report and each moving object only stores and transmits the reports with the highest novelty probabilities. We study different strategies of using novelty factors to compute the novelty probability. Extensive experiments are conducted to test and analyze the performance of different strategies. The experimental results determine the best strategy and demonstrate its superiority against existing mobile peer-to-peer methods.