Skip to main content
Log in

Analysis of bandwidth allocation algorithms for wireless personal area networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

A major issue in the design and operation of ad hoc networks is sharing the common spectrum among links in the same geographic area. Bandwidth allocation, to optimize the performance of networks in which each station can converse with at most a single neighbor at a time, has been recently studied in the context of Bluetooth Personal Area Networks. There, centralized and distributed, capacity assignment heuristics were developed, with applicability to a variety of ad hoc networks. Yet, no guarantees on the performance of these heuristics have been provided. In this paper, we extend these heuristics such that they can operate with general convex objective functions. Then, we present our analytic results regarding these heuristics. Specifically, we show that they are β-approximation (β<2) algorithms. Moreover, we show that even though the distributed and centralized algorithms allocate capacity in a different manner, both algorithms converge to the same results. Finally, we present numerical results that demonstrate the performance of the algorithms.

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

Access this article

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. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall Inc., New Jersey, 1993.

    Google Scholar 

  2. S. Baatz, C. Bieschke, M. Frank, C. Kühl, P. Martini, and C. Scholz, “Building Efficient Bluetooth Scatternet Topologies from 1-Factors”, Proc. IASTED WOC 2002, July 2002.

  3. S. Baatz, M. Frank, C. Kühl, P. Martini and C. Scholz, “Adaptive Scatternet Support for Bluetooth using Sniff Mode”, Proc. IEEE LCN'01, Nov. 2001.

  4. S. Basagni, R. Bruno, G. Mambrini, and C. Petrioli, “Comparative Performance Evaluation of Scatternet Formation Protocols for Networks of Bluetooth Devices”, ACM/Kluwer Wireless Networks, Vol. 10, No. 2, pp. 197–213, Mar. 2004.

    Article  Google Scholar 

  5. D.P. Bertsekas, Nonlinear Programming, Athena Scientific, Massachusetts, 1999.

    MATH  Google Scholar 

  6. D.P. Bertsekas and R. Gallager, Data Networks, Prentice-Hall Inc., New Jersey, 1992.

    MATH  Google Scholar 

  7. P. Bhagwat and S.P. Rao, “On the Characterization of Bluetooth Scatternet Topologies”, Submitted for Publication, Available at http://www.winlab.rutgers.edu/~pravin/publications/papers/bt-top.ps, Dec. 2004.

  8. Bluetooth Special Interest Group, Specification of the Bluetooth System—Version 1.2, Nov. 2003.

  9. S.A. Borbash and A. Ephremides, “Wireless Link Scheduling with Power Control”, Proc. WiOpt'04, Mar. 2004

  10. J. Edmonds, “Maximum Matching and a Polyhedron with (0,1) Vertices”, J. of Research of the National Bureau of Standards, Vol. 69B, pp. 125–130, 1965.

    MathSciNet  Google Scholar 

  11. B. Hajek and G. Sasaki, “Link Scheduling in Polynomial Time”, IEEE Trans. on Information Theory, Vol. 34, pp. 910–917, Sep. 1988.

    Article  MathSciNet  Google Scholar 

  12. L. Har-Shai, R. Kofman, A. Segall, and G. Zussman, “Load Adaptive Inter-Piconet Scheduling in Small-Scale Bluetooth Scatternets”, IEEE Communications, Vol. 42, No. 7, pp. 136–142, July 2004.

    Article  Google Scholar 

  13. D.S. Hochbaum, “Polynomial and Strongly Polynomial Algorithms for Convex Network Optimization”, in Network Optimization Problems (eds: D. Z. Du and P. M. Pardalos), pp. 63–92, World Scientific, Singapore, 1993.

    Google Scholar 

  14. D.S. Hochbaum and J.G. Shanthikumar, “Convex Separable Optimization is Not Much Harder than Linear Optimization”, J. of the ACM, Vol. 37, No. 4, pp. 843–862, Oct. 1990.

    Article  MathSciNet  MATH  Google Scholar 

  15. IEEE std 802.15.3-2003, “Part 15.3: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specification for High Rate Wireless Personal Area Networks”, Sep. 2003.

  16. A.V. Karzanov and S.T. McCormick, “Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications”, SIAM J. Comput., Vol. 26, No. 4, pp. 1245–1275, Aug. 1997.

    Article  MathSciNet  MATH  Google Scholar 

  17. F.P. Kelly, “Charging and Rate Control for Elastic Traffic”, European Trans. on Telecommunications, Vol. 8, pp. 33–37, 1997.

    Article  Google Scholar 

  18. L. Kleinrock, Communication Nets: Stochastic Message Flow and Delay, McGraw-Hill, New York, 1964.

    Google Scholar 

  19. F. Legrand, I. Bucaille, S. Hetuin, L. De Nardis, G. Giancola, M.-G. Di Benedetto, L. Blazevic, and P. Rouzet, “U.C.A.N.'s Ultra Wide Band System: MAC and Routing protocols”, Proc. IWUWBS'03, June 2003.

  20. M. Minoux, “Solving Integer Minimum Cost Flows with Separable Cost Objective Polynomially”, Mathematical Programming Study, Vol. 26, pp. 237–239, 1986.

    MATH  MathSciNet  Google Scholar 

  21. D. Miorandi and A. Zanella, “Performance Analysis of Limited-1 Polling in a Bluetooth Piconet”, Proc. CITSA'05, July 2005.

  22. D. Porcino and W. Hirt, “Ultra-Wideband Radio Technology: Potential and Challenges Ahead”, IEEE Communications, Vol. 41, No. 7, pp. 66–74, July 2003.

    Article  Google Scholar 

  23. S. Ramanathan, “A Unified Framework and Algorithm for Channel Assignment in Wireless Networks”, ACM/Kluwer Wireless Networks, Vol. 5, No. 2, pp. 81–94, Mar. 1999.

    Article  Google Scholar 

  24. T. Salonidis, P. Bhagwat, L. Tassiulas, and R. LaMaire, “Distributed Topology Construction of Bluetooth Personal Area Networks”, Proc. IEEE INFOCOM'01, Apr. 2001.

  25. S. Sarkar and L. Tassiulas, “End-to-end Bandwidth Guarantees Through Fair Local Spectrum Share in Wireless Ad-Hoc Networks”, Proc. IEEE CDC'03, Dec. 2003.

  26. L. Tassiulas and S. Sarkar, “Maxmin Fair Scheduling in Wireless Networks”, Proc. IEEE INFOCOM'02, June 2002.

  27. R.M. Whitaker, L. Hodge, and I. Chlamtac, “Bluetooth Scatternet Formation: a Survey”, Ad Hoc Networks, Vol. 3, No. 4, pp. 403–450, July 2005.

    Google Scholar 

  28. W. Zhang and G. Cao, “A Flexible Scatternet-wide Scheduling Algorithm for Bluetooth Networks”, Proc. IEEE IPCCC'02, Apr. 2002.

  29. G. Zussman and A. Segall, “Capacity Assignment in Bluetooth Scatternets - Optimal and Heuristic Algorithms”, ACM/Kluwer Mobile Networks and Applications (MONET), Vol. 9, No. 1, pp. 49–61, Feb. 2004.

    Article  Google Scholar 

  30. G. Zussman, A. Segall, and U. Yechiali, “Bluetooth Time Division Duplex - Analysis as a Polling System”, Proc. IEEE SECON'04, Oct. 2004.

  31. G. Zussman, U. Yechiali, and A. Segall, “Exact Probablistic Analysis of the Limited Scheduling Algorithm for Symetrical Bluetooth Piconets”, Proc. IFIP-TC6 PWC'03, LNCS Vol. 2775 (eds: M. Conti et al.), Springer, Sep. 2003.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gil Zussman.

Additional information

Randeep Bhatia received the Ph.D. degree in Computer Science from University of Maryland, the M.S. degree in Mathematics and Computer Science from University of Illinois at Chicago and the B.Tech. degree in Computer Science and Engineering from Indian Institute of Technology, Delhi. He is currently with the High Speed Networks Research Department at Bell Labs, Lucent technologies, working on network design, traffic engineering and scheduling algorithms. His current research interests are in the area of QoS for multimedia services in wireless data networks.

Adrian Segall received the B.Sc. and M.Sc. degrees in electrical engineering from the Technion, Israel Institute of Technology in 1965 and 1971, respectively, and the Ph.D. degree in electrical engineering with a minor in statistics from Stanford University in 1973. After serving active duty in the Israel Defense Forces, he joined in 1968 the Scientific Department of Israel’s Ministry of Defense. From 1973 to 1974 he was a Research Engineer at System Control Inc., Palo Alto, CA and a Lecturer at Stanford University. From 1974 to 1976 he was an Assistant Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. From 1987 to 1998 he was on the faculty of the Department of Computer Science at the Technion. He is presently Benjamin Professor of Computer-Communication Networks in the Department of Electrical Engineering, Technion, Israel Institute of Technology. From 1982 to 1984 he was on leave with the IBM T.J.Watson Research Center, Yorktown Heights, NY. He held visiting positions with IBM, AT&T and Lucent Bell Labs. His current research interests are in the area of optical networks, wireless, sensor and ad-hoc networks. Dr. Segall is an IEEE Fellow and has served in the past as Editor for Computer Communication Theory of the IEEE Transactions on Communications, Editor for the IEEE Information Theory Society Newsletter and Senior Editor for the IEEE Journal on Selected Areas in Communications. He was selected as an IEEE delegate to the 1975 IEEE-USSR Information Theory Workshop, and is the recipient of the 1981 Miriam and Ray Klein Award for Outstanding Research and of the 1990 Taub Award in Computer Science.

Gil Zussman received the B.Sc. degree in Industrial Engineering and Management and the B.A. degree in Economics (both summa cum laude) from the Technion—Israel Institute of Technology in 1995. He received the M.Sc. degree (summa cum laude) in Operations Research from Tel-Aviv University in 1999 and the Ph.D. degree in Electrical Engineering from the Technion—Israel Institute of Technology in 2004. Between 1995 and 1998, he served as an engineer in the Israel Defense Forces. He is currently a Postdoctoral Associate in the Laboratory for Information and Decision Systems in MIT. His current research interests are in the area of ad hoc and sensor networks. In particular, he is interested in energy efficient protocols, medium access control protocols, and personal area networks. Gil received the Knesset (Israeli Parliament) Award for distinguished students, the Best Student Paper Award at the IFIP-TC6 Networking 2002 Conference, and the IEEE Communications Magazine Best Paper Award at the OPNETWORK 2002 Conference. In 2004 he received the Marie Curie Outgoing International Fellowship and the Fulbright Fellowship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bhatia, R., Segall, A. & Zussman, G. Analysis of bandwidth allocation algorithms for wireless personal area networks. Wireless Netw 12, 589–603 (2006). https://doi.org/10.1007/s11276-006-6537-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-6537-y

Keywords

Navigation