On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Wireless integrated network sensors
Communications of the ACM
Approximating the Domatic Number
SIAM Journal on Computing
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Chain-Based Protocols for Data Broadcasting and Gathering in Sensor Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Power-efficient data dissemination in wireless sensor networks
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Energy-aware data-centric routing in microsensor networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
A study of energy consumption and reliability in a multi-hop sensor network
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
Proceedings of the 3rd international symposium on Information processing in sensor networks
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Minimum power configuration in wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
IEEE Transactions on Computers
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
International Journal of Sensor Networks
Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Review: A survey on cross-layer solutions for wireless sensor networks
Journal of Network and Computer Applications
Hi-index | 0.25 |
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost over a wide area. There has been a general consensus within the research community that it is of critical importance to jointly optimize protocol sublayers in order to devise energy-efficient, cost-effective, and reliable communication strategies for WSNs. This paper proposes a cross-layer organizational approach based on sleep scheduling, called Sense-Sleep Trees (SS-Trees), that aims to harmonize the various engineering issues and provides a method to increase the monitoring coverage and the operational lifetime of mesh-based WSNs engaged in wide-area surveillance applications. An integer linear programming (ILP) formulation based on network flow model is provided to determine the optimal SS-Tree structures for achieving such design goals.