一种基于能耗均衡的ZigBee网络高效混合路由算法

针对目前ZigBee网络混合路由算法寻找开销偏大、能耗不均的问题,提出一种高效混合路由算法( EHCA)。通过采用跨层泛听与优先使用深度大、剩余能量多的节点进行路由的方式,减少部分泛洪寻路分组的转发,均衡节点能耗。仿真结果表明,EHCA的节点能耗均衡、路由开销和网络寿命等性能均优于混合路由算法和树路由算法。     

基于移动锚节点的无线传感网络节点定位算法

在无线传感网络定位算法中,锚节点位置决定了节点定位精度。为此,提出基于高斯-Markov模型的移动锚节点的节点定位(GM-MAL)算法。GM-MAL算法基于高斯-Markov移动模型,提出自适应锚节点的移动路径规划,通过速度调整策略、垂直平分线策略、虚斥力策略以及虚引力策略规划路径。在定位阶段,将非凸优化问题转化为双凸形式,再利用交替最小算法(AMA)求解,进而获取更短的锚节点移动路径。实验数据表明,引入虚引力策略提高了路径规划精度,覆盖了更多的监测区域。此外,相比于线性算法,GM-MAL的定位精度得到提高。     

移动WSNs中一种覆盖空洞的修复算法

基于无线传感网络的应用依赖于节点对监测区域的可靠覆盖.由于能耗殆尽或故障,节点感测能力可能失效,形成覆盖空洞区域.为此,提出基于模糊推理系统(FIS)的修复节点选取(FISS)算法.FISS算法采用自适应感测半径调整策略,利用节点的移动修复覆盖空洞.将节点的剩余能量和覆盖重叠率作为FIS的输入,并由FIS估计节点成为修...     

Deploying mobile nodes for maximal energy matching in WSNs

This paper proposes a self‐stabilizing distributed algorithm for deploying mobile nodes with loaded energy to the stationary nodes by considering the energy those stationary nodes need. The goal is to deploy mobile nodes to appropriate locations for energy supplements such that the network lifetime can be extended. The problem of maximizing the lifetime is NP‐hard. Therefore, it is unrealistic to search for an optimal solution in sensor networks. In this paper, we design several simple rules for mobile nodes and stationary nodes separately in order to find a feasible solution. Simple rules are especially suitable and necessary for low computability sensor networks. Our algorithm is simple and distributed. We prove that our method is stable and has good performance. Simulations show its efficiency too. Copyright © 2010 John Wiley & Sons, Ltd.     

WSNs中优化移动信宿路径的数据收集算法

收集数据是部署无线传感网络(WSNs)的根本目的。采用移动信宿策略可有效缓解WSNs的能耗问题,信宿的移动路径是该策略的关键。为此,提出基于伪驻留点的数据收集(VRDC)算法。VRDC算法先依据驻留点规划信宿路径,再依据路径选择伪驻留点(VRPs)。VRPs可通过一跳直接向移动信宿传输数据,而其他的节点则将数据传输至最近的VRPs,进而减少传输跳数,降低能耗。仿真结果表明,提出的VRDC算法能有效降低能耗,并平衡节点间的能耗。     

Dynamic clustering approach with ACO-based mobile sink for data collection in WSNs

Enhancing the network lifetime of wireless sensor networks is an essential task. It involves sensor deployment, cluster formation, routing, and effective utilization of battery units. Clustering and routing are important techniques for adequate enhancement of the network lifetime. Since the existing clustering and routing approaches have high message overhead due to forwarding collected data to sinks or the base station, it creates premature death of sensors and hot-spot issues. The objective of this study is to design a dynamic clustering and optimal routing mechanism for data collection in order to enhance the network lifetime. A new dynamic clustering approach is proposed to prevent premature sensor death and avoid the hot spot problem. In addition, an Ant Colony Optimization (ACO) technique is adopted for effective path selection of mobile sinks. The proposed algorithm is compared with existing routing methodologies, such as LEACH, GA, and PSO. The simulation results show that the proposed cluster head selection algorithm with ACO-based MDC enhances the sensor network lifetime significantly.

     

Priority-based IEEE 802.15.4 CSMA/CA mechanism for WSNs

The IEEE 802.15.4 standard is widely used in wireless sensor networks (WSNs). In this paper, we propose a priority-based IEEE 802.15.4 carrier sense multiple access with collision avoidance (CSMA/CA) mechanism for WSNs. Considering traffic load and traffic type of sensor nodes, we classify sensor nodes into three types. In our mechanism, different contention parameters are set for nodes with different priority levels, in order that nodes with high priority achieve high probability to access the channel. By modeling the proposed mechanism using a Markov chain, we analyze and compute the successful transmission probability, throughput and energy consumption for nodes with different priority levels. Finally, our numerical results demonstrate that our mechanism performs well for WSNs.     

一种改进的应用于无线传感器网络的拜占庭容错方案

研究了传统拜占庭容错方案并针对无线传感器网络的特定环境加以改进,减少了传统方案中网络节点间消息交换轮数,提高了效率并降低了通信开销和能量消耗,仿真结果表明:设计的方案在使所有正常网络节点达成一致的同时,其使用的消息交换轮数与传统拜占庭方案相比有显著的下降.     

An Improved PSOGSA for Clustering and Routing in WSNs

Wireless Personal Communications - Wireless sensor network (WSN) is an integration of sensing, communicating, computing in a board range environment. Efficient energy consumption becomes the most...     

A multicast mechanism for mobile networks

This letter proposes a multicast table approach to support GSM/UMTS multicast that minimizes the paging cost. The implementation and execution of the multicast tables are very efficient. The costs for updating these tables can be ignored compared with the costs of standard location update procedures. Furthermore, our mechanism can be implemented within the mobility databases without modifying the standard location update messages. We show that our mechanism always outperforms the existing GSM/UMTS multicast mechanisms     

面向移动计算环境的混合式数据同步机制

提出混合式数据同步机制,有机融合集中式和ad hoc架构,设置自组织域(SOD, self-organization domain),减少了同步数据通信量和数据同步服务器负载;提出基于节点能力值的数据分发策略,根据移动终端综合处理能力值来建立SOD树分发路径,实现同步数据的高效分发;还提出了基于轨迹变更的增量捕获策略,采用触发器捕获操作日志,用净化方法合并操作日志得到净增量数据。实验结果表明,混合式数据同步机制能更好地维护移动计算环境中数据的一致性,缩短同步响应时间,减少同步数据通信量,降低同步服务器负载。     

An energy-efficient overlapping clustering protocol in WSNs

Wireless Networks - The limited battery power supply system makes energy efficiency a major concern in WSNs. An effective method is to organize the sensors into clusters to avoid redundancy and...     

A multicast mechanism for mobile multimedia messaging service

Based on the cell broadcast service architecture, this paper proposes an efficient multicast mechanism for the universal mobile telecommunications system to support multimedia messaging service (MMS). We define a new interface between the serving GPRS support node and the cell broadcast center to track the current locations of the multicast members. Then we describe the location tracking procedures (including attach, detach, and location update) of the multicast members and the multicast message delivery procedure. We use an analytic model to investigate the performance of our approach. This paper indicates that our MMS multicast mechanism outperforms the previous proposed approaches.     

Decentralized and energy‐balanced algorithms for maintaining temporal full‐coverage in mobile WSNs

Coverage is one of the most important issues in Wireless Sensor Networks (WSNs). However, full coverage only can be achieved when surplus mobile sensors contribute a coverage area larger than the hole size. When there is no surplus mobile sensor to cover a big hole, previous studies have utilized mobile sensors by moving the hole from one location to another, therefore achieving temporal full‐coverage, where each location on the monitoring region has been ever covered by mobile sensors during a fixed time interval. However, with only some mobile sensors participating in the hole‐movement task, this results in an energy‐imbalance WSN. This paper considers a mobile WSN that contains a big hole where there exists no redundant mobile sensor to heal the hole. Three distributed algorithms, called Basic, Forward‐Only, and Any‐Direction movement mechanisms, are proposed to achieve the purpose of temporal full‐coverage in a way that the total energy consumption is minimized or that the energy consumption of all mobile sensors that participate in the hole‐movement task are balanced. Simulation results reveal that the proposed hole‐movement mechanisms enhance the coverage of WSNs and balance the energy consumption of mobile sensor nodes. Copyright © 2010 John Wiley & Sons, Ltd.     

An opportunistic routing mechanism for real‐time voice service in mobile ad hoc networks

The opportunistic routing mechanism can use several lossy broadcast links to support reliable transmission. In this paper, a simple opportunistic routing mechanism for real‐time multimedia services is proposed. This mechanism is based on the dynamic source routing protocol with some modifications, multiple route request, and route reply messages are used to construct the forwarder list, and the nodes within the forwarder list forward the packets which they overhear. The forwarder list is placed on the packet header in the form of a Bloom filter, which will restrict the size of the forwarder list to a constant value. There are no strict scheduling mechanisms for the forwarding order of the forwarder nodes, thus our opportunistic routing mechanism can be scalable for multiple simultaneous flows. Simulations show that our mechanism can effectively decrease the transmission times and the amount of the control messages for each packet and reduce the end‐to‐end delay for real‐time voice service, the quality of service for these services can be supported well over the unstable wireless channel. Copyright © 2009 John Wiley & Sons, Ltd.     

基于密钥ID和地理位置信息的密钥预分配方案

文章首先分析无线传感器网络（Wireless Sensor Networks-WSNs）成簇协议存在的安全隐患，主要考虑恶意节点对网络的破坏。然后，描述了现有的安全成簇协议，提出基于密钥ID和地理位置信息的密钥预分配方案（IDLB），最后对该算法进行了性能分析。     

基于网格的无线传感器网络非均匀分簇算法

在无线传感器网络中,首先要考虑的是如何解决能耗问题.针对无线传感器网络现有算法存在的节点能耗不均匀及节点部署密集造成的数据冗余和能量浪费,提出了一种节能路由算法UECG.通过设定虚拟网格以及非均匀分簇来实现网络能量的均衡消耗.仿真结果表明,与LEACH协议及其改进协议EEUC相比,UECG算法能够有效减少冗余数据,平衡簇群间的能量消耗,达到延长网络寿命的目的.     

Data gathering via mobile sink in WSNs using game theory and enhanced ant colony optimization

Optimal performance and improved lifetime are the most desirable design benchmarks for WSNs and the mechanism for data gathering is a major constituent influencing these standards.Several researchers have provided significant evidence on the advantage of mobile sink (MS) in performing effective gathering of relevant data. However, determining the trajectory for MS is an NP-hard-problem. Especially in delay-inevitable applications, it is challenging to select the best-stops or rendezvous points (RPs) for MS and also to design an efficient route for MS to gather data.To provide a suitable solution to these challenges, we propose in this paper, a game theory and enhanced ant colony based MS route selection and data gathering (GTAC-DG) technique.This is a distributed method of data gathering using MS, combining the optimal decision making skill of game theory in selecting the best RPs and computational swarm intelligence of enhanced ant colony optimization in choosing the best path for MS. GTAC-DG helps to reduce data transfer and management, energy consumption and delay in data delivery. The MS moves in a reliable and intelligent trajectory, extending the lifetime and conserving the energy of WSN. The simulation results prove the effectiveness of GTAC-DG in terms of metrics such as energy and network lifetime.