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]

In the current research on data query for two-tiered WSN, the privacy-preservation range query is one of the hotspots. However, there are some problems in the existing researches in two-tiered wireless sensor networks such as high computational and communication costs for security comparison items and high energy consumption of sensing nodes. In this paper, a privacy-preservation range query protocol based on the integration reversal 0-1 encoding with Bloom filter is researched and designed. In the sensing data submission stage, the optimized reversal 0-1 encoding, HMAC algorithm, AES encryption algorithm and variable-length Bloom filter are used for generating the maximum–minimum comparison encoding and constructing a shorter verification index chain to reduce computational and communication costs of sensing nodes; in the private data range query stage, the base station uses the HMAC algorithm to convert the plaintext query range into the ciphertext query range and sends it to the storage node. In the storage node, the bitmap encoding information of the verification index chain is calculated with the comparison rule of the reversal 0-1 encoding and it is returned to the base station together with the verification index chain and the data ciphertext that compliance with the query rule; in the data integrity verification stage, the integrity of the query results using the verification index chain and bitmap encoding is verified at the base station. In the experimental section, the Cortex-M4 development board equipped with the Alios-Things operating system as sensing node and the Cortex-A9 development board equipped with the Linux operating system as storage node are implemented in this protocol, which is compared with the existing protocols in three aspects: the number of data collected in each cycle, the length of data and the number of data dimensions. The experimental results show that the energy consumption of this protocol is lower under the same experimental environment. [ABSTRACT FROM AUTHOR]

Introduction-- Smart irrigation systems require reliable and energy-efficient communication between the sensors in a Wireless Sensor Network (WSN) and the control system. Objective-- To address this challenge, this paper presents several cluster-based selection protocols, based on the Stable Election Protocol (SEP) and Distributed Energy-Efficient Clustering (DEEC). Methodology-- The presented protocols divide the agriculture field into sub-fields to reduce energy consumption between far sensors and the Base Station (BS). Results-- Comparison with traditional protocols using evaluation metrics such as network throughput, stability, instability period, and lifetime, shows that the presented protocols outperform in terms of all metrics. Conclusions-- The results indicate the effectiveness of the proposed protocols in prolonging the network's lifetime and improving energy efficiency in heterogeneous WSNs, thus supporting the performance of smart irrigation systems. Numerically, using the proposed protocols, the network lifetime increased by 23% compared to conventional SEP. [ABSTRACT FROM AUTHOR]

In order to improve the data monitoring and information management capabilities of membrane gas measure device indirect metering terminals, a sensor network based data monitoring method for membrane gas measure device indirect metering terminals was proposed. The distributed and centralized sensor network node deployment method is used to achieve data collection for membrane gas measure device indirect metering terminals, and the collected membrane gas measure device indirect metering terminal data is segmented, fused, and reorganized. The distributed energy storage and constant volume two-level optimal control method is used to analyze the operation status of gas measure device indirect metering terminal data. The ZigBee networking protocol is used to build a network structure model for gas measure device indirect metering terminals, an integrated high-precision temperature and pressure sensor arranged parallel to the inner wall of the valve body is used to detect the temperature and pressure at the outlet of the membrane gas measure device. The temperature information is stored in DSP, and the user's expenses, system operation and maintenance, and peak shaving and valley filling benefits are taken as the parameters of the energy storage and constant volume outer layer model. The output stability of the indirect metering terminal data of the membrane gas measure device is analyzed in the high switching frequency mode. Combined with adaptive parameter adjustment, the indirect metering terminal control and data dynamic collection of the membrane gas measure device are realized. Realize dynamic monitoring of metering terminal data in wireless sensor network networking control mode. The test results show that using this method for indirect metering terminal data monitoring of gas measure devices has good output stability, strong dynamic fusion of sensing information, reduced metering errors, and improved metering accuracy of gas measure devices. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks consist of a number of low cost, small sensor nodes powered by energy constrained batteries. Due to limited power, memory, and processing capacities of sensor nodes, it is essential to find new methods which improves energy consumption of the nodes and prolongs the lifetime of the network. Cluster head election among sensor nodes has an important role in wireless sensor networks to boost efficiency and lifetime of the network. In this study, a cluster head election method has been proposed and evaluated for heterogeneous wireless sensor networks, which extends the lifetime of the network. Simulation results reveal that the proposed cluster head election method offers a better performance than the SEP and LEACH protocols in terms of network lifetime and is able to provide throughput for a longer period of time. It is found that EECHEP provides efficient use of sensor energy and helps increase the number of surviving cluster head nodes that report to the base station. [ABSTRACT FROM AUTHOR]

Acoustic energy mapping provides the functionality to obtain characteristics of acoustic sources, as: presence, localization, type and trajectory of sound sources. Several beamforming-based techniques can be used for this purpose. However, they rely on the difference of arrival times of the signal at each capture node (or microphone), so it is of major importance to have synchronized multi-channel recordings. A Wireless Acoustic Sensor Network (WASN) can be very practical to install when used for mapping the acoustic energy of a given acoustic environment. However, they are known for having low synchronization between the recordings from each node. The objective of this paper is to characterize the impact of current popular synchronization methodologies as part of the WASN to capture reliable data to be used for acoustic energy mapping. The two evaluated synchronization protocols are: Network Time Protocol (NTP) y Precision Time Protocol (PTP). Additionally, three different audio capture methodologies were proposed for the WASN to capture the acoustic signal: two of them, recording the data locally and one sending the data through a local wireless network. As a real-life evaluation scenario, a WASN was built using nodes conformed by a Raspberry Pi 4B+ with a single MEMS microphone. Experimental results demonstrate that the most reliable methodology is using the PTP synchronization protocol and audio recording locally. [ABSTRACT FROM AUTHOR]

Underwater acoustic sensor networks (UASNs) are challenged by the dynamic nature of the underwater environment, large propagation delays, and global positioning system (GPS) signal unavailability, which make traditional medium access control (MAC) protocols less effective. These factors limit the channel utilization and performance of UASNs, making it difficult to achieve high data rates and handle congestion. To address these challenges, we propose a reinforcement learning (RL) MAC protocol that supports asynchronous network operation and leverages large propagation delays to improve the network throughput.he protocol is based on framed ALOHA and enables nodes to learn an optimal transmission strategy in a fully distributed manner without requiring detailed information about the external environment. The transmission strategy of sensor nodes is defined as a combination of time-slot and transmission-offset selection. By relying on the concept of learning through interaction with the environment, the proposed protocol enhances network resilience and adaptability. In both static and mobile network scenarios, it has been compared with the state-of-the-art framed ALOHA for the underwater environment (UW-ALOHA-Q), carrier-sensing ALOHA (CS-ALOHA), and delay-aware opportunistic transmission scheduling (DOTS) protocols. The simulation results show that the proposed solution leads to significant channel utilization gains, ranging from 13% to 106% in static network scenarios and from 23% to 126% in mobile network scenarios.oreover, using a more efficient learning strategy, it significantly reduces convergence time compared to UW-ALOHA-Q in larger networks, despite the increased action space. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are considerably used for various environmental sensing applications. The architecture and internal specifications of WSNs have been chosen based on the requirements of particular applications. On this basis, WSNs consist of resource (energy and memory)-limited wireless sensor nodes. WSNs initiate data communication from source to destination via physical layer management principles, channel slot scheduling principles (time division multiple access), wireless medium access control (WMAC) protocols, wireless routing protocols and application protocols. In this environment, the development of WMAC principles, routing protocols and channel allotment schemes play crucial roles in network communication phases. Consequently, these layering functions consume more energy at each sensor node, which leads to minimal network lifetime. Even though the channel management schemes, medium control protocols and routing protocols are functionally suitable, the excessive energy consumption affects the overall network performance. In this situation, energy optimization algorithms are advised to minimize the resource wastage of WSNs during regular operations (medium control and routing process). Many research works struggle to identify the optimal energy-efficient load balancing strategies to improve WSN functions. With this in mind, the proposed article has conducted a detailed literature review and notable experimental comparisons on energy-efficient MAC protocols, channel scheduling policies and energy-efficient routing protocols. To an extent, the detailed analysis over these wireless network operations helps to understand the benefits and limitations of recent research works. In the experimental section of this article, eight existing techniques are evaluated under energy optimization strategies (WMAC, channel allocation, sleep/wake protocols, integrated routing and WMAC policies, balanced routing and cooperative routing). The proposed review and the classified technical observations collected from notable recent works have been recognized as crucial contributions. The results infer the suggestions for feasible WSN communication strategies with optimal channel management policies and routing policies. Notably, the simulation results show that cross-layer or multi-layer energy optimization policies perform better than homogeneous energy optimization models. [ABSTRACT FROM AUTHOR]

In the Industry 4.0 era, with the continuous integration of industrial field systems and upper-layer facilities, interconnection between industrial wireless sensor networks (IWSNs) and industrial Internet networks is becoming increasingly pivotal. However, when deployed in real industrial scenarios, IWSNs are often connected to legacy control systems, through some wired industrial network protocols via gateways. Complex protocol translation is required in these gateways, and semantic interoperability is lacking between IWSNs and the industrial Internet. To fill this gap, our study focuses on realizing the interconnection and interoperability between an IWSN and the industrial Internet. The Open Platform Communications Unified Architecture (OPC UA) and joint publish/subscribe (pub/sub) communication between the two networks are used to achieve efficient transmission. Taking the Wireless Networks for Industrial Automation Process Automation (WIA-PA), a typical technology in IWSNs, as an example, we develop a communication architecture that adopts OPC UA as a communication bridge to integrate the WIA-PA network into the industrial Internet. A WIA-PA virtualization method for OPC UA pub/sub data sources is designed to solve the data mapping problem between WIA-PA and OPC UA. Then, the WIA-PA/OPC UA joint pub/sub transmission mechanism and the corresponding configuration mechanism are designed. Finally, a laboratory-level verification system is implemented to validate the proposed architecture, and the experimental results demonstrate its promising feasibility and capability. [ABSTRACT FROM AUTHOR]

A distinct security protocol is necessary for the exponential growth in intelligent edge devices. In particular, the autonomous devices need to address significant security concern to function smoothly in the high market demand. Nevertheless, exponential increase in the connected devices has made cloud networks more complex and suffer from information processing delay. Therefore, the goal of this work is to design a novel server-less mutual authentication protocol for the edge networks. The aim is to demonstrate an autonomous mutual authentication amongst the connected smart devices within the edge networks. The solution addresses applications of autonomous cars, smart things, and Internet of Things (IoT) devices in the edge or wireless sensor networks (WSN), etc. In this paper, the design proposes use of a public-key system, octet-based balanced-tree transitions, challenge–response mechanism, device unique ID (UID), pseudo-random number generator (PRNG), time-stamps, and event specific session keys. Ultimately, server-less design requires less infrastructure and avoids several types of network-based communication attacks, e.g., impersonating, Man in the middle (MITM), IoT-DDOS, etc. Additionally, the system overhead is eliminated by no secret key requirements. The results provide sufficient evidence about the protocol market competitiveness and demonstrate better benchmark comparison results. [ABSTRACT FROM AUTHOR]

Underwater wireless sensor networks (UWSNs) contain sensor nodes that sense the data and then transfer them to the sink node or base station. Sensor nodes are operationalized through limited-power batteries. Therefore, improvement in energy consumption becomes critical in UWSNs. Data forwarding through the nearest sensor node to the sink or base station reduces the network's reliability and stability because it creates a hotspot and drains the energy early. In this paper, we propose the cooperative energy-efficient routing (CEER) protocol to increase the network lifetime and acquire a reliable network. We use the sink mobility scheme to reduce energy consumption by eliminating the hotspot issue. We have divided the area into multiple sections for better deployment and deployed the sink nodes in each area. Sensor nodes generate the data and send it to the sink nodes to reduce energy consumption. We have also used the cooperative technique to achieve reliability in the network. Based on simulation results, the proposed scheme performed better than existing routing protocols in terms of packet delivery ratio (PDR), energy consumption, transmission loss, and end-to-end delay. [ABSTRACT FROM AUTHOR]

In the era of expansion of smart sensing interconnected devices and their growing application in complex systems, the application of wireless communication technology becomes evident. Many wireless technologies are developed to facilitate the growth of systems such as the Internet of Things and Smart Cities. The application of a particular wireless technology in a particular system depends on many factors, such as purpose, requirements, complexity, range, and node deployment. IEEE 802.15.4 is a technical standard that defines the operation of low-rate wireless personal area networks. It is used as the basis for a group of network standards and protocols designed for wireless sensor networks. In this article, the basic features of the emerging IEEE 802.15.4g SUN low-powered wireless network standard, its application scenarios, and performance analyses are presented. [ABSTRACT FROM AUTHOR]

Clustering is one of the most energy-efficient techniques for extending the lifetime of wireless sensor networks (WSNs). In a clustered WSN, each sensor node transmits the data acquired from the sensing field to the leader node (cluster head). The cluster head (CH) is in charge of aggregating and routing the collected data to the Base station (BS) of the deployed network. Thereby, the selection of the optimum CH is still a crucial issue to reduce the consumed energy in each node and extend the network lifetime. To determine the optimal number of CHs, this paper proposes an Enhanced Fuzzy-based LEACH (E-FLEACH) protocol based on the Fuzzy Logic Controller (FLC). The FLC system relies on three inputs: the residual energy of each node, the distance of each node from the base station (sink node), as well as the node's centrality. The proposed protocol is implemented using the Castalia simulator in conjunction with OMNET++, and simulation results indicate that the proposed protocol outperforms the traditional LEACH protocol in terms of network lifetime, energy consumption, and stability. [ABSTRACT FROM AUTHOR]

The low-rate denial of service (LDoS) attack mainly exploits security vulnerabilities of adaptive mechanisms in network protocols and application services. The high-rate attack pulses within a short time interval are sent periodically, which will result in the degradation of service quality. The attack traffic is similar to normal traffic from legitimate users in the network, consequently, it is easy to escape the traditional detection methods because of its intermittence. Research works have demonstrated that there are fractal characteristics (self-similarity) of the network traffic over the large scale of time. Although the fractal characteristics of the network traffic will be changed under the LDoS attack, the variations of the fractal characteristics in some network states are not apparent in real-time detection. Based on the fractal characteristics, the fractal residual of the network traffic is analyzed through the Hurst parameters calculating process by R/S algorithm in this article. It can be found that the fractal residual of the network traffic can better reflect the different states of the LDoS attack. Combining the idea behind the sliding window, a novel fractal residual based real-time detection (FR-RED) method of the LDoS attack is proposed. The effectiveness of the method in this article is verified by performing some experiments on two platforms, the NS2 and test-bed. The results manifest the beginning and end of the LDoS attack can be estimated in real-time with high detection accuracy. [ABSTRACT FROM AUTHOR]

Leach (low energy adaptive clustering hierarchy) algorithm is a self-clustering topology algorithm. Its execution process is cyclical. Each cycle is divided into two phases: cluster building phase and stable data communication phase. In the stage of cluster building, the adjacent nodes cluster dynamically and randomly generate cluster heads. In the data communication phase, the nodes in the cluster send the data to the cluster head, and the cluster head performs data fusion and sends the results to the aggregation node. Because the cluster head needs to complete data fusion, communication with the convergence node and other works, the energy consumption is large. Leach algorithm can ensure that each node acts as cluster head with equal probability, so that the nodes in the network consume energy relatively evenly. The basic idea of Leach algorithm is to randomly select cluster head nodes in a circular way. It evenly distributes the energy load of the whole network to each sensor node in the network. It can reduce network energy consumption and improve network life cycle. Leach repeatedly performs cluster refactoring during its operation. This paper studies the parameter detection of wireless sensor network based on Leach algorithm on the on-chip embedded debugging system. Because the classical low-power adaptive clustering layered protocol (Leach) has the problem of energy imbalance and short node life cycle, this paper uses embedded debugging technology based on Leach algorithm and the residual energy and position of nodes in wireless sensor networks were tested for research. This Leach algorithm uses the concept of wheel. Each round consists of two phases: initialization and stabilization. In the initialization stage, each node generates a random number between 0 and 1. If the random number generated by a node is less than the set threshold T (n), the node publishes a message that it is a cluster head. Through the research on the parameter detection, the simulation results show that the research in this paper has good feasibility and rationality. [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]

The development of wireless sensor and actuator network is leading to high complexity networks and subsequently, new challenges in task assignment for effective sensor–actuator coordination. This article proposes an adaptive auction protocol for task assignment in multi-hop wireless actuator networks, considering a scenario where all actuators are immobile and each of them can obtain the target information from sensors. Unlike existing methods that neglect the adaptive auction area required by dynamic networks, the proposed method uses an adaptive factor k o (reflects the adaptive auction area) that is deduced based on the relation between network characteristics and protocol performance. Simulation results show that the adaptive protocol can dynamically change the auction area during the network operation. In addition, comparison with existing methods, such as simple auction protocol, 1 hop simple auction aggregation protocol, and 1 hop simple auction aggregation protocol greedy extension, shows that the adaptive auction protocol can choose the optimal solution at a low communication cost with a high probability, irrespective of the changes in the network. [ABSTRACT FROM AUTHOR]

Nodes in a wireless sensor network are normally constrained by hardware and environmental conditions and face challenges of reduced computing capabilities and system security vulnerabilities. This fact calls for special requirements for network protocol design, security assessment models, and energy-efficient algorithms. Data aggregation is an effective energy conservation technique, which removes redundant information from the data aggregated from neighbor sensor nodes. How to further improve the effectiveness of data aggregation plays an important role in improving data collection accuracy and reducing the overall network energy consumption. Unfortunately, sensor nodes are normally deployed in an open environment and thus are subject to various attacks conducted by adversaries. Consequently, data aggregation brings new challenges to wireless sensor network security. In this article, we propose a novel secure data aggregation solution based on autoregressive integrated moving average model, a time series analysis technique, to prevent private data from being learned by adversaries. We leverage the autoregressive integrated moving average model to predict the data volume in sensor nodes, and update and synchronize the model as needed. The experimental results demonstrate that our model provides accurate predictions and that, compared with competing methods, our solution achieves better security, lower computation and communication costs, and better flexibility. [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]

In the current scenario, around 35 billion Internet of Things (IoT) devices is connected to the internet. By 2025, it is predicted that the number will grow between 80 and 120 billion devices connected to the internet, supporting to generate 180 trillion gigabytes of new sensor data that year. The IoT sensor data is generated from various heterogeneous devices, communication protocols, and data formats that are enormous in nature. This huge amount of sensor data is unable to acquire and analyze manually. This is a significant problem for IoT application developers to make the integration of IoT sensor data automatically. However, the large amount of data has led to the inadequacy of the manual data acquisition and stressed the urgency into the research of IoT based frameworks in automatic. In this paper, we have proposed a framework for IoT sensor data acquisition and analysis (FSDAA). The FSDAA has been implemented on the ThingSpeak IoT Cloud platform for data analysis and visualizations, and compared with the state of the art schemes. Finally, the results show that the proposed FSDAA is efficient in terms of Accuracy, Precision, Recall, and F-measure. [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]

A natural basis for the detection of a wireless random reactive jammer (RRJ) is the perceived violation by the detector [typically located at the access point (AP)] of the carrier sensing protocol underpinning many wireless random access protocols (e.g., Wi-Fi). Specifically, when the wireless medium is perceived by a station to be busy, a carrier sensing compliant station will avoid transmission, while an RRJ station will often initiate transmission. However, hidden terminals (HTs), i.e., activity detected by the AP but not by the sensing station, complicate the use of carrier sensing as the basis for RRJ detection since they provide plausible deniability to a station suspected of being an RRJ. The RRJ has the dual objectives of avoiding detection and effectively disrupting communication, but there is an inherent performance tradeoff between these two objectives. In this paper, we capture the behavior of both the RRJ and the compliant stations via a parsimonious Markov chain model and pose the detection problem using the framework of the Markov chain hypothesis testing. Our analysis yields the receiver operating characteristic (ROC) of the detector and the optimized behavior of the RRJ. While there has been extensive work in the literature on jamming detection, our innovation lies in leveraging carrier sensing as a natural and effective basis for detection. [ABSTRACT FROM AUTHOR]

Achieving reliable and energy-saving broadcast is the main issue discussed in this study. Firstly, a multi-hop broadcast model is introduced, and the energy consumption and reliability of the network are defined in this study. Then five broadcast-based automatic repeat request (ARQ) protocols (automatic retransmission N times, stop-and-wait end-to-end-ARQ, stop-and-wait hop-by-hop-ARQ, stop-and-wait hop-by-hop oriented implicit ARQ, stop-and-wait hop-by-hop implicit and explicit ARQ) are proposed to realise the reliable transmission. Secondly, based on five protocols, the relationship between the system reliability and the number of retransmissions of the root node is established analytically, and the maximum number of retransmissions is solved under the required system reliability. Thirdly, the energy consumptions of the root node are calculated, and then the analytical expressions of the minimum system energy consumption are obtained separately according to five broadcast-based retransmission mechanisms. Finally, the relationships between the maximum number of retransmissions, energy consumption and reliability, the broadcast probability and feedback probability are discussed in the numerical analysis. Specially, for better energy-saving, the modulation technique should be adopted to choose suitable protocol based on a dynamic hop threshold. [ABSTRACT FROM AUTHOR]

• There is no collaborative multihop LoRa protocol. Users 'nodes cannot relay each-other's messages. • MauMe assumes users have a home-node with permanent power supply (base-node) acting as a relay for all users. • MauMe is single channel and designed for a controlled flooding of messages. • Messages are acknowledged. Acknowledgments kill lost messages. • Users can activate local Wi-Fi connection to allow sending free emergency SMS using a smartphone. • MauMe has a ready-to-use Github C++ library which allows immediate deployment on ESP32 microcontrollers. • The proposed implementation respects the legal duty-cycle. Low-cost low-power long-distance LoRa radio devices recently made available on the market allow the emerging of a new generation of networking paradigms on the Internet of Things. While the LoRaWan offers an efficient way of connecting LoRa end-point devices to the internet, LoRaWan nodes do not act as peers, but rather as terminals connected to gateways. As such, the current state of the art does not offer a public protocol for easily taking advantage of the fact that individuals and professionals wishing to aggregate data using LoRa devices are likely to run each a "base-node" on a continuous basis. Such permanently-powered base-nodes could potentially offer an increased cumulated area coverage to other nodes if they would behave as relays. In the present study, an Epidemic Delay Tolerant Network messaging protocol is proposed, which allows multi-hops between peer LoRa relay-nodes through a raw-LoRa controlled-flooding approach. This protocol has been implemented on low-cost LoRa-chip-equipped microcontrollers in the form of an open-source library acting as a network transport-layer. The design analysis concluded that MauMe is better suited for networks with reduced connectivity (≤ 9), and that a 4-connectivity redundant network could allow each user to send several tens of messages several tens of hops away. The proposed approach was tested on three different LoRa network topologies, and the totality of the packets and acknowledgments reached their destination. Furthermore, the network's activity ceased after delivery, confirming the ability of the protocol to return the network to rest after the flooding. The proposed library also offers to users a free emergency-messaging system implemented as an http server embedded in each node and accessible via Wi-fi. End-users can readily use our solution to easily deploy a network of sensors at a much lower cost than when using multiple gateways. The MauMe protocol is a first step towards the creation of collaborative and application-friendly extended-range LoRa-peers networks, and is intended for use in remote regions with scattered housings such as in the islands and atolls of Polynesia. [ABSTRACT FROM AUTHOR]

Liang, Z., 2019. Design of automatic matching system for ocean-going cargo in international logistics. In: Guido-Aldana, P.A. and Mulahasan, S. (eds.), Advances in Water Resources and Exploration. Journal of Coastal Research, Special Issue No. 93, pp. 1105–1110. Coconut Creek (Florida), ISSN 0749-0208. To realize the automatic matching and automatic dispatching of ocean-going cargo in international logistics, a design scheme of automatic matching system for ocean-going cargo in international logistics based on fuzzy scheduling and wireless sensor communication networking technology is proposed. The automatic matching model of ocean-going cargo in international logistics is constructed, and the MVB bus controller is used to schedule the automatic matching of ocean-going cargo in international logistics. Based on PID fuzzy neural network control, the automatic matching dispatching control model of ocean-going cargo in international logistics is constructed. According to the IEC61375 protocol, the wireless sensor communication network design for the automatic matching of ocean-going cargo in international logistics is carried out. According to the results of auto-correlation feature detection, fuzzy scheduling and optimal control of ocean-going cargo auto-matching in international logistics are carried out by extracting the associated features of ocean-going cargo auto-matching in international logistics. In the application layer, the real-time transport protocol is used for automatic scheduling of ocean-going cargo in international logistics. Based on DSP and RAM as the core processors, the hardware development and design of the automatic matching system for ocean-going cargo in international logistics is carried out. The test results show that the automation level of automatic matching device scheduling for ocean-going cargo in international logistics is high, and the throughput performance of scheduling process is better. [ABSTRACT FROM AUTHOR]

The packet transmission among sensor nodes mainly focuses on clock synchronization. This paper proposes a protocol for efficient clock synchronization in energy based approaches to overcome the clock synchronization invariances and communication overheads. Clustering technique helps to design the sensor network architectures and broadcast the sensor nodes. The existing Mobility Zonal Based Stable Election Protocol (Mob-ZSEP) protocol identifies best path using clustering approach. The selected best path using Mob-ZSEP routing protocol will be utilized by proposed clock synchronization protocols. This research paper proposes two novel protocols: Energy based Proportional Integral and Least Common Multiple (EPILCM) and Weighted based Least Common Multiple (WLCM). EPILCM protocol hybrids two methods such as Energy based Proportional Integral (EPI) and Energy based Least Common Multiple (ELCM). The proposed EPILCM protocol is used for clock synchronization using energy based approach which reduces energy consumption, synchronization error, propagation delay, clock inaccuracy and communication overhead. WLCM protocol performs transmission based on the weight of the packet in sensor networks. The EPILCM, WLCM protocols are compared and the simulation results shows that EPILCM protocol outperforms WLCM protocol. [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]

Extending an Internet subnet by connecting resource-constrained nodes (e.g., embedded sensors and actuators) over multiple wireless hops is necessary to support the future Internet of Things (IoT). RPL, the IPv6 routing standard for low-power and lossy networks, tried to achieve this goal but has not seen wide adoption in practice. As an alternative, Thread is a recently standardized low-power network protocol for IoT, driven by the Thread group, an industry consortium led by Google/Nest. We provide a comparative analysis of the technical aspects of RPL and Thread based on their specifications, explaining why using Thread, as opposed to RPL, may make sense for the future Internet. Specifically, the fundamental differences between RPL and Thread are their respective scopes and multihop network architectures, which result in Thread's unique design and advantages over RPL. Lastly, we evaluate Thread in an indoor multihop wireless testbed using OpenThread, an official open source implementation of Thread. This work serves as the first analysis of the Thread protocol in academia. [ABSTRACT FROM AUTHOR]

To realize the automatic matching and automatic dispatching of ocean-going cargo in international logistics, a design scheme of automatic matching system for ocean-going cargo in international logistics based on fuzzy scheduling and wireless sensor communication networking technology is proposed. The automatic matching model of ocean-going cargo in international logistics is constructed, and the MVB bus controller is used to schedule the automatic matching of ocean-going cargo in international logistics. Based on PID fuzzy neural network control, the automatic matching dispatching control model of ocean-going cargo in international logistics is constructed. According to the IEC61375 protocol, the wireless sensor communication network design for the automatic matching of ocean-going cargo in international logistics is carried out. According to the results of auto-correlation feature detection, fuzzy scheduling and optimal control of ocean-going cargo auto-matching in international logistics are carried out by extracting the associated features of ocean-going cargo auto-matching in international logistics. In the application layer, the real-time transport protocol is used for automatic scheduling of ocean-going cargo in international logistics. Based on DSP and RAM as the core processors, the hardware development and design of the automatic matching system for ocean-going cargo in international logistics is carried out. The test results show that the automation level of automatic matching device scheduling for ocean-going cargo in international logistics is high, and the throughput performance of scheduling process is better. [ABSTRACT FROM AUTHOR]

Underwater wireless sensor networks (UWSNs) will pave the way for a new era of underwater monitoring and actuation applications. The envisioned landscape of UWSN applications will help us learn more about our oceans, as well as about what lies beneath them. They are expected to change the current reality where no more than 5% of the volume of the oceans has been observed by humans. However, to enable large deployments of UWSNs, networking solutions toward efficient and reliable underwater data collection need to be investigated and proposed. In this context, the use of topology control algorithms for a suit-able, autonomous, and on-the-fly organization of the UWSN topology might mitigate the undesired effects of underwater wireless communications and consequently improve the performance of networking services and protocols designed for UWSNs. This article presents and discusses the intrinsic properties, potentials, and current research challenges of topology control in underwater sensor networks. We propose to classify topology control algorithms based on the principal methodology used to change the network topology. They can be categorized in three major groups: power control, wireless interface mode management, and mobility assisted-based techniques. Using the proposed classification, we survey the current state of the art and present an in-depth discussion of topology control solutions designed for UWSNs. [ABSTRACT FROM AUTHOR]

The evolution of Wireless Sensor Networks has led to the development of protocols that must comply with their new restrictions while being efficient in terms of energy consumption and time. We focus on a collision resolution protocol, the so-called Two Cell Sorted (2CS-WSN). We propose three different ways to improve its performance by minimizing the collision resolution time or the energy consumption. After evaluating these proposals and carrying out the comparison with the original protocol, we recommend an improvement to the protocol which reduces the elapsed time by early 8% and the number of retries and conflicts more than 40%. [ABSTRACT FROM AUTHOR]

Network latency and reliability are becoming critical performance indicators for future mission critical services based on wireless connectivity. In this article we present a portable and low-cost measurement framework for quantifying the endto- end (E2E) latency and reliability of communication systems based on single or multiple links. The proposed framework is tailored for characterization of access diversity mechanisms, for example, multi-connectivity or hybrid access methods, which are expected to be essential for ultra-reliable wireless communications in 4G and 5G networks. An active-probe measurement approach is adopted, consisting of a client that transmits timestamped packets to a server, and vice versa, via one or multiple communication links under test. The setup allows us to measure the one-way latency performance in uplink and downlink separately, and allows fully synchronized measurements of multiple links in parallel to understand the benefits of multi-connectivity mechanisms. Traffic generation is flexible in terms of packet size, transport protocol (TCP or UDP), and inter-arrival time interval of the generated packets, hence being a powerful tool for benchmarking the performance for different application-specific message flows. Special emphasis is put on the tail of the latency distribution, that is, the latency that can be achieved with a certain probability constraint, for example, 99.9 percent or beyond. Given the challenge of measuring such rare events, we measure and validate the stability of the measurement equipment to ensure that the observed performance is not compromised by undesired behavior or malfunction of the equipment. The system has a measurement error below 400 μs with 99.9 percent confidence and below 3.1 ms with 99.999 percent confidence. The capability and applicability of the measurement framework is illustrated by a measurement test of two simultaneous LTE connections that provide robust communications to an aerial drone. [ABSTRACT FROM AUTHOR]

Nowadays, Wireless Sensor Networks (WSNs) are pondered as an exploration subject. Currently, progress in electronic communications has directed to multi-purpose Sensor Nodes (SNs) with less price and power consumption. Energy efficiency is a major concern in WSNs as the sensor nodes are battery-operated devices. Clustering based techniques are implemented through data aggregation to make equal energy consumption among SNs for energy efficient data transmission. The existing clustering techniques make use of distinct Harmony Search Algorithm (HSA), Low-Energy Adaptive Clustering Hierarchy (LEACH) and Particle Swarm Optimization (PSO) algorithms. However, these algorithms have exploration exploitation trade-off and local search constraint individually. In order to obtain a global search with faster convergence, Efficient Energy Clustering Protocol (EECP) based on Genetic Algorithm (GA) is recently proposed to detect their immediate neighbors, balance energy consumption load among data transmission routes and energy efficient cluster head selection. The proposed algorithm exhibited high search efficiency and dynamic capability that improves lifetime of SNs. The presentation of the proposed algorithm was assessed using throughput, packet delivery ratio, energy consumption and end to end delay. The proposed algorithm showed an improvement in energy consumption and throughput by 95 and 90 Mbps respectively than existing clustering algorithm. [ABSTRACT FROM AUTHOR]

Abstract The Threshold-based Low-energy Adaptive Clustering Hierarchy (T-LEACH) protocol declares that cluster heads do not have to turn over every round but rather every batch of rounds. In other words, nodes keep serving as cluster heads as long as their energy is higher than a threshold energy. This article imposes upon major drawbacks of T-LEACH protocol and presents a Modified Threshold-based Cluster Head Replacement (MT-CHR) protocol. In the MT-CHR protocol, a new probability of being a cluster head, for any node in any round, has been proposed which agrees fairly with the assumptions introduced in LEACH protocol. Moreover, a new expression for threshold energy is proposed in which delaying the first node death and avoiding any data loss are taken into consideration. The performance of MT-CHR is evaluated using alive nodes, network lifetime, as well as network utilization performance metrics. The results are further compared with those obtained importantly from LEACH and T-LEACH protocols and the contributions of MT-CHR protocol are extremely impressive. As far as the real sensor network is concerned, the MT-CHR protocol is highly applicable and very effective as long-lasting networks are ascertained. [ABSTRACT FROM AUTHOR]

We consider a binary hypothesis testing problem in a wireless sensor network, where a fusion center (FC) makes a final decision about the underlying hypothesis. We assume under hypothesis ${\mathcal H}_0$ , sensors’ observations are uncorrelated and identically distributed Gaussian, however, under ${\mathcal H}_1$ they are correlated and nonidentically distributed Gaussian and sensors are unaware of this correlation when making decisions. Sensors send their local binary decisions over power constrained fading channels. We consider both parallel access channel (PAC) and multiple access channel (MAC) models. To obtain the detection statistic in PAC, we assume that the FC utilizes a linear fusion rule, which linearly combines the signals received from all sensors, while in MAC, the signal received at the FC is naturally the coherent sum of the transmitted signals. For both PAC and MAC, we derive modified deflection coefficient (MDC) of the detection statistic at the FC with coherent reception. Choosing MDC as the detection performance metric, we formulate several constrained transmit power optimization problems. In these problems, MDC is the objective function to be maximized and there are three different sets of transmit power constraints: total power constraint, individual and total power constraints, and individual power constraints only. We refer to the solutions of these constrained optimization problems as MDC-based transmit power allocation. When analytical solutions to these constrained optimization problems are elusive, we discuss how these problems can be converted to convex ones. Our results show that, compared with equal power allocation, detection performance improvement provided by our proposed MDC-based power allocation is more significant in MAC. We quantify the improvement in terms of several factors, including the degree of correlation among sensors’ observations, reliability of local decisions (local detection performance indices), communication channel properties, and the type of transmit power constraint. We also study how the power allocation among sensors varies as these factors change. [ABSTRACT FROM AUTHOR]

The amazing proliferation of communication technologies for embedded systems opens the way for completely new applications but forces designers to adopt new methodologies to meet time-to-market constraints. Computer-Aided Design (CAD) has been traditionally applied to computers and embedded systems in isolation without considering them as a global inter-connected system. The paper contributes to fill this gap by proposing 1) a communication-aware design flow for network-interconnected embedded systems and 2) a formal framework to efficiently synthesize their network aspects by formulating and solving an optimization problem. Presented case studies show the potentiality of the proposed approach to address heterogeneous scenarios, e.g., related to smart spaces up to the ever-more-mentioned Internet-of-Things. [ABSTRACT FROM AUTHOR]

In this paper, we consider multichannel ALOHA for a wireless sensor network (WSN), where sensors’ signals are correlated. The impact of the number of channels on the length of information that an access point (AP) can collect is investigated. Under a certain distributed signal source model, in order for the AP to have a sufficiently long length of information, we show that the number of channels is to be larger than the square of the average number of active nodes. Thus, when the number of channels is limited, we need to use re-transmissions. To this end, we propose an adaptive transmission approach that can effectively exploit the correlation between the collected signals at the AP and nodes’ signals using Slepian–Wolf coding to shorten the total transmission time, which results in a more energy efficient WSN. [ABSTRACT FROM AUTHOR]

In Wireless Sensor Networks (WSNs), sensors are spread over a remote and hardly accessed sensing zone. In this situation, Unmanned Aerial Vehicles (UAVs) allow to facilitate the data gathering from sensors in real time. In the present paper, we consider an optical UAV network that allows the real time data distribution to a base station, based on multiple collection trees and multiple base stations. Each UAV is identified by an optical codeword with adequate structure to reduce the codeword management process implied by the UAV mobility. Using the attributed codewords, each UAV can optically switch the gathered data to reach a base station for processing. Furthermore, we present quality-based attachment and re-attachment procedures allowing to an UAV to attach and re-attach to a tree whether it notices the quality degradation of its link to the collection tree. [ABSTRACT FROM AUTHOR]

In the complicated settings ofWSN (Wireless Sensor Networks) and IoT (Internet of Things) environments, keeping a number of heterogeneous devices updated is a challenging job, especially with respect to effectively discovering target devices and rapidly delivering the software updates. In this paper, we convert the traditional software update process to a distributed service. We set an incentive system for faithfully transporting the patches to the recipient devices. The incentive system motivates independent, self-interested transporters for helping the devices to be updated. To ensure the system correctly operates, we employ the blockchain system that enforces the commitment in a decentralized manner. We also present a detailed specification for the proposed protocol and validate it by model checking and simulations for correctness. [ABSTRACT FROM AUTHOR]

Opportunistic routing and network coding are two promising techniques that have been proposed for wireless networks. These techniques have significantly improved the performance of multi-hop wireless networks by utilizing the broadcast nature of wireless media and optimizing the capacity of lossy wireless networks. Recent research has shown that the combination of opportunistic routing and network coding in a single joint protocol outperforms each of them individually. This article explains the motivation and interaction effect of the joint protocols. We provide a taxonomy of joint protocols and illustrate the benefit and cost by highlighting their fundamental components and comparing different solutions. We also present a conclusion along with the outline of future research direction. [ABSTRACT FROM AUTHOR]

Fuel utilization efficiency and cost reduction are two major goals in designing in-vehicle networks. Aiming to address these two issues, we investigate in-vehicle networking protocols from both wired and wireless perspectives by first presenting representative solutions in each area, then identifying the challenges to current solutions, and finally advocating the use of the automotive Ethernet. Also, we propose a priority-based scheduler for the automotive Ethernet. Our preliminary experiments show that the proposed scheduler is effective and flexible, and thus is applicable to next-generation in-vehicle networks. We hope that further studies in this area can be inspired by our work and will be forthcoming in years to come. [ABSTRACT FROM AUTHOR]

Non-ideal channel conditions degrade the performance of wireless networks due to the occurrence of frame errors. Most of the well-known works compute the saturation throughput and packet delay for the IEEE 802.11 Distributed Coordination Function (DCF) protocol with the assumption that transmission is carried out via an ideal channel (i.e., no channel bit errors or hidden stations), and/or the errors exist only in data packets. Besides, there are no considerations for transmission errors in the control frames (i.e., Request to Send (RTS), Clear to Send (CTS), and Acknowledgement (ACK)). Considering the transmission errors in the control frames adds complexity to the existing analysis for the wireless networks. In this paper, an analytical model to evaluate the Medium Access Control (MAC) layer saturation throughput and packet delay of the IEEE 802.11g and IEEE 802.11n protocols in the presence of both collisions and transmission errors in a non-ideal wireless channel is provided. The derived analytical expressions reveal that the saturation throughput and packet delay are affected by the network size (n), packet size, minimum backoff window size (Wmin), maximum backoff stage (m), and bit error rate (BER). These results are important for protocol optimization and network planning in wireless networks. [ABSTRACT FROM AUTHOR]

This paper presents the design of a wireless sensor network particularly designed for remote monitoring and control of industrial parameters. The article describes the network components, protocol and sensor deployment, aimed to accomplish industrial constraint and to assure reliability and low power consumption. A particular case of study is presented. The system consists of a base station, gas sensing nodes, a tree-based routing scheme for the wireless sensor nodes and a real-time monitoring application that operates from a remote computer and a mobile phone. The system assures that the industrial safety quality and the measurement and monitoring system achieves an efficient industrial monitoring operations. The robustness of the developed system and the security in the communications have been guaranteed both in hardware and software level. The system is flexible and can be adapted to different environments. The testing of the system confirms the feasibility of the proposed implementation and validates the functional requirements of the developed devices, the networking solution and the power consumption management. [ABSTRACT FROM AUTHOR]

Energy Harvesting techniques are increasingly seen as the solution for freeing the wireless sensor nodes from their battery dependency. However, it remains evident that network performance features, such as network size, packet length, and duty cycle, are influenced by the sum of recovered energy. This paper proposes a new approach to defining the specifications of a stand-alone wireless node based on a Radio-frequency Energy Harvesting System (REHS). To achieve adequate performance regarding the range of the Wireless Sensor Network (WSN), techniques for minimizing the energy consumed by the sensor node are combined with methods for optimizing the performance of the REHS. For more rigor in the design of the autonomous node, a comprehensive energy model of the node in a wireless network is established. For an equitable distribution of network charges between the different nodes that compose it, the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is used for this purpose. The model considers five energy-consumption sources, most of which are ignored in recently used models. By using the hardware parameters of commercial off-the-shelf components (Mica2 Motes and CC2520 of Texas Instruments), the energy requirement of a sensor node is quantified. A miniature REHS based on a judicious choice of rectifying diodes is then designed and developed to achieve optimal performance in the Industrial Scientific and Medical (ISM) band centralized at 2.45 GHz. Due to the mismatch between the REHS and the antenna, a band pass filter is designed to reduce reflection losses. A gradient method search is used to optimize the output characteristics of the adapted REHS. At 1 mW of input RF power, the REHS provides an output DC power of 0.57 mW and a comparison with the energy requirement of the node allows the Base Station (BS) to be located at 310 m from the wireless nodes when theWireless Sensor Network (WSN) has 100 nodes evenly spread over an area of 300 × 300 m2 and when each round lasts 10 min. The result shows that the range of the autonomous WSN increases when the controlled physical phenomenon varies very slowly. Having taken into account all the dissipation sources coexisting in a sensor node and using actual measurements of an REHS, this work provides the guidelines for the design of autonomous nodes based on REHS. [ABSTRACT FROM AUTHOR]

Mobile sink groups play crucial roles to perform their own missions in many wireless sensor network (WSN) applications. In order to support mobility of such sink groups, it is important to design a mechanism for effective discovery of the group in motion. However, earlier studies obtain group region information by periodic query. For that reason, the mechanism leads to significant signaling overhead due to frequent flooding for the query regardless of the group movement. Furthermore, the mechanism worsens the problem by the flooding in the whole expected area. To deal with this problem, we propose a novel mobile sink group support scheme with low communication cost, called Region-Shift-based Mobile Geocasting Protocol (RSMGP). In this study, we utilize the group mobility feature for which members of a group have joint motion patterns. Thus, we could trace group movement by shifting the region as much as partial members move out of the previous region. Furthermore, the region acquisition is only performed at the moment by just deviated members without collaboration of all members. Experimental results validate the improved signaling overhead of our study compared to the previous studies. [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]

Wireless Sensor Networks (WSNs) are used for environmental monitoring. In recent years, energy constraints have led us to develop sensor nodes that harvest energy from the environment. WSNs improve performances by using techniques such as routing and clustering, by harvesting energy from the environment. These networks are called Energy Harvesting Wireless Sensor Network (EH-WSN). Due to the unique features of EH-WSNs, typical WSN clustering and routing methods are inefficient for EH-WSN. In this paper, we propose a novel hybrid methodology involving static and dynamic clustering operations. It uses a distributed-centralized approach and multi-hop routing and considers criteria, such as the energy level, the amount of harvested energy and the number of neighbors in the clustering process. Simulation results show that the proposed method improves the network stability and efficiency, comparing to other methods. [ABSTRACT FROM AUTHOR]

Power consumption is a primary interest in Wireless Sensor Networks (WSNs), and a large number of strategies have been proposed to evaluate it. However, those approaches usually neither consider reliability issues nor the power consumption of applications executing in the network. A central concern is the lack of consolidated solutions that enable us to evaluate the power consumption of applications and the network stack also considering their reliabilities. To solve this problem, we introduce a fully automatic solution to design power consumption aware WSN applications and communication protocols. The solution presented in this paper comprises a methodology to evaluate the power consumption based on the integration of formal models, a set of power consumption and reliability models, a sensitivity analysis strategy to select WSN configurations and a toolbox named EDEN to fully support the proposed methodology. This solution allows accurately estimating the power consumption of WSN applications and the network stack in an automated way. [ABSTRACT FROM AUTHOR]