A Framework for Generating Network-Based Moving Objects
Geoinformatica
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Instant Advertising in Mobile Peer-to-Peer Networks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
PeerTIS: a peer-to-peer traffic information system
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
Group P2P network organization in mobile ad-hoc network
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
A Peer to Peer Based Information Sharing Scheme in Vehicular Ad Hoc Networks
MDM '10 Proceedings of the 2010 Eleventh International Conference on Mobile Data Management
An Adaptive Content Sharing Protocol for P2P Mobile Social Networks
WAINA '10 Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops
A chord-based novel mobile peer-to-peer file sharing protocol
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
| Hi-index | 0.00 |
Nowadays, the hierarchical architectures based on super peers have been proposed over mobile peer to peer (MP2P) networks. However, the management cost of the mobile network topology is high. In this paper, we propose a clustering method to construct hierarchical MP2P architectures. The proposed method groups the mobile peers through three aspects such as the maximum connection time, the minimum hop count and the number of the connected peers. The connection times between the connected peers can be determined by the location, velocity and communication range of each mobile peer. Since the maximum connection time of the connected peers are considered, the network topology is relatively stable. Therefore, the management cost of the network is decreased and the success rate of contents search is increased. Experiments have shown that our proposed method outperforms the existing schemes.