Linear programming: methods and applications (5th ed.)
Linear programming: methods and applications (5th ed.)
A strongly polynomial minimum cost circulation algorithm
Combinatorica
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
Theory of linear and integer programming
Theory of linear and integer programming
A faster strongly polynomial minimum cost flow algorithm
Operations Research
Combinatorial optimization
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint
IEEE Transactions on Mobile Computing
Relay node placement in large scale wireless sensor networks
Computer Communications
IEEE Communications Magazine
Journal of Network and Computer Applications
Hi-index | 0.00 |
In this paper we present and discuss several models for wireless sensor networks (\wsn s) where the focus is on selecting paths to relay data from sensors to the base station. We are concerned with high level protocols that assume complete knowledge of the local network topology at any node and rely on basic routines to address and forward packets from node to node. More precisely, for every sensor node that needs to send data to the base station, we want to select one or more routes involving perhaps several intermediate nodes along which data are sent. The route(s) are chosen to satisfy quality of service (QoS) requirements expressed by the maximum delay incurred by data from the moment they are captured by sensors to the moment they reach the base station.