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

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.

Impact of Duty-Cycling

Wireless Sensor Networks (WSNs) became omnipresent in our daily life. As a result, they have emerged as a fruitful research topic, because of their advantages, especially their low cost and easy deployment. However, these attractive merits imply that available resources, especially energy, in each sensor node have to be wisely used through different network dynamics. Beside other techniques, duty-cycling (DC) is the first widely used one to save energy in WSNs. However, due to the continuous changes, mainly in the energy availability, the nodes have to operate in a very low DC which is a required strategy in many applications in order to keep the network operational. This article presents a detailed survey that provides an interesting view of different DC schemes which are proposed to tackle the specific WSN challenges, and it also gives a novel classification of DC schemes that includes the most recent techniques. The last part aims to investigate the impact of the low DC on both the network and the application layer.

E-VEDGE

Hole minimization in wireless sensor networks is a critical issue. In the presence of obstacles, the issue becomes much more challenging. In this article, a hole minimization technique named enhanced VEDGE (E-VEDGE) has been proposed. The scheme uses both the Voronoi polygon and Delaunay triangulation so that it can work efficiently in presence of obstacle. The proposed scheme, along with two other existing schemes namely: VEDGE and the Delaunay Triangulation-Score (DT-Score) has been simulated. Simulation results show that while the proposed E-VEDGE provides a maximum coverage of 95% to 96.8%, VEDGE and DT-Score provide maximum coverage of 89% to 92.5% and 86% to 87%, respectively.

A Comparative Study of Range-Free and Range-Based Localization Protocols for Wireless Sensor Network

Wireless Sensor Network is deployed in many fields including military operations, mechanical applications, human services, smart homes, etc. However, deploying WSN encounters many challenges. One of the challenges is localizing the node position, especially mobile targets in critical situations. In this paper, the authors compare two types from range-free localization algorithms and one type from range-based algorithms, namely: Received Signal Strength (RSS), Centroid, and Distance Vector Hop (DV-Hops) protocols, using Cooja simulator. RSS localization algorithms require determining values of the RSS from the anchor nodes around the mobile node, to calculate the distance between the unknown mobile and the first three anchor nodes in the mobile range. The centroid localization requires only three anchors to compute the location of the mobile sensor without the need for distance measuring. Lastly, the DV-Hop algorithm uses routing tables of each anchor in the network topology to compute the Average Distance of Hops. The results show that rang-based algorithms are more accurate than range-free.

Cost Minimization of Sensor Placement and Routing in Wireless Sensor Networks

Wireless Sensor Nodes (WSNs) are small in size and have limited energy resources. Recent technological advances have facilitated widespread use of wireless sensor networks in many real world applications. In real life situations WSN has to cover an area or monitor a number of nodes on a plane. Sensor node's coverage range is proportional to their cost, as high cost sensor nodes have higher coverage ranges. The main goal of this paper is to minimize the node placement cost with the help of uniform and non-uniform 2D grid planes. Authors propose a new algorithm for data transformation between strongly connected sensor nodes, based on graph theory.

Appraisal of Soft Computing Methods in Collaboration With Smart City Applications and Wireless Network

Applications of soft computing methods are spread in fields that deal with intelligent analysis. As the human intelligence can survey the likelihood of some occasions in possibilities, comparatively soft computing systems additionally utilize some smart-based strategies to evaluate ongoing issues with diagnostic models. Fundamental segments of soft computing incorporate machine learning, probabilistic thinking, swarm intelligence, and ANN algorithms. In this research article, there is a broad analysis of these intelligence-based soft computing strategies connected as different operational parts of a wireless network and there is a scheme of a soft computing-based method for smart and safe health care systems.

Mobile Sink with Mobile Agents

Wireless Sensor Networks (WSN) has been drawing considerable attention and discussion in recent years due to its potential applications in various fields. In modern applications for future internet the MSN (Mobile Sensor Network) is a key factor. Mobility allows the applications of Wireless Sensor Network to be compatible with IoT (Internet of Things) applications. As mobility enhances capability of the network it also affects the performance of the network at each layer. In recent years the various methodologies are proposed to handle mobility. Most of them use mobility for efficient data collection in WSNs. The purpose of this paper is to study effects of mobility on various performance parameters of the network and to explore the effective techniques to handle mobility in network. This paper proposes Mobile Sink with Mobile Agent mobility model for WSN which will increase the lifetime of the network using sink and agent node mobility.

Case Study on WSN Based Smart Home Garden with Priority Driven Approach

The proposed system focuses on utilizing the available water for a home garden in an effective way. The same approach is applicable to agriculture (large field), as our country's economy depends up on the agriculture. Therefore, agriculture is the backbone of Indian economy. In this paper, the authors have proposed a novel approach priority driven scheduling based irrigation model (for home garden) which supplies optimum and good quality water to the crops. The most important part for such system is Wireless Sensor Network which irrigates the plants. The proposed system will be very useful as it immediately irrigates the plant. In this process, soil moisture values will be sensed and compared to find out the lowest value. It means water will be given immediately to such plants where moisture values are low. Such systems will start new era in agriculture and will prove itself as a major requirement in the future due to many critical factors such as irregularity of monsoon, less availability of water, etc.

Target Tracking in Wireless Sensor Network

Wireless Sensor nodes are being employed in various applications like in traffic control, battlefield, and habitat monitoring, emergency rescue, aerospace systems, healthcare systems and in intruder tracking recently. Tracking techniques differ in almost every application of Wireless Sensor Network (WSN), as WSN is itself application specific. The chapter aims to present the current state of art of the tracking techniques. It throws light on how mathematically target tracking is perceived and then explains tracking schemes and routing techniques based on tracking techniques. An insight of how to code localization techniques in matlab simulation tool is provided and analyzed. It further draws the attention of the readers to types of tracking scenarios. Some of the well established tracking techniques are also surveyed for the reader's benefit. The chapter presents with open research challenges that need to be addressed along with target tracking in wireless sensor networks.

Novel Energy Aware Algorithm to Design Multilayer Architecture for Dense Wireless Sensor Networks

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.