Resilient Wireless Sensor Networks Using Topology Control: A Review

Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs

Predicting and Recovering Link Failure Localization Using Competitive Swarm Optimization for DSR Protocol in MANET

Portable impromptu organization is a self-putting together, major construction-less, independent remote versatile hub that exists without even a trace of a determined base station or government association. MANET requires no extraordinary foundation as the organization is unique. Multicasting is an urgent issue in correspondence organizations. Multicast is one of the effective methods in MANET. In multicasting, information parcels from one hub are communicated to a bunch of recipient hubs all at once, at a similar time. In this research work, Failure Node Detection and Efficient Node Localization in a MANET situation are proposed. Localization in MANET is a main area that attracts significant research interest. Localization is a method to determine the nodes’ location in the communication network. A novel routing algorithm, which is used for Predicting and Recovering Link Failure Localization using a Genetic Algorithm with Competitive Swarm Optimization (PRLFL-GACSO) Algorithm is proposed in this study to calculate and recover link failure in MANET. The process of link failure detection is accomplished using mathematical modelling of the genetic algorithm and the routing is attained using the Competitive Swarm optimization technique. The result proposed MANET method makes use of the CSO algorithm, which facilitates a well-organized packet transfer from the source node to the destination node and enhances DSR routing performance. Based on node movement, link value, and endwise delay, the optimal route is found. The main benefit of the PRLFL-GACSO Algorithm is it achieves multiple optimal solutions over global information. Further, premature convergence is avoided using Competitive Swarm Optimization (CSO). The suggested work is measured based on the Ns simulator. The presentation metrix are PDR, endwise delay, power consumption, hit ratio, etc. The presentation of the proposed method is almost 4% and 5% greater than the present TEA-MDRP, RSTA-AOMDV, and RMQS-ua methods. After, the suggested method attains greater performance for detecting and recovering link failure. In future work, the hybrid multiway routing protocols are presented to provide link failure and route breakages and liability tolerance at the time of node failure, and it also increases the worth of service aspects, respectively

Retransmission Reduction using Checkpoint based Sub-Path Routing for Wireless IoT

Wireless IoT has been one of the major breakthroughs of the current decade. It has improved the quality of life and has also aided in several improvements in domains like healthcare. Effective routing and energy conservation has been the major challenges in creating and maintaining a successful IoT network. This work presents a checkpoint based routing model, CSPR, to improve the transmission efficiency by reducing retransmission. This work selects checkpoints in the network prior to transmission. The checkpoints are used to build the final path. This process ensures that the routes created are dynamic and reactive, leading to improved security and increased path reliability. Comparison with existing routing model shows improved network lifetime and reduced selection overhead levels, exhibiting the high efficiency of CSPR

Target tracking in wireless sensor networks

The problem being tackled here relates to the problem of target tracking in wireless sensor networks. It is a specific problem in localization. Localization primarily refers to the detection of spatial coordinates of a node or an object. Target tracking deals with finding spatial coordinates of a moving object and being able to track its movements. In the tracking scheme illustrated, sensors are deployed in a triangular fashion in a hexagonal mesh such that the hexagon is divided into a number of equilateral triangles. The technique used for detection is the trilateration technique in which intersection of three circles is used to determine the object location. While the object is being tracked by three sensors, distance to it from a fourth sensor is also being calculated simultaneously. The difference is that closest three sensors detect at a frequency of one second while the fourth sensor detects the object location at twice the frequency. Using the distance information from the fourth sensor and a simple mathematical technique, location of object is predicted for every half second as well. The key thing to note is that the forth sensor node is not used for detection but only for estimation of the object at half second intervals and hence does not utilize much power. Using this technique, tracking capability of the system is increased. The scheme proposed can theoretically detect objects moving at speeds of up to 33 m/s unlike the paper [16] on which it is based which can detect objects moving only up to speeds of 5 m/s. While the earlier system [16] has been demonstrated with four sensors as well, but for that the arrangement of sensor nodes is a square. The technique demonstrated does not involve a change in the arrangement and utilizes the hexagonal mesh arrangement. Some other scenarios have been tackled such as when displacement of the object is zero at the end of one second. Its movement is predicted during that time interval. Also, incase an object moves in a circle, such motions are also tracked

Multipath Cluster Based Routing Protocol For Non-Uniform Node Density Mobile Ad Hoc Networks

Rangkaian sementara bergerak (Mobile Ad Hoc Networks, MANET) merupakan suatu kumpulan nod bergerak yang boleh berkomunikasi bersama tanpa memerlukan sebarang infrastruktur tetap dan pengurusan terpusat. MANET begitu popular dalam keadaan ketiadaan lokasi infrastruktur komunikasi tetap, seperti tapak bencana alam atau medan perang. Ketumpatan nod bergerak yang berbeza daripada satu subkawasan dengan subkawasan yang lain didefinisikan sebagai ketumpatan nod tidak seragam. Komunikasi di antara nod dalam rangkaian ketumpatan nod tidak seragam berdepan dengan cabaran keterikatan yang rendah, yang memungkinkan nod lebih rentan atau suseptibel untuk terputus pautan. Keadaan tersebut akan memberi impak terhadap kualiti perkhidmatan (quality of service, QoS) dalam rangkaian. Secara tipikal, ketumpatan nod tidak seragam boleh mempengaruhi prestasi rangkaian.. Sebagai contoh, nisbah penghantaran paket dijangka tinggi dalam subrangkaian ketumpatan tinggi dan rendah dalam subrangkaian ketumpatan rendah. Tesis ini mncadangkan Kluster Berbilang Laluan berdasarkan Protokol Penghalaan (MPCBRP) untuk mengesan masalah keterkaitan yang rendah dalam rangkaian ketumpatan nod tidak seragam dan untuk menambah baik QoS bagi MANET. A mobile ad hoc network (MANET) is a group of mobile nodes that can communicate with one another without the need for a fixed infrastructure and centralized management. MANETs are popular in locations that lack a fixed communication infrastructure, such as in natural disaster sites and battlefields. The varying densities of mobile nodes from one sub-area to another are referred to as non-uniform node densities. The communication between nodes in a network with non-uniform density faces the challenge of low connectivity, in which nodes are susceptible to link breakages. Such condition affects the Quality of Service (QoS) in networks. Typically, a non-uniform node density influences network performance. For instance, packet delivery ratio is expected to be high in high-density sub networks and low in low-density sub networks. This thesis proposes a multipath cluster-based routing protocol (MP-CBRP) to address the problem of low connectivity in networks with non-uniform density and to improve the QoS for MANETs

Performance and energy efficiency in wireless self-organized networks

fi=vertaisarvioitu|en=peerReviewed

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

Smart Wireless Sensor Networks

The recent development of communication and sensor technology results in the growth of a new attractive and challenging area - wireless sensor networks (WSNs). A wireless sensor network which consists of a large number of sensor nodes is deployed in environmental fields to serve various applications. Facilitated with the ability of wireless communication and intelligent computation, these nodes become smart sensors which do not only perceive ambient physical parameters but also be able to process information, cooperate with each other and self-organize into the network. These new features assist the sensor nodes as well as the network to operate more efficiently in terms of both data acquisition and energy consumption. Special purposes of the applications require design and operation of WSNs different from conventional networks such as the internet. The network design must take into account of the objectives of specific applications. The nature of deployed environment must be considered. The limited of sensor nodes� resources such as memory, computational ability, communication bandwidth and energy source are the challenges in network design. A smart wireless sensor network must be able to deal with these constraints as well as to guarantee the connectivity, coverage, reliability and security of network's operation for a maximized lifetime. This book discusses various aspects of designing such smart wireless sensor networks. Main topics includes: design methodologies, network protocols and algorithms, quality of service management, coverage optimization, time synchronization and security techniques for sensor networks