Performance Analysis of Different Backoff Algorithms for WBAN-Based Emerging Sensor Networks

The Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) procedure of IEEE 802.15.6 Medium Access Control (MAC) protocols for the Wireless Body Area Network (WBAN) use an Alternative Binary Exponential Backoff (ABEB) procedure. The backoff algorithm plays an important role to avoid collision in wireless networks. The Binary Exponential Backoff (BEB) algorithm used in different standards does not obtain the optimum performance due to enormous Contention Window (CW) gaps induced from packet collisions. Therefore, The IEEE 802.15.6 CSMA/CA has developed the ABEB procedure to avoid the large CW gaps upon each collision. However, the ABEB algorithm may lead to a high collision rate (as the CW size is incremented on every alternative collision) and poor utilization of the channel due to the gap between the subsequent CW. To minimize the gap between subsequent CW sizes, we adopted the Prioritized Fibonacci Backoff (PFB) procedure. This procedure leads to a smooth and gradual increase in the CW size, after each collision, which eventually decreases the waiting time, and the contending node can access the channel promptly with little delay; while ABEB leads to irregular and fluctuated CW values, which eventually increase collision and waiting time before a re-transmission attempt. We analytically approach this problem by employing a Markov chain to design the PFB scheme for the CSMA/CA procedure of the IEEE 80.15.6 standard. The performance of the PFB algorithm is compared against the ABEB function of WBAN CSMA/CA. The results show that the PFB procedure adopted for IEEE 802.15.6 CSMA/CA outperforms the ABEB procedure.

A Web of Things-Based Emerging Sensor Network Architecture for Smart Control Systems

The Web of Things (WoT) plays an important role in the representation of the objects connected to the Internet of Things in a more transparent and effective way. Thus, it enables seamless and ubiquitous web communication between users and the smart things. Considering the importance of WoT, we propose a WoT-based emerging sensor network (WoT-ESN), which collects data from sensors, routes sensor data to the web, and integrate smart things into the web employing a representational state transfer (REST) architecture. A smart home scenario is introduced to evaluate the proposed WoT-ESN architecture. The smart home scenario is tested through computer simulation of the energy consumption of various household appliances, device discovery, and response time performance. The simulation results show that the proposed scheme significantly optimizes the energy consumption of the household appliances and the response time of the appliances. 

Market Model for Resource Allocation in Emerging Sensor Networks with Reinforcement Learning

Emerging sensor networks (ESNs) are an inevitable trend with the development of the Internet of Things (IoT), and intend to connect almost every intelligent device. Therefore, it is critical to study resource allocation in such an environment, due to the concern of efficiency, especially when resources are limited. By viewing ESNs as multi-agent environments, we model them with an agent-based modelling (ABM) method and deal with resource allocation problems with market models, after describing users' patterns. Reinforcement learning methods are introduced to estimate users' patterns and verify the outcomes in our market models. Experimental results show the efficiency of our methods, which are also capable of guiding topology management.

An Improved Mobility-Based Control Protocol for Tolerating Clone Failures in Wireless Sensor Networks

Nowadays, with the ubiquitous presence of the Internet of Things industry, the application of emerging sensor networks has become a focus of public attention. Unattended sensor nodes can be comprised and cloned to destroy the network topology. This paper proposes a novel distributed protocol and management technique for the detection of mobile replicas to tolerate node failures. In our scheme, sensors' location claims are forwarded to obtain samples only when the corresponding witnesses meet. Meanwhile, sequential tests of statistical hypotheses are applied to further detect the cloned node by witnesses. The combination of randomized detection based on encountering and sequential tests drastically reduces the routing overhead and false positive/negative rate for detection. Theoretical analysis and simulation results show the detection efficiency and reasonable overhead of the proposed method.

CoDA: Collaborative Data Aggregation in Emerging Sensor Networks Using Bio-Level Voronoi Diagrams

To implement minimum power consumption of the link, cluster heads adopt the multi-hop manner for inter-cluster communication so as to forward the aggregation data to the relay nodes. This paper proposes a collaborative data aggregation in emerging sensor networks using a bio-level Voronoi diagram, which is an energy-efficient data aggregation protocol that integrates topology control, Multiple Access Control (MAC) and routing. The sensor nodes situated in the lower level of the diagram are responsible for listening and gathering data, and should be organized by optimal clustering node. In the inter-cluster communication stage, a particle swarm optimization algorithm is addressed to seek optimal transmission path which could simultaneously achieve the minimization of the maximum next hop distance between two nodes in the routing path and the minimization of the maximum hop count, so the minimization of whole network energy consumption is realized. The results of theoretical analysis and simulation results show that energy efficiency and synchronization accuracy of the proposed algorithm can be much better than with traditional routing protocols, and the energy consumption of nodes in the whole network can be more balanced.