A minimum-energy path-preserving topology control algorithm for wireless sensor networks

The topology control strategies of wireless sensor networks are very important for reducing the energy consumption of sensor nodes and prolonging the life-span of networks. In this paper, we put forward a minimum-energy path-preserving topology control （MPTC） algorithm based on a concept of none k-redundant edges. MPTC not only resolves the problem of excessive energy consumption because of the unclosed region in small minimum-energy communication network （SMECN）, but also preserves at least one minimum-energy path between every pair of nodes in a wireless sensor network. We also propose an energy-efficient reconfiguration protocol that maintains the minimum-energy path property in the case where the network topology changes dynamically. Finally, we demonstrate the performance improvements of our algorithm through simulation.     

DHC: Distributed,Hierarchical Clustering in Sensor Networks

In many sensor network applications,it is essential to get the data distribution of the attribute value over the network.Such data distribution can be got through clustering,which partitions the network into contiguous regions,each of which contains sensor nodes of a range of similar readings.This paper proposes a method named Distributed,Hierarchical Clustering (DHC) for online data analysis and mining in senior networks.Different from the acquisition and aggregation of raw sensory data,DHC clusters sensor nodes based on their current data values as well as their geographical proximity,and computes a summary for each cluster.Furthermore,these clusters,together with their summaries,are produced in a distributed,bottom-up manner.The resulting hierarchy of clusters and their summaries facilitates interactive data exploration at multiple resolutions.It can also be used to improve the efficiency of data-centric routing and query processing in sensor networks.We also design and evaluate the maintenance mechanisms for DHC to make it be able to work on evolving data.Our simulation results on real world datasets as well as synthetic datasets show the effectiveness and efficiency of our approach.     

Balancing the power consumption speed in flat and hierarchical WSN

A combination of a cluster tree routing protocol and an Ad hoc on demand vector (AODV) routing protocol is used in the latest ZigBee standard wireless sensor networks (WSNs) technology. However, the AODV routing protocol has no means by which to take into consideration the power consumption of the nodes during the routing process. Therefore, a new approach is proposed in this paper to balance the power consumption speed and to distribute the responsibilities of routing among fiat wireless sensor nodes and the three levels of hierarchical wireless sensor nodes. These three levels are based on the three types of devices, which are used in the ZigBee standard: the coordinator, the touters, and the end devices. In this paper, we have compared the original AODV routing protocol with our extension approach for the distribution of power consumption. Based on the simulation results, our new approach has achieved better performance in terms of increasing the lifetime of the fiat wireless sensor network, the personal area network (PAN)coordinator, the touters, and the whole network of the hierarchical wireless sensor network. Additionally, it has better performance in terms of distributing the power consumption among the key nodes of the wireless sensor network.     

Sensor Distribution Optimization Based on Extending-tree in Sensor Network

In a sensor network,reasonable distribution of sensor nodes will do much good to the improvement of sensorial ability.In a sensor network constructed by randomly scattering,a better sensing coverage can be achieved by topology adjustment utilizing mobility of some sensor nodes.To solve this problem,we define an extending-tree in the sensor network using Voronoi diagrams and Delaunay network.On this base,a new optimization algorithm of sensor node distribution based on genetic algorithm is designed,which provides a sound effective means to improve the sensorial ability of network.Simulation output shows that this algorithm can achieve an optimizing node distribution in the object area,by which sensorial ability of the whole sensor network can be improved at a relatively low cost.     

A new forwarding address for next generation networks

The forwarding address plays an important role in constructing a communication network.In this paper,a new forwarding address suitable for next generation networks named the vector address(VA) is proposed which is different from the forwarding address coding methods of current networks.The characteristics of the VA are analyzed.Complex network theory and a theoretical analysis method are introduced to study the average address length of the VA when used to construct a global network.Simulation experiments in a practical network topology model are carried out to validate the results.The results show that not only can the VA construct a simpler,more secure,and more scalable network,but it also can accommodate many more users than an Internet Protocol(IP) network with the same address length.     

无线传感器网络中基于伸展树的感知节点分布优化

In a sensor network, reasonable distribution of sensor nodes will do much good to the improvement of sensorial ability. In a sensor network constructed by randomly scattering, a better sensing coverage can be achieved by topology adjustment utilizing mobility of some sensor nodes. To solve this problem, we define an extending-tree in the sensor network using Voronoi diagrams and Delaunay network. On this base, a new optimization algorithm of sensor node distribution based on genetic algorithm is designed, which provides a sound effective means to improve the sensorial ability of network. Simulation output shows that this algorithm can achieve an optimizing node distribution in the object area, by which sensorial ability of the whole sensor network can be improved at a relatively low cost.     

Energy saving in wireless sensor networks

With the development of low-cost processor, memory, and radio technologies, it becomes possible to build inexpensive wireless micro-sensor nodes. However, energy is the biggest constraint to wireless sensor capabilities and such constraint combined with a typical deployment of large numbers of sensor nodes have posed many challenges to the design and management of sensor networks. Due to their ad-hoc deployment in hazardous environment, once sensor nodes are deployed in a sensor network, they cannot be easily replaced or recharged. Thus, energy saving acts as one of the hottest topics in wireless sensor networks （WSNs） and hence several energy conservation schemes have been proposed in the literature. In this work, we will make a short survey on the main techniques used for energy conservation in sensor networks. Specifically, we will focus primarily on duty cycling schemes which represent the most suitable technique for energy saving. Moreover, we will also survey in-network processing and network coding techniques which can guarantee a significant amount of energy saving in packet transmission. Finally, we will make a review on some communication protocols proposed for sensor networks.     

Power efficient scheme for self localization in wireless sensor networks

With the tremendous applications of the wireless sensor network, self-localization has become one of the challenging subject matter that has gained attention of many researchers in the field of wireless sensor network. Localization is the process of assigning or computing the location of the sensor nodes in a sensor network. As the sensor nodes are deployed randomly, we do not have any knowledge about their location in advance. As a result, this becomes very important that they localize themselves as manual deployment of sensor node is not feasible. Also, in WSN the main problem is the power as the sensor nodes have very limited power source. This paper provides a novel solution for localizing the sensor nodes using controlled power of the beacon nodes such that we will have longer life of the beacon nodes which plays a vital role in the process of localization as it is the only special nodes that has the information about its location when they are deployed such that the remaining ordinary nodes can localize themselves in accordance with these beacon node. We develop a novel model that first finds the distance of the sensor nodes then it finds the location of the unknown sensor nodes in power efficient manner. Our simulation results show the effectiveness of the proposed methodology in terms of controlled and reduced power.     

Optimizing data collection path in sensor networks with mobile elements

Exploiting mobile elements (MEs) to accomplish data collection in wireless sensor networks (WSNs) can improve the energy efficiency of sensor nodes, and prolong network lifetime. However, it will lead to large data collection latency for the network, which is unacceptable for data-critical applications. In this paper, we address this problem by minimizing the traveling length of MEs. Our methods mainly consist of two steps: we first construct a virtual grid network and select the minimal stop point set (SPS) from it; then, we make optimal scheduling for the MEs based on the SPS in order to minimize their traveling length. Different implementations of genetic algorithm (GA) are used to solve the problem. Our methods are evaluated by extensive simulations. The results show that these methods can greatly reduce the traveling length of MEs, and decrease the data collection latency.     

TinyOS路由协议原理及性能评估

LEPS是TinyOS的多跳路由协议,适用于数据聚集型传感器网络。LEPS路由建立一个以汇聚节点为根节点的树型拓扑,每个节点向自己的父节点发送传感数据,并沿最短路径传送到汇聚节点。LEPS协议将跳数和链路质量作为选择父节点的依据,具有一定的传输可靠性保证。该文对LEPS的原理以及在TinyOS中的实现机制进行了分析,在实际的传感器网络中进行了性能实验。LEPS路由协议可以形成并维护一个树型拓扑,但是节点间链路不够稳定,拓扑变化比较频繁。     

Energy-aware scheduling for information fusion in wireless sensor network surveillance

Effective energy control while maintaining reliable monitoring performance becomes a key issue in wireless sensor networks (WSNs) based surveillance applications. While importance difference of surveillance zone, limited energy and dynamic network topology pose great challenges to surveillance performance. It is necessary to adjust sensor nodes' awakening frequency dynamically for information fusion. Thus an energy-aware scheduling with quality guarantee method named ESQG is proposed in this paper which considers sensor nodes' residual energy, different importance degrees of the surveillance zone and network topology comprehensively. It first uses a Voronoi diagram to determine the effective scope of each sensor node and then calculates node importance according to its residual energy and the importance degree of the effective scope. Then ESQG utilizes the importance of individual sensing scope and current forwarding costs to further compute node importance and awakening frequency for information fusion. In this way, ESQG can dynamically adapts each nodes awakening frequency to its dynamic network topology and importance degree of each individual sensing scope. The nodes are then turned on stochasticlly via the node awakening probability and node importance based information fusion is conducted for target detection. Besides, an adaptive process of perception factor C is proposed to match actual situation, and automatically change according to the detected data. Experiments results demonstrate that the proposed method ESQG can reduce the number of awakening nodes to a large extent while maintaining high reliability via information fusion.     

A Light-Weight Opportunistic Forwarding Protocol with Optimized Preamble Length for Low-Duty-Cycle Wireless Sensor Networks

In wireless sensor networks, sensed information is expected to be reliably and timely delivered to a sink in an ad-hoc way. However, it is challenging to achieve this goal because of the highly dynamic topology induced from asynchronous duty cycles and temporally and spatially varying link quality among nodes. Currently some opportunistic forwarding protocols have been proposed to address the challenge. However, they involve complicated mechanisms to determine the best forwarder at each hop, which incurs heavy overheads for the resource-constrained nodes. In this paper, we propose a light-weight opportunistic forwarding (LWOF) scheme. Different from other recently proposed opportunistic forwarding schemes, LWOF employs neither historical network information nor a contention process to select a forwarder prior to data transmissions. It confines forwarding candidates to an optimized area, and takes advantage of the preamble in low-power-listening (LPL) MAC protocols and dual-channel communication to forward a packet to a unique downstream node towards the sink with a high probability, without making a forwarding decision prior to data transmission. Under LWOF, we optimize LPL MAC protocol to have a shortened preamble (LWMAC), based on a theoretical analysis on the relationship among preamble length, delivery probability at each hop, node density and sleep duration. Simulation results show that LWOF, along with LWMAC, can achieve relatively good performance in terms of delivery reliability and latency, as a receiver-based opportunistic forwarding protocol, while reducing energy consumption per packet by at least twice.     

An energy-efficient,transport-controlled MAC protocol for wireless sensor networks

In wireless sensor networks (WSNs), one major cause of wasted energy is that the wireless network interface is always on to accept possible traffic. Many medium access control (MAC) protocols therefore adopted a periodic listen-and-sleep scheme to save energy, at sacrifice of end-to-end latency and throughput. Another cause is packet dropping due to network congestion, necessitating a lightweight transport protocol for WSNs. In this paper, we suggest a transport-controlled MAC protocol (TC-MAC) that combines the transport protocol into the MAC protocol with the aims of achieving high performance as well as energy efficiency in multi-hop forwarding. Although TC-MAC also works through a periodic listen-and-sleep scheme, it lowers end-to-end latency by reserving data forwarding schedules across multi-hop nodes during the listen period and by forwarding data during the sleep period, all while increasing throughput by piggybacking the subsequent data forwarding schedule on current data transmissions and forwarding data consecutively. In addition, TC-MAC gives a fairness-aware lightweight transport control mechanism based on benefits of using the MAC-layer information. The results show that TC-MAC performs as well as an 802.11-like MAC in end-to-end latency and throughput, and is more efficient than S-MAC in energy consumption, with the additional advantage of supporting fairness-aware congestion control.     

无线传感网络数据转发最佳权重选取算法仿真

为了有效提高无线传感网络数据转发的有效性和可靠性,针对传统的数据转发算法存在的数据转发率低、延时长等问题,提出一种基于蚁群优化的无线传感网络数据转发最佳权重选取算法。选择无线传感网络数据节点负载、剩余能量以及数据转发时延作为网络服务性能评价指标,利用熵权系数法自适应地确定评价指标的权重。引入数据转发链路容量和链路距离等因素建立数据转发时延最小的优化模型,利用蚁群算法的节点概率函数机制找出能同时满足时延带宽和数据转发链路容量要求的评价值最高的邻居节点,通过上述节点选取数据转发最优权重,完成数据转发。实验结果表明,所提算法在节点能量消耗、转发延迟、数据转发率等方面都优于现有无线传感网络数据转发算法。     

无线传感器网络中基于概率触发的负载均衡拓扑控制算法

多跳无线传感器网络中,部分节点由于担当数据转发任务,能量消耗较快,缩短了网络的生命期。充分考虑节点承担数据转发任务时负载过大的特点,用剩余能量和发射功率构建综合权值来决定节点担当数据转发任务的可能性,并通过设计的拓扑维护概率周期性的对网络拓扑进行局部调整,形成了基于概率触发的负载均衡拓扑控制算法,有效地解决了节点由于担当转发任务而造成能量过早耗尽的问题在一定程度上均衡了节点负载,延长了网络生命期。     

How much energy saving does topology control offer for wireless sensor networks? – A practical study

Topology control is an important feature for energy saving, and many topology control protocols have been proposed. Yet, little work has been done on quantitatively measuring practical performance gains that topology control achieves in a real sensor network. This is because many existing protocols either are too complex or make too impractical assumptions for a practical implementation and analysis. A rule of thumb or a practical upper bound on the energy saving gains achievable by topology control would assist engineers in estimating the overall energy budget of a real sensor system. This paper proposes a new topology control protocol simple enough to permit a straightforward stochastic analysis and also a real implementation in Mica2. This protocol is currently deployed in our testbed network of 42 Mica2 nodes. Our contribution is not on the novelty of this protocol but on a practical performance bound we can study using this protocol. The stochastic analysis reveals that topology control can achieve a power gain proportional to network density divided by a factor of eight to ten. Our experiment result from the real testbed tests confirms this finding. We also find a tradeoff in terms of throughput loss due to reduced density by topology control which amounts to about 50% throughput loss. These performance figures represent rough rules of thumb on energy efficiency achievable even by a very simple, unoptimized protocol.     

WSNs中基于信任度的节能机会路由算法

为了防止网络中存在的潜在恶意节点被加入到机会路由的候选转发集中,减少网络能量的消耗,并保证数据的可靠传输,提出了一种在无线传感器网络中基于信任度的节能机会路由(Trust Based Energy Efficient Opportunistic Routing in Wireless Sensor Networks,TBEEOR)算法。该算法根据网络的拓扑结构计算节点的代数连通度,进而计算节点的连通度诚意;再联合节点的转发诚意和ACK诚意,利用信息熵的概念计算综合信任度;最后,用节点的综合信任度来计算节点之间通信和协作造成的能量消耗,从而得到网络的预期成本。此外,该算法能够有效地识别和判断网络中的恶意节点,进一步减小了恶意节点对网络性能的影响。实验结果表明,TBEEOR算法有效地保证了数据传输的可靠性,有助于延长网络生命周期,从而增加了网络吞吐量,减少了网络能量消耗。     

移动传感器网络中一种基于接收者的跨层传输协议

移动传感器网络中节点的移动引起网络拓扑动态变化,数据源节点到Sink节点之间往往不存在稳定的通信路径,从而对数据传输协议提出了更高的要求.基于接收者的路由不需要建立数据源节点到Sink节点的全局路由,而是由发送节点的邻居节点根据自身的位置信息按一定规则参与转发权的竞争,动态地生成下一跳的转发路径,因此能够应用于移动传感器网络.针对移动传感器网络的特性以及现有相关协议存在的缺陷,提出了一种基于接收者的跨层传输协议.该协议优化了转发优先度计算方法,设计了一种自适应的转发申请信息发送机制,采用双信道通信模式解决了转发权竞争过程中的数据碰撞和多播抑制问题,并提出了一种简单高效的路由空洞逾越机制.仿真实验表明,该协议在通信开销、传输时延以及可靠性等方面具有较好的性能.