共查询到20条相似文献，搜索用时 15 毫秒
1.
为了延长无线传感网络的生存时间,需要设计满足高效率、低功耗的路由算法。一种CMRA（intercluster head multi-hop routing algorithm）算法被提出来,这种算法通过节点通信能量消耗模型建立最小能量路径树,但CMRA对于簇头选择的能量分配不均衡,造成簇头结点负载过重。提出一种新的路由算法CMRA-EE（CMRA-energy efficient）,在簇头选举阶段引入节点能量参数,同时将簇头节点能量与距离作为代价参数,从而平衡了网络节点能耗。通过仿真对CMRA-EE算法进行性能分析与评价,结果显示,CMRA-EE算法在延长无线传感网有效生存时间方面比CMRA算法有了明显的改善。 相似文献
2.
Hamed Alasarpanahi Vahid Ayatollahitafti Abolfazl Gandomi 《International Journal of Communication Systems》2020,33(6)
Underwater wireless sensor networks (UWSNs) consist of a group of sensors that send the information to the sonobuoys at the surface level. Void area, however, is one of the challenges faced by UWSNs. When a sensor falls in a void area of communication, it causes problems such as high latency, power consumption, or packet loss. In this paper, an energy‐efficient void avoidance geographic routing protocol (EVAGR) has been proposed to handle the void area with low amount of energy consumption. In this protocol, a suitable set of forwarding nodes is selected using a weight function, and the data packets are forwarded to the nodes inside the set. The weight function includes the consumed energy and the depth of the candidate neighboring nodes, and candidate neighboring node selection is based on the packet advancement of the neighboring nodes toward the sonobuoys. Extensive simulation experiments were performed to evaluate the efficiency of the proposed protocol. Simulation results revealed that the proposed protocol can effectively achieve better performance in terms of energy consumption, packet drop, and routing overhead compared with the similar routing protocol. 相似文献
3.
定向扩散协议作为一种经典的以数据为中心的无线传感网络的路由协议,得到了广泛的认可。但是在复杂质询的应用中,定向扩散协议采用的泛洪质询算法的能效性非常低,本文在此基础上提出了一种改进算法,可以将复杂质询分成若干个子质询,节点在收到质询消息后,可以先通过向d跳之内的相邻节点收集信息来解决质询消息。并将改进算法与传统的泛洪质... 相似文献
4.
LEACH协议是无线传感器网络中最流行的分簇路由协议之一.针对LEACH算法簇分布不均匀以及网络能耗不均衡等问题提出了一种高效节能多跳路由算法.在簇建立阶段,新算法根据网络模型计算出最优簇头间距值,调整节点通信半径以控制簇的大小,形成合理网络拓扑结构;在数据传输阶段,簇头与基站之间采用多跳的通信方式,降低了节点能耗.在TinyOS操作系统下,使用nesC语言设计实现了LEACH-EEMH算法.基于TOSSIM平台的仿真结果表明,新算法较LEACH算法在均衡网络能耗、延长网络寿命方面具有显著优势. 相似文献
5.
何丰;李貌;魏然;黄志辉 《光通信研究》2014,(1):57-59
针对无线传感器网络对能量的要求非常高且节点能量有限的特点,以提高无线传感器网络的生命周期为目的进行研究,提出了无线传感器网络中混合路由技术的改进方案。通过仿真实验对混合路由协议进行了技术分析,结果表明与其他路由协议相比,所提出的混合路由协议能有效降低节点的广播冗余,从而有效地增加了网络寿命,提高了数据的传输速率且降低了传输时延,更加适用于大型无线传感器网络。 相似文献
6.
Long Cheng Canfeng Chen Jian Ma Lei Shu 《International Journal of Communication Systems》2012,25(12):1585-1602
In asynchronous duty‐cycled wireless sensor networks, it is desirable that the data forwarding scheme is adaptive to the dynamics caused by the uncertainty of sensor nodes’ working schedules. Contention‐based forwarding is designed to adapt to the dynamic environments. In this work, we are interested in the contention‐based geographic forwarding (CGF) for two asynchronous duty‐cycling (ADC) models, which we refer to as uninterruptible ADC (U‐ADC) and interruptible ADC (I‐ADC). We propose a new residual time‐aware routing metric for CGF in the I‐ADC model and present a residual time‐aware forwarding scheme using this metric. We evaluate the performance of CGF in both asynchronous duty‐cycling models. Simulation results show that CGF in the U‐ADC model provides a shorter delivery delay while suffering from a high sender effective duty cycle problem. CGF in the I‐ADC model incurs a very long data delivery delay, but it can achieve a good load balancing among nodes. It is also demonstrated that the proposed residual time‐aware forwarding scheme lowers the effects of the performance degradation caused by the pure asynchronous duty‐cycling operation. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
7.
编码感知路由可以发现路由中的网络编码机会,减少数据传输次数,提高网络吞吐量,是近年来路由算法研究的一个热点.当前编码感知路由存在编码条件失效、未考虑节点能量的问题,不适合直接应用于无线传感器网络.本文提出基于跨层网络编码感知的无线传感器网络节能路由算法CAER (Cross layer coding Aware Energy efficient Routing).提出并证明了修正后的网络编码条件,以解决编码条件失效问题.基于跨层思想,将网络编码感知机制与拓扑控制、覆盖控制结合,挖掘潜在编码机会.提出综合考虑节点编码机会、节点能量的跨层综合路由度量CCRM (Cross layer Coding aware Routing Metric).仿真结果表明,相比现有编码感知路由,CAER能够提高网络编码感知准确性,增加网络编码机会数量5%~15%,延长网络生存时间8%~12%. 相似文献
8.
9.
Yan Yan Baoxian Zhang Jun Zheng Jian Ma 《Wireless Communications and Mobile Computing》2010,10(7):899-911
In wireless sensor networks (WSNs), a mobile sink can help eliminate the hotspot effect in the vicinity of the sink, which can balance the traffic load in the network and thus improve the network performance. Location‐based routing is an effective routing paradigm for supporting sink mobility in WSNs with mobile sinks (mWSNs). To support efficient location‐based routing, scalable location service must be provided to advertise the location information of mobile sinks in an mWSN. In this paper, we propose a new hierarchical location service for supporting location‐based routing in mWSNs. The proposed location service divides an mWSN into a grid structure and exploits the characteristics of static sensors and mobile sinks in selecting location servers. It can build, maintain, and update the grid‐spaced network structure via a simple hashing function. To reduce the location update cost, a hierarchy structure is built by choosing a subset of location servers in the network to store the location information of mobile sinks. The simulation results show that the proposed location service can significantly reduce the communication overhead caused by sink mobility while maintaining high routing performance, and scales well in terms of network size and sink number. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
10.
Mohammad Abdul Azim M. Rubaiyat Kibria Abbas Jamalipour 《Wireless Communications and Mobile Computing》2009,9(1):103-115
Optimized routing (from source to sink) in wireless sensor networks (WSN) constitutes one of the key design issues in prolonging the lifetime of battery‐limited sensor nodes. In this paper, we explore this optimization problem by considering different cost functions such as distance, remaining battery power, and link usage in selecting the next hop node among multiple candidates. Optimized selection is carried out through fuzzy inference system (FIS). Two differing algorithms are presented, namely optimized forwarding by fuzzy inference systems (OFFIS), and two‐layer OFFIS (2L‐OFFIS), that have been developed for flat and hierarchical networks, respectively. The proposed algorithms are compared with popular routing protocols that are considered as the closest counterparts such as minimum transmit energy (MTE) and low energy adaptive clustering hierarchy (LEACH). Simulation results demonstrate the superiority of the proposed algorithms in extending the WSN lifetime. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
11.
本文主要围绕ZigBee协议中的能量感知路由协议进行分析和研究,重点分析和探讨了能量路由原理,能量多路径路由原理。在此基础上文中针对能量多路径路由协议提出了一种简单完整的处理方法。 相似文献
12.
LI LI DONG Shu-song WEN Xiang-mingInstitute of Continuing Education School Beijing University of Posts Telecommunications Beijing China 《中国邮电高校学报(英文版)》2006,13(3):71-75
~~An energy efficient clustering routing algorithm for wireless sensor networks1. Mainwaring A, Polastre J, Szewczyk R, et al. Wireless sensor networks for habitat monitoring. Proceedings of the ACM International Workshop on Wireless Sensor Networks and A… 相似文献
13.
The problem of distributed estimation in a wireless sensor network with unknown observation noise distribution is investigated, where each sensor only sends quantized data to a fusion center. The sensing field is modeled as a spatially random field. The objective was to accurately estimate a hidden parameter at the location where no sensor exists, while minimizing the total energy consumption. Driven by the lack of a prior knowledge of the sensing field and the existence of some outliers, an indicator kriging estimator is developed for distributed estimation under imperfect communication channels between the sensors and the fusion center. The tradeoff between estimation performance and energy consumption is formulated as an optimization problem, and a global search algorithm is proposed to approximate the solution. The results show that the proposed indicator kriging estimator achieves better performance than the inverse distance estimator and the simple averaging estimator. Moreover, the proposed search algorithm can schedule the sensors to reach the tradeoff. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
14.
The features of transmissions in underwater sensor networks (UWSNs) include lower transmission rate, longer delay time, and higher power consumption when compared with terrestrial radio transmissions. The negative effects of transmission collisions deteriorate in such environments. Existing UWSN routing protocols do not consider the transmission collision probability differences resulting from different transmission distances. In this paper, we show that collision probability plays an important role in route selection and propose an energy‐efficient routing protocol (DRP), which considers the distance‐varied collision probability as well as each node's residual energy. Considering these 2 issues, DRP can find a path with high successful transmission rate and high‐residual energy. In fact, DRP can find the path producing the longest network lifetime, which we have confirmed through theoretical analysis. To the best of our knowledge, DRP is the first UWSN routing protocol that uses transmission collision probability as a factor in route selection. Simulation results verify that DRP extends network lifetime, increases network throughput, and reduces end‐to‐end delay when compared with solutions without considering distance‐varied collision probability or residual energy. 相似文献
15.
Ali Peiravi Habib Rajabi Mashhadi S. Hamed Javadi 《International Journal of Communication Systems》2013,26(1):114-126
In this study, an optimal method of clustering homogeneous wireless sensor networks using a multi‐objective two‐nested genetic algorithm is presented. The top level algorithm is a multi‐objective genetic algorithm (GA) whose goal is to obtain clustering schemes in which the network lifetime is optimized for different delay values. The low level GA is used in each cluster in order to get the most efficient topology for data transmission from sensor nodes to the cluster head. The presented clustering method is not restrictive, whereas existing intelligent clustering methods impose certain conditions such as performing two‐tiered clustering. A random deployed model is used to demonstrate the efficiency of the proposed algorithm. In addition, a comparison is made between the presented algorithm other GA‐based clustering methods and the Low Energy Adaptive Clustering Hierarchy protocol. The results obtained indicate that using the proposed method, the network's lifetime would be extended much more than it would be when using the other methods. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
16.
17.
Chu‐Fu Wang Jen‐Wen Ding Chun‐Chia Lee 《Wireless Communications and Mobile Computing》2010,10(2):171-187
Energy allocation problems and routing problems are both important research issues in the wireless sensor network (WSN) field. The former usually aims at considering how to allocate a certain number of sensor devices in a sensing region to form a WSN so that the objective function value (e.g., the network connectivity or the network lifetime) of the constructed network is optimized. For the message routing problem in WSNs, researchers tend to consider how to find an energy conservable message transmission routing scheme for notifying the supervisor of the WSN when an event occurs. Till now, many solutions have been proposed for the above two categories of optimization problems. However, unifying the above two network optimization problems to maximize the network lifetime, to the best of our knowledge, still lacks related research. This paper considers a joint optimization problem for energy allocation and energy‐aware routing called the joint optimization of energy allocation and routing problem (JOEARP) for a hierarchical cluster‐based WSN. We propose an exact algorithm to provide the optimum solution for the JOEARP. The simulation results show that this solution performed better in prolonging the network lifetime of a WSN in a real situation, compared to other compositions of conventional energy allocation schemes with some known routing algorithms. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
18.
19.
Clustering is one of the essential operations in wireless sensor network (WSN) to ensure organized data aggregation followed by energy efficiency. However, obtaining optimal clustering performance is yet an unsolved problem in WSN. Review of existing approaches towards cluster optimization shows that effective balance between energy efficiency and topology control is still missing. Therefore, the proposed system presents a unique topology control mechanism using a novel concept of interstellar orientation toward optimizing the clustering performance in WSN. Adopting an analytical research methodology, the proposed system introduces two interstellar‐based topology control system, which targets the maximum saving of resource consumption of the cluster head. The simulated outcome of the study shows that the proposed topology control system offers significant energy conservation performance in comparison to the existing hierarchical clustering scheme in WSN. 相似文献
20.