Data networks
Stochastic systems: estimation, identification and adaptive control
Stochastic systems: estimation, identification and adaptive control
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
A transmission control scheme for media access in sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Utility-based rate control in the Internet for elastic traffic
IEEE/ACM Transactions on Networking (TON)
A power control MAC protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Transmission scheduling in ad hoc networks with directional antennas
Proceedings of the 8th annual international conference on Mobile computing and networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
CODA: congestion detection and avoidance in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A scalable model for channel access protocols in multihop ad hoc networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Capacity, mutual information, and coding for finite-state Markov channels
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We consider medium access control (MAC) in multihop sensor networks, where only partial information about the shared medium is available to the transmitter. We model our setting as a queuing problem in which the service rate of a queue is a function of a partially observed Markov chain representing the available bandwidth, and in which the arrivals are controlled based on the partial observations so as to keep the system in a desirable mildly unstable regime. The optimal controller for this problem satisfies a separation property: we first compute a probability measure on the state space of the chain, namely the information state, then use this measure as the new state on which the control decisions are based. We give a formal description of the system considered and of its dynamics, we formalize and solve an optimal control problem, and we show numerical simulations to illustrate with concrete examples properties of the optimal control law. We show how the ergodic behavior of our queuing model is characterized by an invariant measure over all possible information states, and we construct that measure. Our results can be specifically applied for designing efficient and stable algorithms for medium access control in multiple-accessed systems, in particular for sensor networks.