Scheduling transmissions in wireless ad-hoc networks with time-varying topologies

Title of Thesis: Scheduling transmissions in wireless ad-h oc networks with time-varying topologies Anna Pantelidou, Master of Science, 2004 Thesis directed by: Professor Anthony Ephremides Department of Electrical and Computer Engineering In wireless ad-hoc networks, signal interference and colli si ns from simultaneous transmissions of neighboring nodes significantly degrade throughput. Hen ce, it is necessary to devise scheduling policies for coordinating wireless transmissions. In this thesis, we focus on maximum stable throughput schedu ling in mobile, finite node, wireless ad-hoc networks, whose topology changes according to a stationary and ergodic process. In particular, we study the i.i.d topology case, and we extend o ur results to the more general case of Markov and Hidden Markov topology processes. Initially, we introduce a centralized stationary scheduling rule and then prove that it maximizes the stable t hroughput the network can sustain. Finally, we show through simulations that mobility of the no des may considerably improve the network throughput and plot the corresponding results thro ugh a Monte Carlo method. Scheduling transmissions in wireless ad-hoc networks with time-varying topologies by Anna Pantelidou Thesis submitted to the Faculty of the Graduate School of the University of Maryland, College Park in partial fulfillment of the requirements for the degree of Master of Science 2004 Advisory Committee: Professor Anthony Ephremides, Chairman/Advisor Professor André Tits, Professor Şennur Ulukuş c © Copyright by Anna Pantelidou 2004

[1]  Leandros Tassiulas.  Dynamic link activation scheduling in multihop radio networks with fixed or changing connectivity , 1992 .

[2]  Leandros Tassiulas.  Scheduling and performance limits of networks with constantly changing topology , 1997 .

[3]  Sami Tabbane.  Handbook Of Mobile Radio Networks , 2000 .

[4]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[5]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[6]  Andrea J. Goldsmith,et al.  Performance, optimization, and cross-layer design of media access protocols for wireless ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  J. D. Krauss.  Antennas For All Applications , 1950 .

[9]  Chien-Chung Shen,et al.  Topology control for ad hoc networks with directional antennas , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[10]  Imrich Chlamtac,et al.  Fair Algorithms for Maximal Link Activation in Multihop Radio Networks , 1987, IEEE Trans. Commun..

[11]  Pravin Varaiya,et al.  Routing and scheduling in multi-hop wireless networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[12]  Leandros Tassiulas,et al.  Scheduling and performance limits of networks with constantly changing topology , 1997, IEEE Trans. Inf. Theory.

[13]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[14]  Sheldon M. Ross,et al.  Introduction to Probability Models, Eighth Edition , 1972 .

[15]  Yong Pei,et al.  On the capacity improvement of ad hoc wireless networks using directional antennas , 2003, MobiHoc '03.

[16]  Israel Cidon,et al.  Distributed Assignment Algorithms for Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.