Search

In this study, we focus on real-time anomaly detection using the gated graph neural network (GGNN) and long short-term memory (LSTM) algorithms for the most commonly used network protocols of HTTP and TELNET. In a network, the flow of the various protocols is determined by their respective roles. Each protocol consists of options with individual tasks, and protocols are processed based on these tasks. Therefore, when analyzing flow, a unique repetitive pattern emerges according to the flow and mission. Accordingly, when an anomaly signal is involved, the pattern shows different characteristics from the existing pattern. This study identifies the flow of input and output values based on the correlation between the options defined at each port, whereby the correlation is analyzed, and the detection accuracy of the anomaly signal is determined using the GGNN and LSTM algorithms. The experimental results demonstrate an accuracy of 99.36% for GGNN and 89.46% for LSTM in detecting network anomalies. [ABSTRACT FROM AUTHOR]

Wireless body sensor network (WBSN) provides a sophisticated monitoring environment without disturbing the daily subject activity. The WBSN increases the mobility of the subject without being restricted inside the hospital environment. However, resources like limited power and transceiver capability limit the movement of the subject. Providing an energy-efficient scheme will provide extended network lifetime and limits the frequency of recharging the battery. This subject condition modelled as a Markov model with normal and abnormal states. The transition from the normal state to abnormal state is predicted through Markov process. The sensor nodes monitoring the subject status remade to sleep state during the reasonable condition, and during the abnormal state, all the nodes awakened. This sleep–wake methodology with priority queuing model is studied in this paper and implemented in MATLAB. The priority queuing model provides a novel solution for time-critical applications. The proposed TCEM-PQM provides reduced time delay when compared to PQM routing protocol. The time delay reduced for critical applications and the policy suits monitoring environment and healthcare applications. The proposed model is simulated with Markov model. [ABSTRACT FROM AUTHOR]

A new region-based energy-conscious sink movement (RESM) is presented to enhance the lifetime of the heterogeneous wireless sensor network using stable election protocol. The movement is based on the total energy of the individual regions of the entire sensing field. The sink always moves to the centre of the lowest nonzero energy region, which is the main contribution of this work. Based on the residual energy of the regions, RESM enhances the network lifetime. Simulation results prove that this approach prolongs the network lifetime as compared to other sink movement methods such as continuous movement in the periphery and the centre as well as other existing algorithms such as LEACH, SEP, and MSE. The lifetime improvement over LEACH, SEP, and MSE is 22%, 5%, and 3%, respectively. [ABSTRACT FROM AUTHOR]

APTEEN is a typical routing protocol for wireless sensor networks, but when clustering, cluster heads are randomly selected, which makes it easy to select nodes with low residual energy as cluster heads, thus forming network holes. At the same time, in multi hop transmission, the cluster head near the sink node is overloaded due to forwarding a large amount of data. Aiming at these problems, this paper introduces PSO algorithm and proposes ADCH-EPE-APTEEN routing protocol. In order to make the particle swarm optimization algorithm more suitable for routing protocol, this paper first proposes DCA-PSO based on particle swarm optimization algorithm. DCA-PSO uses the classification adaptive change inertia weight for different states of particles in the optimization process. At the same time, dynamic learning factor is used to improve the influence of particle experience and other particle experience on convergence speed and to improve the optimization accuracy and speed of the algorithm. Secondly, when APTEEN routing protocol is networked, the cluster head is selected by DCA-PSO, in which the residual energy of nodes, the location of nodes, and the energy distribution around nodes are fully taken into consideration. Thirdly, considering the distance between nodes and the sink node, the residual energy and the energy distribution around nodes, a front area is set up in the cluster located in the upper half and the assistant cluster head is selected in the front area through the DCA-PSO algorithm. The simulation results show that the DCA-PSO algorithm can significantly improve the search speed and precision compared with the PSO algorithm. Compared with APTEEN routing protocol, the ADCH-EPE-APTEEN routing protocol can reduce the network energy consumption rate and extend network lifetime by 173%. [ABSTRACT FROM AUTHOR]

Nodes in original S-MAC protocol just can visit the channel in the scheduling and listening stage. The working schema may result in data latency and high conflict. To solve those above problems, we split scheduling duty into multiple micro-duties. By using different micro-dispersed contention channel, the sensor nodes reduce the collision probability of the data. Aiming at detecting the fixed duty cycle in S-MAC protocol, on the basis of the micro-duty and buffer queue length, this paper presents an adaptive duty cycle and back-off algorithm. While using different back-off algorithm with different duty cycles, sensor node Fast-Binary Exponential Backoff and Conflict-Avoid-Binary exponential Backoff algorithm separated are applied to reduce data latency further reduce the conflict probability. Combining both of the improvements, we propose a modified S-MAC protocol. Comparing the performance of S-MAC protocol and Division-Multiple Access-Media Access Control (MDA-SMAC) protocol on the NS-2 simulation platform, the results show that MDA-SMAC protocol performs better in terms of energy consumption, latency, and effective throughput than S-MAC protocol [ABSTRACT FROM AUTHOR]

Artificial bee colony or ABC is an interesting meta-heuristic algorithm designed to solve various continuous optimization problems. However, it cannot be directly applied to solve discrete problems such as clustering of sensor nodes in the wireless sensor networks (WSNs). For this purpose, in this paper, we present a chaotic discrete version of the ABC algorithm, denoted as chaotic discrete ABC (CDABC). By using the CDABC algorithm, we propose a novel clustering protocol that can be used to organize WSNs into multiple levels of clusters to reduce their energy consumption. The main objective of this protocol is to improve WSN's lifetime by selecting appropriate nodes as cluster heads in each clustering level and reducing the energy costs of the inter-cluster and intra-cluster communications. Extensive simulations results validate the effectiveness of the proposed CDABC-based multi-level clustering protocol in improving the network lifetime. [ABSTRACT FROM AUTHOR]

The advent of wireless sensor networks (WSNs) has revolutionized the field of smart applications. In order to improve the performance of WSNs, refinement of clustering and routing protocols can make a vast difference. Existing classical and evolutionary optimization technique-based protocols have high computational complexity since clustering and routing problems are solved separately. Moreover, these protocols suffer from hot-spot problem due to uneven formation of clusters. In this paper, we propose a multi-level clustering protocol (MLCP) for energy-efficient data gathering in large-scale WSNs. Additionally, a hierarchical clustering architecture is designed in MLCP to jointly solve the problems of clustering and routing. Further, for the purpose of cluster head selection, a hybrid dragonfly algorithm-based particle swarm optimization technique is proposed which combines the exploration and exploitation capabilities of dragonfly algorithm and particle swarm optimization, respectively. MLCP considers intra-cluster distance, node degree and inter-cluster distance for the formation of scalable, load-balanced and energy-efficient clusters. To demonstrate the full potential of MLCP, network simulations have been carried out in diverse network conditions. MLCP has shown up to 90% increase in the network lifetime and an improvement of 19.36% in conservation of energy in comparison with the competent protocols. The comparison of obtained results with state-of-the-art clustering protocols clearly establishes the superiority of MLCP in achieving load-balanced, scalable and energy-efficient clustering. [ABSTRACT FROM AUTHOR]

Runtime validation of wireless protocol implementations cannot always employ direct instrumentation of the device under test (DUT). The DUT may not implement the required instrumentation, or the instrumentation may alter the DUT’s behavior when enabled. Wireless sniffers can monitor the DUT’s behavior without instrumentation, but they introduce new validation challenges. Losses caused by wireless propagation prevent sniffers from perfectly reconstructing the actual DUT packet trace. As a result, accurate validation requires distinguishing between specification deviations that represent implementation errors and those caused by sniffer uncertainty. We present a new approach enabling sniffer-based validation of wireless protocol implementations. Beginning with the original protocol monitor state machine, we automatically and completely encode sniffer uncertainty by selectively adding non-deterministic transitions. We characterize the NP-completeness of the resulting decision problem and provide an exhaustive algorithm for searching over all mutated traces. We also present practical protocol-oblivious heuristics for searching over the most likely mutated traces. We have implemented our framework and show that it can accurately identify implementation errors in the face of uncertainty. [ABSTRACT FROM AUTHOR]

Mobile ad hoc networks (MANETs) are mobile networks, which are automatically outspread on a geographically limited region, without requiring any preexisting infrastructure. Mostly, nodes are both self-governed and self-organized without requiring a central monitoring. Because of their distributed characteristic, MANETs are vulnerable to a particular routing misbehavior, called wormhole attack. In wormhole attack, one attacker node tunnels packet from its position to the other attacker nodes. Such wormhole attack results in a fake route with fewer hop count. If source node selects this fictitious route, attacker nodes have the options of delivering the packets or dropping them. For this reason, this paper proposes an improvement over AODV routing protocol to design a wormhole-immune routing protocol. The proposed protocol called defending against wormhole attack (DAWA) employs fuzzy logic system and artificial immune system to defend against wormhole attacks. DAWA is evaluated through extensive simulations in the NS-2 environment. The results show that DAWA outperforms other existing solutions in terms of false negative ratio, false positive ratio, detection ratio, packet delivery ratio, packets loss ratio and packets drop ratio. [ABSTRACT FROM AUTHOR]

Population protocols (Angluin et al. in PODC, 2004) are a formal model of sensor networks consisting of identical mobile devices. Two devices can interact and thereby change their states. Computations are infinite sequences of interactions satisfying a strong fairness constraint. A population protocol is well specified if for every initial configuration C of devices, and every computation starting at C, all devices eventually agree on a consensus value depending only on C. If a protocol is well specified, then it is said to compute the predicate that assigns to each initial configuration its consensus value. While the computational power of well-specified protocols has been extensively studied, the two basic verification problems remain open: Is a given protocol well specified? Does a given protocol compute a given predicate? We prove that both problems are decidable by reduction to the reachability problem of Petri nets. We also give a new proof of the fact that the predicates computed by well-defined protocols are those definable in Presburger arithmetic (Angluin et al. in PODC, 2006). [ABSTRACT FROM AUTHOR]

In this paper, we propose Balanced Energy-Efficient Network Integrated Super Heterogeneous (BEENISH), improved BEENISH (iBEENISH), Mobile BEENISH (MBEENISH), and improved Mobile BEENISH (iMBEENISH) protocols for heterogeneous wireless sensor networks (WSNs). BEENISH considers four energy levels of nodes and selects cluster heads (CHs) on the base of residual energy levels of nodes and average energy level of the network, whereas iBEENISH dynamically varies the CHs selection probability in an efficient manner leading to increased network lifetime. We also present a mathematical sink mobility model and validate this model by implementing it in BEENISH (resulting in MBEENISH) and iBEENISH (resulting in iMBEENISH). Finally, simulation results show that BEENISH, MBEENISH, iBEENISH, and iMBEENISH protocols outperform contemporary protocols in terms of stability period, network lifetime, and throughput. [ABSTRACT FROM AUTHOR]

Target tracking applications in wireless sensor networks need to achieve energy efficiency, tracking accuracy, and certain real-time constraints in response to fast-moving targets. From a layer view, an energy-efficient cross-layer communication protocol that consists of a medium access control layer and network routing layer is necessary for joint optimization. Due to the interference and contention over the wireless medium, the limited resources of battery-operated sensor nodes, and the dynamic topology of large-scale networks, this cross-layer design becomes a challenging task. In this research, we exploit a cluster routing algorithm over large-scale networks and propose a low-duty-cycle medium access control (MAC) algorithm to reduce collision, idle-listening, and overhearing. In addition, our work focuses on the joint optimization of routing and a MAC strategy for achieving a good trade-off between low delay, energy efficiency, and tracking accuracy. To deploy this protocol in a real tracking application, we also propose a clustering synchronization procedure that does not require distributing the global timing information over the complete network to achieve network-wide time synchronization. An analytical model and extensive simulations are proposed to evaluate and compare the performance of our work with existing protocols. Simulation and analysis results show that our approach achieves better communication delay and thus better tracking error while maintaining reasonable energy consumption compared to other cases. [ABSTRACT FROM AUTHOR]

EA-MAC protocol is proposed on the basis of SMAC protocol to remedy the shortcomings of SMAC. In the EA-MAC, node correlation analysis algorithm and traffic adaptive duty cycle mechanism are added. Meanwhile, the residual energy is introduced into the existing traffic adaptive back-off mechanism to measure the saving efficiency. In the node correlation algorithm, all network nodes are divided into several areas by computing node correlation according to the collected information. The clustering mechanism is applied for choosing representative node in each area for transmitting data. This method can effectively reduce redundant nodes transmitting duplicate data. In traffic adaptive duty cycle mechanism, the duty cycle is regulated dynamically to decrease idle listening by comparing the threshold set with the flow value obtained from the predict flow model. In back-off mechanisms, by adjusting the value of contention window and back-off time, data collisions can be effectively avoided when network traffic is heavy. In addition, nodes with more remaining energy have priority to access the channel and have shorter back-off time, which can keep the balance of the whole network energy consumption and lengthen network lifetime. Simulation results show that the EA-MAC protocol has better energy saving, throughput, shorter delay performance, and low packet loss rate than that of SMAC protocol in dynamic traffic sensor networks. [ABSTRACT FROM AUTHOR]

Achieving same notion of time remains an important task for most distributed systems. Time synchronization requires a unique combination of high accuracy ( $$\upmu $$ s level) and energy efficiency. Several application layer protocols have been developed to meet these requirements. This article proposes that the physical layer clock recovery process can provide application layer clock drift estimate, and the application layer clock can be corrected with the help of this estimate. This eliminates the need of application layer time synchronization protocol i.e. the cross-layer approach reduces the number of message exchanges required by application layer for time synchronization that leads to energy conservation. It argues that such a cross-layer approach can provide a more accurate frequency offset estimation, or can achieve greater energy savings, for a given accuracy, by reducing the message exchanges. Analysis of the proposed method provides concrete bounds on achieved improvement. Experimental evaluation showed that physical layer clock drift can be used to correct application layer clock drift as they are identical. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) have recently extended application areas to numerous sectors such as industrial automation, military applications, transportation systems, building management, and environment surveillance. In particular, WSNs provide flexible, reliable, cost-effective solutions to monitor the real-time status of automated manufacturing facilities. A facility-specific WSN for reliable monitoring and efficient management of industrial facilities is called the facility sensor network (FSN). In general, industrial facilities run various electromagnetic devices causing electromagnetic interference (EMI), which disturbs wireless data communication. To obtain accurate and reliable data in such environments, the FSN needs to deal with the EMI by proper deployment of sensor nodes and their validation and fusion. This paper proposes a data processing protocol, called Interfered Sensor Data Processing Protocol (ISDPP) to handle the EMI affecting wireless communication. ISDPP is developed with a data fusion algorithm and an exponentially weighted moving average/fuzzy logic-based error detection method to obtain reliable information from the FSN. To evaluate the performance, experiments in various settings are performed in a test-bed manufacturing facility. The experimental results indicate the interfered data, and outliers can be filtered out even if unexpected interferences occur in the facility. The FSN with the ISDPP can provide efficient real-time monitoring solutions for various industrial applications. [ABSTRACT FROM AUTHOR]

power- and delay-efficient routing algorithm and emergency-efficient protocol of ubiquitous wireless sensor network systems for silver town applications is presented. For this protocol, a fixed node (without any limited resources) is established at one point which can communicate with one-hop to both the sink node and the mobile sensor nodes in the dark region (in which mobile sensor nodes cannot communicate to the sink node). The fixed nodes are operated like the fixed cluster head. The simulated lifetime of the proposed routing algorithm is longer than those of LEACH and HEED and the simulated time delay of the proposed routing algorithm is faster than those of LEACH and HEED when the three protocols are applied to a specific silver town environment. [ABSTRACT FROM AUTHOR]

The problem of collaborative tracking of mobile nodes in wireless sensor networks is addressed. By using a novel metric derived from the energy model in LEACH (W.B. Heinzelman, A.P. Chandrakasan and H. Balakrishnan, Energy-Efficient Communication Protocol for Wireless Microsensor Networks, in: Proceedings of the 33rd Hawaii International Conference on System Sciences (HICSS '00), 2000) and aiming at an efficient resource solution, the approach adopts a strategy of combining target tracking with node selection procedures in order to select informative sensors to minimize the energy consumption of the tracking task. We layout a cluster-based architecture to address the limitations in computational power, battery capacity and communication capacities of the sensor devices. The computation of the posterior Cramer-Rao bound (PCRB) based on received signal strength measurements has been considered. To track mobile nodes two particle filters are used: the bootstrap particle filter and the unscented particle filter, both in the centralized and in the distributed manner. Their performances are compared with the theoretical lower bound PCRB. To save energy, a node selection procedure based on greedy algorithms is proposed. The node selection problem is formulated as a cross-layer optimization problem and it is solved using greedy algorithms. [ABSTRACT FROM AUTHOR]

Recently, researchers and practitioners in wireless sensor networks (WSNs) are focusing on energy-oriented communication and computing considering next-generation smaller and tiny wireless devices. The tiny sensor-enabled devices will be used for the purpose of sensing, computing, and wireless communication. The hundreds/thousands of WSNs sensors are used to monitor specific activities and report events via wireless communication. The tiny sensor-enabled devices are powered by smaller batteries to work independently in distributed environments resulting in limited maximum lifetime of the network constituted by these devices. Considering the non-uniform distribution of sensor-enabled devices in the next-generation mobility centric WSNs environments, energy consumption is imbalanced among the different sensors in the overall network environments. Toward this end, in this paper, a cluster-oriented routing protocol termed as prediction-oriented distributed clustering (PODC) mechanism is proposed for WSNs focusing on non-uniform sensor distribution in the network. A network model is presented, while categorizing PODC mechanism in two activities including setting cluster of nodes and the activity in the steady state. Further cluster set up activity is described while categorizing in four subcategories. The proposed protocol is compared with individual sensor energy awareness and distributed networking mode of clustering (EADC) and scheduled sensor activity-based individual sensor energy awareness and distributed networking mode of clustering (SA-ADC). The metrics including the overall lifetime of the network and nodes individual energy consumption in realistic next-generation WSNs environments are considered in the experimental evaluation. The results attest the reduced energy consumption centric benefits of the proposed framework PODC as compared to the literature. Therefore, the framework will be more applicable for the smart product development in the next-generation WSNs environments. [ABSTRACT FROM AUTHOR]

In this paper, the existing ad hoc on demand multipath distance vector (AOMDV) routing scheme for vehicular ad hoc networks (VANETs) is extended to a reliable low-latency multipath routing (RLLMR) scheme based on multipath link reliability, capable of determining the reliable routes preemptively. Here, the link reliability refers to the probability that a direct transmission link among any two vehicles remains constantly available for a specific period of time, which can be computed based on the position, route, and velocity of the vehicles to facilitate the reliable routing process in VANETs. In the proposed RLLMR scheme, the mathematical distribution of vehicles movements and link breakages is also considered to increase the reliability of the vehicular networks. The simulation results show that proposed RLLMR scheme performs better compared to existing schemes in terms of latency, reliability, throughput, and energy consumption at the cost of marginally increased routing overhead. [ABSTRACT FROM AUTHOR]

This study aims to solve time-space uncertainties due to the narrow network channel bandwidth and long transmission delay of an underwater acoustic sensor network when a node is using a channel. This study proposes a MAC protocol (BSPMDP-MAC) for an underwater acoustic sensor network based on the belief state space. This protocol can averagely divide the time axis of a sensor’s receiving nodes into n slots. The action state information of a sensor’s transmission node was divided by the grades of link quality and the residual energy of each node. The receiving nodes would obtain the decision strategy sequence of the usage rights of the competitive channels of the sensor’s transmission nodes according to the joint probability distributions of historical observations and action information of channel occupancy. The transmission nodes will transmit data packets to the receiving nodes in turns in allocated slots, according to the decision strategy sequence, and the receiving nodes will predict the channel occupancy and perceive the belief states and access actions in the next cycle, according to the present belief states and actions. These experimental simulation results show that this protocol can reduce the collision rate of data packets, improve the network throughput and transmission success rate of data packets, and reduce the energy overhead of the network. [ABSTRACT FROM AUTHOR]

Due to the limited energy of the sensor nodes, the unreasonable clustering routing algorithm will cause node premature death and low utilization of energy efficiency in wireless sensor network (WSN). In Adaptive Threshold-sensitive Energy Efficient Network (APTEEN), the assignments of the cluster head (CH) are much heavier than other nodes. The CH unbalanced energy dissipation between nodes that make them die prematurely. Ant colony algorithm can avoid this problem, so this paper presents a double cluster heads Adaptive Threshold-sensitive Energy Efficient Network based on ant colony (ADCAPTEEN). ADCAPTEEN optimizes the cluster head election method compared with APTEEN. It suggests that one master cluster head (MCH) and one vice cluster head (VCH) will be selected in each cluster. The double cluster heads (DCH) can co-work on data collection, fusion, transition, etc. To make routes more stable and energy efficient, this paper proposes a Multiple Adaptive Threshold-sensitive Energy Efficient Network based on Ant-colony (AMAPTEEN). It is the optimization of ADCAPTEEN. And CH selects intermediate node (IM_node) multiple times with ant colony algorithm per round in each cluster, and this way forms multiple route transmission data. Simulation in OPNET proves that compared with APTEEN, ADCAPTEEN reduces energy dissipation, improves node survival rate, and extends network life cycle. AMAPTEEN delays the time of node death, balances energy consumption, and extends network lifetime further operating in the same settings compared with ADCAPTEEN. The proposed two algorithms have good scalability, and they are suitable for large-scale network. [ABSTRACT FROM AUTHOR]

In this paper, we consider the beam-domain hybrid time-switching (TS) and power-splitting (PS) simultaneous wireless information and power transfer (SWIPT) protocol design in full-duplex (FD) massive multiple-input multiple-output (MIMO) system, where the FD base station (BS) simultaneously serves a set of downlink half-duplex (HD) users (cellular users) and a set of fixed uplink HD users (fixed sensor nodes) which are uniformly distributed in its coverage area. In order to reduce the computational complexity, we investigate the beam-domain representation of massive MIMO channels based on the basis expansion model, and then the beam-domain SWIPT protocol which lies in intelligently scheduling the users and sensors based on the beam-domain distributions of their associated channels to mitigate SI and enhance transmission efficiency is designed for full-duplex massive MIMO system. The whole beam-domain hybrid TS and PS SWIPT protocol is divided into two phases based on the ideal of TS. The first phase is used for cellular users uplink training and sensor nodes energy harvesting as well as downlink training, wherein the cellular users transmit uplink pilots for uplink channel estimation at the BS, while the BS simultaneously transmits energy signals to the sensor nodes. Based on the idea of PS, the sensor nodes utilize the received energy signals for energy harvesting and downlink channel estimation. In the second phase, the BS forms the transmit beamformers for information transmission to the users as well as the receive beamformers for the sensors transmit their data to the BS simultaneously. By optimizing the TS ratio and transmit powers at the BS in two phases, the system achievable sum rate performance is maximized. Simulation results show the superiority of the proposed protocol on spectral efficiency compared with the existing massive MIMO SWIPT protocol. [ABSTRACT FROM AUTHOR]