TelG Mote: A Green Wireless Sensor Node Platform for Smart Home and Ambient Assisted Living

The wireless sensor network （WSN） consists of sensor nodes that interact with each other to collectively monitor environmental or physical conditions at different locations for the intended users. One of its potential deployments is in the form of smart home and ambient assisted living （SHAAL）to measure patients or elderly physiological signals, control home appliances, and monitor home. This paper focuses on the development of a wireless sensor node platform for SHAAL application over WSN which complies with the IEEE 802.15.4 standard and operates in 2.4 GHz ISM （industrial, scientific, and medical） band. The initial stage of SHAAL application development is the design of the wireless sensor node named TelG mote. The main features of TelG mote contributing to the green communications include low power consumption, wearable, flexible, user-friendly, and small sizes. It is then embedded with a self-built operating system named WiseOS to support customized operation. The node can achieve a packet reception rate （PRR） above 80% for a distance of up to 8 m. The designed TelG mote is also comparable with the existing wireless sensor nodes available in the market.

Transmission performance of 2.4 GHz wireless sensor nodes when used in a working-face environment

Wireless sensor nodes have the advantage of being low-cost,easily deployed and of good mobility.If deployed in an underground mine with existing underground transmission systems a wireless sensor network can improve the collection of information.To get good transmission performance for 2.4 GHz wireless sensor nodes at the working face we calculated the reflection properties of electromagnetic waves from a flat metal plate.Using the cascade impedance method(CIM),we studied transmission attenuation and compared the results to actual tests.The results show that the effective transmission distance of 2.4 GHz wireless sensor nodes meets the stipulations of the ZigBee protocol.

无线传感器网络基于测距的节点定位算法综述OverviewoftheNodeLocalizationAlgorithmBasedonRangingofWirelessSensorNetworks

基于测距的定位方法对测量的距离信息运用几何知识求解未知节点的位置,常用在定位精度较高的领域,可在误差、能耗、受环境因素影响等方面进行优化。本文对基于测距的无线传感器网络节点定位算法进行详细地分析和比较。

Design and performance analysis of wireless sensor network location node system for underground mine

Aiming at the application of a wireless sensor network to locating miners in underground mine,we design a wireless sensor network location node system,considering the communication performance and the intrinsic safety. The location node system consists of a mobile node,several fixed nodes,and a sink node,all of whose circuits were designed based on CC2430. A varistor and a RC circuit were used in the reset circuit of a sensor node to guarantee the intrinsic safety by reducing discharge energy,the theoretical analysis of the discharge energy shows that the reset circuit is an intrinsic safety one. The analysis and simulation about the performance of the location node system are discussed,such as network communication delay and packet loss rate,the results show that the highest network communication delay of the system is about 0.11 seconds,and the highest packet loss rate is about 0.13,which assures the location node system has a high reliability,and can locate miners in the underground mine.

Grid-Based Localization Mechanism with Mobile Reference Node in Wireless Sensor Networks

Wireless sensor networks （WSNs） are based on monitoring or managing the sensing area by using the location information with sensor nodes. Most sensor nodes require hardware support or receive packets with location information to estimate their locations, which needs lots of time or costs. In this paper we proposed a localization mechanism using a mobile reference node （MRN） and trilateration in WSNs to reduce the energy consumption and location error. The simulation results demonstrate that the proposed mechanism can obtain more unknown nodes locations by the mobile reference node moving scheme and will decreases the energy consumption and average ocation error.

Neighbor-Based Malicious Node Detection in Wireless Sensor Networks

The primary function of wireless sensor networks is to gather sensor data from the monitored area. Due to faults or malicious nodes, however, the sensor data collected or reported might be wrong. Hence it is important to detect events in the presence of wrong sensor readings and misleading reports. In this paper, we present a neighbor-based malicious node detection scheme for wireless sensor networks. Malicious nodes are modeled as faulty nodes behaving intelligently to lead to an incorrect decision or energy depletion without being easily detected. Each sensor node makes a decision on the fault status of itself and its neighboring nodes based on the sensor readings. Most erroneous readings due to transient faults are corrected by filtering, while nodes with permanent faults are removed using confidence-level evaluation, to improve malicious node detection rate and event detection accuracy. Each node maintains confidence levels of itself and its neighbors, indicating the track records in reporting past events correctly. Computer simulation shows that most of the malicious nodes reporting against their own readings are correctly detected unless they behave similar to the normal nodes. As a result, high event detection accuracy is also maintained while achieving low false alarm rate.

A Malicious and Malfunctioning Node Detection Scheme for Wireless Sensor Networks

Wireless sensor networks are often used to monitor physical and environmental conditions in various regions where human access is limited. Due to limited resources and deployment in hostile environment, they are vulnerable to faults and malicious attacks. The sensor nodes affected or compromised can send erroneous data or misleading reports to base station. Hence identifying malicious and faulty nodes in an accurate and timely manner is important to provide reliable functioning of the networks. In this paper, we present a malicious and malfunctioning node detection scheme using dual-weighted trust evaluation in a hierarchical sensor network. Malicious nodes are effectively detected in the presence of natural faults and noise without sacrificing fault-free nodes. Simulation results show that the proposed scheme outperforms some existing schemes in terms of mis-detection rate and event detection accuracy, while maintaining comparable performance in malicious node detection rate and false alarm rate.

Genetic Algorithm Based Node Deployment in Hybrid Wireless Sensor Networks

In hybrid wireless sensor networks composed of both static and mobile sensor nodes, the random deployment of stationary nodes may cause coverage holes in the sensing field. Hence, mobile sensor nodes are added after the initial deployment to overcome the coverage holes problem. To achieve optimal coverage, an efficient algorithm should be employed to find the best positions of the additional mobile nodes. This paper presents a genetic algorithm that searches for an optimal or near optimal solution to the coverage holes problem. The proposed algorithm determines the minimum number and the best locations of the mobile nodes that need to be added after the initial deployment of the stationary nodes. The performance of the genetic algorithm was evaluated using several metrics, and the simulation results demonstrated that the proposed algorithm can optimize the network coverage in terms of the overall coverage ratio and the number of additional mobile nodes.

Chain-type wireless sensor network node scheduling strategy

In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network （WSN）, sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment （UD）, non-uniform deployment （NUD） and op-timal distribution point spacing （ODS） is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.

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.

On Energy-Efficient Node Deployment in Wireless Sensor Networks

In wireless sensor networks, sensor nodes collect local data and transfer to the base station often relayed by other nodes. If deploying sensor nodes evenly, sensor nodes nearer to the base station will consume more energy and use up their energy faster that reduces system lifetime. By analyzing energy consumption, a density formula of deploying nodes is proposed. The ratio of whole energy of sensor nodes to energy consumption speed of sensor nodes in every area can get consistent if deploying nodes by the density formula, therefore system lifetime is prolonged. Analysis and simulation results show that when communication dominates whole energy consumption and the monitored region is big compared with radio range of sensor node, system lifetime under this scheme can be 3R/(2t) times of that under deploying nodes evenly, where R is radius of the monitored region and t is radio range of sensor node.

Utility-Based Node Cooperation Mechanism in Wireless Sensor Networks

In wireless sensor networks, due to the energy and resource constraints, nodes may be unwilling to forward packets for their neighbors. This can render severe deteriorations in the network performance and malfunctions of the system. To tackle such selfish behaviors and enhance the cooperation among sensors, based on reputation and energy consumption of each node, we present a utility function to punish the malicious nodes and encourage cooperation among nodes. Specifically, we firstly give a mixed strategy Nash equilibrium solution for the two nodes. Then we extend the model to multi-nodes scenario. With the unity function, each sensor’s reputation is evaluated according to its degree of cooperation. The extensive simulation results have shown the effectiveness of the mechanism, in that the cooperative behaviors are encouraged, which can ensure the normal functioning of the network system.

Development of Battery-Less Wireless Current Sensor Node Utilizing Charging Time of Capacitors with Wide Measurement Range

We report a novel battery-less wireless current sensor node without an analog to digital converter (ADC). If a capacitor is charged using a current transformer (CT) and a rectifying circuit, the charging time depends on the current flowing through a power line. In the case that the node transmits data every time when voltage of the capacitor exceeds a threshold voltage, we can indirectly measure the current by measuring the transmission intervals. In this method, the circuit of the node can be simplified and power consumption for the wireless transmission can be decreased because the measured current data does not need to be included in the transmitted packet. However, the measurable range is about single digit because the transmission interval decreases suddenly as the current increases. In this work, we have ex- panded the range using one CT, one wireless transmission module, and two charging circuits that include different load resistors connected in series. The results indicated that the measurable range was from 0.5 A to 50 A.

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.

RESEARCH ON KEY NODES OF WIRELESS SENSOR NETWORK BASED ON COMPLEX NETWORK THEORY

On the basis of complex network theory, the issues of key nodes in Wireless Sensor Networks (WSN) are discussed. A model expression of sub-network fault in WSN is given at first; subsequently, the concepts of average path length and clustering coefficient are introduced. Based on the two concepts, a novel attribute description of key nodes related to sub-networks is proposed. Moreover, in terms of node deployment density and transmission range, the concept of single-point key nodes and generalized key nodes of WSN are defined, and their decision theorems are investigated.

Survey on node deployment in wireless sensor networks

Node deployment strategy plays an important role in wireless sensor networks(WSNs)application because it determines the coverage,connectivity and network lifetime of WSNs.This paper reports the current research on the optimization means for achieving the desirable design goals in various applications.We categorize the placements strategies into are the static and the dynamic according to whether the node position change after the network is operational.The coverage,connectivity and energy consumption of WSNs are analysed and discussed in detail.

Employing Orphan Nodes to Avoid Energy Holes in Wireless Sensor Networks

When energy consumption by wireless sensor nodes gets off balance, partitions in the network appear because several of the nodes stop functioning. The respective network’s lifetime also diminishes. This problem is commonly known as the “hot spot” or “energy hole” phenomenon. To resolve this issue, a Multi-Hop Decentralized Cluster-Based Routing (MDCR) protocol is proposed. This algorithm uses orphan nodes as intermediate nodes to form inter-cluster multi-hop routing and balance the energy consumption among sensor nodes. Simulation experiments have shown that MDCR is significantly better at prolonging network lifetime compared to the Adaptive Decentralized Re-Clustering Protocol.

Research on Dynamic Clustering Routing Considering Node Load for Wireless Sensor Networks

Aiming at the problem that node load is rarely considered in existing clustering routing algorithm for Wireless Sensor Networks (WSNs), a dynamic clustering routing algorithm for WSN is presented in this paper called DCRCL (Dynamic Clustering Routing Considering Load). This algorithm is comprised of three phases including cluster head (CH) selection, cluster setup and inter-cluster routing. First, the CHs are selected based on residual energy and node load. Then the non-CH nodes choose a cluster by comparing the cost function of its neighbor CHs. At last, each CH communicates with base station by using multi-hop communication. The simulation results show that comparing with the existing one, the techniques life cycle and date volume of the network are increased by 30.7 percent and 29.8 percent respectively by using the proposed algorithm DCRCL.

Coordinated node scheduling for energy-conserving in large wireless sensor networks

Aiming at developing a node scheduling protocol for sensor networks with fewer active nodes,we propose a coordinated node scheduling protocol based on the presentation of a solution and its optimization to determine whether a node is redundant.The proposed protocol can reduce the number of working nodes by turning off as many redundant nodes as possible without degrading the coverage and connectivity.The simulation result shows that our protocol outperforms the peer with respect to the working node number and dynamic coverage percentage.