Application of Computational Intelligence Techniques in Wireless Sensor Networks the State of the Art

2020 ◽  
pp. 1580-1600
Author(s):  
Subhendu Kumar Pani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Computational Intelligence ◽  
State Of The Art ◽  
Area Coverage ◽  
Wireless Sensor ◽  
Coverage Problem ◽  
Sensor Devices ◽  
Huge Variety

A wireless sensor network may contain hundreds or even tens of thousands of inexpensive sensor devices that can communicate with their neighbors within a limited radio range. By relaying information on each other, they transmit signals to a command post anywhere within the network. Worldwide market for wireless sensor networks is rapidly growing due to a huge variety of applications it offers. In this chapter, we discuss application of computational intelligence techniques in wireless sensor networks on the coverage problem in general and area coverage in particular. After providing different types of coverage encountered in WSN, we present a possible classification of coverage algorithms. Then we dwell on area coverage which is widely studied due to its importance. We provide a survey of literature on area coverage and give an account of its state-of-the art and research directions.

Application of Computational Intelligence Techniques in Wireless Sensor Networks the State of the Art

2016 ◽  
pp. 441-461
Author(s):  
Subhendu Kumar Pani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Computational Intelligence ◽  
State Of The Art ◽  
Area Coverage ◽  
Wireless Sensor ◽  
Coverage Problem ◽  
Sensor Devices ◽  
Huge Variety

A wireless sensor network may contain hundreds or even tens of thousands of inexpensive sensor devices that can communicate with their neighbors within a limited radio range. By relaying information on each other, they transmit signals to a command post anywhere within the network. Worldwide market for wireless sensor networks is rapidly growing due to a huge variety of applications it offers. In this chapter, we discuss application of computational intelligence techniques in wireless sensor networks on the coverage problem in general and area coverage in particular. After providing different types of coverage encountered in WSN, we present a possible classification of coverage algorithms. Then we dwell on area coverage which is widely studied due to its importance. We provide a survey of literature on area coverage and give an account of its state-of-the art and research directions.

Exploring Coverage within Wireless Sensor Networks through Evolutionary Computations

2010 ◽  
pp. 191-200
Author(s):  
Sami Habib
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Search Space ◽  
Service Area ◽  
Wireless Sensor ◽  
Coverage Problem ◽  
Evolutionary Computations ◽  
Placement Problem ◽  
Sensor Devices ◽  
Computationally Intensive

The evolutionary search approach has demonstrated its effectiveness in many real world applications, such as the coverage problem in wireless sensor networks. It is to place sensor devices in a service area so that the entire service area is covered. We have modeled the coverage problem as two sub-problems: floorplan and placement. The floorplan problem is to partition the service area into well-defined geometric cells, where the placement problem is to assign the sensor devices into a set of cells. Even though the search space has been transformed from continuous into discrete, the complexity of the coverage problem is computationally intensive. The objective function is to maximize the coverage of the service area while not exceeding a given budget. The merged optimization problem has been coded into the genetic algorithm (GA) and the experimental results reveal the versatility of GA to adapt and find a good solution in a short time.

scholarly journals Coverage and k-Coverage Optimization in Wireless Sensor Networks Using Computational Intelligence Methods: A Comparative Study

Electronics ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 675
Author(s):  
Konstantinos Tarnaris ◽  
Ioanna Preka ◽  
Dionisis Kandris ◽  
Alex Alexandridis
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Computational Intelligence ◽  
Critical Issue ◽  
Area Coverage ◽  
Statistical Testing ◽  
Wireless Sensor ◽  
Test Results ◽  
Successful Operation ◽  
Computational Intelligence Methods

The domain of wireless sensor networks is considered to be among the most significant scientific regions thanks to the numerous benefits that their usage provides. The optimization of the performance of wireless sensor networks in terms of area coverage is a critical issue for the successful operation of every wireless sensor network. This article pursues the maximization of area coverage and area k-coverage by using computational intelligence algorithms, i.e., a genetic algorithm and a particle swarm optimization algorithm. Their performance was evaluated via comparative simulation tests, made not only against each other but also against two other well-known algorithms. This appraisal was made using statistical testing. The test results, that proved the efficacy of the algorithms proposed, were analyzed and concluding remarks were drawn.

scholarly journals Transforming Area Coverage to Target Coverage to Maintain Coverage and Connectivity for Wireless Sensor Networks

2012 ◽  
Vol 8 (10) ◽  
pp. 254318 ◽  
Author(s):  
Xiu Deng ◽  
Jiguo Yu ◽  
Dongxiao Yu ◽  
Congcong Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Area Coverage ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Target Coverage ◽  
Coverage Problem ◽  
Minimum Number ◽  
New Perspective ◽  
Target Coverage Problem

Area coverage is one of the key issues for wireless sensor networks. It aims at selecting a minimum number of sensor nodes to cover the whole sensing region and maximizing the lifetime of the network. In this paper, we discuss the energy-efficient area coverage problem considering boundary effects in a new perspective, that is, transforming the area coverage problem to the target coverage problem and then achieving full area coverage by covering all the targets in the converted target coverage problem. Thus, the coverage of every point in the sensing region is transformed to the coverage of a fraction of targets. Two schemes for the converted target coverage are proposed, which can generate cover sets covering all the targets. The network constructed by sensor nodes in the cover set is proved to be connected. Compared with the previous algorithms, simulation results show that the proposed algorithm can prolong the lifetime of the network.

scholarly journals Sensor Networks Attacks Classifications and Mitigation

2018 ◽  
Vol 2 (4) ◽  
pp. 28-43 ◽  
Author(s):  
Ahmed S. Abu Daia ◽  
Rabie A. Ramadan ◽  
Magda B. Fayek
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
State Of The Art ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Communication ◽  
Security Attacks ◽  
New Classification ◽  
Security Services

Wireless Sensor Networks (WSNs) are exposed to many security attacks, and it can be easily compromised. One of the main reasons for these vulnerabilities is the deployment nature, where sensor nodes are deployed without physical guarding duty. That makes the network susceptible to physical attacks. The communication nature between sensor nodes is another reason, where intruders can easily send/receive information if they are located in the network communication range. In this paper, most of the possible WSN attacks are discussed, different security services expected in WSN are explained, and trust-based solutions proposed in the literature are listed. Moreover, the state-of-the-art of the attacks’ mitigation and avoidance techniques are presented. Besides, this paper is enriched with a new classification of the WSNs attacks regarding attacks’ characteristics. It will be beneficial to researchers in the field of WSNs security if they can distinguish between different attacks that have common characteristics.

scholarly journals Proficient QoS-Based Target Coverage Problem in Wireless Sensor Networks

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 74315-74325 ◽  
Author(s):  
Manju ◽  
Samayveer Singh ◽  
Sandeep Kumar ◽  
Anand Nayyar ◽  
Fadi Al-Turjman ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Target Coverage ◽  
Coverage Problem ◽  
Target Coverage Problem

Adaptive Monitor Placement for Near Real-time Node Failure Localisation in Wireless Sensor Networks

2022 ◽  
Vol 18 (1) ◽  
pp. 1-41
Author(s):  
Pamela Bezerra ◽  
Po-Yu Chen ◽  
Julie A. McCann ◽  
Weiren Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
State Of The Art ◽  
Global Analysis ◽  
Wireless Sensor ◽  
Greedy Heuristics ◽  
Network Tomography ◽  
Topology Changes ◽  
End To End

As sensor-based networks become more prevalent, scaling to unmanageable numbers or deployed in difficult to reach areas, real-time failure localisation is becoming essential for continued operation. Network tomography, a system and application-independent approach, has been successful in localising complex failures (i.e., observable by end-to-end global analysis) in traditional networks. Applying network tomography to wireless sensor networks (WSNs), however, is challenging. First, WSN topology changes due to environmental interactions (e.g., interference). Additionally, the selection of devices for running network monitoring processes (monitors) is an NP-hard problem. Monitors observe end-to-end in-network properties to identify failures, with their placement impacting the number of identifiable failures. Since monitoring consumes more in-node resources, it is essential to minimise their number while maintaining network tomography’s effectiveness. Unfortunately, state-of-the-art solutions solve this optimisation problem using time-consuming greedy heuristics. In this article, we propose two solutions for efficiently applying Network Tomography in WSNs: a graph compression scheme, enabling faster monitor placement by reducing the number of edges in the network, and an adaptive monitor placement algorithm for recovering the monitor placement given topology changes. The experiments show that our solution is at least 1,000× faster than the state-of-the-art approaches and efficiently copes with topology variations in large-scale WSNs.

Sign in / Sign up

Export Citation Format

Share Document