A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Practical Handbook of Spreadsheet Curves and Geometric Constructions
Practical Handbook of Spreadsheet Curves and Geometric Constructions
A coverage-preserving node scheduling scheme for large wireless sensor networks
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
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
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
International Journal of Sensor Networks
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
Mobility-assisted minimum connected cover in a wireless sensor network
Journal of Parallel and Distributed Computing
Minimum connected cover of a query region in heterogeneous wireless sensor networks
Information Sciences: an International Journal
Hi-index | 0.00 |
In this paper, we present a two-tiered scheduling approach for effective energy conservation in wireless sensor networks. The effectiveness of this mechanism relies on dynamically updated two-tiered scheduling architecture. We aim to prolong network lifetime, while preserving the major requirements of wireless sensor networks: coverage and connectivity. In this approach, sensors are periodically scheduled into sleep in two phases using weighted greedy algorithms that can be deployed either centralised or distributed. First, we establish a coverage-tier by selecting a set of sensors that fully covers the sensing field. Thus, sensors that are not selected for the coverage-tier, are put into sleep immediately. However, the coverage-tier sensors do not necessarily stay active all the time when events are not reported. Therefore, a second tier, called connectivity-tier, is formed to deliver data traffic to a sink node. Thus sensors, essential to coverage-tier but not in connectivity-tier may periodically sleep and become active only for sending new sensing measurement and receiving queries from the sink to preserve coverage for energy savings. In addition, periodically rotating the coverage and connectivity tiers is performed in order to maximise network lifetime and achieve fairness of energy consumption. Through extensive simulations in ns2, we demonstrate that the two-tier scheduling can reduce average energy consumption up to 40% while balancing the residual energy of sensors.