In energy-constrained wireless sensor networks (WSNs), maximizing the data collection using mobile sink(s) with minimum energy consumption is one of the practical challenging issues. In this article, we consider the problem of efficient data collection along with a pre-specified path using a mobile sink with constant speed. We refer the problem as a Maximizing data gathering with minimum energy consumption (MDGMEC) problem. So far, existing works have heuristic algorithms for MDGMEC problem. Therefore, based on network flow optimization approach, we propose a deterministic algorithm called data gathering using mobile sink for path constraint environment (DGAMSPCE) to handle the MDGMEC problem. The proposed DGAMSPCE scheme runs in polynomial time and is easily scalable for the networks with a large number of nodes. Based on the data receiving models used by the mobile sink, another algorithm called single access based data gathering using mobile sink for path constraint environment (SADGAMSPCE) is also proposed. We evaluate the proposed schemes and compare these with the existing schemes. The simulation experiments in MATLAB show that our proposed schemes outperform other existing schemes in terms of collecting the amount of data and the total energy consumption of the network, significantly.

Flow Based Efficient Data Gathering in Wireless Sensor Network Using Path-Constrained Mobile Sink

A Trusted Distributed Routing Scheme for Wireless Sensor Networks Using Block Chain and Jelly Fish Search Optimizer Based Deep Generative Adversarial Neural Network (Deep-GANN) Technique

A comparison study of Weibull, normal and Boulevard distributions for wireless mesh networks considering different router replacement methods by a hybrid intelligent simulation system

A wireless sensor network is a set of sensor nodes used to identify the environment and the corresponding object. It collects all the data of the situation and transmits this detected data to the central node through a wireless network. However, some challenges are encountered in wireless sensor networks i.e., the efficient deployment of sensor nodes in an environment. Some of the issues are limited sources of energy, limited transmission bandwidth, short coverage, data distribution, data persistence, faulty node, and data security redundancy. The Discovery Configuration Protocol (DCP) has been signed for a period of time to monitor the applications. It is required for alternate use, which is very important to recreate the correct data source. Recently, Source Location Privacy (SLP) security at the WSN has attracted a way to prevent opponents from pursuing a backtracking strategy to capture the data source. Delivery of messages from different source nodes to sink nodes is done through an end-to-end location privacy process. With location-based services, data must be retrieved by users who do not have information about the data’s location. So, introduce a proposed Adaptive Trust Sector-Based Authenticated System (ATSAS), which is meant to evaluate the trust confidence value of each node with the help of agent sinks node. When the joining nodes discover their neighbors, they exchange information about the number of single-hop neighbors. The updated confidence value of the node is formed in the network algorithm. The first stage is done using the Honey Encryption (HE) for message authentication and packet encryption to provide security in WSN. These encryptions are making Distribution-Transforming Encoder (DTE) for space of the un-encrypted plain text message into the seed space of n-bit string. The output encryption point is the input to feedback for key generation. To the next level, both direct and indirect observations, such as its neighbor’s trust value, are calculated based on two sources of information. This protocol thereby increases secure communication in a hierarchical WSN. The trust rate control of the network at the source of the packet, which helps drive the time control mechanism. Such Network Control Point (NCP) system development methods provide security and reduce the occurrence of overload on distributed sensor nodes. The theoretical analysis and test results demonstrate that the proposed method improves security, reduces directional attacks, and increases the network’s longevity.

An improved source location privacy protection using adaptive trust sector-based authentication with honey encryption algorithm in WSN

In recent decades, the use of sensors has dramatically grown to monitor human body activities and maintain the health status. In this application, routing and secure data transmission are very important to prevent the unauthorized access by attackers to health data. In this article, we propose a secure routing scheme called SecAODV for heterogeneous wireless body sensor networks. SecAODV has three phases: bootstrapping, routing between cluster head nodes, and communication security. In the bootstrapping phase, the base station loads system parameters and encryption functions in the memory of sensor nodes. In the routing phase, each cluster head node calculates its degree based on several parameters, including, distance, residual energy, link quality, and the number of hops, to decide for rebroadcasting the route request (RREQ) message. In the communication security phase, a symmetric cryptography method is used to protect intra-cluster communications. Also, an asymmetric cryptography method is used to secure communication links between cluster head nodes. The proposed secure routing scheme is simulated in the network simulator version 2 (NS2) simulator. The simulation results are compared with the secure multi tier energy-efficient routing scheme (SMEER) and the centralized low-energy adaptive clustering hierarchy (LEACH-C). The results show that SecAODV improves end-to-end delay, throughput, energy consumption, packet delivery rate (PDR), and packet loss rate (PLR).

/pdf/secaodv-a-secure-healthcare-routing-scheme-based-on-hybrid-2yj6g8tp.pdf

SecAODV: A Secure Healthcare Routing Scheme Based on Hybrid Cryptography in Wireless Body Sensor Networks

To transmit information over the industrial network today, you need data in a secure way to make it a high security root. Routing security issues in the wireless web network have been well studied. The problem of security in routing in wireless mesh networks (WMN) has been well studied. There exist numerous techniques to resolve this issue but differ and suffer to achieve higher security performance in WMN. To resolve this issue, a dynamic rate aware classified key distributional secure routing (DRCKDS) is proposed. In this approach, the sensor nodes maintain various factors related to the neighbor like energy, transmission involvement, rate of success and so on. According to this, available routes are identified to reach the destination from the source. For each route identified, the method computes the secure route measure (SRM). According to the SRM value, an optimal route is selected for the transmission. Similarly, the method generates different secret keys and distributes them through the transmission route selected. The same key has been used to encrypt the data and forward the packet through the route selected. The method improves the security performance and improves the quality of service of WMN.

S. S. Sathya

Papers

An optimized distributed secure routing protocol using dynamic rate aware classified key for improving network security in wireless sensor network