1,980 research outputs found
Adaptive Duty Cycling MAC Protocols Using Closed-Loop Control for Wireless Sensor Networks
The fundamental design goal of wireless sensor MAC protocols is to minimize unnecessary power consumption of the sensor nodes, because of its stringent resource constraints and ultra-power limitation. In existing MAC protocols in wireless sensor networks (WSNs), duty cycling, in which each node periodically cycles between the active and sleep states, has been introduced to reduce unnecessary energy consumption. Existing MAC schemes, however, use a fixed duty cycling regardless of multi-hop communication and traffic fluctuations. On the other hand, there is a tradeoff between energy efficiency and delay caused by duty cycling mechanism in multi-hop communication and existing MAC approaches only tend to improve energy efficiency with sacrificing data delivery delay. In this paper, we propose two different MAC schemes (ADS-MAC and ELA-MAC) using closed-loop control in order to achieve both energy savings and minimal delay in wireless sensor networks. The two proposed MAC schemes, which are synchronous and asynchronous approaches, respectively, utilize an adaptive timer and a successive preload frame with closed-loop control for adaptive duty cycling. As a result, the analysis and the simulation results show that our schemes outperform existing schemes in terms of energy efficiency and delivery delay
A Coverage Monitoring algorithm based on Learning Automata for Wireless Sensor Networks
To cover a set of targets with known locations within an area with limited or
prohibited ground access using a wireless sensor network, one approach is to
deploy the sensors remotely, from an aircraft. In this approach, the lack of
precise sensor placement is compensated by redundant de-ployment of sensor
nodes. This redundancy can also be used for extending the lifetime of the
network, if a proper scheduling mechanism is available for scheduling the
active and sleep times of sensor nodes in such a way that each node is in
active mode only if it is required to. In this pa-per, we propose an efficient
scheduling method based on learning automata and we called it LAML, in which
each node is equipped with a learning automaton, which helps the node to select
its proper state (active or sleep), at any given time. To study the performance
of the proposed method, computer simulations are conducted. Results of these
simulations show that the pro-posed scheduling method can better prolong the
lifetime of the network in comparison to similar existing method
A Resource Intensive Traffic-Aware Scheme for Cluster-based Energy Conservation in Wireless Devices
Wireless traffic that is destined for a certain device in a network, can be
exploited in order to minimize the availability and delay trade-offs, and
mitigate the Energy consumption. The Energy Conservation (EC) mechanism can be
node-centric by considering the traversed nodal traffic in order to prolong the
network lifetime. This work describes a quantitative traffic-based approach
where a clustered Sleep-Proxy mechanism takes place in order to enable each
node to sleep according to the time duration of the active traffic that each
node expects and experiences. Sleep-proxies within the clusters are created
according to pairwise active-time comparison, where each node expects during
the active periods, a requested traffic. For resource availability and recovery
purposes, the caching mechanism takes place in case where the node for which
the traffic is destined is not available. The proposed scheme uses Role-based
nodes which are assigned to manipulate the traffic in a cluster, through the
time-oriented backward difference traffic evaluation scheme. Simulation study
is carried out for the proposed backward estimation scheme and the
effectiveness of the end-to-end EC mechanism taking into account a number of
metrics and measures for the effects while incrementing the sleep time duration
under the proposed framework. Comparative simulation results show that the
proposed scheme could be applied to infrastructure-less systems, providing
energy-efficient resource exchange with significant minimization in the power
consumption of each device.Comment: 6 pages, 8 figures, To appear in the proceedings of IEEE 14th
International Conference on High Performance Computing and Communications
(HPCC-2012) of the Third International Workshop on Wireless Networks and
Multimedia (WNM-2012), 25-27 June 2012, Liverpool, U
Adaptive Energy Efficient Scheduling (AEES) for Fault Tolerant Coverage in Sensor Networks
For many sensor network applications it is necessary to provide full sensing coverage to a security-sensitive area. To actively monitor the set of target the subset of sensors are redundantly deployed. One of the major challenges in devising such network lies in the constrained energy and to tolerate unexpected failure to prolong the life span of the network. In this we rapidly restore the field monitoring, by periodically refreshing and switching the cover to tackle unanticipated failure in an energy efficient manner, because energy is the most critical resource considering the irreplaceable of batteries of the sensor nodes. In the same time it should amenably support more than one sensor at a time with different degree in distributed approach that periodically selects the covers and switch between them to extend coverage time and tolerate unexpected failures at runtime. In this scheme the sensor is an autonomous system that has the authority to decide how to cover its sensing range. It also incorporates a novel technique for offline cover update (OCU) to facilitate asynchronous transition between covers. This approach is robust to failure pattern is no uniform.
DOI: 10.17762/ijritcc2321-8169.15013
- …