scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Fault Tolerant Mobile Sensor Node Traversal Schemes Based on Hexagonal Coverage

06 Feb 2014-The Scientific World Journal (Hindawi Publishing Corporation)-Vol. 2014, pp 130793-130793
TL;DR: This work shows that, ROI partition plays great role in hole free coverage and makes the MSNs have optimized movement cost with fault tolerant support.
Abstract: Mobile sensor nodes (MSNs) are equipped with locomotive can move around after having been deployed. They are equipped with limited energy. A large portion of energy is drained during the traversal. In order to extend the life time of a MSN, the traveling distance must be minimized. Region of interest (ROI) is covered with multiple MSNs using coverage based pattern movement. When a group of MSNs are deployed to cover a given ROI, all the deployed MSNs should travel an approximately equal distance. Otherwise, the MSN which travels longer distance depletes more energy compared to the MSN which travels a shorter distance. In this work we show that, ROI partition plays great role in hole free coverage and makes the MSNs have optimized movement cost with fault tolerant support.

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI
TL;DR: This work formulates the problem of scheduling the MSNs in distributed manner so that the entire region is covered without coverage holes with minimum energy depletion and some computationally practical algorithms for multiple MSNs with fault and non-fault tolerant support are presented and their performances compared.
Abstract: Mobile elements have shown the advantages in wireless sensor networks not only in data collection and transmission but also in the field of region coverage. The mobile sensor nodes (MSNs) whose mobility is controlled, visits the predetermined locations and collects the environmental information as per the procedure called MSNs traversal algorithms. The major performance bottleneck in MSNs is the energy source which is impractical to replace after the deployment. In random deployment, single or a group of MSNs may fall at the same location or at different locations, whose starting positions of traversal and traversal paths may differ from the preplanned. This work formulates the problem of scheduling the MSNs in distributed manner so that the entire region is covered without coverage holes with minimum energy depletion. Finally, some computationally practical algorithms for multiple MSNs with fault and non-fault tolerant support are presented and their performances compared.

6 citations

References
More filters
Journal ArticleDOI
TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.

17,936 citations


"Fault Tolerant Mobile Sensor Node T..." refers background in this paper

  • ...Like static wireless sensor nodes MSNs are also encapsulated with sensor unit, power supply unit, data processing unit, data storage, and data transmission units [1, 2]....

    [...]

Journal ArticleDOI
TL;DR: This survey presents a comprehensive review of the recent literature since the publication of a survey on sensor networks, and gives an overview of several new applications and then reviews the literature on various aspects of WSNs.

5,626 citations

01 Jan 2013
TL;DR: In this paper, various issues are discussed that actually put the limitations in the well working and the life time of the network.
Abstract: Wireless sensor networks are the networks consisting of large number of small and tiny sensor nodes. The nodes are supplied with limited power, memory and other resources and perform in-network processing. In this paper, various issues are discussed that actually put the limitations in the well working and the life time of the network. In Wireless sensor network, nodes should consume less power, memory and so data aggregation should be performed. Security is another aspect which should be present in the network. Quality of service, routing, medium access schemes all are considered in designing the protocols.

1,985 citations

Book
16 Apr 2010
TL;DR: This easy-to-read text focuses on challenges in coverage control in sensor networks, examines fundamental coverage problems, and presents the most recent advances and techniques in the field.
Abstract: This easy-to-read text focuses on challenges in coverage control in sensor networks, examines fundamental coverage problems, and presents the most recent advances and techniques in the field. Features: provides an introduction to sensors, sensor nodes, sensor networks, and sensor coverage models; supplies an informal definition and taxonomy for network-wide coverage control; explores the node placement optimization problem for coverage configuration before network deployment; investigates the coverage lifetime maximization problem by controlling coverage characteristics in a randomly deployed network; discusses the critical sensor-density problem for coverage configuration before network deployment; examines the sensor-activity scheduling problem of controlling network coverage characteristics in a randomly deployed network; introduces the node movement strategy problem for sensor networks containing mobile nodes; presents the challenges of building intrusion barriers and finding penetration paths.

122 citations

Journal ArticleDOI
TL;DR: This paper presents several mobile traversal algorithms (MTA) based on triangulation coverage that employs N ≥ 3 MSNs such that, up to N‬−‬3 node failures can be tolerated and the bounds on the total traveling distance and time are derived and the tightness of the bounds are proven through simulations.
Abstract: In harsh outdoor terrains like disaster areas and urban toxic regions, optimal placements of static sensor nodes might not be possible, leading to possible incomplete coverage of the region. In such situations, mobile sensor nodes (MSNs) might be a better option and a significantly fewer number of nodes are required than their static counterparts. A triangulation-based coverage where, groups of three MSNs position themselves to form equilateral triangles, has several applications in localization, 3D imaging and coordinated search operation. In this paper, we present several mobile traversal algorithms (MTA) based on triangulation coverage that employs N ≥ 3 MSNs such that, up to N - 3 node failures can be tolerated. MTA achieves three objectives: (a) as N increases, the total time to cover the field decreases in the absence of a failure; (b) each MSN travels a minimum distance; (c) upon a failure, the remaining MSNs efficiently complete the coverage of the field. The bounds on the total traveling distance and time are derived and the tightness of the bounds are proven through simulations. Furthermore, we also derive the bounds on the distance traveled by an MSN to complete the coverage process. The bounds on the individual traveling distances are useful in minimizing and bounding the energy consumption of the MSNs.

9 citations