Analysis of bandwidth allocation algorithms for wireless personal area networks

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.

[1]  Anthony Ephremides,et al.  Wireless Link Scheduling With Power Control and SINR Constraints , 2006, IEEE Transactions on Information Theory.

[2]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Matthias Frank,et al.  Adaptive scatternet support for Bluetooth using sniff mode , 2001, Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks.

[4]  S. Ramanathan.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[5]  Leandros Tassiulas,et al.  Distributed topology construction of Bluetooth personal area networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Peter Martini,et al.  BUILDING EFFICIENT BLUETOOTH SCATTERNET TOPOLOGIES FROM 1-FACTORS , 2002 .

[7]  Fabrice Legrand.  U. C. A. N.''s ultra wide band system: MAC and routing protocols , 2003 .

[8]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[9]  Andrea Zanella,et al.  Performance Analysis of Limited-1 Polling in a Bluetooth Piconet , 2005 .

[10]  Leandros Tassiulas,et al.  End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks , 2005, IEEE Transactions on Automatic Control.

[11]  Dorit S. Hochbaum.  Polynomial and Strongly Polynomial Algorithms for Convex Network Optimization , 1993 .

[12]  S. Thomas McCormick,et al.  Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications , 1997, SIAM J. Comput..

[13]  Stefano Basagni,et al.  Comparative Performance Evaluation of Scatternet Formation Protocols for Networks of Bluetooth Devices , 2004, Wirel. Networks.

[14]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[15]  Leandros Tassiulas,et al.  Abstract--in Recent Years, Wireless Ad Hoc Networks Have Been a Growing Area of Research. While There Has Been Considerable Distributed Topology Construction of Bluetooth Personal Area Networks , .

[16]  L. A. Pilipchuk,et al.  Network optimization problems , 2002 .

[17]  Gil Zussman,et al.  Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets , 2003, PWC.

[18]  Gil Zussman,et al.  Bluetooth time division duplex - analysis as a polling system , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[19]  J. George Shanthikumar,et al.  Convex separable optimization is not much harder than linear optimization , 1990, JACM.

[20]  Guohong Cao,et al.  A flexible scatternet-wide scheduling algorithm for Bluetooth networks , 2002, Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326).

[21]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[22]  Gil Zussman,et al.  Capacity Assignment in Bluetooth Scatternets – Optimal and Heuristic Algorithms , 2004, Mob. Networks Appl..

[23]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[24]  Gil Zussman,et al.  Load-adaptive inter-piconet scheduling in small-scale Bluetooth scatternets , 2004, IEEE Communications Magazine.

[25]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[26]  Walter Hirt,et al.  Composite Reconfigurable Wireless Networks: the Eu R&d Path towards 4g , 2022 .

[27]  Imrich Chlamtac,et al.  Bluetooth scatternet formation: A survey , 2005, Ad Hoc Networks.

[28]  M. Minoux.  Solving integer minimum cost flows with separable convex cost objective polynomially , 1986 .

[29]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .