216,950 research outputs found
Connectivity-guaranteed and obstacle-adaptive deployment schemes for mobile sensor networks
Mobile sensors can relocate and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes largely over-simplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain location information through local communication, or they assume a dense network that remains connected. In addition, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not governed by these assumptions, and thus adapt to a wider range of application scenarios. The schemes are designed to maximize sensing coverage and also guarantee connectivity for a network with arbitrary sensor communication/sensing ranges or node densities, at the cost of a small moving distance. The schemes do not need any knowledge of the field layout, which can be irregular and have obstacles/holes of arbitrary shape. Our first scheme is an enhanced form of the traditional virtual-force-based method, which we term the Connectivity-Preserved Virtual Force (CPVF) scheme. We show that the localized communication, which is the very reason for its simplicity, results in poor coverage in certain cases. We then describe a Floor-based scheme which overcomes the difficulties of CPVF and, as a result, significantly outperforms it and other state-of-the-art approaches. Throughout the paper our conclusions are corroborated by the results from extensive simulations
Recommended from our members
Software integration testing based on communication coverage criteria and partial model generation
This paper considers the problem of integration testing the components of a timed distributed software system. We assume that communication between the components is specified using timed interface automata and use computational tree logic (CTL) to define communication-based coverage criteria that refer to send- and receive-statements and communication paths. The proposed method enables testers to focus during component integration on such parts of the specification, e.g. behaviour specifications or Markovian usage models, that are involved in the communication between components to be integrated. A more specific application area of this approach is the integration of test-models, e.g. a transmission gear can be tested based on separated models for the driver behaviour, the engine condition, and the mechanical and hydraulical transmission states. Given such a state-based specification of a distributed system and a concrete coverage goal, a model checker is used in order to determine the coverage or generate test sequences that achieve the goal. Given the generated test sequences we derive a partial test-model of the components from which the test sequences are derived. The partial model can be used to drive further testing and can also be used as the basis for producing additional partial models in incremental integration testing. While the process of deriving the test sequences could suffer from a combinatorial explosion, the effort required to generate the partial model is polynomial in the number of test sequences and their length. Thus, where it is not feasible to produce test sequences that achieve a given type of coverage it is still possible to produce a partial model on the basis of test sequences generated to achieve some other criterion. As a result, the process of generating a partial model has the potential to scale to large industrial software systems. While a particular model checker, UPPAAL, was used, it should be relatively straightforward to adapt the approach for use with other CTL based model checkers. A potential additional benefit of the approach is that it provides a visual description of the state-based testing of distributed systems, which may be beneficial in other contexts such as education and comprehension
Push & Pull: autonomous deployment of mobile sensors for a complete coverage
Mobile sensor networks are important for several strategic applications
devoted to monitoring critical areas. In such hostile scenarios, sensors cannot
be deployed manually and are either sent from a safe location or dropped from
an aircraft. Mobile devices permit a dynamic deployment reconfiguration that
improves the coverage in terms of completeness and uniformity.
In this paper we propose a distributed algorithm for the autonomous
deployment of mobile sensors called Push&Pull. According to our proposal,
movement decisions are made by each sensor on the basis of locally available
information and do not require any prior knowledge of the operating conditions
or any manual tuning of key parameters.
We formally prove that, when a sufficient number of sensors are available,
our approach guarantees a complete and uniform coverage. Furthermore, we
demonstrate that the algorithm execution always terminates preventing movement
oscillations.
Numerous simulations show that our algorithm reaches a complete coverage
within reasonable time with moderate energy consumption, even when the target
area has irregular shapes. Performance comparisons between Push&Pull and one of
the most acknowledged algorithms show how the former one can efficiently reach
a more uniform and complete coverage under a wide range of working scenarios.Comment: Technical Report. This paper has been published on Wireless Networks,
Springer. Animations and the complete code of the proposed algorithm are
available for download at the address:
http://www.dsi.uniroma1.it/~novella/mobile_sensors
- …