Throughput-optimal configuration of fixed wireless networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Throughput-optimal configuration of fixed wireless networks

Full text

Pdf (971 KB)

Source

IEEE/ACM Transactions on Networking (TON) archive
Volume 16 , Issue 5 (October 2008) table of contents

Pages 1161-1174

Year of Publication: 2008

ISSN:1063-6692

Authors

Aditya Karnik	General Motors India Science Lab, Bangalore, India
Aravind Iyer	General Motors India Science Lab, Bangalore, India
Catherine Rosenberg	Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada

Publisher

IEEE Press Piscataway, NJ, USA

Bibliometrics

Downloads (6 Weeks): 17, Downloads (12 Months): 90, Citation Count: 0

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	10.1109/TNET.2007.909717

ABSTRACT

In this paper, we address the following two questions concerning the capacity and configuration of fixed wireless networks: (i) given a set of wireless nodes with arbitrary but fixed locations, and a set of data flows, what is the max-min achievable throughput? and (ii) how should the network be configured to achieve the optimum? We consider these questions from a networking standpoint assuming point-to-point links, and employ a rigorous physical layer model to model conflict relationships between them. Since we seek capacity results, we assume that the network is operated using an appropriate schedule of conflict-free link activations. We develop and investigate a novel optimization framework to determine the optimal throughput and configuration, i.e., flow routes, link activation schedules and physical layer parameters. Determining the optimal throughput is a computationally hard problem, in general. However, using a smart enumerative technique we obtain numerical results for several different scenarios of interest. We obtain several important insights into the structure of the optimal routes, schedules and physical layer parameters. Besides determining the achievable throughput, we believe that our optimization-based framework can also be used as a tool, for configuring scheduled wireless networks, such as those based on IEEE 802.16.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
	2	V. Mhatre and C. Rosenberg, "The impact of link layer model on the capacity of random ad hoc network," in Proc. 2006 ISIT, Jul. 2006.
	3	L.-L. Xie and P. R. Kumar, "A network information theory for wireless communication: Scaling laws and optimal operation," IEEE Trans. Inf. Theory, vol. 50, no. 5, pp. 748-767, May 2004.
	4	J. Proakis, Digital Communications. New York: McGraw-Hill, 2000.
	5	Aravind Iyer , Catherine Rosenberg , Aditya Karnik, What is the right model for wireless channel interference?, Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks, August 07-09, 2006, Waterloo, Ontario, Canada [doi>10.1145/1185373.1185376]
	6	A. Karnik and A. Kumar, "Distributed optimal self-organisation in a class of wireless sensor networks," in Proc. IEEE INFOCOM, 2004, pp. 536-547.
	7	S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar, "Power control in ad hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol," in Proc. Eur. Wireless Conf., 2002.
	8	A. Behzad and I. Rubin, "High transmission power increases the capacity of ad hoc wireless networks," IEEE Trans. Wireless Commun., vol. 5, no. 1, pp. 156-165, Jan. 2006.
	9	Baruch Awerbuch , David Holmer , Herbert Rubens, The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks, Mobile Networks and Applications, v.11 n.2, p.253-266, April 2006 [doi>10.1007/s11036-005-4477-x]
	10	Ian F. Akyildiz , Xudong Wang , Weilin Wang, Wireless mesh networks: a survey, Computer Networks and ISDN Systems, v.47 n.4, p.445-487, 15 March 2005 [doi>10.1016/j.comnet.2004.12.001]
	11	Kamal Jain , Jitendra Padhye , Venkata N. Padmanabhan , Lili Qiu, Impact of interference on multi-hop wireless network performance, Proceedings of the 9th annual international conference on Mobile computing and networking, September 14-19, 2003, San Diego, CA, USA [doi>10.1145/938985.938993]
	12	Patrick Stuedi , Gustavo Alonso, Computing throughput capacity for realistic wireless multihop networks, Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems, October 02-06, 2006, Terromolinos, Spain [doi>10.1145/1164717.1164752]
	13	H. Viswanathan and S. Mukherjee, "Throughput-range tradeoff of wireless mesh backhaul networks," IEEE J. Sel. Areas Commun., vol. 24, no. 3, pp. 593-602, Mar. 2006.
	14	R. L. Cruz and A. V. Santhanam, "Optimal routing, link scheduling and power control in multihop wireless networks," in Proc. IEEE INFOCOM , 2003, pp. 702-711.
	15	M. J. Neely, E. Modiano, and C. E. Rohrs, "Dynamic power allocation and routing for time-varying wireless networks," IEEE J. Sel. Areas Commun., vol. 23, no. 1, pp. 89-103, Jan. 2005.
	16	L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Contr., vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
	17	R. Gallager, "A minimum delay routing algorithm using distributed computation," IEEE Trans. Commun., vol. COM-25, no. 1, pp. 73-85, Jan. 1977.
	18	V. Erceg, L. Greenstein, Y. Tjandra, S. Parkoff, A. Gupta, B. Kulic, A. Julius, and R. Bianchi, "An empirically-based path loss model for wireless channels in suburban environments," IEEE J. Sel. Areas Commun., vol. 17, no. 7, pp. 1205-1211, Jul. 1999.
	19	Amotz Bar-Noy , Alain Mayer , Baruch Schieber , Madhu Sudan, Guaranteeing Fair Service to Persistent Dependent Tasks, SIAM Journal on Computing, v.27 n.4, p.1168-1189, Aug. 1998 [doi>10.1137/S0097539795282092]
	20	D. Bertsekas, Nonlinear Programming. Nashua, NH: Athena Scientific, 1995.
	21	K. Border, Fixed Point Theorems With Applications to Economics and Game Theory. Cambridge, U.K.: Cambridge Univ. Press, 1985.
	22	Rajarshi Gupta , John Musacchio , Jean Walrand, Sufficient rate constraints for QoS flows in ad-hoc networks, Ad Hoc Networks, v.5 n.4, p.429-443, May, 2007 [doi>10.1016/j.adhoc.2006.01.003]
	23	S. Muthaiah, A. Iyer, A. Karnik, and C. Rosenberg, "Design of high throughput scheduled wireless mesh networks: Smart antennas," in Proc. IEEE Globecom, 2007.