EETC: Energy Efficient Tree-Clustering in Delay Constrained Wireless Sensor Network

Wireless Personal Communications - Joint employment of multi-hop data forwarding and mobile data-collector is a popular technique for efficient data collection in energy constraint and delay...     

无线传感器网络中分簇算法能量有效性分析

该文针对无线传感器网络是一种能量受限的网络,首先说明根据节点数目以及分布区域特征,确定合理的成簇数目是分簇算法设计的核心;然后给出节点在通信中使用的能量模型,按照分簇的不同层数,分别对其成簇的数目进行理论上的优化分析,最后通过实验的方法验证优化的分簇算法能够满足能量有效性,对均匀节点能耗分布,提高网络生存时间有着重要作用。     

最小化延迟的无线传感器网络节点调度算法

如何实现节能和减小延迟一直是无线传感器网络中研究的热点及难点问题。提出一种新的最小化延迟的能量均衡的节点调度（MDS）算法,算法通过对能量以及延迟的分析计算,计算出节点的能量判定阈值,并在选择下一跳的时候,总是选择节点剩余能量在限定范围内且延迟最小的节点,以此实现最小化网络延迟的目的。理论分析及实验结果表明,MDS算法能够较好地把网络的生命周期控制在可接受范围内,同时可以解决在能耗限定条件下的最小化延迟的问题。     

一种能量有效的无线传感器网络路由算法

无线传感器网络中传感器节点能量有限,为了提高能量利用率,针对现有算法随机选择簇首、簇结构不合理等缺陷提出了一种新的能量有效的分簇路由算法EERA.EERA采用新的簇首选举、成簇,以及构建簇间路由算法,基于节点剩余能量与节点的相对位置选择簇首、成簇,使剩余能量较多的节点优先成为簇首并且各簇首能较均匀的分布在网络区域内;构建簇间路由时将最小跳数路由算法与改进的MTE算法结合起来,在簇间形成最小跳数、最小能耗路径.仿真结果表明,EERA算法可以均衡全网能量消耗,延长网络的生命周期.     

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.     

一种基于超节点和能量优先的无线传感器网络的高效查询算法

文中提出一种基于超节点和能量优先的无线传感器网络的高效查询算法.该算法包括传感器节点的层次聚类算法及基于能量代价模型等支撑技术,主要解决了以下两个问题:(1)数据如何从传感器节点传送到汇聚节点;(2)通过对传感器节点进行聚类,形成超节点,使得在查询过程中减少对无关节点的访问.实验表明该算法在提高无线传感器网络查询效率的情况下,延长网络的使用寿命.     

Energy Efficient Inactive Node Detection Based Routing Protocol for Delay Tolerant Network

Wireless Personal Communications - The delay tolerant network multi-copy protocols create and transmit multiple copies of each message that overload the buffer size, energy and bandwidth. The...     

An Energy Efficient Barrier Coverage Algorithm for Wireless Sensor Networks

Intrusion detection is one of the most important applications of wireless sensor networks. When mobile objects are entering into the boundary of a sensor field or are moving cross the sensor field, they should be detected by the scattered sensor nodes before they pierce through the field of sensor (barrier coverage). In this paper, we propose an energy efficient scheduling method based on learning automata, in which each node is equipped with a learning automaton, which helps the node to select best node to guarantee barrier coverage, at any given time. To apply our method, we used coverage graph of deployed networks and learning automata of each node operates based on nodes that located in adjacency of current node. Our algorithm tries to select minimum number of required nodes to monitor barriers in deployed network. To investigate the efficiency of the proposed barrier coverage algorithm several computer simulation experiments are conducted. Numerical results show the superiority of the proposed method over the existing methods in term of the network lifetime and our proposed algorithm can operate very close to optimal method.     

End-to-End Delay and Energy Efficient Routing Protocol for Underwater Wireless Sensor Networks

Providing better communication and maximising the communication performance in a Underwater Wireless Sensor Network (UWSN) is always challenging due to the volatile characteristics of the underwater environment. Radio signals cannot properly propagate underwater, so there is a need for acoustic technology that can support better data rates and reliable underwater wireless communications. Node mobility, 3-D spaces and horizontal communication links are some critical challenges to the researcher in designing new routing protocols for UWSNs. In this paper, we have proposed a novel routing protocol called Layer by layer Angle-Based Flooding (L2-ABF) to address the issues of continuous node movements, end-to-end delays and energy consumption. In L2-ABF, every node can calculate its flooding angle to forward data packets toward the sinks without using any explicit configuration or location information. The simulation results show that L2-ABF has some advantages over some existing flooding-based techniques and also can easily manage quick routing changes where node movements are frequent.     

一种基于WSN的能源有效的被动聚类模式

在分析无线传感器网络（WSN）的能量消耗模型的基础上，提出了一种新的层次型、分布式的能源有效的被动聚类模式EEPCS。采用“智能延迟策略”和“智能启发式选择”产生类首和网关结点，改变了传统被动聚类模式中通信结点能源消耗过快、网络不连通等缺点。理论分析和实验结果表明，EEPCS不仅能够节省通信结点的能量消耗，而且使能量在节点间均衡消耗，延长了网络的生存周期。     

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.     

WSN中负载均衡能量有效的路由算法研究

在PHGASIS建链方法的基础上提出了一种改进的建链方法；在此基础上提出了一种基于双层链结构并由基站集中控制的负载均衡、能量有效的路由算法（LBEERA），此算法充分利用了簇状路由算法和链状路由算法的优点．LBEERA算法将网络划分为多个簇，每个簇的节点组成一条低层链，每条链的链头节点形成一条高层链．仿真试验发现，相对于LHACH算法和PHGASIS算法，LBEERA算法增加了网络生存时间，减少了包传输时延．     

Symmetric Algorithm for Detection of Coverage Hole in Wireless Sensor Network

Wireless Personal Communications - For the problems of traditional overburden hole detection methods, such as overtime, low accuracy and high running cost, etc. A multi factor reliable coverage...     

Energy Efficient Distributed Face Recognition in Wireless Sensor Network

Face recognition enhances the security through wireless sensor network and it is a challenging task due to constrains involved in wireless sensor network. Image processing and image communication in wireless sensor network reduces the life time of network due to the heavy processing and communication. This paper presents a collaborative face recognition system in wireless sensor network. The layered linear discriminant analysis is re-engineered to implement on wireless sensor network by efficiently allocating the network resources. Distributed face recognition not only help to reduce the communication overload but it also increase the node life time by distributing the work load on the nodes. The simulation shows that the proposed technique provide significant gain in network life time.     

Hybrid Optimization Model for Energy Efficient Cloud Assisted Wireless Sensor Network

Wireless Personal Communications - The role of wireless sensor networks is ubiquitous in the present era. The dependency of wireless sensor networks is inevitable for small scale to large scale...     

Double Cluster Based Energy Efficient Routing Protocol for Wireless Sensor Network

Reducing the energy consumption of sensor nodes and prolonging the life of the network is the central topic in the research of wireless sensor network (WSN) protocol. The low-energy adaptive clustering hierarchy (LEACH) is one of the hierarchical routing protocols designed for communication in WSNs. LEACH is clustering based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. But LEACH is based on the assumption that each sensor nodes contain equal amount of energy which is not valid in real scenarios. A developed routing protocol named as DL-LEACH is proposed. The DL-LEACH protocol cluster head election considers residual energy of nodes, distance from node to the base station and neighbor nodes, which makes cluster head election reasonable and node energy consumption balance. The simulation results of proposed protocols are compared for its network life time in MATLAB with LEACH protocol. The DL-LEACH is prolong the network life cycle by 75 % than LEACH.     

Energy Efficient Shortest Path Routing Protocol for Underwater Acoustic Wireless Sensor Network

Wireless Personal Communications - While several protocols are proposed in performing sub aquatic communication, routing and issues related to efficiency of energy are considered as important for...     

FIEPE: Fuzzy Inspired Energy Efficient Protocol for Heterogeneous Wireless Sensor Network

Wireless Personal Communications - Besides sensing, computation, and communication of sensed data, the nodes near the base station have an additional responsibility to forward the data from far...     

高斯分布下的WSN能量均衡算法

针对无线传感器网络能量有限的问题,从稳定性的角度出发,提出一种在低功耗自适应分簇路由算法（LEACH）的基础上的改进算法。该算法首先确定高斯分布下最优簇头数目,在一个周期内,节点能量高于网内平均可用能量可以多次竞选簇头,并相应地延长周期的轮数。经仿真结果表明,在高斯分布下每一轮簇头的数量保持在最优簇头数目上下,改进协议能获得比LEACH协议更长的网络稳定期,更高的能量利用率。