首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
传统的单路径路由使自组网路由性能一直不能获得太大的突破。因此,设计有效的和稳定的多路径路由成为最受关注的问题。为此提出了一种新的多路径路由算法,其在路由发现阶段使用了一种新的多路径转发策略。在基于稳定性因子的基础上,该算法计算路径间海明距离并据此选择多条相似的稳定不相交多路由,从而进一步提高该路由算法的性能。模拟结果显示,与经典的多路径路由相比较,该算法是一个有效的多路径自组网路由算法。  相似文献   

2.
An ad hoc network is a self-organizing network of wireless links connecting mobile nodes. The mobile nodes can communicate without an infrastructure. They form an arbitrary topology, where the nodes play the role of routers and are free to move randomly.  相似文献   

3.
In Mobile Ad Hoc Networks (MANETs), nodes depend upon each other for routing and forwarding packets. However, nodes belonging to independent authorities in MANETs may behave selfishly and may not forward packets to save battery and other resources. To stimulate cooperation, nodes are rewarded for their forwarding service. Since nodes spend different cost to forward packets, it is desirable to reimburse nodes according to their cost so that nodes get incentive while the least total payment is charged to the sender. However, to maximize their utility, nodes may tell lie about their cost. This poses the requirement of truthful protocols, which maximizes the utility of nodes only when they declare their true cost. Anderegg and Eidenbenz recently proposed a truthful routing protocol, named ad hoc-VCG. This protocol incurs the route discovery overhead of O(n3), where n is the number of nodes in the network. This routing overhead is likely to become prohibitively large as the network size grows. Moreover, it leads to low network performance due to congestion and interference. We present a low-overhead truthful routing protocol for route discovery in MANETs with selfish nodes by applying mechanism design. The protocol, named LOTTO (Low Overhead Truthful rouTing prOtocol), finds a least cost path for data forwarding with a lower routing overhead of O(n2). We conduct an extensive simulation study to evaluate the performance of our protocol and compare it with ad hoc-VCG. Simulation results show that our protocol provides a much higher packet delivery ratio, generates much lower overhead and has much lower end-to-end delay.  相似文献   

4.
一种激励自私无线Ad Hoc网络中节点合作的方法,向提供报文传输服务的节点提供不低于其传输成本的报酬。低开销诚实路由协议LOTER引入了VCG机制,节点在路由发现阶段收集邻居节点的信息,目标节点选择多条RREP路径,位于RREP路径上的节点将邻居节点信息沿RREP路径报告给源节点,源节点完成LCP路由选择和VCG报酬的计算。LOTER协议以低的报文开销收集网络拓扑信息,有效实现了自私无线Ad Hoc网络中的诚实能效路由。仿真结果表明,与现有协议比较,该协议具有更好的性能。  相似文献   

5.
无线自组网与传统的有线网不同,它由一些可移动的结点组成,这些结点的带宽、计算能力和能量都受到一定限制。针对这种网络,研究者们提出了按需路由协议,这些协议非常适合无线自组网这种拓扑结构,但是由于缺乏对全局拓扑和结点移动性的了解,可能达不到最优。因此提出了一种高效的路由协议ERNC,该协议基于已提出的SHORT路由协议[13],并对以前所提出的NAOR协议[14]进行了扩展,即利用网络编码技术来进一步提高路由协议的性能。最后,使用NS-2模拟器来评估ERNC的性能,结果显示ERNC在分组投递率和平均端到端时延等方面获得了比已有协议更好的性能。  相似文献   

6.
Routing protocols for Mobile ad hoc networks (MANETs) have been studied extensively in the past decade. Routing protocols for MANETs can be broadly classified as reactive (on-demand), proactive, hybrid and position-based. Reactive routing protocols are attractive because a route between a source and a destination is established only when it is needed. Such protocols, unlike proactive protocols, do not have high overhead for route maintenance and are especially suitable for networks in which not all nodes communicate frequently. One problem with existing reactive routing protocols is the propagation of redundant route request messages during route discovery. In this paper, we present a low-overhead reactive routing protocol which reduces propagation of redundant route request messages. We also compare its performance with the well-known reactive routing protocol AODV.  相似文献   

7.
Mobile Ad Hoc Networks (MANETs), which provide data networking without infrastructure, represent one kind of wireless networks. A MANET is a self-organizating and adaptive wireless network formed by the dynamic gathering of mobile nodes. Due to the mobility of mobile nodes, the topology of a MANET frequently changes and thus results in the disability of originally on-the-fly data transmission routes. The dynamic properties of MANETs are therefore challenging to protocol design. To cope with the intrinsic properties of MANETs, Dynamic Backup Routes Routing Protocol (DBR2P), a backup node mechanism for quick reconnection during link failures, is proposed in this paper. DBR2P is an on-demand routing protocol and it can set up many routes to reach a destination node in a given period. Even when a link fails, those routes from the source node to the destination node can be analyzed to obtain backup routes to sustain quick reconnection. The information of backup routes can be saved in a specific on-the-route node and enables backup routes to be found immediately in situation regarding disconnection. As a result, DBR2P could more thoroughly improve the quality of routing protocol than those proposed in the past.  相似文献   

8.
A stable weight-based on-demand routing protocol for mobile ad hoc networks   总被引:3,自引:0,他引:3  
A mobile ad hoc network (MANET) consists of a set of mobile hosts that can communicate with each other without the assistance of base stations. In MANETs, the high mobility of mobile nodes is a major reason for link failures. In this paper, we propose a stable weight-based on-demand routing protocol (SWORP) for MANETs. The proposed scheme uses the weight-based route strategy to select a stable route in order to enhance system performance. The weight of a route is decided by three factors: the route expiration time, the error count, and the hop count. Route discovery usually first finds multiple routes from the source node to the destination node. Then the path with the largest weight value for routing is selected. Simulation results show that the proposed SWORP outperforms DSR, AODV, and AODV-RFC, especially in a high mobility environment.  相似文献   

9.
传统的AODV协议应用于车载自组织网络,尽管分组投递率比较高,但在数据分组需要发送时才建立路由,网络延迟较大。而DSDV中通过周期性的路由更新机制,网络延迟小,但需维护大量不必要的路由,并且拓扑结构变化使许多路由无效,导致分组投递率非常低。为了综合满足VANET分组投递率和网络延迟的要求,将AODV和DSDV两种路由建立机制相互融合,形成混合式路由协议。首先,根据车辆节点的位置、速度和方向等移动状态周期性地选择稳定且距离适中的链路,形成网络主干并更新路由;其次,当数据分组目的节点路由不存在时,发起路由发现过程建立路由,在路由请求报文前进和路由应答报文回溯过程中求出路由过期时间。仿真实验表明,尽管路由开销有所增大,分组投递率略低于AODV,但是网络延迟显著降低。  相似文献   

10.
An efcient hop count route fnding approach for mobile ad hoc network is presented in this paper.It is an adaptive routing protocol that has a tradeof between transmission power and hop count for wireless ad hoc networks.During the route fnding process,the node can dynamically assign transmission power to nodes along the route.The node who has received route request message compares its power with the threshold power value,and then selects a reasonable route according to discriminating algorithms.This algorithm is an efective solution scheme to wireless ad hoc networks through reasonably selected path to reduce network consumption.Simulation results indicate that the proposed protocol can deliver better performances with respect to energy consumption and end-to-end delay.  相似文献   

11.
自组网路由协议综述   总被引:4,自引:0,他引:4  
在分析影响自组网路由协议设计的因素的基础上,对路由协议中的关键技术问题进行了研究和总结,包括路由环路避免、对网络动态性的适应、控制开销、节能问题以及路由协议与定位技术的结合问题。最后指出了目前路由协议研究中存在的问题,如协议需求、协议的评估方法等。  相似文献   

12.
It is a challenge to make the routes quickly adapt to the changed network topology when nodes fail in a wireless ad hoc network. In this paper, we propose an adaptive routing protocol, which groups the network nodes into virtual nodes according to their data transfer capabilities and creates virtual-node-based routes. The protocol can accommodate the routes to node failures by adaptively pdating the virtual nodes and just-in-time using available nodes during data transmission. The simulations indicate that the proposed protocol can keep the routes failed-node-freewhen the available virtual node members cover the failed nodes scattering area.  相似文献   

13.
讨论了层状移动AdHoc网络的一个信息传播路由算法和基于半马尔可夫过程的节点移动跟踪模型,通过该路由算法可以有效地解决层状子网络间的通信和信息交换。通过路由算法得到的中继节点的移动跟踪模型和计算机仿真,分析了层状移动AdHoc网络的传播性能和路由开销,并得出:当 0≤ρ≤ 1时,层状AdHoc网络的传播性能显著地受到移动呼叫率ρ的影响,当ρ>1时,层状AdHoc网络的传播性能主要取决于移动网络的节点总数、节点移动速度和加速度的结论。  相似文献   

14.
Kuo-Feng  Chun-Hao  Chih-Hsun  An-Kuo 《Computer Networks》2009,53(15):2663-2673
In mobile ad hoc networks (MANETs), each node has the ability to transmit, receive, and route packets, and also moves through the field either randomly or in accordance with a pre-planned route. For enhancing the performance of MANETs, reducing the routing distance is a primary concern. For either ad hoc or static networks, the problem of minimizing the overall routing distance during multicasting is NP-complete. Therefore, it is difficult to determine an optimal solution. This paper presents an efficient geographic multicast protocol, designated as GMFP, based on the use of Fermat points. The objective of GMFP is to improve the overall routing distance for multicast tasks. Through a series of simulations, it is shown that GMFP outperforms the conventional Position-Based Multicast protocol and FERMA protocol in terms of the total routing distance, the packet transmission delay, the packet delivery ratio, and the node energy consumption. The performance improvements provided by GMFP are apparent as the scale of the network topology increases.  相似文献   

15.
In this paper, a novel decentralized cross-layer multi-hop cooperative network architecture is proposed and presented. This cross-layer architecture introduces a new cooperative flooding scheme and two decentralized opportunistic cooperative forwarding mechanisms based on randomized coding, and a Routing Enabled Cooperative Medium Access Control (RECOMAC) protocol that enables cooperative forwarding, while incorporating physical, medium access control (MAC) and routing layers. RECOMAC employs randomized coding to realize cooperative diversity, so that relay selection and actuation mechanisms are alleviated and the MAC costs are reduced. The coded packets are routed in the network via the proposed cooperative forwarding schemes, which opportunistically form cooperative sets within a region, not needing a prior route to be established. Essentially, in the RECOMAC architecture, the routing layer functionality is submerged into the MAC layer to provide seamless cooperative communication, while the messaging overhead to set up routes, select and actuate relays is reduced. We evaluate the performance of RECOMAC in terms of network throughput, delay and MAC and routing overhead, in comparison to the conventional architecture based on the well-known IEEE 802.11 MAC and Ad hoc On Demand Distance Vector (AODV) routing protocols. RECOMAC is shown to provide quite significant improvement by an order of magnitude difference in all investigated performance metrics, under a variety of scenarios, considering different network sizes, static and mobile scenarios and networks with multiple flows.  相似文献   

16.
A mobile ad hoc network (MANET) is a collection of mobile hosts that form a temporary network on the fly without using any fixed infrastructure. Recently, the explosive growth in the use of real-time applications on mobile devices has resulted in new challenges to the design of protocols for MANETs. Chief among these challenges to enable real-time applications for MANETs is incorporating support for quality of service (QoS), such as bandwidth constraints. However, MANETs having a high ratio of topology change make routing especially unstable; making stability is an important challenge, especially for routing having a quality of service provision. In this paper, we propose a reliable multi-path QoS routing (RMQR) protocol with a slot assignment scheme. In this scheme, we examine the QoS routing problem associated with searching for a reliable multi-path (or uni-path) QoS route from a source node to a destination node in a MANET. This route must also satisfy certain bandwidth requirements. We determine the route expiration time between two connected mobile nodes using global positioning system (GPS). Then, two parameters, the route expiration time and the number of hops, are used to select a routing path with low latency and high stability. Simulation results show that the proposed RMQR protocol have some outstanding properties when compared with Lin's [Lin C-R. On-demand QoS routing in multihop mobile networks. In: Proceedings of the twentieth annual joint conference of the IEEE computer and communications societies (INFOCOM), vol. 3(22–26), 2001, p. 1735–44], Liao's [Liao W-H, Tseng Y-C, Wang S-L, Sheu J-P. A multi-path QoS routing protocol in a wireless mobile Ad Hoc network. Telecommunication Systems 2002;19(3–4):329–47], and Chen's [Chen Y-S, Tseng Y-C, Sheu J-P, Kuo P-H. An on-demand, link-state, multi-path QoS routing in a wireless mobile Ad-Hoc network. Computer Communications 204;27(1):27–40] protocols.  相似文献   

17.
Many routing protocols for mobile ad hoc networks assume that the node density of the network is sufficiently high that network partitions do not occur. However, in practice, this assumption is invalid since the mobility and random deployment of the nodes can easily cause partitions to take place. Therefore, this paper develops an approach for identifying suitable helping nodes to carry data packets from one partition to another during geographic routing. Unlike the assisting nodes proposed in previous schemes, the helping nodes are chosen from a group of regular mobile nodes that can move freely throughout the network. In addition, handoff procedures which may be required during the routing trip are implemented. Two mechanisms based on the approach were evaluated using network simulator 2. The evaluation results demonstrate that the algorithm successfully improves successful delivery ratio without needing special assisting nodes and only induces a little more routing overhead and energy consumption to the system.  相似文献   

18.
Location aware, dependable multicast for mobile ad hoc networks   总被引:1,自引:0,他引:1  
This paper introduces dynamic source multicast (DSM), a new protocol for multi-hop wireless (i.e., ad hoc) networks for the multicast of a data packet from a source node to a group of mobile nodes in the network. The protocol assumes that, through the use of positioning system devices, each node knows its own geographic location and the current (global) time, and it is able to efficiently spread these measures to all other nodes. When a packet is to be multicast, the source node first locally computes a snapshot of the complete network topology from the collected node measures. A Steiner (i.e., multicast) tree for the addressed multicast group is then computed locally based on the snapshot, rather than maintained in a distributed manner. The resulting Steiner tree is then optimally encoded by using its unique Pr

u" height="11" width="9">fer sequence and is included in the packet header as in, and extending the length of the header by no more than, the header of packets in source routing (unicast) techniques. We show that all the local computations are executed in polynomial time. More specifically, the time complexity of the local operation of finding a Steiner tree, and the encoding/decoding procedures of the related Prüfer sequence, is proven to be O(n2), where n is the number of nodes in the network. The protocol has been simulated in ad hoc networks with 30 and 60 nodes and with different multicast group sizes. We show that DSM delivers packets to all the nodes in a destination group in more than 90% of the cases. Furthermore, compared to flooding, DSM achieves improvements of up to 50% on multicast completion delay.  相似文献   

19.
In mobile ad hoc and sensor networks, greedy-face-greedy (GFG) geographic routing protocols have been a topic of active research in recent years. Most of the GFG geographic routing protocols make an ideal assumption that nodes in the network construct a unit-disk graph, UDG, and extract a planar subgraph from the UDG for face routing. However, the assumption of UDG may be violated in realistic environments, which may cause the current GFG geographic routing protocols to fail. In this paper, we propose a Pre-Processed Cross Link Detection Protocol, PPCLDP, which extracts an almost planar subgraph from a realistic network graph, instead of a UDG, for face routing and makes the GFG geographic routing work correctly in realistic environments with obstacles. The proposed PPCLDP improves the previous work of Cross Link Detection Protocol, CLDP, with far less communication cost and better convergence time. Our simulation results show that the average communication cost and the average convergence time of PPCLDP are, respectively, 65% and 45% less than those of CLDP. This makes PPCLDP more desirable for mobile ad hoc and sensor networks.  相似文献   

20.
Chun-Ta Li 《Information Sciences》2011,181(23):5333-5347
More attention should be paid to anonymous routing protocols in secure wireless ad hoc networks. However, as far as we know, only a few papers on secure routing protocols have addressed both issues of anonymity and efficiency. Most recent protocols adopted public key Infrastructure (PKI) solutions to ensure the anonymity and security of route constructing mechanisms. Since PKI solution requires huge and expensive infrastructure with complex computations and the resource constraints of small ad hoc devices; a two-layer authentication protocol with anonymous routing (TAPAR) is proposed in this paper. TAPAR does not adopt public key computations to provide secure and anonymous communications between source and destination nodes over wireless ad hoc networks. Moreover, TAPAR accomplishes mutual authentication, session key agreement, and forward secrecy among communicating nodes; along with integration of non-PKI techniques into the routing protocol allowing the source node to anonymously interact with the destination node through a number of intermediate nodes. Without adopting PKI en/decryptions, our proposed TAPAR can be efficiently implemented on small ad hoc devices while at least reducing the computational overhead of participating nodes in TAPAR by 21.75%. Our protocol is certainly favorable when compared with other related protocols.  相似文献   

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

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