Heterogeneous Architecture for Ad Hoc Networks

Article Preview

Abstract:

By making small adjustment to general ad hoc network architecture, we build a network topology with short average path length and high clustering coefficient, which are two important metrics of ad hoc networks. Furthermore, an efficient probabilistic flooding routing algorithm is proposed based on this network model. Simulation results show that this architecture behaves better performance than its ordinary counterpart.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

1059-1062

Citation:

Online since:

September 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] B. Bollobas, Random graphs, Cambridge University Press, (2001).

Google Scholar

[2] M. Penrose. Random geometric graphs. Oxford university press, (2003).

Google Scholar

[3] Bhaskar Krishnamachari, Stephen B. Wicker, Ramon Bejar. Phase transition phenomena in wireless Ad hoc networks. Global Telecommunications Conference, 2001. Globecom'01 IEEE Vol5,  pp.2921-2925.

DOI: 10.1109/glocom.2001.965963

Google Scholar

[4] Yoav Sasson, David Cavin, Andre Schiper. Probabilistic broadcast for flooding in wireless mobile Ad hoc networks. 2003 IEEE Wireless Communications and Networking Conference Record (Cat. No. 03 TH8659), 2003, vol. 2, pp.1124-1130.

DOI: 10.1109/wcnc.2003.1200529

Google Scholar