Topology Optimization of Mobile P2P Ad Hoc Networks

The topological properties of mobile P2P Ad Hoc networks are critical factors that dominate the performance of these networks. The node degree and diameter of these networks are most important parameters which measure the autonomy, efficiency, robustness and load balancing of these networks. In order to improve the four features for these networks, researchers have proposed many practical systems with desirable degree and diameter values. However, values of degree and diameter conflict with each other, and a tradeoff is needed between them. In this paper, we propose a networking topology model from which practical systems can be derived with optimization. Some new networks with desirable degree and diameter values are also derived from the model. Moreover, the diameter values of some networks are improved to the optimal value from the model. Finally, theoretical analysis is provided to verify our designs.

[1]  Charles E. Perkins,et al.  Ad hoc networking: an introduction , 2001 .

[2]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[3]  John S. Baras,et al.  A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks , 2003 .

[4]  Roberto Montemanni,et al.  Design patterns from biology for distributed computing , 2006, TAAS.

[5]  Alberto Montresor,et al.  A robust protocol for building superpeer overlay topologies , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[6]  Abhishek Kumar,et al.  On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks , 2004, IEEE J. Sel. Areas Commun..

[7]  Jim Dowling,et al.  SAMPLE: Statistical Network Link Modelling in an On-Demand Probabilistic Routing Protocol for Ad Hoc Networks , 2005, Second Annual Conference on Wireless On-demand Network Systems and Services.

[8]  Dmitri Loguinov,et al.  Load-Balancing Performance of Consistent Hashing: Asymptotic Analysis of Random Node Join , 2007, IEEE/ACM Transactions on Networking.

[9]  Dilip Sarkar,et al.  Hypercube connected rings: a scalable and fault-tolerant logical topology for optical networks , 2001, Comput. Commun..

[10]  Jie Wu,et al.  FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Ching Law,et al.  Distributed construction of random expander graphs , 2003, INFOCOM 2003.

[12]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[13]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[14]  Sam Toueg,et al.  On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.