Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm

ABSTRACT

Adaptive distributed clustering algorithms and respective protocols are used in wireless ad hoc networks to dynamically organize all nodes into groups and hierarchites. In this paper, we investigate the Distributed Mobility-Adaptive Clustering (DMAC) algorithm proposed in [6]. In particular, we evaluate how the cluster stability (i.e., the number of clusterhead elections, cluster changes per time step, and cluster lifetime) is influenced by the speed, the choice of the weight, and the failure rate of nodes. We performed simulations in a scenario with an enhanced random mobility model and in a realistic campus scenario that includes hot spots and streets

REFERENCES

• 1: NIST/SEMATECH Engineering Statistics Handbook. http://www.itlmist.gov/div898/hmldbook.
• 2: A. D. Antis, R. Prakash, T. H. Vuong, and D. T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings IEEE INFOCOM-O0, Tel Aviv, Israel, Mar. 2000.
• 3: D. J. Baker and A. Ephremides. The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications, COM-29:1694-1701, Nov. 1981.
• 4: D. J. Baker, A. Ephremides, and J. A. Flynn. The design and simulation of a mobile radio network with distributed control. IEEE Journal on Selected Areas in Communications, SAC-2(1):226-237, Jan. 1984.
• 5: S. Basagni. Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks. In Proceedings VTC-99, IEEE Vehicular Technology Conference, pages 889-893, Amsterdam, Netherlands, Sept. 1999.
• 6: Stefano Basagni, Distributed Clustering for Ad Hoc Networks, Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), p.310, June 23-25, 1999
• 7: B. Das and V. Bhm-ghavml. Routing in ad hoc networks using minimum connected dominating sets. In Proceedings Icc,gz International Conference on Communications, volume 1, pages 376-380, Montreal, Canada, June 1997.
• 8: Mario Gerla , Jack Tzu-Chieh Tsai, Multicluster, mobile, multimedia radio network, Wireless Networks, v.1 n.3, p.255-265, 1995 [doi>10.1007/BF01200845]
• 9: R. A. Guerin. Channel occupancy time distribution in a cellular radio system. IEEE Transactions on Vehicular Technology, 36(3):89-99, Aug. 1987.
• 10: L. Kleinrock and F. Kmnoun. Hierarchical routing for large networks. Computer Networks, 1 (3): 155-174, Jan. 1977.
• 11: P. Krishna , Mainak Chatterjee , Nitin H. Vaidya , Dhiraj K. Pradhan, A Cluster-based Approach for Routing in Ad-Hoc Networks, Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing, p.1-10, April 10-11, 1995
• 12: P. Krishna , N. H. Vaidya , M. Chatterjee , D. K. Pradhan, A cluster-based approach for routing in dynamic networks, ACM SIGCOMM Computer Communication Review, v.27 n.2, p.49-64, Apr. 1997 [doi>10.1145/263876.263885]
• 13: C. R. Lin and M. Gerla. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications, 15(7):1265-1275, Sept. 1997.
• 14: Makoto Matsumoto , Takuji Nishimura, Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.8 n.1, p.3-30, Jan. 1998 [doi>10.1145/272991.272995]
• 15: A. B. McDonald and T. F. Znati. A mobility-based framework for adaptive clustering in wireless ad hoc networks. IEEE Journal on Selected Areas in Communications, 17(8):1466-1486, Aug. 1999.
• 16: A. K. Pm-ekh. Selecting touters in ad hoc wireless networks. Journal of Brazilian Computer Society, 1(2):75-86, Nov. 1994.
• 17: M. R. Pearlman and Z. J. Haas. Determining the optimal configuration for the zone routing protocol. IEEE Journal on Selected Areas in Communications, 17(8):1395-1414, Aug. 1999.
• 18: Ad hoc networking, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2001
• 19: Lakshmi Ramachandran , Manika Kapoor , Abhinanda Sarkar , Alok Aggarwal, Clustering algorithms for wireless ad hoc networks, Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, p.54-63, August 11-11, 2000, Boston, Massachusetts, United States [doi>10.1145/345848.345860]
• 20: C. V. Rmnamoorthy, A. Bhide, and J. Srivastava. Reliable clustering techniques for large, mobile packet radio networks. In Proceedings IEEE INFOCOM'87, pages 218-226, San Francisco, May 1987.
• 21: Ram Ramanathan , Martha Steenstrup, Hierarchically-organized, multihop mobile wireless networks for quality-of-service support, Mobile Networks and Applications, v.3 n.1, p.101-119, June 1998 [doi>10.1023/A:1019148009641]
• 22: Thomas G. Robertazzi, Planning Telecommunication Networks, Wiley-IEEE Press, 1998
• 23: Nachum Shacham, Organization of Dynamic Radio Network by Overlapping Clusters: Architecture Considerations and Optimization, Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation, p.435-447, December 19-21, 1984

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Network topology
      C.2.4 Distributed Systems
  C.4 PERFORMANCE OF SYSTEMS

General Terms:
Algorithms, Design

Keywords:
clustering, distributed network algorithms, mobile wireless ad hoc networks, modeling, self-organization and self-configuration, simulation and performance evaluation