Distributed k-clustering algorithms for random wireless multihop networks

Lecture Notes in Computer Science

Volumn 3420, Issue I, 2005, Pages 109-116

  Ravelomanana, Vlady ^a  

^a UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; MOBILE COMPUTING; PROBLEM SOLVING; RADIO TRANSMISSION;

AD HOC NETWORKS; NON-OVERLAPPING SUBNETWORKS; WIRELESS HOSTS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 24644518600     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31956-6_14     Document Type: Conference Paper

References (30)

1. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y. and Cayirci, E. Wireless sensor networks: a survey. Computer Networks 38: 393-422, 2002.
2. Al Agha, K., Pujolle, G. and Vivier, G. Réseaux de mobiles & réseaux sans fil. Éditions Eyrolles, 2001.
3. Basagni, S. Distributed Clustering for Ad Hoc Networks. in Proc. Inter. Symp. Par. Architectures, Algorithms and Networks (ISPAN), 1999.
4. Battiti, R., Bertossi, A. A. and Bonuccelli M. A. Assigning Codes in Wireless Networks: Bounds and Scaling Properties. Wireless Networks, 5: 195-209, 1999.
5. Black, U. Mobile and Wireless Networks. Prentice-Hall, 1996.
6. Chatzigiannakis, L., Nikoletseas, S. and Spirakis, P. Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Protocols. To appear in ACM/Kluwer Mobile Networks and Applications, 2004.
7. Cheng, Y.-C. and Robertazzi T. G. Critical connectivity phenomena in multihop radio models. IEEE Trans. on Communications, 36: 770-777, 1989.
8. Corless, R. M., Gonnet G. H., Hare D. E. G., Jeffrey D. J. and Knuth D. E. On the Lambert W Function. Advances in Computational Mathematics, 5: 329-359, 1996.
9. Deogun, J. S., Kratsch D. and Steiner G. An approximation algorithm for clustering graphs with dominating diametral path. Inf. Proc. Letters, 61(3): 121-127, 1997.
10. Ephremides, A., Flynn, J. A. and Baker, D. J. The design and simulation of a mobile radio network with distributed control. IEEE Journal on Selected Areas of Communications 2(1): 226-237, 1984.
11. Estrin, D., Govindan, R., Heidemann, J. and Kumar S. Next century challenges: Scalable coordination in sensor networks. Proceedings of IEEE/ACM International Conference on Mobile Computing and Networking, pp 263-270, 1999.
12. Fernandess, Y. and Malkhi, D. K-Clustering in Wireless Ad Hoc Networks. in Proceedings of ACM POMC 2002.
13. Garcia Nocetti, F., Solano Gonzalez, J. and Stojmenovic, I. Connectivity Based k-hop Clustering in Wireless Networks. Telecommunication Systems, 22: 205-220, 2003.
14. Gerla, M. and Tsai, J. T. C. Multicluster, mobile, multimedia radio network. ACM/Kluwer Wireless Networks, 1: 255-265, 1995.
15. Gilbert, E. N. Random Plane Networks. Journal of the Society for Industrial and Applied Math, 9: 533-543, 1961.
16. Gupta, P. and Kumar P. R. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications: a volume in honor of W. H. Fleming, W. M. McEneaney, G. Yin and Q. Zhang, Birkhauser, Boston, 1998.
17. Gupta, P. and Kumar P. R. Internet in the Sky: The Capacity of Three Dimensional Wireless Networks. Communications in Information and Systems, 1:33-49, 2001.
18. Hall, P. Introduction to the Theory of Coverage Processes. Birkhäuser, Boston, 1988.
19. Krishna, P., Vaidya, N. H., Chatterjee, M. and Pradhan, D. K. A cluster-based approach for routing in dynamic networks ACM Computer Comm. Review, vol. 27, 1997.
20. Krishnamachari, B., Wicker S. B., Bejar R. and Pearlman M. Critical Density Thresholds in Distributed Wireless Networks. Book chapter in Communications, Information and Network Security, eds. H. Bhargava, H. V. Poor, V. Tarokh, and S. Yoon, Kluwer Publishers, 2002.
21. Kushilevitz, E. and Mansour, Y. An Ω(Dlog(N/D)) Lower Bound for Broadcast in Radio Networks. SIAM Journal on Comput. 27(3): 702-712, 1998.
22. Lin, C. R. and Gerla, M. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas of Communications 15(7): 1265-1275, 1997.
23. Malpani, N., Vaidya, N. and Welch J. L. Leader Election Algorithms for Mobile Ad Hoc Networks. Proceedings of 4th Int. Workshop on Disc.Algorithms and Methods for Mobile Computing and Communications - DIALM 2000, pp. 96-103.
24. Miles, R. E. On the Homogenous Planar Poisson Point Process. Math. Biosciences, 6: 85-127, 1970.
25. Parekh, A. K. Selecting routers in ad hoc wireless networks. Proceedings of SBT/IEEE Int'l Telecomm. Symp., 1994.
26. Perkins, C. E. Ad Hoc Networking. Addison-Wesley, 2001.
27. Philips, T. K., Panwar, S. S. and Tantawi, A. N. Connectivity properties of a packet radio network model. IEEE Trans. on Information Theory, 35: 1044-1047, 1989.
28. Ravelomanana, V. Extremal Properties of Three-Dimensional Sensor Networks with Applications. IEEE Trans. on Mobile Computing, 3: 246-257, 2004.
29. th HICSS, 2005.
30. Santi, P. and Blough D. M. The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks. IEEE Trans. on Mobile Computing, 2: 1-15, 2003.