6DMPP: small worlds in mobile peer-to-peer networks

Authors:
Ke Zuo;Quanyuan Wu
Affiliations:
National University of Defense Technology, Changsha, P.R. China;National University of Defense Technology, Changsha, P.R. China
Venue:
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Year:
2009

Citing 8
Cited 0

Small worlds: the dynamics of networks between order and randomness

Small worlds: the dynamics of networks between order and randomness
GHT: a geographic hash table for data-centric storage

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Peer-to-peer File-sharing over Mobile Ad hoc Networks

PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks

WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
PReCinCt: A Scheme for Cooperative Caching in Mobile Peer-to-Peer Systems

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
MANET simulation studies: the incredibles

ACM SIGMOBILE Mobile Computing and Communications Review - Special Issue on Medium Access and Call Admission Control Algorithms for Next Generation Wireless Networks.: The Digital Library version of this issue has a corrected special issue title compared to the one in the print version of the issue.
Virtual ring routing: network routing inspired by DHTs

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed Hashing for Scalable Multicast in Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present 6DMPP, a novel network routing protocol that improve routing performance by applying the small word concept to reducing average routing lengths. The key idea is to arrange all nodes along a logic circle and equip them with long distance links drawn from a family of power law distribution. We also introduce deceasing failure detection and failure repairs techniques to maintain long distance links at a small cost. Through simulations, we demonstrate that our approach performs comparably, or better than, the existing wireless routing protocol.