Skip to main content
SpringerLink
Log in

Finding a Maximal Weighted Independent Set in Wireless Networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper introduces MWIS, a distributed algorithm for the efficient determination of a maximal weighted independent set in the topology graph G of a wireless network. Motivated by the observation that the problem of partitioning wireless nodes into clusters easily reduces to the problem of finding a maximal weighted independent set of nodes, the proposed algorithm is described by taking into account two main characteristics of wireless networks, namely, the broadcast nature of the wireless medium and the possibility to support nodes mobility. MWIS is executed at each node by means of fast message triggered procedures that require the sole knowledge of the topology local to the node. Moreover, its time complexity is proven to be bounded by a topology dependent parameter of the network (the stability number α(G) of the network topology graph G), rather than by the invariant number n of the network nodes. Based on this result, and by using a well known result about α(G) in the theory of random graphs the paper concludes with a brief discussion on the average time complexity of MWIS.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. N. Alon, L. Babai and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, Journal of Algorithms 7(4) (December 1986) 567-583.

    Google Scholar 

  2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and the hardness of approximation problems, Journal of the ACM 45(3) (May 1998) 501-555.

    Google Scholar 

  3. D.J. Baker and A. Ephremides, The architectural organization of a mobile radio network via a distributed algorithm, IEEE Transactions on Communications 29(11) (November 1981) 1694-1701.

    Google Scholar 

  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 2(1) (January 1984) 226-237.

    Google Scholar 

  5. S. Basagni, D. Bruschi and I. Chlamtac, A mobility transparent deterministic broadcast mechanism for ad hoc networks, ACM/IEEE Transactions on Networking 7(6) (December 1999) 799-807.

    Google Scholar 

  6. S. Basagni, I. Chlamtac and A. Faragó, A generalized clustering algorithm for peer-to-peer networks, in: Workshop on Algorithmic Aspects of Communication, Satellite Workshop of ICALP'97 (invited paper), Bologna, Italy, 11–12 July 1997.

  7. B. Bollobás, Random Graphs (Academic Press, London, UK, 1985).

    Google Scholar 

  8. A. Ephremides, Design concepts for a mobile-user radio network, Computers & Electrical Engineering 10(3) (1983) 127-135.

    Google Scholar 

  9. A. Ephremides, J.E. Wieselthier and D.J. Baker, A design concept for reliable mobile radio networks with frequency hopping signaling, Proceedings of the IEEE 75(1) (January 1987) 56-73.

    Google Scholar 

  10. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).

    Google Scholar 

  11. M. Gerla and C.R. Lin, Multimedia transport in multihop dynamic packet radio networks, in: Proc. of Internat. Conf. on Network Protocols, Tokyo, Japan, 7–10 November 1995, pp. 209-216.

  12. M. Gerla and J.T.-C. Tsai, Multicluster, mobile, multimedia radio network, Wireless Networks 1(3) (1995) 255-265.

    Google Scholar 

  13. J. Håstad, Clique is hard to approximate within n 1-ɛ, in: Proc. of the 37th Annual Symposium on Foundations of Computer Science, Burlington, VT, 14–16 October 1996, pp. 627-636.

  14. R. Kopf and G. Ruhe, A computational study of the weighted independent set problem for general graphs, Foundations of Control Engineering 12(4) (1987) 167-180.

    Google Scholar 

  15. C.R. Lin and M. Gerla, Adaptive clustering for mobile wireless networks, Journal on Selected Areas in Communications 15(7) (September 1997) 1265-1275.

    Google Scholar 

  16. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM Journal on Computing 15(4) (November 1986) 1036-1053.

    Google Scholar 

  17. E.M. Palmer, Graphical Evolutions: An Introduction to the Theory of Random Graphs, Wiley-Interscience Series in Discrete Mathematics (Wiley, New York, 1985).

    Google Scholar 

  18. A.S. Tanenbaum, Computer Networks, 3rd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Advanced Telecommunications Systems and Services, Department of Computer Science, Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, USA

    Stefano Basagni

Authors
  1. Stefano Basagni
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Basagni, S. Finding a Maximal Weighted Independent Set in Wireless Networks. Telecommunication Systems 18, 155–168 (2001). https://doi.org/10.1023/A:1016747704458

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016747704458

Search

Navigation