组移动模型中基于模型特点的数据收集分簇算法

如今移动传感器网络在各个领域已起到重要作用.目前,移动传感器网络在军事、民用、科研等领域的应用价值都很高.而数据收集问题一直是这方面科研中必须被突破的难题.组移动模型是移动传感网络中的一个重要的移动模型,在本领域内都起到重要作用,然而有关移动传感器网络组模型的数据收集算法却屈指可数.提出了一种组移动模型中基于模型特点的...     

基于空间相关性的事件驱动无线传感器网络分簇算法

分簇算法是传感器网络中减少能量消耗的一种关键技术,它能够增强网络的扩展性和延长网络的生存时间。针对传感器节点数据的空间相关性,该文提出了一种新的基于空间相关性的事件驱动传感器网络分簇算法。算法根据用户要求的误差门限及结合节点数据的空间相关性马尔可夫模型,将事件感知区域划分成虚拟极坐标等价层。每个等价层选取层内当前剩余能量最大的节点作为簇头,网络通过移动代理收集簇头感知信息,该方法减少了传输数据量,有效节省了网络能量。     

基于空间相关性的事件驱动无线传感器网络分簇算法

分簇算法是传感器网络中减少能量消耗的一种关键技术,它能够增强网络的扩展性和延长网络的生存时间。针对传感器节点数据的空间相关性,该文提出了一种新的基于空间相关性的事件驱动传感器网络分簇算法。算法根据用户要求的误差门限及结合节点数据的空间相关性马尔可夫模型,将事件感知区域划分成虚拟极坐标等价层。每个等价层选取层内当前剩余能量最大的节点作为簇头,网络通过移动代理收集簇头感知信息,该方法减少了传输数据量,有效节省了网络能量。     

基于移动Agent和WSN的突发事件场景数据收集算法研究

该文针对无线传感器网络应用于突发事件监测场景的能量消耗和网络延迟问题,提出了基于移动Agent的无线传感器网络簇式数据收集算法.动态成簇过程基于事件严重程度,并由其决定簇的生命周期和覆盖范围.Sink和簇头之间形成以Sink节点为簇头的虚拟簇.移动Agent迁移路径规划过程中下一跳节点的选取基于节点剩余能量、路径损耗及受刺激强度.移动Agent通过节点遍历的方式完成对所有簇内成员节点信息的收集.仿真结果表明,相对于C/S数据收集模型,基于移动Agent的模型具有更好的节能效果,并能一定程度地减少网络延迟,尤其适用于大规模无线传感器网络应用.     

引入移动数据收集器的WSN节能策略

在无线传感器网络中引入移动数据收集器可以减少因数据远距离传输带来的能量消耗,在层次型无线传感器网络中,移动数据收集器只需要访问所有的簇头节点就可以收集到全网数据。为了防止簇头节点在移动数据收集器到来之前因存储空间不足发生溢出,提出了最大化缓存机制(Time Highest-Overflow-Based Mechanism,THM)算法,将每个簇内所有节点的存储空间合并成大空间的虚拟存储器。实验结果表明,THM算法能够有效地延长网络的生存时间。     

基于移动代理的WSN数据融合的研究

移动代理已广泛用于无线传感器网络并进行数据融合。该文将移动代理用于簇成员节点间进行数据收集并进行数据融合,并提出了基于精度的量化编码的数据融合算法。该算法有效减少了冗余数据,提高了传输速率,延长了无线传感器网络的寿命,并将其应用到森林防火中去。     

一种基于UAV的无人海岛监控网络数据收集策略

针对传统的最小跳路由无线传感器网络（WSN）在数据汇聚上较高的能量开销问题,提出了一种基于无人机(UAV)数据收集的动态分簇算法,其主要思想是利用节点剩余能量来确定那些节点可以当选簇首,同时利用节点坐标位置和设定地分簇半径来划分簇的大小。该算法的优势是能最大程度地均衡每个传感器节点的能量,使整体的节点剩余的能量维持在同一水平。为了提高数据收集的效率,采用蚁群算法规划了无人机数据收集的最短路径。仿真结果表明,与相同的分簇算法下传统的最小跳路由无线传感器网络相比,所提出的基于无人机的无线传感器网络（UAV-WSN）在能量利用率和生命周期方面分别提升了15%和25%,并且以上两种网络的能量利用率高达70%。     

无线传感网络移动分簇路由策略

无线传感网络(WSN)路由协议中,分簇路由具有拓扑管理方便、能量高效和数据融合简单等优点,成为当前重点研究的路由技术。通过研究各种环境下的移动传感器网络,有效地降低能耗则是研究移动无线传感器网络的重要目的之一。针对无线传感网络中移动性问题,基于LEACH协议,利用移动传感器网络中节点距离、速度和剩余能量等因素提出了能量高效的移动分簇路由算法。实验结果表明此算法能够较好地支持节点移动,从而降低网络能耗,延长网络生存时间。     

无线传感器网络中移动sink节点的路径规划

在无线传感器网络中,大量感知数据汇集到sink节点的采集方法会导致sink节点附近的节点能量耗尽,造成能量空洞。针对该问题,利用移动的sink节点进行数据收集是一种解决方法,其中移动sink的路径规划成为一个重要的问题。提出了一个移动sink路径规划算法,将无线传感器中随机分布的节点划分为不同的子区域,寻找sink节点移动的最佳转向点,最终得到最优的移动路径,以实现无线传感器网络生命周期最大化。仿真实验表明,与现有方案相比,该算法能显著延长网络的生命周期。     

无线传感器网络中基于能量的成簇协议

无线传感器网络采用能量有效方式传输数据对于延长传感器网络寿命十分重要。LEACH是一种基于簇的协议,它采用本地簇头随机轮转机制将能量负载均匀分布到网络中的所有传感器节点,簇头节点将收集到数据进行融合后发送给基站。提出一种改进的方案,采用随机成簇算法让网络中传感器节点成簇,成簇的过程考虑传感器节点剩余能量和簇头与非簇头结点之间的距离。通过分析评价和仿真结果,说明新算法比LEACH更能有效利用能量且发送更多的数据。     

Nature inspired discrete firefly algorithm for optimal mobile data gathering in wireless sensor networks

Nowadays wireless sensor networks enhance the life of human beings by helping them through several applications like precision agriculture, health monitoring, landslide detection, pollution control, etc. The built-in sensors on a sensor node are used to measure the various events like temperature, vibration, gas emission, etc., in the remotely deployed unmanned environment. The limited energy constraint of the sensor node causes a huge impact on the lifetime of the deployed network. The data transmitted by each sensor node cause significant energy consumption and it has to be efficiently used to improve the lifetime of the network. The energy consumption can be reduced significantly by incorporating mobility on a sink node. Thus the mobile data gathering can result in reduced energy consumption among all sensor nodes while transmitting their data. A special mobile sink node named as the mobile data transporter (MDT) is introduced in this paper to collect the information from the sensor nodes by visiting each of them and finally it sends them to the base station. The Data collection by the MDT is formulated as a discrete optimization problem which is termed as a data gathering tour problem. To reduce the distance traveled by the MDT during its tour, a nature-inspired heuristic discrete firefly algorithm is proposed in this paper to optimally collect the data from the sensor nodes. The proposed algorithm computes an optimal order to visit the sensor nodes by the MDT to collect their data with minimal travel distance. The proposed algorithm is compared with tree-based data collection approaches and ant colony optimization approach. The results demonstrate that the proposed algorithm outperform other approaches minimizing the tour length under different scenarios.     

Mobility prediction in mobile ad hoc networks using a lightweight genetic algorithm

A mobile ad hoc network is a collection of wireless mobile nodes creating a network without using any existing infrastructure. Much research has been carried out to find out an optimal routing protocol for the successful transmission of data in this network. The main hindrance is the mobility of the network. If the mobility pattern of the network can be predicted, it will help in improving the QoS of the network. This paper discusses a novel approach to mobility prediction using movement history and existing concepts of genetic algorithms, to improve the MANET routing algorithms. The proposed lightweight genetic algorithm performs outlier removal on the basis of heuristics and parent selection using the weighted roulette wheel algorithm. After performing the genetic operations a node to node adjacency matrix is obtained from which the predicted direction of each node is calculated using force directed graphs and vector calculations. The technique proposes a new approach to mobility prediction which does not depend on probabilistic methods and which is completely based on genetic algorithms.     

移动无线传感网的生存时间优化算法研究

当sink节点位置固定不变时,分布在sink 节点周围的传感节点很容易成为枢纽节点,因转发较多的数据而过早失效。为解决上述问题,提出移动无线传感网的生存时间优化算法（LOAMWSN）。LOAMWSN算法考虑sink节点的移动,采用减聚类算法确定sink节点移动的锚点,采用最近邻插值法寻找能遍历所有锚点的最短路径近似解,采用分布式非同步Bellman-Ford算法构建sink节点k跳通信范围内的最短路径树。最终,传感节点沿着最短路径树将数据发送给sink节点。仿真结果表明：在节点均匀分布和非均匀分布的无线传感网中,LOAMWSN算法都可以延长网络生存时间、平衡节点能耗,将平均节点能耗保持在较低水平。在一定的条件下,比Ratio_w、TPGF算法更优。     

A Genetic‐Algorithm‐Based Optimized Clustering for Energy‐Efficient Routing in MWSN

With the increasing demands for mobile wireless sensor networks in recent years, designing an energy‐efficient clustering and routing protocol has become very important. This paper provides an analytical model to evaluate the power consumption of a mobile sensor node. Based on this, a clustering algorithm is designed to optimize the energy efficiency during cluster head formation. A genetic algorithm technique is employed to find the near‐optimal threshold for residual energy below which a node has to give up its role of being the cluster head. This clustering algorithm along with a hybrid routing concept is applied as the near‐optimal energy‐efficient routing technique to increase the overall efficiency of the network. Compared to the mobile low energy adaptive clustering hierarchy protocol, the simulation studies reveal that the energy‐efficient routing technique produces a longer network lifetime and achieves better energy efficiency.     

Energy Efficient Clustering Scheme (EECS) for Wireless Sensor Network with Mobile Sink

The participants in the Wireless Sensor Network (WSN) are highly resource constraint in nature. The clustering approach in the WSN supports a large-scale monitoring with ease to the user. The node near the sink depletes the energy, forming energy holes in the network. The mobility of the sink creates a major challenge in reliable and energy efficient data communication towards the sink. Hence, a new energy efficient routing protocol is needed to serve the use of networks with a mobile sink. The primary objective of the proposed work is to enhance the lifetime of the network and to increase the packet delivered to mobile sink in the network. The residual energy of the node, distance, and the data overhead are taken into account for selection of cluster head in this proposed Energy Efficient Clustering Scheme (EECS). The waiting time of the mobile sink is estimated. Based on the mobility model, the role of the sensor node is realized as finite state machine and the state transition is realized through Markov model. The proposed EECS algorithm is also been compared with Modified-Low Energy Adaptive Clustering Hierarchy (MOD-LEACH) and Gateway-based Energy-Aware multi-hop Routing protocol algorithms (M-GEAR). The proposed EECS algorithm outperforms the MOD-LEACH algorithm by 1.78 times in terms of lifetime and 1.103 times in terms of throughput. The EECS algorithm promotes unequal clustering by avoiding the energy hole and the HOT SPOT issues.     

一种基于ZigBee协议的DSDV改进型路由算法

大量的研究人员也投入精力研究和改进无线传感网。其中,ZigBee协议在无线传感网中扮演着举足轻重的角色,其可使大量传感器高效互连的能力,是有线网络所不能及的。提出了一种基于ZigBee协议DSDV路由算法的改进型路由算法,根据仿真,改进后的算法在处理存在移动节点通信时有一定的优势。     

时延受限的移动sink数据收集算法

在实时性要求比较高的应用中,时延要求限制了sink的移动速率与移动轨迹,sink的移动速率限制了节点与sink的通信时间,因此很难兼顾时延要求与数据收集效率。提出一种时延受限的移动sink数据收集算法MSDC,在低能耗缓存区内找到一条sink的最优移动轨迹,在有限的时间限制内利用sink的移动性来提升传感器网络的数据收集性能。仿真结果表明,与已有算法比较,该方案能够提高网络数据采集量,降低能耗,延长网络生命周期。     

基于GSM和ZigBee的远程无线数据采集系统

近年来,无线传感器网络技术发展非常迅速,并在很多领域得到了广泛的应用。通过对全球移动通讯系统（GSM）和无线传感器网络协议ZigBee技术的研究,提出了一种结合这两种技术的远程无线数据采集系统。采用TI公司的ZigBee芯片CC2430组成无线传感器网络,负责数据的采集和汇总。使用西门子公司的全球移动通讯系统模块TC35接入公共移动通信网络,把数据发送到远端。ZigBee模块和全球移动通讯系统模块之间通过RS-232串口通信。     

Adaptation of a routing algorithm in wireless video sensor network for disaster scenarios using JPEG 2000

In this work we will develop an extension of one of existing routing algorithm in wireless sensor network. This new adaptation will permit the sensor node to save more energy and transmit images in wireless mode. This situation will be strategic and helpful especially in disaster scenario, where groups of rescuers must be on site to accomplish emergency tasks; therefore it’s very important and necessary to establish a wireless communication in real time between individuals or groups. The nature of wireless video sensor network makes it suitable to be used in the context of emergencies because introducing a video give more information in precise time and this is very advantageous when the existing infrastructure is down or severely overloaded. In emergencies the network topology may change rapidly and randomly. The increasing mobility of terminals makes them progressively dependent on their autonomy from the power source. This is illustrated by introducing many mobility models and using many scenarios of mobility in emergency situation, where image transmission via sensor node is used. Low complexity algorithm in image processing in order to reduce time transfer of selected data by this way allows saving energy. Efficiency in emergency scenario is the main objective of this work, achieved by the combination of three strategies: low-power mode algorithm, a power-aware routing strategy and compression technique in image processing used in sensor node. A selected set of simulations studies and real test bed on sensor node platform (Telos-B) indicate a reduction in energy consumption and a significant increase in node lifetime whereas network performance is not affected significantly. This is the big interest of our work in emergency situation, by increasing life time of node, individual can communicate longer and give more chance to rescuers to find them.     

A myopic mobile sink migration strategy for maximizing lifetime of wireless sensor networks

Network lifetime maximization is challenging particularly for large-scale wireless sensor networks. The sensor nodes near the sink node tend to suffer high energy consumption due to heavy traffic relay operations, becoming vulnerable to energy depletion. The rationale of the sink mobility approach is that as the sink node moves around, such risk of energy depletion at some nodes can be alleviated. In this paper, we first obtain the optimal mobile sink sojourning pattern by solving a linear programming model and then we mathematically analyze why the optimal solution exhibits such sojourning pattern. We use the insights from this analysis to design a simple practical heuristic algorithm for sink mobility, which utilizes only local information. Our heuristic is very different from the existing algorithms which often use the traffic volume as the main decision factor, in that we consider the variance of residual energy of neighboring sensor nodes. The simulation results show that our scheme achieves near-optimal network lifetime even with the relatively low moving speed of the mobile sink.