共查询到20条相似文献,搜索用时 78 毫秒
1.
针对现有的基于社会组的机会网络路由协议(SGBR)存在中继节点的选择和消息副本数量的分配不合理的问题,提出了基于社会组的高投递率机会网络路由协议(SGBRHDR)。SGBRHDR协议是一种采用分布式划分社会组的多副本路由协议。在社会组内,节点依据平均关系强度值决定相遇节点是否成为转发节点;在社会组间,节点依据相遇节点所在的社会组活跃性大小分配消息副本数量。采用ONE工具对SGBRHDR协议进行了仿真,仿真结果表明:与SGBR协议相比,SGBRHDR协议减小了消息平均端到端时延的同时,消息投递成功率提高了18%。 相似文献
2.
3.
4.
5.
6.
在分析Ad hoc网络中的经典路由协议AODV的基础上,结合无线网状网的特点,提出了基于链路加权的无线网状网路由协议MODVWLS.协议通过节点的可用带宽、缓冲队列和吞吐性能等计算每一跳的代价(即权重),选择从信源到信宿累计权重最小的路径作为路由.对链路权重计算、报文格式、路由发现和维护过程进行了详细阐述,并利用NS2对MODVWLS协议进行了仿真实现.结果表明,MODVWLS协议能合理利用空闲节点和链路资源,较好地均衡网络负载,在数据包转发率、端到端延迟和标准化路由负载等性能上均优于AODV协议. 相似文献
7.
针对智能电网(SG)中电力线通信(PLC)网络中负载均衡的问题,提出了一个自适应机会路由协议——负载均衡的机会路由协议(LBORP)。在LBORP中,所有收到数据包的候选转发节点都有机会参与到数据包的转发中,不再局限于一条路由路径,避免了流量仅从一条链路经过导致的负载不均衡现象;而且候选转发节点的转发优先级不仅考虑到转发节点到目的节点的距离,还考虑到了PLC链路的不稳定性以及流量的变化。除此之外,在LBORP中采用一种隐式确认方案,进一步减少协议的端到端时延。在仿真实验中,与基于有序树的PLC路由协议(PLC-TR)和PLC机会路由协议(PLC-OR)相比,LBORP在时延上分别降低了19.7%和45.8%,在丢包率上分别降低了23.4%和32.5%。实验结果表明,LBORP能够实现网络的负载均衡,提升网络的可靠性并减小端到端时延。 相似文献
8.
《电子技术应用》2017,(9):119-122
针对现有考虑节点编码机会的编码感知路由协议Ex CAR(a coding-aware routing protocol termed extended coding aware routing)在无线链路不稳定的情况下转发节点集内的节点在计算编码机会时可能产生误判,以及在转发节点集内选择最优编码节点时需要交换大量的数据包缓存信息会导致较大的端到端时延和网络开销等问题,提出一种适用于多跳无线网络的节点编码感知机会转发路由协议NAOFP(node network coding aware opportunistic forwarding routing protocol)。NAOFP协议通过引入基于侦听概率的附加ID信息添加机制和转发节点集的最优转发节点选择机制,提高了网络吞吐量和编码包的解码成功率,减小了数据包的平均端到端时延。仿真结果表明,与Ex CAR协议相比,NAOFP协议在网络吞吐量、平均端到端时延、编码包的解码成功率等方面的性能均得到了有效的改善。 相似文献
9.
针对无线传感器网络节点能量有限和网络拥塞问题,采用一种基于蚁群系统的能量均衡多路径路由协议。在路由发现过程中,综合考虑节点最小剩余能量和平均剩余能量,通过跨层设计模型获取节点距离信息和节点队列长度作为启发式函数,利用蚁群系统的特点形成多路径的数据传输。仿真结果表明,该路由协议在端到端传输时延和能量均衡等方面优于其它协议。 相似文献
10.
无线Ad Hoc网络能量感知地理路由协议研究进展 总被引:1,自引:0,他引:1
无线Ad Hoc网络(以下简称为Ad Hoc网络)能量感知地理路由协议深度影响网络性能,具有降低网络能量消耗、延长网络寿命等功效,受到越来越多的关注.系统阐述了Ad Hoc网络能量感知地理路由协议的研究进展.首先介绍了Ad Hoc网络地理路由,进而详细概述了能量感知地理路由协议形成的背景、度量指标、节点选择规则、研究意义及分类;然后,详细介绍了典型能量感知地理路由协议,并从多角度对其进行了归纳总结与比较;最后,阐述了能量感知地理路由协议研究存在的问题,指出了未来需要研究的内容,并在此基础上进行总结. 相似文献
11.
Muhammad Azhar Iqbal Bin Dai Benxiong Huang A. Hassan Shui Yu 《Journal of Network and Computer Applications》2011,34(6):1956-1970
In recent times, there have been many advances in the field of information theory and wireless ad hoc network technologies. Regarding information theory progression and its connection with wireless ad hoc networks, this study presents fundamental concepts related to the application of the state-of-the-art Network Coding (NC) within wireless ad hoc networks in the context of routing. To begin with, this paper briefly describes opportunistic routing and identifies differentiation between NC-aware and NC-based routing mechanisms in wireless ad hoc networks. However, our main focus is to provide a survey of available NC-aware routing protocols that make forwarding decisions based on the information of available coding opportunities across several routes within wireless ad hoc networks. The taxonomy and characteristics of various representative NC-aware routing protocols will also be discussed. In summary, we provide a comparison of available NC-aware routing schemes and conclude that NC-aware routing techniques have several advantages over traditional routing in terms of high throughput, high reliability, and lower delay in a wireless scenario. To the best of our knowledge, this work is the first that provides comprehensive discussion about NC-aware routing protocols. 相似文献
12.
基于身份加密的机会网络安全路由架构 总被引:1,自引:0,他引:1
机会网络整合了容迟网络、移动自组织网络、社会网络等多种概念,可通过移动节点的相遇性机会实现消息的传输与共享,针对机会网络中目前较为流行的基于社会上下文的路由转发协议,设计了基于身份加密的安全架构来保证节点社会上下文的隐私性以及消息的机密性:通过可搜索的加密算法为每一个节点的社会属性设置相应的陷门,使得中继节点在可计算自... 相似文献
13.
Wang BoAuthor Vitae Huang ChuanheAuthor VitaeLi LayuanAuthor Vitae Yang WenzhongAuthor Vitae 《Journal of Systems and Software》2011,84(12):2107-2122
Recently, opportunistic routing has received much attention as a new design direction. It can exploit the wireless broadcast and more highly reliable opportunistic forwarding, so as to substantially increase the throughput of network. Due to dynamic topology, distributed collaboration, limited bandwidth and computing ability, the absence of enough physical protection in Ad hoc networks, opportunistic routing is vulnerable to attacks by malicious nodes. In order to alleviate the malicious behaviors, we incorporate the concept of trust to Ad hoc networks, build a simple trust model to evaluate neighbors’ forwarding behavior and apply this model to opportunistic routing for Ad hoc networks. A new trusted opportunistic forwarding model is proposed by choosing the trusted and highest priority candidate forwarder, then a trusted minimum cost routing algorithm (MCOR) is formally formulated, the correctness and effectiveness of this algorithm from theoretical analysis are also approved. Finally, MCOR algorithm is verified by simulation using nsclick software and compared its performance with the classic protocols: ExOR, TAODV and Watchdog-DSR. The simulation results show that MCOR scheme can detect and mitigate node misbehaviors. Furthermore, MCOR scheme outperforms the other protocols in terms of: throughput, delay, Expected ETX, security-gains and cost of routing. 相似文献
14.
15.
Energy consumption is an important issue in the design of wireless sensor networks (WSNs) which typically rely on portable energy sources like batteries for power. Recent advances in ambient energy harvesting technologies have made it possible for sensor nodes to be powered by ambient energy entirely without the use of batteries. However, since the energy harvesting process is stochastic, exact sleep-and-wakeup schedules cannot be determined in WSNs Powered solely using Ambient Energy Harvesters (WSN–HEAP). Therefore, many existing WSN routing protocols cannot be used in WSN–HEAP. In this paper, we design an opportunistic routing protocol (EHOR) for multi-hop WSN–HEAP. Unlike traditional opportunistic routing protocols like ExOR or MORE, EHOR takes into account energy constraints because nodes have to shut down to recharge once their energy are depleted. Furthermore, since the rate of charging is dependent on environmental factors, the exact identities of nodes that are awake cannot be determined in advance. Therefore, choosing an optimal forwarder is another challenge in EHOR. We use a regioning approach to achieve this goal. Using extensive simulations incorporating experimental results from the characterization of different types of energy harvesters, we evaluate EHOR and the results show that EHOR increases goodput and efficiency compared to traditional opportunistic routing protocols and other non-opportunistic routing protocols suited for WSN–HEAP. 相似文献
16.
Abraham Martín-Campillo Jon Crowcroft Eiko Yoneki Ramon Martí 《Journal of Network and Computer Applications》2013,36(2):870-880
Forwarding data in scenarios where devices have sporadic connectivity is a challenge. An example scenario is a disaster area, where forwarding information generated in the incident location, like victims' medical data, to a coordination point is critical for quick, accurate and coordinated intervention. New applications are being developed based on mobile devices and wireless opportunistic networks as a solution to destroyed or overused communication networks. But the performance of opportunistic routing methods applied to emergency scenarios is unknown today. In this paper, we compare and contrast the efficiency of the most significant opportunistic routing protocols through simulations in realistic disaster scenarios in order to show how the different characteristics of an emergency scenario impact in the behaviour of each one of them. 相似文献
17.
无线传感器网络多径路由协议综述 总被引:1,自引:0,他引:1
由于无线传感器网络不同于传统的自组织网络,已有自组织网络路由协议不能有效应用于传感器网络中.文献中已提出不少无线传感器网络路由协议,但这些协议大多针对单路径情况.当链路失效时,单径路由协议需要重新发现新的路由,从而会对传输延时、能耗和可靠性带来较大影响.采用多径路由协议可弥补单径路由协议的不足,有利于提高数据传输的可靠性和实现负载平衡.通过对目前文献中几种典型的多径路由协议的分析和比较,指出进一步研究中值得关注的问题. 相似文献
18.
Muhammad Mehran Ajmal Sajjad A. Madani Tahir Maqsood Kashif Bilal Babar Nazir Khizar Hayat 《Computers & Electrical Engineering》2013
Opportunistic routing is an emerging research area in Wireless Mesh Networks (WMNs), that exploits the broadcast nature of wireless networks to find the optimal routing solution that maximizes throughput and minimizes packet loss. Opportunistic routing protocols mainly suffer from computational overheads, as most of the protocols try to find the best next forwarding node. In this paper we address the key issue of computational overhead by designing new routing technique without using pre-selected list of potential forwarders. We propose a novel opportunistic routing technique named, Coordinated Opportunistic Routing Protocol for WMNs (CORP-M). We compare CORP-M with well-known protocols, such as AODV, OLSR, and ROMER based on throughput, delivery ratio, and average end-to-end delay. Simulation results show that CORP-M, gives average throughput increase upto 32%, and increase in delivery ratio (from 10% to 20%). We also analyze the performance of CORP-M and ROMER based on various parameters, such as duplicate transmissions and network collisions, by analysis depicts that CORP-M reduces duplicate transmissions upto 70% and network collisions upto 30%. 相似文献
19.
基于有效传输的能量敏感的路由协议 总被引:1,自引:0,他引:1
能量敏感是传感器网络设计中的一个基本要求,现有的基于位置的路由协议都没有考虑下一跳节点与源节点的距离,使得传输效率不高。本文通过引入有效传输(ET)概念保证每个前向节点比其前驱节点不仅更加靠近目标节点,而且更加远离源节点,提出一种基于ET的能量敏感的路由协议。仿真结果表明这种路由协议与其它一些协议比较起来,可以提供较低的能量消耗。 相似文献
20.
Wireless sensor networks are inherently plagued by problems of node failure, interference to communications from environmental noise and energy-limited sensor motes. These problems pose conflicting issues in the design of suitable routing protocols. Several existing reliable routing protocols exploit message broadcast redundancy and hop count as routing metrics and their performance trade-offs are revealed during simulation. In this paper, we study and analyse related design issues in proposed efficient and reliable routing protocols that attempt to achieve reliable and efficient communication performance in both single- and multi-hub sensor networks. Simulation results of four such routing protocols show that routing performance depends more on optimal (near-optimal) routing in single hub than in multi-hub networks. Our work also shows that optimal (near-optimal) routing is better achieved when historical metrics like packet distance traversed and transmission success are also considered in the routing protocol design. 相似文献