The cluster density of a distributed clustering algorithm in ad hoc networks

IEEE International Conference on Communications

Volumn 7, Issue , 2004, Pages 4336-4340

  Bettstetter, Christian ^a,b  

^a DOCOMO EURO LABS   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Ad hoc networking; Cluster density; Clustering; Leader election; Self organization; Sensor networks

Indexed keywords

ALGORITHMS; CARRIER COMMUNICATION; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; HIERARCHICAL SYSTEMS; LOGIC DESIGN; POISSON DISTRIBUTION; TELEPHONE TRAFFIC ANALYSIS; VOICE/DATA COMMUNICATION SYSTEMS;

AD HOC NETWORKS; CLUSTER DENSITY; CLUSTERING; LEADER ELECTION; SELF ORGANIZATION; SENSORS NETWORKS;

PACKET NETWORKS;

EID: 4143086007     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icc.2004.1313366     Document Type: Conference Paper

References (22)

1. D. J. Baker and A. Ephremides, "The architectural organization of a mobile radio network via a distributed algorithm," IEEE Trans. Commun., vol. 29, pp. 1694-1701, Nov. 1981.
2. M. Gerla and J. T.-C. Tsai, "Multicluster, mobile, multimedia radio network," ACM/Kluwer Wireless Networks, vol. 1, pp. 255-265, Mar. 1995.
3. C. R. Lin and M. Gerla, "Adaptive clustering for mobile wireless networks," IEEE J. Select. Areas Commun., vol. 15, pp. 1265-1275, Sept. 1997.
4. P. Krishna, N. H. Vaidya, M. Chatterjee, and D. K. Pradhan, "A cluster-based approach for routing in dynamic networks," ACM Computer Communications Review, vol. 27, Apr. 1997.
5. R. Ramanathan and M. Steenstrup, "Hierarchically-organized, multihop mobile wireless networks for quality-of-service support," ACM/Kluwer Mobile Networks and Applications, vol. 3, pp. 101-119, June 1998.
6. B. Das and V. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets." in Proc. IEEE Intern. Conf. on Communications (ICC), (Monréal, Canada), June 1997.
7. R. Sivakumar, B. Das, and V. Bharghavan, "Spine-based routing in ad hoc networks," ACM/Baltzer Cluster Computing, vol. 1, Nov. 1998.
8. S. Basagni, "Distributed clustering for ad hoc networks," in Proc. Intern. Symp. Parallel Architectures, Algorithms, and Networks (ISPAN), (Perth/Fremantle, Australia), June 1999.
9. J. Wu and H. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proc. Intern. Workshop Discrete Algorithms and Methods for Mobile Computing and Communications (DialM), (Seattle, USA), Aug. 1999.
10. A. B. McDonald and T. F. Znati, "A mobility-based framework for adaptive clustering in wireless ad hoc networks" IEEE J. Select. Areas Commun., vol. 17, pp. 1466-1487, Aug. 1999.
11. A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh, "Max-min d-cluster formation in wireless ad hoc networks," in Proc. IEEE Infocom, (Tel Aviv, Israel), 2000.
12. K. M. Alzoubi, P.-J. Wan, and O. Frieder, "Message-optimal connected dominating sets in mobile ad hoc networks," in Proc. ACM Intern. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), (Lausanne, Switzerland), June 2002.
13. Y. P. Chen and A. L. Liestman, "Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks," in Proc. ACM Intern. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), (Lausanne, Switzerland), June 2002.
14. P.-J. Wan, K. M. Alzoubi, and O. Frieder, "Distributed construction of connected dominating set in wireless ad hoc networks," in Proc. IEEE Infocom, (New York, USA), June 2002.
15. J. Sucec and I. Marsic, "Clustering overhead for hierarchical routing in mobile ad hoc networks," in Proc. IEEE Infocom, (New York, USA), June 2002.
16. S. Verblunsky, "On the least number of unit circles which can cover a square," J. London Math. Soc., vol. 24, no. 164-170, 1949.
17. L. F. Tóth, "Review of [16]." http://www.ams.org/ mathscinet-getitem?mr=11,455g, cited August 2003.
18. C. Bettstetter and O. Krause. "On border effects in modeling and simulation of wireless ad hoc networks," in Proc. IEEE Intern. Conf. on Mobile and Wireless Commun. Networks (MWCN), (Recife, Brazil), Aug. 2001.
19. S. Stoyan, W. S. Kendall, and J. Mecke, Stochastic Geometry and its Applications. Wiley, 2nd ed., 1995.
20. C. Bettstetter, "Mobility modeling in wireless networks: Categorization, smooth movement, and border effects," ACM Mobile Computing and Communications Review, vol. 5, no. 3, 2001.
21. C. Bettstetter and J. Xi, "Mobility modeling and analysis of adaptive clustering algorithms in ad hoc networks," in Proc. European Personal Mobile Commun. Conf. (EPMCC), (Vienna, Austria), Feb. 2001.
22. B. Ghosh, "Random distances within a rectangle and between two rectangles," Bull. Calcutta Math. Soc., vol. 43, pp. 17-24, 1951.