首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
The unreachability problem (i.e. the so-called void problem) which exists in the greedy routing algorithms has been studied for the wireless sensor networks. However, most of the current research work can not fully resolve the problem (i.e. to ensure the delivery of packets) within their formulation. In this letter, the greedy anti-void routing (GAR) protocol is proposed, which solves the void problem by exploiting the boundary finding technique for the unit disk graph (UDG). The proposed rolling-ball UDG boundary traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node. The proofs of correctness for the proposed GAR protocol are also given at the end of this letter.  相似文献   

2.
The unreachability problem (i.e., the so-called void problem) that exists in the greedy routing algorithms has been studied for the wireless sensor networks. Some of the current research work cannot fully resolve the void problem, while there exist other schemes that can guarantee the delivery of packets with the excessive consumption of control overheads. In this paper, a greedy anti-void routing (GAR) protocol is proposed to solve the void problem with increased routing efficiency by exploiting the boundary finding technique for the unit disk graph (UDG). The proposed rolling-ball UDG boundary traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node under the UDG network. The boundary map (BM) and the indirect map searching (IMS) scheme are proposed as efficient algorithms for the realization of the RUT technique. Moreover, the hop count reduction (HCR) scheme is utilized as a short-cutting technique to reduce the routing hops by listening to the neighbor's traffic, while the intersection navigation (IN) mechanism is proposed to obtain the best rolling direction for boundary traversal with the adoption of shortest path criterion. In order to maintain the network requirement of the proposed RUT scheme under the non-UDG networks, the partial UDG construction (PUC) mechanism is proposed to transform the non-UDG into UDG setting for a portion of nodes that facilitate boundary traversal. These three schemes are incorporated within the GAR protocol to further enhance the routing performance with reduced communication overhead. The proofs of correctness for the GAR scheme are also given in this paper. Comparing with the existing localized routing algorithms, the simulation results show that the proposed GAR-based protocols can provide better routing efficiency.  相似文献   

3.
微机电系统、处理器、无线通信及存储技术的进步促进了无线传感器网络的飞速发展,使得无线传感器网络成为一种全新的信息获取和处理技术。在对其网络特点进行分析的基础上,介绍了无线传感器网络体系结构。路由技术是无线传感器网络通信层的核心技术,也是其组网的基础,着重讨论了无线传感器网络的路由协议的特点及其相关问题。  相似文献   

4.
In real life scenario for wireless sensor networks (WSNs), energy heterogeneity among the sensor nodes due to uneven terrain, connectivity failure, and packet dropping is a crucial factor that triggered the race for developing robust and reliable routing protocols. Prolonging the time interval before the death of the first sensor node, viz. the stability period, is critical for many applications where the feedback from the WSN must be reliable. Although Low Energy Adaptive Clustering Hierarchy (LEACH) and LEACH-like protocols are fundamental and popular clustering protocols to manage the system’s energy and thus to prolong the lifespan of the network, they assume a near to a perfect energy homogeneous system where a node failure, drainage and re-energizing are typically not considered. More recent protocols like Stable Election Protocol (SEP) considers the reverse, i.e., energy heterogeneity, and properly utilizes the extra energy to guarantee a stable and reliable performance of the network system. While paradigms of computational intelligence such as evolutionary algorithms (EAs) have attracted significant attention in recent years to address various WSN’s challenges such as nodes deployment and localization, data fusion and aggregation, security and routing, they did not (to the best of our knowledge) explore the possibility of maintaining heterogeneous-aware energy consumption to guarantee a reliable and robust routing protocol design. By this, a new protocol named stable-aware evolutionary routing protocol (SAERP), is proposed in this paper to ensure maximum stability and minimum instability periods for both homogeneous/heterogeneous WSNs. SAERP introduces an evolutionary modeling, where the cluster head election probability becomes more efficient, to well maintain balanced energy consumption in both energy homogeneous and heterogeneous settings. The performance of SAERP over simulation for 90 WSNs is evaluated and compared to well known LEACH and SEP protocols. We found that SAERP is more robust and always ensures longer stability period and shorter instability period.  相似文献   

5.
一种无线传感器网络简单按需路由协议   总被引:3,自引:1,他引:3  
对被监测对象进行实时监测,在有敏感事件突然发生时,由监测传感器及时向监测者报告被监测对象的相关信息是一类非常重要的无线传感器网络应用.针对这类应用,文章提出了一种无线传感器网络简单按需路由协议:SOD.协议通过动态汇聚节点生成协议使得节点能量消耗尽可能均衡化;利用扩散算法减少路由建立和恢复过程中消息的发送.考虑到此类应用的数据突发性和实时性特点,协议采取紧凑设计的原则,将路由请求消息与最初的突发数据相绑定,在路由建立的同时很好地保证了监测的实时性.仿真和实验表明该协议具有简单性、能量有效性和实时性等特点.  相似文献   

6.
一种改进的无线传感器网络分簇路由协议   总被引:1,自引:1,他引:1  
针对无线传感器网络中节点能量受限的特征,提出了ILEACH(improved-LEACH)分簇路由协议,达到延长网络生存时间的目的,该分簇路由协议在簇头选取时,充分考虑了节点的剩余能量;簇形成时利用了距离阈值的约束来优化分簇方案;数据收集阶段,根据节点的权值在簇头节点之间建立到基站的路由树,利用NS2仿真软件对LEACH和ILEACH协议进行仿真、比较,结果显示ILEACH具有良好的性能.  相似文献   

7.
Wireless Personal Communications - Energy efficiency to route data in wireless sensor networks is key concern to enhance network lifetime. In this paper, an energy efficient routing protocol has...  相似文献   

8.
在无线传感器网络中,节点具有有限的电池能量,为了延长网络的生存时间,提出了一种基于生成树的分布式路由协议STRP及其具有能量意识的改进版本STRP-PA.每个传感器节点根据相邻节点与基站的距离、剩余能量等信息寻找父节点,构造一棵以基站为根的近优最小生成树,节点采集的数据沿树传输,并在树杈节点进行聚合.仿真实验结果表明:STRP-PA协议能够节省网络能量,显著延长网络稳定工作的时间,性能明显好于LEACH协议.  相似文献   

9.
In this paper, we first propose a method, ABVCap, to construct a virtual coordinate system in a wireless sensor network. ABVCap assigns each node multiple 5-tuple virtual coordinates. Subsequently, we introduce a protocol, ABVCap routing, to route packets based on the ABVCap virtual coordinate system. ABVCap routing guarantees packet delivery without the computation and storage of the global topological features. Finally, we demonstrate an approach, ABVCap maintenance, to reconstruct an ABVCap virtual coordinate system in a network with node failures. Simulations show ABVCap routing ensures moderate routing path length, as compared to virtual-coordinate-based routing, GLIDER, Hop ID, GLDR, and VCap.   相似文献   

10.
This paper investigates the proposition of a new routing protocol for wireless sensor networks called TSRP (Tabu Search based Routing Protocol). In this protocol, we use the mechanism of the meta-heuristic Tabu search to route the data from the sensor (that has sense the events) to the sink. This mechanism is used to select the next sensor that will route the data based on a cost function (considering the energy and the visibility of this sensor compared to the sink). Simulation results, on a car parking application, show that TSRP prolongs the network lifetime than the existing protocols.  相似文献   

11.
In this paper, a scalable priority-based multi-path routing protocol (PRIMP) is proposed for wireless sensor networks to offer extended network lifetime and robust network fault tolerance, under the context of stringent energy constraint and vulnerability of sensors to dynamic environmental conditions. A novel interest dissemination strategy which invokes an on-demand virtual source technique is designed in PRIMP to minimize communication overheads and energy wastage. In routing, data traffic is distributed over multiple braided data paths simultaneously by a priority-based probabilistic approach at each hop to achieve the robustness against the unreliable transmission due to frequent node failures. Extensive simulations validate that PRIMP exhibits significantly better performance in energy conservation, load-balancing and data delivery than comparable schemes, while at the same time PRIMP achieves a nice scalability feature in terms of energy dissipation with various network sizes and network densities. Last but not least, PRIMP addresses the slow startup problem that is prevalent in data-centric routing schemes.  相似文献   

12.
In this paper we propose a routing protocol based on clustering (IGP-C Protocol) to extend the lifetime in the context of wireless sensor networks while optimizing other resources (memory and processor). Firstly, a clustering algorithm and a load balancing technique are used together in order to reap the benefits of both approaches. The proposed clustering algorithm with load balancing (CALB Algorithm) is a fully distributed algorithm performed by each sensor and requires only communication with its immediate neighbors. Secondly, an Improved Gossiping Protocol (IGP) is proposed to extend the CALB algorithm to the data routing. The simulation results demonstrate the better and promising performances of the IGP-C protocol compared with the other protocols proposed in the literature. The IGP-C protocol allows a better distribution of energy, memory and processing capabilities of cluster-heads and reduces the number of clusters consisting of a single sensor along with the number of iterations. This demonstrates the effectiveness of the cluster-heads election process which improves the load balancing in the wireless sensors network in terms of cluster-heads load and clusters size. Furthermore, the proposed routing strategy builds around the clustering algorithm, is effective since it reduces the data transmission delay and prolongs the network lifetime.  相似文献   

13.
The routing energy efficiency of a wireless sensor network is a crucial issue for the network lifetime. In this article, we propose MICRO (MInimum Cost Routing with Optimized data fusion), an energy-efficient routing protocol for event-driven dense wireless sensor networks. The proposed routing protocol is an improvement over the formerly proposed LEACH and PEGASIS protocol, which is designed to be implemented mainly with node computations rather than mainly with node communications. Moreover, in the routing computation the proposed scheme exploits a new cost function for energy balancing among sensor nodes, and uses an iterative scheme with optimized data fusions to compute the minimum-cost route for each event-detecting sensor node. Compared to the PEGASIS routing protocol, MICRO substantially improves the energy-efficiency of each route, by optimizing the trade-off between minimization of the total energy consumption of each route and the balancing of the energy state of each sensor node. It is demonstrated that the proposed protocol is able to outperform the LEACH and the PEGASIS protocols with respect to network lifetime by 100–300% and 10–100%, respectively.  相似文献   

14.
路由是无线传感器网络的关键问题之一。通过分析TinyOS系统中MintRoute路由协议的主要结构和路由策略。提出一种能量有效的路由协议MintRouteEE。模拟结果表明,MintRouteEE能够较大地降低网络的能耗,从而达到延长网络生存时间的目的。  相似文献   

15.
针对传统AODV路由协议在路由发现过程中采用洪泛机制会带来很大的通信开销这一问题,提出了一种基于路径深度的AODV路由协议,减少了参与路由发现过程的节点数,以减少通信开销。在节点转发路由请求时,引入一个时间延时,最大可能地选择最短路径实现通信。实验结果表明:改进的协议有效地减少了能量消耗,减少通信冲突。  相似文献   

16.
The design of routing protocols for Underwater Wireless Sensor Networks (UWSNs) poses many challenges due to the intrinsic properties of underwater environments. In this paper we present DUCS (Distributed Underwater Clustering Scheme), a new GPS-free routing protocol that does not use flooding techniques, minimizes the proactive routing message exchange and uses data aggregation to eliminate redundant information. Besides, DUCS assumes random node mobility and compensates the high propagation delays of the underwater medium using a continually adjusted timing advance combined with guard time values to minimize data loss. The theoretical and simulation studies carried out demonstrate its effectiveness.  相似文献   

17.
In wireless sensor network, the power supply is, generally, a non-renewable battery. Consequently, energy effectiveness is a crucial factor. To maximize the battery life and therefore, the duration of network service, a robust wireless communication protocol providing a best energy efficiency is required. In this paper, we present a uniform balancing energy routing protocol. In this later the transmission path is chosen for maximizing the whole network lifetime. Every transmission round, only the nodes which have their remaining energies greater than a threshold can participate as routers for other nodes in addition to sensing the environment. This choice allows the distribution of energy load among any sensor nodes; thus extends network lifetime. The experimental results shows that the proposed protocol outperforms some protocols given in the literature.  相似文献   

18.
LEACH协议首次提出在WSNs(无线传感器网络)中采用动态分簇的层次结构,大大降低了能耗,提高了网络寿命。基于集中式簇头选举的LEACH-C协议比LEACH更节省能耗,但二者都没有考虑安全性,从而可能遭遇各种攻击。论文采用动态密钥分配对LEACH-C进行了安全性改进,并提出了一种适用于集中式控制的安全分簇路由协议SLEACH-C。  相似文献   

19.
One major concern shared by many researchers about underwater wireless sensor networks (UWSNs), with respect to the limitations and particularities of underwater environment, is the problem of routing. These limitations include three-dimensional topology, limited bandwidth, node movement, long delay, limited energy, and construction costs. The new routing protocols for underwater networks have been developed on the basis of voracious routing systems. The main problem with UWSNs is finding an efficient route between the source and the target to send more packets to the target with lower levels of energy consumption. In this research, by improving VBF algorithm, which is dependent on the radius of the routing pipe, an algorithm is introduced which considers pipe radius as a function of the environment’s dimensions and of the range and the number of nodes. Consequently, by changing one of these parameters, the radius of the routing pipe changes. However, to control the energy consumed by the nodes, there exists a function that, if the recipient node’s energy to receive the packet is much lower than that of the sender node, the proposed method reduces the size of the routing pipe’s radius to lessen its chance of being selected as the guiding node so that other nodes are able to have the chance of getting the packet’s guiding node. The proposed algorithm has been compared with VBVA, HHVBF, and VBF protocols; the simulation results obtained from NS-2 simulator indicate that the proposed protocol could cut back on energy consumption, especially in networks with high number of nodes, by relying on changing the width of the routing pipe in proportion to network density. It was also successful in delivering more packets in non-dense networks.  相似文献   

20.
Wireless sensor networks consist of low cost sensor nodes which have limited power supplies, memory capacity, processing capability and transmission rate. Sensor nodes gather information from the environment and send the collected information to base station with help of a routing cooperation. Because of limited resources in Wireless Sensor Networks, fulfilling these routing operations is a major problem. Routing protocols are used to perform these operations. The most important thing by considering while these protocols are designed is energy efficiency. Because wireless sensor networks are widely used in intelligent systems, the energy efficiency of these networks is very important in IoT. Researchers have proposed several hierarchical routing protocols such as LEACH, PEGASIS, TEEN and APTEEN. In this study, an energy efficient routing protocol is developed which is more efficient than currently avaliable routing protocols. The developed protocol involves mapping of the network, sleep–wake/load balancing, data merge processes. The proposed protocol gives better results than other protocols in number of surviving nodes and amount of energy consumed criterias.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号