Two Ranked Aware Phase Surveillance in Wireless Sensor Networks.
ABSTRACT Event detection and environment surveillance are the important issues in wireless sensor networks. However,using the non-renewable power source leads to the short lifetime of the networks. For this reason the scheduling process is to determine the time sensor node wakes up and goes sleeping to conserve energy, so the delay time and the working interval would become trade-off. In this article, we introduce the two ranked aware phase surveillance to lower the delay time, and we use the sensed data to make the scheduling policy.We consider the event happening in two phase, so we propose two surveillance models to cope with these two phases,although this model is simple to create it can achieve the goal of reducing the delay time of detection and delivery. Finally, we show our performance in the simulation section and then describe the improvement of our approach in the future work section.
SourceAvailable from: hindawi.com[Show abstract] [Hide abstract]
ABSTRACT: Energy management is an interesting research area for wireless sensor networks. Relevant dutycycling (or sleep scheduling) algorithm has been actively studied at MAC, routing, and application levels. Low power listening (LPL) MAC is one of effective dutycycling techniques. This paper proposes a novel approach called dual wake-up LPL (DW-LPL). Existing LPL scheme uses a preamble detection method for both broadcast and unicast, thus suffers from severe overhearing problem at unicast transmission. DW-LPL uses a different wake-up method for unicast while using LPL-like method for broadcast; DW-LPL introduces a receiver-initiated method in which a sender waits a signal from receiver to start unicast transmission, which incurs some signaling overhead but supports flexible adaptive listening as well as overhearing removal effect. Through analysis and Mote (Telosb) experiment, we show that DW-LPL provides more energy saving than LPL and our adaptive listening scheme is effective for energy conservation in practical network topologies and traffic patterns.EURASIP Journal on Wireless Communications and Networking 01/2008; DOI:10.1155/2008/738292 · 0.81 Impact Factor
[Show abstract] [Hide abstract]
ABSTRACT: In this paper, we investigate the theoretical aspects of the nonuniform node distribution strategy used to mitigate the energy hole problem in wireless sensor networks (WSNs). We conclude that in a circular multihop sensor network (modeled as concentric coronas) with nonuniform node distribution and constant data reporting, the unbalanced energy depletion among all the nodes in the network is unavoidable. Even if the nodes in the inner coronas of the network have used up their energy simultaneously, the ones in the outermost corona may still have unused energy. This is due to the intrinsic many-to-one traffic pattern of WSNs. Nevertheless, nearly balanced energy depletion in the network is possible if the number of nodes increases in geometric progression from the outer coronas to the inner ones except the outermost one. Based on the analysis, we propose a novel nonuniform node distribution strategy to achieve nearly balanced energy depletion in the network. We regulate the number of nodes in each corona and derive the ratio between the node densities in the adjacent (i + 1)th and ith coronas by the strategy. Finally, we propose (q-switch routing, a distributed shortest path routing algorithm tailored for the proposed nonuniform node distribution strategy. Extensive simulations have been performed to validate the analysis.IEEE Transactions on Parallel and Distributed Systems 06/2008; DOI:10.1109/TPDS.2007.70770 · 2.17 Impact Factor
[Show abstract] [Hide abstract]
ABSTRACT: Lifetime maximization is one key element in the design of sensor-network-based surveillance applications. We propose a protocol for node sleep scheduling that guarantees a bounded-delay sensing coverage while maximizing network lifetime. Our sleep scheduling ensures that coverage rotates such that each point in the environment is sensed within some finite interval of time, called the detection delay. The framework is optimized for rare event detection and allows favorable compromises to be achieved between event detection delay and lifetime without sacrificing (eventual) coverage for each point. We compare different sleep scheduling policies in terms of average detection delay, and show that ours is closest to the detection delay lower bound for stationary event surveillance. We also explain the inherent relationship between detection delay, which applies to persistent events, and detection probability, which applies to temporary events. Finally, a connectivity maintenance protocol is proposed to minimize the delay of multi-hop delivery to a base-station. The resulting sleep schedule achieves the lowest overall target surveillance delay given constraints on energy consumption.Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, IPSN 2005, April 25-27, 2005, UCLA, Los Angeles, California, USA; 01/2005