Packets In Wireless Sensor Networks Research Articles

Multi-Network Latency Prediction for IoT and WSNs

The domain of Multi-Network Latency Prediction for IoT and Wireless Sensor Networks (WSNs) confronts significant challenges. However, continuous research efforts and progress in areas such as machine learning, edge computing, security technologies, and hybrid modelling are actively influencing the closure of identified gaps. Effectively addressing the inherent complexities in this field will play a crucial role in unlocking the full potential of latency prediction systems within the dynamic and diverse landscape of the Internet of Things (IoT). Using linear interpolation and extrapolation algorithms, the study explores the use of multi-network real-time end-to-end latency data for precise prediction. This approach has significantly improved network performance through throughput and response time optimization. The findings indicate prediction accuracy, with the majority of experimental connection pairs achieving over 95% accuracy, and within a 70% to 95% accuracy range. This research provides tangible evidence that data packet and end-to-end latency time predictions for heterogeneous low-rate and low-power WSNs, facilitated by a localized database, can substantially enhance network performance, and minimize latency. Our proposed JosNet model simplifies and streamlines WSN prediction by employing linear interpolation and extrapolation techniques. The research findings also underscore the potential of this approach to revolutionize the management and control of data packets in WSNs, paving the way for more efficient and responsive wireless sensor networks.

Fragmentation of data packets in wireless sensor network with variable temperature and channel conditions

This study formalizes and solves the problem of minimizing the energy dissipated by a node in order to successfully transmit the initial data amount during one round of communication over a wireless channel affected by Rice fading under varying temperature conditions. In this work, the models for the temperature dependence of the parameters in an incoherent frequency shift key (FSK) demodulator are presented and investigated for the first time, taking into account both the frequency separation and the synchronization type of the clock generator. The studied orthogonality coefficients of FSK signals represent internal parameters in the proposed model of the incoherent Rice wireless channel. This model allows the analytical relationship between the bit error probability (BEP) and node heating temperature, signal fading depth in the channel (Rician K-factor), and signal-to-noise ratio (SNR) to be established.Since it is necessary to retransmit the entire data packet when an erroneous bit is detected in a communication system that uses an automatic repeat request, at high BEP values, it is recommended to fragment packets in order to improve the energy efficiency of the nodes. By using the developed models for calculating energy losses during the communication round, it was determined that optimal fragmentation options (OFO) for data packets can be identified within specific ranges of temperature and Rician K-factor, which includes the overhead costs for packeting and retransmission. As a result, OFO matrices of packets in the "temperature – K-factor" (t0–K) coordinate system were obtained for minimizing the energy loss of nodes at different SNR values. In our example of using TI CC2500 node transceivers for 90-day monitoring of corn vegetation, the t0K-Frag algorithm reduced node energy losses by a factor of K = 3.3 compared to the case of transmitting an unfragmented packet of initial length.

Effect of Energy-Efficient Routing for Packet Splitting using Chinese Remainder Theorem (CRT) for Wireless Sensor Networks (WSNS)

The most popular Wireless Sensor Network (WSN) protocol utilized for energy optimization of WSN nodes is the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol, which is a basic energy-efficient routing protocol of hierarchical routing protocol’s family, where the sensor nodes remain static. There is a need to extend the lifetime with respect to reducing the energy consumption of nodes, and this was accomplished using the Chinese Remainder Theorem (CRT. In this research large data packets are broken into smaller packets. The focus of the study is to develop an energy routing for splitting packets in Wireless Sensor Networks (WSNs) using Chinese Remainder Theorem (CRT) techniques. A further improvement in WSN lifetime is by utilizing fuzzy logic. Factoring node parameters such as residual energy of nodes, their centrality within clusters, and their distance to the base station and improving upon the selection of nodes as cluster heads are required. The developed application can be used to reduce the communication cost of Energy efficiency of WSN. The forwarding technique for this research is to split the packet sent by the source node of a WSN so that the maximum number of bits per packet that a node has to transmit is significantly minimized.

Secure authentication and data aggregation scheme for routing packets in wireless sensor network

<span lang="EN-US">Wireless sensor networks (WSNs) comprise a huge number of sensors that sense real-time data; in general, WSNs are designed for monitoring in various application mainly internet of things based (IoT) application. Moreover, these sensors possess a certain amount of energy i.e., they are battery based; thus, the network model must be efficient. Furthermore, data aggregation is a mechanism that minimizes the energy; however, in addition, these aggregated data and networks can be subject to different types of attacks due to the vulnerable characteristics of the network. Hence it is important to provide end-to-end security in the data aggregation mechanism in this we design and develop dual layer integrated (DLI)-security architecture for secure data aggregation; DLI-security architecture is an integration of two distinctive layers. The first layer of architecture deals with developing an authentication for reputation-based communication; the second layer of architecture focuses on securing the aggregated data through a consensus-based approach. The experiment outcome shows that DLI identifies the correct data packets and discards the unsecured data packets in energy efficient way with minimal computation overhead and higher throughput in comparison with the existing model.</span>

Energy Efficient Ant Colony System for Packet Routing in Wireless Sensor Network

Routing packets in Wireless Sensor Network (WSN) is challenging due to the distribution of sensor nodes with different ability. Inefficient routing may lead to higher failure rate, higher latency and higher energy consumption. One of the common approaches to solve this problem is by using bio-inspired routing algorithms due to their abilities to adapt with dynamic environment. This paper proposed an improved ant colony system for packing routing in WSN that focuses on exploration and exploitation techniques. In the proposed routing algorithm, the best path to be used for packet transmission will be determined by considering the remaining energy of each sensor node to reduce the hotspot problem. Local pheromone update and global pheromone update are used with the aim to prevent imbalanced energy depletion of sensor nodes and to balance the packet distribution. The proposed routing algorithm was validated against several bio-inspired routing algorithms in medium and large sized networks. The results suggested that it has outperformed in terms of success rate, packet loss rate, latency and energy efficiency.

Performance analysis of batch receiving wireless sensor networks with interference signals

In order to improve the energy efficiency, the operating situation of batch receiving wireless sensor network is discussed in this paper. Combining with environmental interference signals, repairable faults of the sensor node and other actual situation, process of receiving and transmitting data packets in wireless sensor networks is simulated. An MX/G/1 vacation queueing model with customers arriving in batches, negative customers, feedback customers, wake-up periods, optional vacations and repairable faults is established. The steady state distribution of the system is solved by using the supplementary variable method, and expressions of the energy saving rate and other performance indexes are given. The equilibrium of the system is discussed by establishing revenue function of the system. Then, using MATLAB software for numerical analysis, the influence of system parameters on performance indexes of wireless sensor networks systems is analysed, and equilibrium numerical results are obtained.

An Enhanced Efficient Leach Protocol (EELP) with Novel Cross Layer Technique to forward the Data Packets in Wireless Sensor Networks

An Enhanced Efficient Leach Protocol (EELP) with Novel Cross Layer Technique to forward the Data Packets in Wireless Sensor Networks

Performance Evaluation of the Objective Functions for Digital Media in Internet of Things (IoT)

Internet of Thing (IoT) technology allows physical objects to connect to the Internet and it is based on Wireless Sensor Networks (WSNs) that represent an essential component for IoT. Moreover, the high rate of using the internet has enabled the spread of digital media such that the world is populated by digital media products, which are included in several industries such as healthcare and education. Moreover, it has emerged that IoT technologies enable the objects from exchanging digital data and communicating in an efficient way by using a routing protocol. Routing Protocol for Low-Power and Lossy Networks (RPL) is one of the most growing routing protocols in IoT. Specifically, it is a routing protocol for WSNs with low-power and lossy networks(LNNs), proposed by Internet Engineering Task Force (IETF) as a standard for routing packets in WSN to support IPv6 communication. Furthermore, RPL uses objective functions(OFs) to optimize the path from source to destination. Mainly, it has two objective functions that are: Objective Function Zero (OF0) and Minimum Rank with Hysteresis Objective Function (MRHOF). In this paper, the evaluation and the analysis of RPL's objective functions are presented in terms of both Power Consumption (PC) and Packet Delivery Ratio (PDR) in medium network sizes specifically when N=25, N=40, and N=50 using a set of network parameters, including Packet Reception Ratio (RX) and Transmission range (TX) under random and grid network topologies. The experimental results show that the two objective functions perform the same in term of PDR when RX=100% but in some cases MRHOF outperforms OF0 and gives a 1-5% higher PDR than OF0. However, on average OF0 consumes less power than MRHOF.

An Intelligent Opportunistic Routing Algorithm for Wireless Sensor Networks and Its Application Towards e-Healthcare.

The lifetime of a node in wireless sensor networks (WSN) is directly responsible for the longevity of the wireless network. The routing of packets is the most energy-consuming activity for a sensor node. Thus, finding an energy-efficient routing strategy for transmission of packets becomes of utmost importance. The opportunistic routing (OR) protocol is one of the new routing protocol that promises reliability and energy efficiency during transmission of packets in wireless sensor networks (WSN). In this paper, we propose an intelligent opportunistic routing protocol (IOP) using a machine learning technique, to select a relay node from the list of potential forwarder nodes to achieve energy efficiency and reliability in the network. The proposed approach might have applications including e-healthcare services. As the proposed method might achieve reliability in the network because it can connect several healthcare network devices in a better way and good healthcare services might be offered. In addition to this, the proposed method saves energy, therefore, it helps the remote patient to connect with healthcare services for a longer duration with the integration of IoT services.

Performance of RPL in Healthcare Wireless Sensor Network

The new advances of the Internet of Things (IoT) technology can be utilized to promote service delivery in several real-life applications such as healthcare systems. The Routing Protocol for Low Power and Loss Network (RPL) is a routing protocol designed to serve as a proper routing protocol for packets in Wireless Sensor Networks (WSN). Among the most prominent issues exist in the RPL protocol are packet loss within the WSN and sensors power consumption especially in healthcare WSNs. Multiple Objective Functions (OF) in RPL intended to find the routes from source nodes to a destination node. This paper presents an evaluation to discover which OF is more efficient for a WSN in a healthcare scenario where the Packet Delivery Ratio (PDR) of WSN and the sensors' power consumption are prominent concerns. Expected transmission Count (ETX) and Objective Function Zero (OF0) of RPL were examined in various network densities and network topologies such as the grid and random topology. The simulation outcomes revealed that the OF0 is more efficient regarding the PDR and power consumption compared to the ETX in random

SiMple: A Unified Single and Multi-Path Routing Algorithm for Wireless Sensor Networks With Source Location Privacy

Wireless Sensor Networks (WSNs) experience two different patterns of traffic with different requirements: 1) Event-driven traffic from sensor nodes to the base-station (BS) in the form of single-path uni-cast packets, and 2) Query-driven traffic from BS to sensors that better matches multi-casting and generates multi-path traffic. In this paper, we propose SiMple, a unified algorithm to jointly route single- and multi-path packets in WSNs. SiMple establishes a square destination area to control the degree of path multiplicity as well as the number of intermediate nodes between the source and destination nodes. When performing single-path routing, SiMple considers the direct line connecting source and destination nodes to select the closest sensor node to the line as the next carrier of the packet. Otherwise, SiMple directs packets towards the destination node(s) by exploiting multiple disjoint routes where the number of disjoint routes is controlled by the source node. In addition, SiMple introduces virtual source nodes to hide the location of the real source node, which is needed in asset monitoring applications. The conducted extensive NS-2 simulation experiments for mixed single- and multi-path packets confirm that SiMple results in a higher performance level and consumes lower energy when compared to the case of using two separate algorithms to individually route event and query packets.

Ant Colony Based Data Aggregation in Real Time Wireless Sensor Networks

Sensing the natural phenomenon, sensing the eventual activities, sensing the abrupt change in human developed systems has a wide number of applications. To sense, one needs the tiny sensor devices called sensor nodes. To collect the data from these devices, one has to arrange these tiny devices into a intelligently managed network, called as sensor networks. Due to mostly unattended application areas and zones, these devices are supposed to be wireless which adds one more dimension to our discussion, known as wireless sensor networks. So basically these are an intelligent arrangement of small, tiny sensing devices with wide array of attributes, namely, sensing ability, low communication range mechanism, limited power sources, small processing ability, small memory. With these limitations, even handling a small data generated/sensed in the network becomes crucial to handle. Therefore there has to be an effective data aggregation technique. The prime goal of any data aggregation algorithms is to collect/retrieve/gather the data in an efficient possible way so that the effort to communicate the data over the network can be reduced. Less work from the network means less energy dissipated, thus lifetime can be enhanced. An effective data aggregation technique reduces the latency also. Small network latency is crucial for time critical applications in real time wireless sensor networks. Ant colony based optimization provides us such a possibility to find an optimal route for efficient data aggregation with significantly reduced network latency. In our work, Ant colony based Data Aggregation in Real Time wireless sensor networks (ACDAR), Ants use their pheromones to establish a new path or follow already established path by other ants. Similarly data packets in wireless sensor networks can take advantage of freshly established paths by Route Ants. As the results received, it is verified that number of packets successfully delivered to the sink have increased and the miss ratio, cumulative packets consumption have improved, network latency has decreased.

Smart Clustering LEACH (SC-LEACH) Protocol for Improved Network Survivability in Wireless Sensor Networks

Wireless Sensor Networks (WSN) are becoming increasingly popular by the virtue of its diversified applications. Nevertheless WSN faces various research challenges despite its ease of implementation. One of the major issues of concern is the energy efficiency which is closely related to the lifetime of the network. Low-Energy Adaptive Clustering Hierarchy (LEACH) is proven to be an efficient way to route packets in WSNs. However the performance of the LEACH can be further enhanced by lessening the frequency of cluster reformation. In this paper we propose a novel Smart Clustering LEACH (SC-LEACH) protocol which is an advancement over the traditional LEACH protocol. The results of the proposed algorithm were validated through simulations.

Performability of Retransmission of Loss Packets in Wireless Sensor Networks

Latest progress in wireless communication technology has enabled the development of low-cost sensor networks with major concern on quality of service (QoS) provisioning. Wireless sensor networks (WSNs) can be adopted in various application domains but each use is likely to pose peculiar technical issues. Basically, we demonstrate that congestion, packet loss and delay have strong influence on the performance of WSNs. In order to implement a realistic sensor network policy to resolve the problem of data delay and avoidance of collisions that lead to packet losses, we develop a system that guarantees QoS in WSNs using Fuzzy Logic Controller (FLC) for sensitivity analysis of the effect of adaptive forward error correction (AFEC). The AFEC approach improves the throughput by dynamically tuning FEC subject to the nature of wireless channel loss thereby optimizing throughput, sensor power utilization, while minimizing traffic retransmission, bit error rate (BER), and energy consumption. Basically, parameters such as packet delivery ratio, packet loss, delay, error rate, and throughput are appraised. The system has a spread procedure which is able to schedule the transmission of the nodes in order to have a data flow that converges from the furthest nodes toward the fusion centre. The key benefit of the scenario showed that, after extensive simulation using realistic field data, the procedure permits a practical approach to obtaining optimal solution to loss packets retransmission problem in WSNs giving a strong improvement on QoS provisioning.

Provide A New Algorithm For Encrypting Packets In Wireless Sensor Networks And Authenticating Network Members Using The Bloom Filter

“Network security” and “information security” are mostly used interchangeably. In fact, as the users and staffs do not know much about the security, intruders can easily enter a computer network reaching secret information. Due to the increasing requirement of users to computer networks, the present study aims to present the algorithms and methods to enhance the security of the networks. As a matter of fact, it is tried to increase the security of sending packages according to cryptography algorithms and decrease the package size by compression method. Therefore, traffic load in connection lines will decrease. Besides, authentication is done by bloom filter in this study. It is expected to guarantee the security of sending packages banning intruders to enter the system.

IW-MAC: a invite and wait MAC protocol for power efficient wireless sensor networks

Energy conservation in MAC protocol is a focal point for researchers for a long time. One of the main reasons is that sensor nodes are left unmonitored for a phase of time with only the inbuilt battery as the sole source of energy power. It’s the onus of MAC protocol to efficiently consume this available source of energy. It must be carefully designed in a way there is no wastage of energy source. Control packets in wireless sensor networks not only degrade packet transmission time but also suck out energy from the energy source built in the wireless sensor nodes. When the control packets collide and there is a need resend the control packets it adds up to further energy loss. A better energy efficient MAC protocol must aim at reducing the adoption of control packets following around the network instead give way for data packets to flow around. The energy efficient deteriorates when the nodes undergo too many overhead steps in MAC protocol thereby transmitting lesser packets in given time. In this paper a new protocol namely IWMAC-invite and wait MAC protocol which leverages efficient use of battery power in wireless sensor nodes. With IWMAC the nodes are enabled to transmit minimal control packets and deliver more data packets in a given time. The energy of the nodes are used primarily in actual data transmissions rather than succumbing to overhead of control packets, channel reservation, back off which drains out the energy source in sensor nodes.

Data Gathering With Minimum Number of Relay Packets in Wireless Sensor Networks

The data gathering problem is an important issue in wireless sensor networks (WSNs). In general, mobile elements are used to collect the sensed data of sensors to reduce the problem of unbalanced energy consumption caused by multi-hop transmission. However, in time-sensitive applications of WSNs where mobile elements are used to collect time-sensitive data, we must pay particular attention to the length of the traveling path to ensure that data are still useful after delivered to the sink. In this paper, we focus on how to plan a traveling path that meets the delay requirement of time-sensitive applications for data collection and reduces the amount of relay packets in the WSNs. The proposed algorithm is called Timeliness Traveling Path Planning (TTPP) algorithm. Based on the least squares curve approach, the proposed TTPP algorithm can find the best-fitting curve for any given set of sensors by reducing the amount of relay packets in the WSNs. The effectiveness of the proposed TTPP algorithm is confirmed through extensive simulations.

Improved QoS for Multimedia Transmission using Buffer Management in Wireless Sensor Network

Wireless Sensor Network (WSN) diverts the attention of the research community as it is easy to deploy, self-maintained and does not require predefine infrastructure. These networks are commonly used to broadcast multimedia data from source to destination. However, this kind of data transmission has some challenges, i.e. power and bandwidth limitation with small delay. Art of work mainly focus on optimization either by the shortest route or to minimize the delay by increasing the bandwidth. However, Buffer management is the main constraint to cause delay and loss of packets. In this paper, an approach is presented to manage the buffer and increase the packet delivery ratio (PDR) and reduce delay by assigning the priorities to Intra- coded (I) frame, predictive – coded (P) frame and bidirectional- coded (B) frames dynamically. This approach is very much effective to control the loss of packets in WSN. The presented approach is validated by using Network Simulator 2.

Routing Imperative Data Packets in Wireless Sensor Networks using Congestion Free Path

The congestion problem in Wireless Sensor Networks (WSNS) is quite different from that in traditional networks. Most current congestion control algorithms try to alleviate the congestion by reducing the rate at which the source nodes inject packets into the network. Congestion occurs when too many source nodes are sending data for network to handle. It causes missing of data packets, increases energy efficiency and transmission delay. Transferring crucial data in critical situation is a challenging problem in WSNS. In sensor network two types of paths are constructed for data transmission, they are single path and multi path. Single path data transmission leads to more congestion as all data are send through a single path. Multi path data transmission reduces congestion by sending data based on the urgency. The proposed work dynamically schedules different type of data flow. To assign priority for each data packets it avoids the starvation problem by finding buffer occupancy of each intermediate node by finding the shortest path. Imperative data packets routed using congestion free path with minimum delay in WSNS increase the network throughput and efficiency.

A hybrid beaconless geographic routing for different packets in WSN

The localized operation and stateless features of geographic routing make it become an attractive routing scheme for wireless sensor network (WSN). In this paper, we proposed a novel routing protocol, hybrid beaconless geographic routing (HBGR), which provides different mechanisms for different packets. Based on the requirement of application on latency, we divide the packets of WSN into delay sensitive packets and normal packets. HBGR uses two kinds of Request-To-Send/Clear-To-Send handshaking mechanisms for delay sensitive packets and normal packets, and assigns them different priority to obtain the channel. The simplified analysis is given, which proves that delay sensitive packets have lower latency and higher priority to obtain the channel than normal packets. Moreover, forwarding area division scheme is proposed to optimize the forwarder selection. Simulation results show that HBGR achieves higher packet delivery ratio, lower End-to-End latency and lower energy consumption than existing protocols under different packet generation rates in stationary and mobility scenario. Besides, compared with normal packets, delay sensitive packets have at least 10 % (9 %) improvement in terms of End-to-End latency. The improvement increases with the increasing of packet generation rate, and achieves 58 % (73 %) when the packet generation rate is 24 packets per second in stationary (mobility) scenario.