690 research outputs found

    Autonomic Role and Mission Allocation Framework for Wireless Sensor Networks.

    No full text
    Pervasive applications incorporate physical components that are exposed to everyday use and a large number of conditions and external factors that can lead to faults and failures. It is also possible that application requirements change during deployment and the network needs to adapt to a new context. Consequently, pervasive systems must be capable to autonomically adapt to changing conditions without involving users becoming a transparent asset in the environment. In this paper, we present an autonomic mechanism for initial task assignment in sensor networks, an NP-hard problem. We also study on-line adaptation of the original deployment which considers real-time metrics for maximising utility and lifetime of applications and smooth service degradation in the face of component failures. © 2011 IEEE

    Greedy Algorithms for Target Coverage Problem in Wireless Sensor Networks

    Get PDF
    Wireless Sensor Networks have seen tremendous advancement in design and applications in the recent years.Wireless Sensor Networks (WSNs) involve deployment of huge number of wireless sensor nodes essentially for monitoring a certain area and collecting data. These collected data are then sent to the base station which acts like a control room and there further processing is done as per requirements.The rapid advancement of digital electronics and wireless communications has resulted in more rapid development of WSN technology. This rapid growth has resulted in focus being given into solving the challenges that this field has to face. One such challenge is to maximise the network lifetime of the network while the target nodes remain monitored constantly. This problem of maximizing the network lifetime while satisfying the coverage and also energy constraints(sensors are equipped with battery as the only power source and hence the energy constraint) is known as the Target Coverage Problem in Wireless Sensor Networks. In this paper a simulation of an existing technique is simulated.Then a modified version of the algorithm is simulated which is found to give better performance over the existing one

    Coverage and Energy Analysis of Mobile Sensor Nodes in Obstructed Noisy Indoor Environment: A Voronoi Approach

    Full text link
    The rapid deployment of wireless sensor network (WSN) poses the challenge of finding optimal locations for the network nodes, especially so in (i) unknown and (ii) obstacle-rich environments. This paper addresses this challenge with BISON (Bio-Inspired Self-Organizing Network), a variant of the Voronoi algorithm. In line with the scenario challenges, BISON nodes are restricted to (i) locally sensed as well as (ii) noisy information on the basis of which they move, avoid obstacles and connect with neighboring nodes. Performance is measured as (i) the percentage of area covered, (ii) the total distance traveled by the nodes, (iii) the cumulative energy consumption and (iv) the uniformity of nodes distribution. Obstacle constellations and noise levels are studied systematically and a collision-free recovery strategy for failing nodes is proposed. Results obtained from extensive simulations show the algorithm outperforming previously reported approaches in both, convergence speed, as well as deployment cost.Comment: 17 pages, 24 figures, 1 tabl
    corecore