Analysis of polling systems
Data networks
Polling and greedy servers on a line
Queueing Systems: Theory and Applications
Extremum properties of hexagonal partitioning and the uniform distribution in Euclidean location
SIAM Journal on Discrete Mathematics
Dominance relations in polling systems
Queueing Systems: Theory and Applications
Workloads and waiting times in single-server systems with multiple customer classes
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
A review of L=&lgr;W and extensions
Queueing Systems: Theory and Applications
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Polling systems with synchronization constraints
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Stability of token passing rings
Queueing Systems: Theory and Applications - Polling models
Stability, monotonicity and invariant quantities in general polling systems
Queueing Systems: Theory and Applications - Polling models
Queueing Systems: Theory and Applications - Polling models
A review of regenerative processes
SIAM Review
Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Analysis and Control of Poling Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
A PTAS for TSP with neighborhoods among fat regions in the plane
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling algorithms for throughput maximization in data networks
Scheduling algorithms for throughput maximization in data networks
MAC for Networks with Multipacket Reception Capability and Spatially Distributed Nodes
IEEE Transactions on Mobile Computing
A selfish approach to coalition formation among unmanned air vehicles in wireless networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Stability and performance of greedy server systems
Queueing Systems: Theory and Applications
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
The capacity of wireless networks
IEEE Transactions on Information Theory
Polling on a space with general arrival and service time distribution
Operations Research Letters
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We consider the use of controlled mobility in wireless networks where messages arriving randomly in time and space are collected by mobile receivers (collectors). The collectors are responsible for receiving these messages via wireless transmission by dynamically adjusting their position in the network. Our goal is to utilize a combination of wireless transmission and controlled mobility to improve the throughput and delay performance in such networks. First, we consider a system with a single collector. We show that the necessary and sufficient stability condition for such a system is given by 驴驴 is the expected system load. We derive lower bounds for the expected message waiting time in the system and develop policies that are stable for all loads 驴 $\varTheta(\frac{1}{1-\rho})$ with the system load 驴, in contrast to the $\varTheta(\frac{1}{(1-\rho)^{2}})$ delay scaling in the corresponding system without wireless transmission, where the collector visits each message location. Next, we consider the system with multiple collectors. In the case where simultaneous transmissions to different collectors do not interfere with each other, we show that both the stability condition and the delay scaling extend from the single collector case. In the case where simultaneous transmissions to different collectors interfere with each other, we characterize the stability region of the system and show that a frame-based version of the well-known Max-Weight policy stabilizes the system asymptotically in the frame length.