Network Lifetime Improved Optimal Routing in Wireless Sensor Network Environment

Wireless Personal Communications - In the field of Wireless Sensor Networks, major problem arises due to the unbalanced consumption of energy. The unbalanced consumption will reduce the lifetime of...     

Improving Lifetime of Wireless Sensor Network Based on Sinks Mobility and Clustering Routing

Wireless Personal Communications - Previous studies on wireless sensor networks indicate one of the most important research topics is to consider both significance of the reduction in sensor nodes...     

Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission

This paper addresses the problem of optimal resource allocation in a multi-hop cognitive radio networks. The objective of the present work is to search for the shortest possible path from the source to the destination and explores the scope of the Bellman–Ford and the Dijkstra’s algorithms due to their low runtime complexity and ease of implementation in routing. Searching for the shortest path focuses on minimization to the outage probability, while satisfying simultaneously the limits of the total transmit power and the interference threshold to the primary user (PU). Fuzzy c-means clustering is used to speed up the route selection process for both the routing algorithms. Network lifetime is also studied for both the algorithms considering the link failure situation. Simulation results show that the proposed scheme not only minimizes the outage probability over the existing power allocation strategies but also reduces interference to the PU. Results also show that network lifetime is increased and faster route selection is possible.     

WSN中一种改进的节点部署方案

节点部署是无线传感器网络的基本问题之一,关系到网络的感知范围和信息传输服务质量。现有的部署算法需要额外探测和修复边界上的覆盖空洞,从而增加了网络部署的成本而且使得节点分布不均匀。针对这一问题,提出了一种改进的节点部署方案,首先进行边界部署,以保证边界上的完全覆盖和连通;然后在感应区域内生成一个新的凸多边形区域,在此新区域上再递归调用边界部署算法,直到整个感应区域被完全覆盖。理论分析和仿真实验表明,在部署节点个数和可扩展性方面均优于已有的部署方案。     

Energy Harvesting Based Efficient Routing Scheme for Wireless Sensor Network

Wireless Sensor Network were deployed in a complex environment where the wide range of complex application is mandatory for the services. Such application includes military, agriculture, healthcare, defense, monitoring, surveillance etc. In general sensor nodes were spatially distributed and deployed in remote fashion, usually they are powered up by batteries. These battery powered sensor nodes are pruned to failure due to its power constrained nature. This led many researchers to explore energy efficient context aware routing for Wireless Sensor Networks. Hence a novel energy harvesting based efficient routing scheme is desirable to address the above stated problem. The key idea is to harvest the energy source from the deployed environment. The proposed routing scheme is tested and validated in MATLAB based simulation test bed. The experimental results shows that the proposed routing scheme is robust and meet all the requirements of routing and promising results for energy usage.     

传感器网络中信息驱动路由算法研究

传感器网络集成了传感器、计算机和网络三大技术,是一种全新的信息获取和处理技术。信息驱动路由就是基于信息的内容和通信开销来决定节点的选择,以达到优化信息获取和降低通信开销的目的。本文介绍了几种信息驱动路由的具体算法,并对其进行了分析比较。     

无线传感器网络优化生存时间的动态路由算法

 节能和延长网络生存时间是无线传感器网络研究领域的热点问题.该文综合考虑网络中节点的剩余能量和节点间传输数据的能耗,基于最短路径树算法,通过构造两种不同的权值函数,提出了"比例权值路由算法"(Ratio-W)与"和权值路由算法"(Sum-W).仿真分析表明,所提出的算法可以延长网络生存时间,并使能耗经济有效,比一些已有知名算法更优.     

基于ZigBee的无线传感器网络路由分析

为了研究基于ZigBee的无线传感器网络路由协议的性能优劣,在路由设计中有选择地改进。介绍了ZigBee无线传感器网络结构,分析了AODV、LEACH和ZigBee路由三种路由协议的基本原理,并使用NS2模拟仿真软件,在其他外部条件相同的情况下,分别对ZigBee路由和AODV进行模拟仿真,以能量消耗和网络生命周期为衡量网络性能的指标,仿真结果表明ZigBee路由在能耗上高于AODV,算法在节能上有待改进。指出了ZigBee路由算法在节能上的改进方法。     

Secure and Trust-Aware Routing Scheme in Wireless Sensor Networks

Wireless Personal Communications - Secure and trustable routing is one of the remarkable challenges in wireless sensor networks (WSNs). In this paper, we proposed a secure, trustable and...     

General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies

In multihop wireless sensor networks that are often characterized by many-to-one (convergecast) traffic patterns, problems related to energy imbalance among sensors often appear. Sensors closer to a data sink are usually required to forward a large amount of traffic for sensors farther from the data sink. Therefore, these sensors tend to die early, leaving areas of the network completely unmonitored and reducing the functional network lifetime. In our study, we explore possible sensor network deployment strategies that maximize sensor network lifetime by mitigating the problem of the hot spot around the data sink. Strategies such as variable-range transmission power control with optimal traffic distribution, mobile-data-sink deployment, multiple-data-sink deployment, nonuniform initial energy assignment, and intelligent sensor/relay deployment are investigated. We suggest a general model to analyze and evaluate these strategies. In this model, we not only discover how to maximize the network lifetime given certain network constraints but also consider the factor of extra costs involved in more complex deployment strategies. This paper presents a comprehensive analysis on the maximum achievable sensor network lifetime for different deployment strategies, and it also provides practical cost-efficient sensor network deployment guidelines.     

5G URLLC无线网络部署方案分析

URLLC场景是5G的典型应用场景之一,也是体现5G技术先进性的重要场景。随着URLLC增强技术标准化工作的完成,运营商需要明确5G URLLC网络下承载的典型业务,推动URLLC无线网络的部署。根据3GPP对不同业务网络指标需求的分析,结合ITU对URLLC场景时延与可靠性指标的要求,分析URLLC场景下潜在的应用,探讨了5G URLLC无线网络的部署方案。     

An Improved Cluster Routing Protocol to Increase the Lifetime of Wireless Sensor Network (WSN)

Wireless Personal Communications - Wireless sensor networks attracted wide attention among researchers in terms of different aspects. The main challenge in such networks is energy consumption. One...     

分布式无线感知网络节点部署算法研究

在无线感知网络节点部署中,目标区域的覆盖率大小对信号检测的效果具有重要的意义,通过智能优化算法来提高区域覆盖率已成为当前无线感知网络节点部署领域的研究热点之一。为了提高分布式无线感知网络对目标区域内的重点区域的覆盖率和减少冗余感知节点的投放,论文提出了一种分布式无线感知网络节点部署算法。该算法首先通过随机部署满足连通性的少量感知节点后初次工作来定位和估计出重点区域,然后将估计出的重点区域融入到粒子群算法的目标函数和粒子更新方程中实现对感知节点的重新部署,从而更好的优化了重点区域的覆盖率和减少冗余感知节点数量。仿真结果表明,与标准粒子群算法及其他优化算法相比,论文所研究的算法有更高的覆盖率和更低的迭代次数。      

无线传感器网络路由协议研究

对无线传感器网络经典的LEACH路由算法作了分析,提出了一种改进型算法。通过仿真,改进后的LEACH算法提高了传感器网络的能效,延长了系统的工作寿命。     

Optimized Sensor Nodes Deployment in Wireless Sensor Network Using Bat Algorithm

Wireless Personal Communications - For the optimal performance of wireless sensor networks in different areas of applications needs to maximize the coverage area of sensor nodes. The coverage of...     

A Tracking-Assisted Routing Scheme for Wireless Sensor Networks

Wireless sensor networks (WSNs) offer much promise for target tracking and environmental monitoring. While many WSN routing protocols have been proposed to date, most of these focus on the mobility of observers and assume that targets are fixed. However, in reality, many applications require for sensing data to be propagated from multiple mobile targets to multiple mobile observers. In addition, WSNs often operate under strict energy constraints, and therefore reducing energy dissipation is also an important issue. In this paper, we present a grid-based routing scheme known as TRENS. First, we address the issue of the WSN comprising multiple mobile targets and observers—with TRENS being the first scheme of its kind to use tracking technology to increase the efficiency of routing procedures in the context of dynamic topology. Next, we introduce a shortcutting approach to resolve energy issues by optimizing routing paths and thus decreasing communication costs and latency. Finally, we conduct extensive simulations to show how TRENS conserves energy and performs better than other grid-based schemes.     

Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing

Wireless sensor networks are becoming increasingly important in recent years due to their ability to detect and convey real-time, in-situ information for many civilian and military applications. A fundamental challenge for such networks lies in energy constraint, which poses a performance limit on the achievable network lifetime. We consider a two-tier wireless sensor network and address the network lifetime problem for upper-tier aggregation and forwarding nodes (AFNs). Existing flow routing solutions proposed for maximizing network lifetime require AFNs to split flows to different paths during transmission, which we call multisession flow routing solutions. If an AFN is equipped with a single transmitter/receiver pair, a multisession flow routing solution requires a packet-level power control at the AFN so as to conserve energy, which calls for considerable overhead in synchronization among the AFNs. In this paper, we show that it is possible to achieve the same optimal network lifetime by power control on a much larger timescale with the so-called single-session flow routing solutions, under which the packet-level power control and, thus, strict requirement on synchronization are not necessary. We also show how to perform optimal single-session flow routing when the bit-rate of composite flows generated by AFNs is time-varying, as long as the average bit-rate can be estimated.     

Hybrid Wireless Sensors Deployment Scheme with Connectivity and Coverage Maintaining in Wireless Sensor Networks

With the rapid growth of the internet of things (IoT), an impressive number of IoT’s application based on wireless sensor networks (WSNs) has been deployed in various domain. Due to its wide ranged applications, WSNs that have the capability to monitor a given sensing field, became the most used platform of IoT. Therefore, coverage becomes one of the most important challenge of WSNs. The search for better positions to assign to the sensors in order to control each point of an area of interest and the collection of data from sensors are major concerns in WSNs. This work addresses these problems by providing a hybrid approach that ensures sensors deployment on a grid for targets coverage while taking into account connectivity. The proposed sequential hybrid approach is based on three algorithms. The first places the sensors so as to all targets are covered. The second removes redundancies from the placement algorithm to reduce the number of sensors deployed. The third one, based on the genetic algorithm, aims to generate a connected graph which provide a minimal path that links deployed sensors and sink. Simulations and a comparative study were carried out to prove the relevance of the proposed method.

     

一种无线传感器网络分簇路由算法研究

在分析LEACH协议的基础上提出一种基于能量和距离的多跳路由算法（CAED）。由基站依据节点剩余能量和簇头与基站的距离分别选出二层簇头,簇内节点利用单跳和多跳模式与簇头进行通信。仿真实验表明,新算法有效地平衡了节点的能量消耗,并显著地延长了网络的生命周期。