Improvement of assurance including security for wireless sensor networks using dispersed data transmission

AbstractAssurance networks are one of the essential technologies of New-generation Networks. Assurance is defined as the capability of guaranteeing functional and non-functional system properties such as dependability, security, timeliness and adaptability to heterogeneous and changing requirements. Assurance is essential for sustainable networks and this research focused specifically on providing assurance for WSNs. Node capture attacks are one prospective kind of attack on WSNs. To reduce negative effect of node capture attacks, we have previously proposed secure decentralized data transfer. In this proposed method, it was assumed that multiple paths were in place. In this paper as well, we again propose using the multipath routing method. To make multiple paths fit our previously proposed method, we have modified ATR (Augmented Tree Based Routing). We have conducted simulation experiments using our proposed method in a network simulator. The results show that our previously proposed method is effective in both cases in which the network size is small or large. In addition, we conducted other simulation experiments to measure several aspects of the assurance of our method. We measured in terms of varying parameters such as node densities, distance between the source and the destination nodes, and so on. Additionally, our method is more assured than the single path-based method

Cooperative Self-Scheduling Secure Routing Protocol for Efficient Communication in MANET

In wireless transmission, a Mobile Ad-hoc Network (MANET) contains many mobile nodes that can communicate without needing base stations. Due to the highly dynamic nature of wireless, MANETs face several issues, like malicious nodes making packet loss, high energy consumption, and security. Key challenges include efficient clustering and routing with optimal energy efficiency for Quality of Service (QoS) performance. To combat these issues, this novel presents Cooperative Self-Scheduling Secure Routing Protocol (CoS3RP) for efficient scheduling for proficient packet transmission in MANET. Initially, we used Elite Sparrow Search Algorithm (ESSA) for identifies the Cluster Head (CH) and form clusters. The Multipath Optimal Distance Selection (MODS) technique is used to find the multiple routes for data transmission. Afterward, the proposed CoS3RP transmits the packets based on each node authentication. The proposed method for evaluating and selecting efficient routing and data transfer paths is implemented using the Network simulator (NS2) tool, and the results are compared with other methods. Furthermore, the proposed well performs in routing performance, security, latency and throughput

Safe Routing Approach by Identifying and Subsequently Eliminating the Attacks in MANET

Wireless networks that are decentralized and communicate without using existing infrastructure are known as mobile ad-hoc networks. The most common sorts of threats and attacks can affect MANETs. Therefore, it is advised to utilize intrusion detection, which controls the system to detect additional security issues. Monitoring is essential to avoid attacks and provide extra protection against unauthorized access. Although the current solutions have been designed to defeat the attack nodes, they still require additional hardware, have considerable delivery delays, do not offer high throughput or packet delivery ratios, or do not do so without using more energy. The capability of a mobile node to forward packets, which is dependent on the platform's life quality, may be impacted by the absence of the network node power source. We developed the Safe Routing Approach (SRA), which uses behaviour analysis to track and monitor attackers who discard packets during the route discovery process. The attacking node recognition system is made for irregular routing node detection to protect the controller network's usual properties from becoming recognized as an attack node. The suggested method examines the nearby attack nodes and conceals the trusted node in the routing pathway. The path is instantly assigned after the initial discovery of trust nodes based on each node's strength value. It extends the network's life span and reduces packet loss. In terms of Packet Delivery Ratio (PDR), energy consumption, network performance, and detection of attack nodes, the suggested approach is contrasted with AIS, ZIDS, and Improved AODV. The findings demonstrate that the recommended strategy performs superior in terms of PDR, residual energy, and network throughput

Improved energy aware cluster based data routing scheme for WSN

Wireless sensor network (WSN) consists of several tiny devices that are dispersed randomly for gathering network field. Clustering mechanism divides the WSN into different sub-regions called clusters. Individual cluster is consisting of cluster head (CH) and member nodes. The main research challenges behind clustering mechanism are to optimize network overheads with efficient data delivery. Sensor nodes are operated by batteries and practically it is not feasible to replace them during sensing the environment so energy should be effectively utilized among sensors for improving overall network performance. This research paper presents an improved energy aware cluster based data routing (i-ECBR) scheme, by dividing the network regions into uniform sized square partitions and localized CH election mechanism. In addition, consistent end-to-end data routing is performed for improving data dissemination. Simulation results illustrate that our proposed scheme outperforms than existing work in terms of different performance metrics

Robust Path Construction for Reliable Data Transmissions in Node Disjoint Multipath Routing

Wireless Sensor Networks (WSNs) are prone to node breakdowns due to energy constraints, which contribute to frequent topology changes. Moreover, since sensor nodes have restricted transmission range, multiple hops are needed by the node in order to forward the packets from one node to the other and this raises very challenging issues when designing routing protocols. Most of the proposed single path routing schemes use a periodic low-rate flooding of data in order to recover from path failures, which causes higher consumption in sensor node resources. So multipath routing is an optimal approach to enhance the network lifetime. In this paper, a robust path construction for a reliable data transmission in node-disjoint multipath routing (RNDMR) is proposed for WSNs. The proposed RNDMR has the ability to provide a low overhead path construction as well as provide data transmission reliability by using XOR-based coding algorithm, which entails low utilization of resources, such as low storage space and lesser computing power. In the proposed RNDMR, the procedure involves the splitting up of all transmitted messages into many different segments of equal size, before adding the XOR-based error correction codes and distributing it among multiple paths simultaneously in order to boost reliable data transmission and to be assured that the essential fragment of the packet arrives at the sink node without any additional consumption of energy and undue delay. By using simulations, the performance of RNDMR was assessed and compares it with ReInForm routing. The results illustrate that RNDMR attains low energy consumption, records low average delay and routing overhead, as well as increased packet delivery ratio when compared with ReInForm Routing

Energy Efficient Multi-hop routing scheme using Taylor based Gravitational Search Algorithm in Wireless Sensor Networks

A group of small sensors can participate in the wireless network infrastructure and make appropriate transmission and communication sensor networks. There are numerous uses for drones, including military, medical, agricultural, and atmospheric monitoring. The power sources available to nodes in WSNs are restricted. Furthermore, because of this, a diverse method of energy availability is required, primarily for communication over a vast distance, for which Multi-Hop (MH) systems are used. Obtaining the optimum routing path between nodes is still a significant problem, even when multi-hop systems reduce the cost of energy needed by every node along the way. As a result, the number of transmissions must be kept to a minimum to provide effective routing and extend the system\u27s lifetime. To solve the energy problem in WSN, Taylor based Gravitational Search Algorithm (TBGSA) is proposed, which combines the Taylor series with a Gravitational search algorithm to discover the best hops for multi-hop routing. Initially, the sensor nodes are categorised as groups or clusters and the maximum capable node can access the cluster head the next action is switching between multiple nodes via a multi-hop manner. Initially, the best (CH) Cluster Head is chosen using the Artificial Bee Colony (ABC) algorithm, and then the data is transmitted utilizing multi-hop routing. The comparison result shows out the extension of networks longevity of the proposed method with the existing EBMRS, MOGA, and DMEERP methods. The network lifetime of the proposed method increased by 13.2%, 21.9% and 29.2% better than DMEERP, MOGA, and EBMRS respectively

Improved Energy Aware Cluster based Data Routing Scheme for WSN

Wireless sensor network (WSN) consists of several tiny devices that are dispersed randomly for gathering network field. Clustering mechanism divides the WSN into different sub-regions called clusters. Individual cluster is consisting of cluster head (CH) and member nodes. The main research challenges behind clustering mechanism are to optimize network overheads with efficient data delivery. Sensor nodes are operated by batteries and practically it is not feasible to replace them during sensing the environment so energy should be effectively utilized among sensors for improving overall network performance. This research paper presents an improved energy aware cluster based data routing (i-ECBR) scheme, by dividing the network regions into uniform sized square partitions and localized CH election mechanism. In addition, consistent end-to-end data routing is performed for improving data dissemination. Simulation results illustrate that our proposed scheme outperforms than existing work in terms of different performance metrics

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

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