Exploration of Energy Conservation MAC Protocol of WSNs for Ubiquitous Environment

According to analyze the facade phenomenon of wire-less sensor networks（WSNs）,this paper proposes a feasible method to state clearly and improve the power control efficiency of wire-less sensor networks（WSNs）. One of the crucial problems for WSNs is the design of medium access control （MAC） protocol. Our method want to adjust the activities of the MAC protocols control to achieve the enery conservation when the wireless communication module of sensor nodes is running, which is the major consumer of energy consumed by sensors energy. The energy efficiency of MAC protocol makes a strong impact on the network performance. To some extent,our research work describes and analyze the sources of energy consumption in MAC layer and simultaneously present an optimal method for the design of MAC protocol. Then we discusses some factors impacting on the performance of MAC protocol and metrics of performance evaluation. Eventually, the coming research direction is summarized.

Dynamic Cluster Head for Lifetime Efficiency in WSN

Saving energy and increasing network lifetime are significant challenges in wireless sensor networks （WSNs）. In this paper, we propose a mechanism to distribute the responsibility of cluster-heads among the wireless sensor nodes in the same cluster based on the ZigBee standard, which is the latest WSN standard. ZigBee supports ad hoc on-demand vector （AODV） and cluster-tree routing protocols in its routing layer. However, none of these protocols considers the energy level of the nodes in the network establishing process or in the data routing process. The cluster-tree routing protocol supports single or multi-cluster networks. However, each single cluster in the multi-cluster network has only one node acting as a cluster head. These cluster-heads are fixed in each cluster during the network lifetime. Consequently, using these cluster-heads will cause them to die quickly, and the entire linked nodes to these cluster-heads will be disconnected from the main network. Therefore, the proposed technique to distribute the role of the cluster head among the wireless sensor nodes in the same cluster is vital to increase the lifetime of the network. Our proposed technique is better in terms of performance than the original structure of these protocols. It has increased the lifetime of the wireless sensor nodes, and increased the lifetime of the WSN by around 50% of the original network lifetime.

SI-INSPIRED ENERGY AWARE QoS ROUTING TREE FOR WSN

A heuristic theoretical optimal routing algorithm （TORA） is presented to achieve the data-gathering structure of location-aided quality of service （QoS） in wireless sensor networks （WSNs）. The construction of TORA is based on a kind of swarm intelligence （SI） mechanism, i. e. , ant colony optimization. Firstly, the ener- gy-efficient weight is designed based on flow distribution to divide WSNs into different functional regions, so the routing selection can self-adapt asymmetric power configurations with lower latency. Then, the designs of the novel heuristic factor and the pheromone updating rule can endow ant-like agents with the ability of detecting the local networks energy status and approaching the theoretical optimal tree, thus improving the adaptability and en- ergy-efficiency in route building. Simulation results show that compared with some classic routing algorithms, TORA can further minimize the total communication energy cost and enhance the QoS performance with low-de- lay effect under the data-gathering condition.

Accurate energy model for WSN node and its optimal design

With the development of CMOS and MEMS technologies, the implementation of a large number of wireless distributed micro-sensors that can be easily and rapidly deployed to form highly redundant, self-configuring, and ad hoc sensor networks. To facilitate ease of deployment, these sensors operate on battery for extended periods of time. A particular challenge in maintaining extended battery lifetime lies in achieving communications with low power. For better understanding of the design tradeoffs of wireless sensor network （WSN）, a more accurate energy model for wireless sensor node is proposed, and an optimal design method of energy efficient wireless sensor node is described as well. Different from power models ever shown which assume the power cost of each component in WSN node is constant, the new one takes into account the energy dissipation of circuits in practical physical layer. It shows that there are some parameters, such as data rate, carrier frequency, bandwidth, Tsw, etc, which have a significant effect on the WSN node energy consumption per useful bit （EPUB）. For a given quality specification, how energy consumption can be reduced by adjusting one or more of these parameters is shown.

IEEE802.15.4MAC协议研究现状

无线传感器网络(Wireless Sensor Networks,WSNs)是一门新兴的无线网络技术。IEEE802.15.4标准作为一种新兴的无线通信协议,以其低功耗、低速率传输和低成本的设计宗旨为无线传感器网络提供了一种很好的解决方案。对IEEE802.15.4标准的相关规定和特点进行了简要介绍,在该标准的基础上针对当前关于能量消耗、GTS调度机制和CSMA/CA协议等方面的研究现状进行了介绍,并做了总结。

Clustering routing algorithm of wireless sensor networks based on Bayesian game

To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.

Adaptive ant-based routing in wireless sensor networks using Energy~* Delay metrics

To find the optimal routing is always an important topic in wireless sensor networks (WSNs). Considering a WSN where the nodes have limited energy, we propose a novel Energy*Delay model based on ant algorithms ("E&D ANTS" for short) to minimize the time delay in transferring a fixed number of data packets in an energy-constrained manner in one round. Our goal is not only to maximize the lifetime of the network but also to provide real-time data transmission services. However, because of the tradeoff of energy and delay in wireless network systems, the reinforcement learning (RL) algorithm is introduced to train the model. In this survey, the paradigm of E&D ANTS is explicated and compared to other ant-based routing algorithms like AntNet and AntChain about the issues of routing information, routing overhead and adaptation. Simulation results show that our method performs about seven times better than AntNet and also outperforms AntChain by more than 150% in terms of energy cost and delay per round.

Energy-saving PPM schemes for WSNs

Energy conservation is a critical problem in recently-emerging wireless sensor networks （WSNs）. Pulse position modulation （PPM）, as an exploring-worthy modulation format for energy efficiency, is tailored for WSNs into two schemes, mono-mode PPM and multi-mode PPM, in this paper. Resorting to an idealized system model and a practical system model, which combine the power consumptions in transmission and reception modules of nodes with the idealized and real- istic battery characteristics, the battery energy efficiencies of mono-mode PPM and multi-mode PPM are evaluated and compared. To minimize the battery energy consumption （BEC）, these schemes are further optimized in terms of constellation size M for a link in path-loss channels. Our analytical and numerical results show that considerable energy can be saved by multi-mode PPM; and the optimization performances of these schemes are noticeable at various communication distances though their optimization properties are different.

A load-balanced minimum energy routing algorithm for Wireless Ad Hoc Sensor Networks

Wireless Ad Hoc Sensor Networks (WSNs) have received considerable academia research attention at present. The energy-constraint sensor nodes in WSNs operate on limited batteries, so it is a very important issue to use energy efficiently and reduce power consumption. To maximize the network lifetime, it is essential to prolong each individual node’s lifetime through minimizing the transmission energy consumption, so that many minimum energy routing schemes for traditional mobile ad hoc network have been developed for this reason. This paper presents a novel minimum energy routing algorithm named Load-Balanced Minimum Energy Routing (LBMER) for WSNs considering both sensor nodes’ energy consumption status and the sensor nodes’ hierarchical congestion levels, which uses mixture of energy balance and traffic balance to solve the problem of “hot spots” of WSNs and avoid the situation of “hot spots” sensor nodes using their energy at much higher rate and die much faster than the other nodes. The path router established by LBMER will not be very congested and the traffic will be distributed evenly in the WSNs. Simulation results verified that the LBMER performance is better than that of Min-Hop routing and the existing minimum energy routing scheme MTPR (Total Transmission Power Routing).

Research on stateful public key based secure data aggregation model for wireless sensor networks

Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggregation nodes being captured and probability of aggregated data being tampered.Thus it will seriously affect the security performance of the network. For network security issues,a stateful public key based SDAM( secure data aggregation model) is proposed for wireless sensor networks( WSNs),which employs a new stateful public key encryption to provide efficient end-to-end security. Moreover,the security aggregation model will not impose any bound on the aggregation function property,so as to realize the low cost and high security level at the same time.

Node cooperation based location secure verification algorithm in wireless sensor networks localization

For the application of wireless sensor networks in the military field, one of the main challenges is security. To solve the problem of verifying the location claim for a node, a new location verifica- tion algorithm called node cooperation based location secure verification （NCBLSV） algorithm is proposed. NCBLSV could verify malicious nodes by contrasting neighbor nodes and nodes under beam width angle using an adaptive array antenna at a base point. Simulation experiments are con- ducted to evaluate the performance of this algorithm by varying the communication range and the an- tenna beam width angle. Results show that NCBLSV algorithm has high probability of successful ma- licious nodes detection and low probability of false nodes detection. Thus, it is proved that the NCBLSV algorithm is useful and necessary in the wireless sensor networks security.

Reliable energy-efficient routing with novel route update in wireless sensor networks

In this paper we introduce a novel energy-aware routing protocol REPU (reliable, efficient with path update), which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy available in the nodes and the re-ceived signal strength of the nodes to identify the best possible route to the destination. Reliability is achieved by selecting a number of intermediate nodes as waypoints and the route is divided into smaller segments by the waypoints. One distinct ad-vantage of this model is that when a node on the route moves out or fails, instead of discarding the whole original route, only the two waypoint nodes of the broken segment are used to find a new path. REPU outperforms traditional schemes by establishing an energy-efficient path and also takes care of efficient route maintenance. Simulation results show that this routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density, and overcomes simul-taneous packet forwarding.

A Distributed Dynamic Clustering Algorithm for Wireless Sensor Networks

This paper proposes a distributed dynamic k-medoid clustering algorithm for wireless sensor networks （WSNs）, DDKCAWSN. Different from node-clustering algorithms and protocols for WSNs, the algorithm focuses on clustering data in the network. By sending the sink clustered data instead of practical ones, the algorithm can greatly reduce the size and the time of data communication, and further save the energy of the nodes in the network and prolong the system lifetime. Moreover, the algorithm improves the accuracy of the clustered data dynamically by updating the clusters periodically such as each day. Simulation results demonstrate the effectiveness of our approach for different metrics.

Frequency hopping in IEEE 802.15.4 to mitigate IEEE 802.11 interference and fading

In this paper, we investigate the issues of initialization and deployment of wireless sensor networks（WSNs） under IEEE 802.11 b/g interference and fading channels using frequency hopping（FH）. We propose an FH algorithm for WSNs, which is implemented and tested with a pair of nodes employing IPv6 over low power wireless personal area networks（6 LoWPAN） standard.The merits and demerits of the proposed FH scheme in WSNs are studied under strong IEEE 802.11 b/g interference and frequency selective fading channels. We compare the performance results of the proposed FH scheme with those obtained by single-channel radio in WSNs, and show that FH maintains very reliable data rates in the presence of adverse conditions where the single-channel radio fails. We determine a minimum center frequency offset of channels between IEEE 802.15.4 and IEEE 802.11 b/g-based networks, which guarantees the error free network operation of IEEE802.15.4 using a single channel. We design a second FH procedure comprising only four free channels（15, 20, 25, and 26） of IEEE 802.15.4 standard, and show that in the presence of nearby IEEE 802.11 b/g interference, the IEEE 802.15.4 data rate using this method is always 98% and more.

Real-time localization estimator of mobile node in wireless sensor networks based on extended Kalman filter

Localization of the sensor nodes is a key supporting technology in wireless sensor networks （WSNs）. In this paper, a real-time localization estimator of mobile node in WSNs based on extended Kalman filter （KF） is proposed. Mobile node movement model is analyzed and online sequential iterative method is used to compute location result. The detailed steps of mobile sensor node self-localization adopting extended Kalman filter （EKF） is designed. The simulation results show that the accuracy of the localization estimator scheme designed is better than those of maximum likelihood estimation （MLE） and traditional KF algorithm.

AN ADAPTIVE-WEIGHTED TWO-DIMENSIONAL DATA AGGREGATION ALGORITHM FOR CLUSTERED WIRELESS SENSOR NETWORKS

In this paper,an Adaptive-Weighted Time-Dimensional and Space-Dimensional(AWTDSD) data aggregation algorithm for a clustered sensor network is proposed for prolonging the lifetime of the network as well as improving the accuracy of the data gathered in the network.AWTDSD contains three phases:(1) the time-dimensional aggregation phase for eliminating the data redundancy;(2) the adaptive-weighted aggregation phase for further aggregating the data as well as improving the accuracy of the aggregated data; and(3) the space-dimensional aggregation phase for reducing the size and the amount of the data transmission to the base station.AWTDSD utilizes the correlations between the sensed data for reducing the data transmission and increasing the data accuracy as well.Experimental result shows that AWTDSD can not only save almost a half of the total energy consumption but also greatly increase the accuracy of the data monitored by the sensors in the clustered network.

Energy Consumption in Wireless Sensor Networks

Wireless sensor networks （WSNs） can be used to collect surrounding data by multi-hop. As sensor networks have the constrained and not rechargeable energy resource, energy efficiency is an important design issue for its topology. In this paper, the energy consumption issue under the different topology is studied. We derive the exact mathematical expression of energy consumption for the fiat and clustering scheme, respectively. Then the energy consumptions of different schemes are compared. By the comparison, multi-level clustering scheme is more energy efficient in large scale networks. Simulation results demonstrate that our analysis is correct from the view of prolonging the large-scale network lifetime and achieving more power reductions.

A FUNCTION NODE-BASED MULTIPLE PAIRWISE KEYS MANAGEMENT PROTOCOL FOR WIRELESS SENSOR NETWORKS AND ENERGY CONSUMPTION ANALYSIS

In this letter, a Function node-based Multiple Pairwise Keys Management (MPKMF) protocol for Wireless Sensor Networks (WSNs) is firstly designed, in which ordinary nodes and cluster head nodes are responsible for data collection and transmission, and function nodes are responsible for key management. There are more than one function nodes in the cluster consulting the key generation and other security decision-making. The function nodes are the second-class security center because of the characteristics of the distributed WSNs. Secondly, It is also described that the formation of function nodes and cluster heads under the control of the former, and five kinds of keys, i.e., individual key, pairwise keys, cluster key, management key, and group key. Finally, performance analysis and experiments show that, the protocol is superior in communication and energy consumption. The delay of establishing the cluster key meets the requirements, and a multiple pairwise key which adopts the coordinated security authentication scheme is provided.

DEFENSE AGAINST COLLUSION SCHEME BASED ON ELLIPTIC CURVE CRYPTOGRAPHY FOR WIRELESS SENSOR NETWORKS

Wireless Sensor Networks (WSNs) are being deployed for a wide variety of applications and the security problems of them have received considerable attention. Considering the limitations of power, computation capability and storage resources, this paper proposed an efficient defense against collusion scheme based on elliptic curve cryptography for wireless sensor networks in order to solve the problems that sensor node-key leaking and adversaries make compromised nodes as their collusions to launch new attack. In the proposed scheme, the group-key distribution strategy is employed to compute the private key of each sensor node, and the encryption and decryption algorithms are constructed based on Elliptic Curve Cryptography (ECC). The command center (node) only needs to broadcast a controlling header with three group elements, and the authorized sensor node can correctly recover the session key and use it to decrypt the broadcasting message. Analysis and proof of the proposed scheme's efficiency and security show that the proposed scheme can resist the k-collusion attack efficiently.

AN EFFICIENT UE CLUSTER HEAD SELECTION ALGORITHM IN WIRELESS SENSOR NETWORKS AND CELLULAR NETWORKS

Wireless Sensor Networks (WSNs) have been applied in many different areas. Energy efficient algorithms and protocols have become one of the most challenging issues for WSN. Many researchers focused on developing energy efficient clustering algorithms for WSN, but less research has been concerned in the mobile User Equipment (UE) acting as a Cluster Head (CH) for data transmission between cellular networks and WSNs. In this paper, we propose a cellular-assisted UE CH selection algorithm for the WSN, which considers several parameters to choose the optimal UE gateway CH. We analyze the energy cost of data transmission from a sensor node to the next node or gateway and calculate the whole system energy cost for a WSN. Simulation results show that better system performance, in terms of system energy cost and WSNs life time, can be achieved by using interactive optimization with cellular networks.