Data Transmission In Sensor Networks Research Articles

Priority Controlled Data Transmission in Sensor Networks

Priority Controlled Data Transmission in Sensor Networks

Prediction-based data reduction with dynamic target node selection in IoT sensor networks

In various applications of IoT sensor networks, special attention is paid to sensor nodes that register higher or lower values of a monitored parameter compared to other nodes. Thus, methods are necessary that enable the selection of target nodes while minimizing the number of data transmissions. The reduced amount of data transmitted during target node selection contributes to energy savings and prolongs the lifetime of battery-powered sensor nodes. This paper introduces a method for reducing data transmissions in sensor networks, where target nodes are selected to perform monitoring tasks. The proposed method allows the IoT gateway to determine when the sensor nodes should report their data readings. The gateway utilizes a prediction algorithm to determine whether a new target node should be selected. In this scheme, data are transmitted only when necessary for the correct selection of the target node. Experiments were conducted for a wireless sensor network consisting of mobile devices, where the target node is the device closest to a given location. The experimental evaluation confirmed that the proposed method significantly reduces the amount of transmitted data and ensures the proper selection of the target node. It was also demonstrated that the introduced approach reduces data transmissions more effectively than the state-of-the-art prediction-based algorithms. During the experiments, the amount of data transmitted from sensor nodes to the IoT gateway was analyzed. The proposed method has reduced the amount of transmissions by 94%, while the highest transmission reduction rate achieved by the existing techniques was 81.4%.

RETRACTED ARTICLE: Research on data transmission model of agricultural wireless sensor network based on game theory

This article has been retracted from publication in the Taylor & Francis journal, Acta Agriculturae Scandinavica, Section B — Soil & Plant Science. Following publication, concerns were raised by multiple third-parties around the content of the special issue and the decision-making process. Following an investigation by the Taylor & Francis Publishing Ethics & Integrity team in full cooperation with the Editor-in-Chief, it was confirmed that this article included in Special Issue titled “ Envisage Computer Modelling and Statistics for Agriculture”, guest edited by Gunasekaran Manogaran was not peer-reviewed appropriately, in line with the Journal's peer review standards and policy. As the stringency of the peer review process is core to the integrity of the publication process, the Editor and Publisher have decided to retract all of the articles within the above-named Special Issue. The journal has not confirmed if the authors were aware of this compromised peer review process. The journal is committed to correcting the scientific record and will fully cooperate with any institutional investigations into this matter. The authors have been informed of this decision. We have been informed in our decision-making by our policy on publishing ethics and integrity and the COPE guidelines.

Hierarchical Data Transmission and Processing Analysis of Sensor Network System

Hierarchical structure is the method and means of data transmission in sensor network system. The large-scale application of sensor network system and a large number of data acquisition will produce massive data. In order to reduce the load of sensor network processor system and make data transmission more reliable and convenient. For the transmission and processing of streaming and structured data, the data can be processed hierarchically and dimensionally. Hierarchical processing can effectively reduce the load of the network system; Dimensionality reduction can effectively compress the amount of data to reduce the time of data transmission and processing. Hierarchical operation is a necessary step for data transmission and processing in sensor networks, and has been applied in large-scale data transmission and processing algorithms.

Development of algorithms for data transmission in sensor networks based on fully homomorphic encryption using symmetric Kuznyechik algorithm

The article presents the development of algorithms for data transmission in wireless sensor networks based on fully homomorphic encryption (FHE) using a symmetric encryption algorithm Kuznyechik. During the study, the main points related to the use of modern sensor networks were considered: data transfer protocols, the most common vulnerabilities and various emulators of sensor networks. Approaches to the use of homomorphic encryption for data exchange are considered. An algorithm for the interaction of the base station and sensor nodes of the sensor network for data exchange based on FHE using the Kuznyechik algorithm has been developed. To use the encryption algorithm Kuznyechik as part of the FHE, an algorithm for constructing Zhegalkin polynomials for nonlinear cipher elements has been developed and implemented. For the encryption algorithm Kuznyechik, for the first time, Zhegalkin polynomials are obtained, which describe the operation of the replacement S-block. The use of the obtained Zhegalkin polynomials makes it possible to decrypt the data encrypted by the Kuznyechik algorithm and at the same time leave them in the encrypted form of the FHE.

Research on Optimization of Port Logistics Distribution Path Planning Based on Intelligent Group Classification Algorithm

Meng, X. and Li, X., 2020. Research on optimization of port logistics distribution path planning based on intelligent group classification algorithm. In: Bai, X. and Zhou, H. (eds.), Advances in Water Resources, Environmental Protection, and Sustainable Development. Journal of Coastal Research, Special Issue No. 115, pp. 205-207. Coconut Creek (Florida), ISSN 0749-0208.At present, the logistics industry has become an important part of social and economic development. The success of modern logistics enterprises depends on efficient cooperation with all upstream and downstream enterprises in the supply chain, and information technology is the prerequisite for such cooperation. Artificial Fish Swarm Algorithm (AFSA) is applied to robot path planning in intelligent bionic way. In order to improve the solving speed of the planning and reduce the length of the planning path, the convergence speed of the algorithm in the later stage is reduced and the local optimal solution is easily trapped. Location information is of great significance to the application of artificial fish swarm algorithm. The location of events or information sources is an important part of data transmission in sensor networks. The operation of the distribution system plays a vital role in the whole logistics system, and its analysis and design are the premise for its good operation.

A unified heuristic bat algorithm to optimize the LEACH protocol

SummaryWireless sensor networks (WSN) have high value in the field of wireless communications. As the earliest WSN clustering protocol, Low Energy Adaptive Clustering Hierarchy (LEACH) can effectively reduce the energy consumption of data transmission in sensor networks. However, LEACH has some problems such as cluster head nodes are unevenly distributed. In this paper, a unified heuristic bat algorithm (UHBA) is proposed to optimize elections in cluster heads. This algorithm guarantees that the election of cluster heads can freely transform both global search and local search. Meanwhile, comparing with several other variants of the bat algorithm in CEC2013 test suite, it can be seen from results that UHBA has better performance. Moreover, the application of the algorithm on LEACH is better than other algorithms, which further proves that the algorithm has better results.

Edge-Aided Reliable Data Transmission for Heterogeneous Edge-IoT Sensor Networks.

Wireless sensor networks have been attracting research attention for the past decade and will continue to be a hot topic due to the emerging trend of Internet-of-Things (IoT). Edge computing for IoT (Edge-IoT) is a promising framework that can help low-powered sensor networks to conduct complex computational tasks. Different from the existing works that focus on cooperative task execution for edge and sensor networks, in this paper, we investigate the problem of reliable data transmission in edge-aided sensor networks. Firstly, we discuss how edge servers can help to improve the data transmission of sensor networks. Secondly, we propose a forwarding scheme for edge nodes to forward packets according to coverage and corresponding interference. Thirdly, we propose an edge-based error recovery approach. By employing edge servers for data transmission and error recovery, the efficiency and reliability of data transmissions can be largely improved.

Trustworthy service composition with secure data transmission in sensor networks

As the basis of the Internet of Things (IoT), sensor networks have materialized its computation and communication capability into anything in our modern lives. Service composition provides us a promising way to cooperate various sensors to build more powerful IoT applications over sensor networks. However, the limited capability of sensor node poses great challenges not only to trustworthy service composition but also to secure data aggregation. The complex composite structure, computation-intensive evaluation, and massive data transmission become burdens for service composition in sensor networks. To overcome these issues, this paper proposes a distributed approach to enable efficient trustworthy service composition with secure data transmission in sensor networks. By analyzing dependency relationships, the rules for computing service trust and data trust are proposed based a multi-level trust model. Then, each target component service can be evaluated independently through a model checker. Moreover, an identity-based aggregate signature is introduced in the composite evaluation to guarantee the secure data transmission among different components. The experimental results show that our approach not only achieves efficient trustworthy service composition with complex invocation structures, but also reduces the costs in the secure data transmission.

Optimizing Retransmission Threshold in Wireless Sensor Networks.

The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is , where is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based -approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed -approximation algorithm with time complexity is proposed. Experimental results show that the proposed algorithms have better performance.

Design and Implementation of Wireless Sensor Network Data Transfer Protocol

This paper discussed the problem of wireless sensor network data transmission protocols, and combined with the characteristics of WSN and the actual needs, the design and implementation of a data transmission priority queue and priority transmission scheme of ACK, provide an end-to-end transmission for the important information, and achieve the timely, reliable transmission of control information.

A Harmony Search Based Low-Delay and Low-Energy Wireless Sensor Network

Aiming at different service quality requirements under different circumstances of wireless sensor network (WSN), harmony search (HS) algorithm is used to solve the lowdelay and low-energy double-objective optimization problem in wireless sensor networks. First, analyze the low-delay and low-energy model, and establish the objective function. Then, use the priority-based path encoding algorithm to update harmony memory iteratively while searching the optimal path. Finally, simulation of 100-node network is carried out by using Matlab. The results show that sensor network data transmission path can be controlled according to the users’ needs of delay and power.

Reliable SPIN in Wireless Sensor Network: A Review

Wireless sensor network (WSN) is becoming famous because of its use in various applications of different areas such as environment, defense, medical, house, media and education. WSN is a structure free network where requirement of application decides the network structure, topology and routing protocols. Data transmission in sensor network is possible with the help of routing protocols. There are multiple routing protocols in WSN which provide efficient data delivery but reliability is still a major constraint of WSN. When data is transmitted from source node to the sink or Base Station (BS), some data packets may lost due to some reason such as failure of node, dead node. Sometimes node is not interested in forwarding data and drops the data packet. The problem of lost data affects the reliability of the network. Various energy efficient protocols have been proposed but they do not ensure reliability. This paper studies the reliability issue. Also highlights some of the proposed techniques to make network more reliable.

Research on Data Transmission Technology Based on Raptor Code in Wireless Sensor Networks

Wireless sensor network is a data centric distributed self-organizing network. The transmission of data is the most important task of it. It is a topic worthy of study that how to ensure the reliability of data transmission in any environment .Fountain codes algorithm is simple, and has no ratio. It is very suitable for coding scheme for Wireless Sensor Networks. This paper mainly studies the Fountain codes of Raptor codes in wireless sensor network data transmission technology, and gives the concrete scheme and implementation ways. The application of this technology can improve the reliability of data transmission and transmission efficiency. It overcome the problems of very large packet error codec technology traditional rate and the decoding success rate.

An Assessment of Security Mechanisms Against Reactive Jammer Attack In Wireless Sensor Networks

Wireless sensor networks have been widely applied to various domains such as environmental monitoring and surveillance. Since wireless sensor networks utilize open transmission media, they are prone to radio jamming attacks. These attacks are easy to launch but difficult to defend. These attacks may lead to low network throughput because of jamming signals. Failure of data transmission in sensor networks is due to corruption of packets by reactive jammers. A number of defence techniques have been proposed in recent years to deal with these jammer attacks. However, each defence technique is suitable for only a limited network range and specific jamming conditions. This paper proposes an adaptive approach to detect and isolate the reactive jammers by using status messages and trigger identification service.

Clustering Network Topology Control Method Based on Responsibility Transmission

The topology control is an effective approach which can improve the quality of wireless sensor network at all sides. Through studying the mechanism of sensor network data transmission, the nature of data transmission in wireless sensor network is concluded as a kind of responsibility transmission. By redefining the responsibility and availability of nodes, the strategy for cluster head selection is studied, the responsibility and availability is determined by the combination of the residual energy, location and current flow of nodes. Based on the above, new clustering network topology control algorithm based on responsibility transmission CNTCABRT and hierarchical multi-hop CNTCABRT is presented in this paper, whose algorithm structure is along the famous LEACH algorithm. Experimental result demonstrates its promising performance over the famous LEACH algorithm in the cluster head selection, the size of cluster, the deployment of nodes and the lifetime of nodes, and several innovative conclusions are proposed finally.

Pushback: A hidden Markov model based scheme for energy efficient data transmission in sensor networks

In sensor networks, application layer QoS requirements are critical to meet while conserving energy. One of the leading factors for energy wastage is failed transmission attempts due to channel dynamics and interference. Existing techniques are unaware of the channel dynamics and lead to suboptimal channel access patterns. We propose a MAC layer solution called pushback, that appropriately delays packet transmissions to overcome periods of poor channel quality and high interference, while ensuring that the throughput requirement of the node is met. It uses a hidden Markov model (HMM) based channel model that is maintained without any additional signaling overhead. The pushback algorithm is shown to improve the packet success rate by up to 71% and reduce the number of transmissions needed by up to 38% while ensuring the same throughput.

Battery-Aware Routing for Streaming Data Transmissions in Wireless Sensor Networks

Recent technological advances have made it possible to support long lifetime and large volume streaming data transmissions in sensor networks. A major challenge is to maximize the lifetime of battery-powered sensors to support such transmissions. Battery, as the power provider of the sensors, therefore emerges as the key factor for achieving high performance in such applications. Recent study in battery technology reveals that the behavior of battery discharging is more complex than we used to think. Battery powered sensors might waste a huge amount of energy if we do not carefully schedule and budget their discharging. In this paper we study the effect of battery behavior on routing for streaming data transmissions in wireless sensor networks. We first give an on-line computable energy model to mathematically model battery discharge behavior. We show that the model can capture and describe battery behavior accurately at low computational complexity and thus is suitable for on-line battery capacity computation. Based on this battery model we then present a battery-aware routing (BAR) protocol to schedule the routing in wireless sensor networks. The routing protocol is sensitive to the battery status of routing nodes and avoids energy loss. We use the battery data from actual sensors to evaluate the performance of our protocol. The results show that the battery-aware protocol proposed in this paper performs well and can save a significant amount of energy compared to existing routing protocols for streaming data transmissions. Network lifetime is also prolonged with maximum data throughput. As far as we know, this is the first work considering battery-awareness with an accurate analytical on-line computable battery model in sensor network routing. We believe the battery model can be used to explore other energy efficient schemes for wireless networks as well.