Continuous polling models and application to ferry assisted WLAN

In this paper we focus on a class of polling systems encountered while modeling the ferry based wireless local area network (FWLAN). A moving ferry, while walking in a predetermined cyclic path, communicates with the static nodes (or users) of the network via a wireless link. The ferry is assumed to stop and communicate with a node that has a packet to send or to receive, when it is closest to that node. The location distribution of the node to which or from which a packet arrives is assumed to have a support of positive Lebesgue measure. These features imply that polling models with finite number of queues cannot be used to model the system. We study in this paper the continuous polling systems with service disciplines that model the use of the FWLAN (and that are more complex than the classical exhaustive or gated services). Our approach is based on discretization of the continuous polling model. We propose a special way of discretizing the continuous system such that: (1) the known Pseudo conservation laws can be applied to obtain the stationary expected workload of the discrete systems; (2) the limit, of these ‘discretized' expected workloads, equals the stationary expected workload of the continuous system. Our results rely heavily on fixed point analysis of infinite dimensional operators.

[1]  Zhu Han,et al.  A selfish approach to coalition formation among unmanned air vehicles in wireless networks , 2009, 2009 International Conference on Game Theory for Networks.

[2]  Hideaki Takagi,et al.  Analysis of polling systems , 1986 .

[3]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[4]  Robert D. van der Mei,et al.  Applications of polling systems , 2011, ArXiv.

[5]  Lasse Leskelä,et al.  Stability of a spatial polling system with greedy myopic service , 2009, Ann. Oper. Res..

[6]  Eitan Altman,et al.  Queuing in space: Design of message ferry routes in static ad hoc networks , 2009, 2009 21st International Teletraffic Congress.

[7]  Onno Boxma,et al.  Pseudo-conservation laws in cyclic-service systems , 1986 .

[8]  Volker Schmidt,et al.  Single-server queues with spatially distributed arrivals , 1994, Queueing Syst. Theory Appl..

[9]  Dirk P. Kroese,et al.  A continuous polling system with general service times , 1991 .

[10]  Eitan Altman,et al.  Polling systems with synchronization constraints , 1992, Ann. Oper. Res..

[11]  Wojciech Szpankowski,et al.  Stability of token passing rings , 1992, Queueing Syst. Theory Appl..

[12]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[13]  Onno Boxma,et al.  Waiting times in polling systems with various service disciplines , 2008 .

[14]  Esther M. Arkin,et al.  The snowblower problem , 2011, Comput. Geom..

[15]  Moshe Sidi,et al.  A queueing network with a single cyclically roving server , 1992, Queueing Syst. Theory Appl..

[16]  Sergey Foss,et al.  Stability and performance of greedy server systems , 2011, Queueing Syst. Theory Appl..

[17]  Eitan Altman,et al.  Analysis and design of message ferry routes in sensor networks using polling models , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[18]  S. Yousefi,et al.  Connectivity in vehicular ad hoc networks in presence wireless mobile base-stations , 2007, 2007 7th International Conference on ITS Telecommunications.

[19]  Hanoch Levy,et al.  Cyclic reservation schemes for efficient operation of multiple-queue single-server systems , 1992, Ann. Oper. Res..

[20]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

[21]  Edward G. Coffman,et al.  Polling and greedy servers on a line , 1987, Queueing Syst. Theory Appl..

[22]  Eitan Altman,et al.  Queueing in space , 1994, Advances in Applied Probability.

[23]  Eitan Altman,et al.  On Elevator polling with globally gated regime , 1992, Queueing Syst. Theory Appl..

[24]  Onno J. Boxma,et al.  Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

[25]  Edward G. Coffman,et al.  A continuous polling system with constant service times , 1986, IEEE Trans. Inf. Theory.

[26]  Veeraruna Kavitha Continuous polling with rerouting and applications to ferry assisted wireless LANs , 2011, VALUETOOLS.

[27]  R. B. Cooper,et al.  Application of decomposition principle in M/G/1 vacation model to two continuum cyclic queueing models — Especially token-ring LANs , 1985, AT&T Technical Journal.

[28]  Serguei Foss,et al.  Comparison Theorems and Ergodic Properties of Polling Systems , 1996 .

[29]  Ward Whitt,et al.  A review ofL=λW and extensions , 1991, Queueing Syst. Theory Appl..

[30]  Yiwei Thomas Hou,et al.  Theoretical Results on Base Station Movement Problem for Sensor Network , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[31]  Eitan Altman,et al.  Queueing in Space : design of Message Ferry Routes in static adhoc networks , 2009 .

[32]  Zhen Liu,et al.  Stability, monotonicity and invariant quantities in general polling systems , 1992, Queueing Syst. Theory Appl..

[33]  Volker Schmidt,et al.  Light-Traffic Analysis for Queues with Spatially Distributed Arrivals , 1996, Math. Oper. Res..

[34]  Iddo Eliazar From Polling to Snowplowing , 2005, Queueing Syst. Theory Appl..

[35]  Philippe Robert,et al.  The evolution of a spatial stochastic network , 2009, 0908.3256.

[36]  Yee Fatt. Lim Connectivity in vehicular ad-hoc networks. , 2009 .

[37]  Eitan Altman,et al.  Opportunistic scheduling of a message ferry in sensor networks , 2010, MobiOpp '10.

[38]  Volker Schmidt,et al.  Queueing systems on a circle , 1993, ZOR Methods Model. Oper. Res..