Simulated annealing & boltzmann Machines: a stochastic approach to combinatorialoptimization & neural computing
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Denial of Service in Sensor Networks
Computer
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Bandwidth-delay constrained path selection under inaccurate state information
IEEE/ACM Transactions on Networking (TON)
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
PEDAMACS: Power Efficient and Delay Aware Medium Access Protocol for Sensor Networks
IEEE Transactions on Mobile Computing
Statistical location detection with sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Limiting end-to-end delays in long-lasting sensor networks
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
| Hi-index | 0.00 |
We consider wireless sensor networks with nodes switching ON (awake) and OFF (sleeping) to preserve energy, and transmitting data over channels with varying quality. The objective is to determine the best path from each node to a single gateway. Performance metrics of interest are: the expected energy consumption and the probability that the latency exceeds a certain threshold. Under Markovian assumptions on the sleeping schedules and the channel conditions, we obtain the expected energy consumption of transmitting a packet on any path to the gateway. We also provide an upper (Chernoff) bound and a tight large deviations asymptotic for the latency probability on each path. To capture the trade-off between energy consumption and latency probability we formulate the problem of choosing a path to minimize a weighted sum of the expected energy consumption and the exponent of the latency probability. We provide two algorithms to solve this problem: a centralized stochastic global optimization algorithm and a distributed algorithm based on simulated annealing. The proposed methodology can also optimize over the fraction of time sensor nodes remain ON (duty cycle).