共查询到20条相似文献,搜索用时 0 毫秒
1.
低开销的MANET网络按需路由协议 总被引:1,自引:0,他引:1
针对简单泛洪效率低的问题,提出了一个限制洪泛的高效的路由广播算法,通过Euclidean距离来限制路由发现过程中请求分组被转发的次数;研究了减少路由维护开销,并降低路由发现的频率的方法,提出了一个基于节点高度的路由修复与优化算法,该算法使用节点监听来对链路断裂的路由进行修复与优化.基于限制泛洪的高效的路由广播算法和路由修复优化算法,提出了一种新的低开销的MANET网络按需路由协议LOOR(low overhead on-demand routing).仿真结果表明,新协议增强了路由的顽健性,减少了路由跳数,降低了路由发现的频率,提高了数据分组递送率,并显著地降低了路由控制开销. 相似文献
2.
Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer multicast in ad hoc networks. To this effect, we propose a flexible receiver-driven overlay multicast protocol which we call Application Layer Multicast Algorithm (ALMA). ALMA constructs an overlay multicast tree in a dynamic, decentralized and incremental way. First, ALMA is receiver-driven: the member nodes find their connections according to their needs. Second, it is flexible, and thus, it can satisfy the performance goals and the needs of a wide range of applications. Third, it is highly adaptive: it reconfigures the tree in response to mobility or congestion. In addition, our protocol has the advantages of an application layer protocol: (a) simplicity of deployment, (b) independence from lower layer protocols, and (c) capability of exploiting features such as reliability and security that may be provided by the lower layers. Through extensive simulations, we show that ALMA performs favorably against the currently best application layer and network layer protocols. In more detail, we find that ALMA performs significantly better than ODMRP, a network layer, for small group sizes. We conclude that the application layer approach and ALMA seem very promising for ad hoc multicasting. 相似文献
3.
In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location information to make forwarding decisions. However, there are several potential security issues for the development of position-based routing protocols. In this paper, we propose a secure geographic forwarding (SGF) mechanism, which provides source authentication, neighbor authentication, and message integrity by using both the shared key and the TIK protocol. By combining SGF with the Grid Location Service (GLS), we propose a Secure Grid Location Service (SGLS) where any receiver can verify the correctness of location messages. We also propose a Local Reputation System (LRS) aiming at detecting and isolating both compromised and selfish users. We present the performance analysis of both SGLS and LRS, and compare them with the original GLS. Simulation results show that SGLS can operate efficiently by using effective cryptographic mechanisms. Results also show that LRS effectively detects and isolates message dropping attackers from the network. 相似文献
4.
Evolution and future directions of the ad hoc on-demand distance-vector routing protocol 总被引:2,自引:0,他引:2
The ad hoc on-demand distance-vector (AODV) routing protocol has been designed for use in ad hoc networks, which are presently receiving wide interest within many diverse research communities. These networks represent a significant departure from traditional wired networks due to the distinguishing characteristics of both the wireless channel and mobile devices. Consequently, AODV incorporates many novel features for handling mobility, reduced capacity links, and the variable, indeterminate nature of the signaling range of wireless media. Since its initial design, AODV has evolved in a number of ways for improved performance, robustness, and better scalability. Nevertheless, we see many opportunities for continued improvement. This paper describes the current state of AODV, including its base functionality as well as optional features that improve performance and add capabilities. We also offer some direction for the continued evolution of AODV by presenting areas that can be targeted for future enhancements. Many of the described current and planned features are a result of AODV’s history and evolution within the Internet engineering task force. 相似文献
5.
Yu Quan Wu Kejun Luo Guoming Jin Yongxin 《电子科学学刊(英文版)》2007,24(3):412-416
A Minimizing Intermediate Multicast Routing protocol (MIMR) is proposed for dynamic multi-hop ad hoc networks. In MIMR, multicast sessions are created and released only by source nodes. In each multicast session process, the source node keeps a list of intermediate nodes and destinations, which is encapsulated into the packet header when the source node sends a multicast packet. Nodes receiving multicast packets decide to accept or forward the packet according to the list. Depending on topology matrix maintained by unicast routing, the shortest virtual hierarchy routing tree is constructed by improved Dijkstra algorithm. MIMR can achieve the minimum number of intermediate nodes, which are computed through the tree. No control packet is transmitted in the process of multicast session. Load of the network is largely decreased. Experimental result shows that MIMR is flexible and robust for dynamic ad hoc networks. 相似文献
6.
Increasing popularity and availability of portable wireless devices, which constitute mobile ad hoc networks, calls for scalable ad hoc routing protocols. On-demand routing protocols adapt well with dynamic topologies of ad hoc networks, because of their lower control overhead and quick response to route breaks. But, as the size of the network increases, these protocols cease to perform due to large routing overhead generated while repairing route breaks. We propose a multipath on-demand routing protocol (SMORT), which reduces the routing overhead incurred in recovering from route breaks, by using secondary paths. SMORT computes fail-safe multiple paths, which provide all the intermediate nodes on the primary path with multiple routes (if exists) to destination. Exhaustive simulations using GloMoSim with large networks (2000 nodes) confirm that SMORT is scalable, and performs better even at higher mobility and traffic loads, when compared to the disjoint multipath routing protocol (DMRP) and ad hoc on-demand distance vector (AODV) routing protocol. 相似文献
7.
基于缓存旁路和本地修复的多跳网络路由重建机制 总被引:1,自引:0,他引:1
该文针对多跳网络中现有AODV和AODV-BR按需路由算法的弊端,提出了基于缓存旁路和本地修复的AODV-CL路由重建机制。该机制利用空闲时间监听无线信道中传输的所有数据包和路由控制信令,用于维护有效的邻居节点列表及本地路由缓存,有效降低了周期性HELLO消息带来的信令负担,并增加了可用路由信息。中间节点在发现断链时,尝试采用局部修复,尽量避免由源节点广播RREQ消息发现路由。根据本地路由缓存及邻居节点的路由信息,实现了快速的路由发现及修复,能有效降低路由控制信令开销及丢包率。 相似文献
8.
Transmission-scheduling protocols can support contention-free link-level broadcast transmissions and delay sensitive traffic in mobile, multiple-hop packet radio networks. Use of transmission-scheduling protocols, however, can be very inefficient in mobile environments due to the difficulty in adapting transmission schedules. The paper defines a new adaptive and distributed protocol that permits a terminal to adapt transmission assignments to changes in topology using information it collects from its local neighborhood only. Because global coordination among all the terminals is not required and changes to transmission assignments are distributed to nearby terminals only, the protocol can adapt quickly to changes in the network connectivity. The two key parameters that affect the ability of the protocol to adapt to changes in connectivity are the rate of connectivity changes and the number of terminals near the connectivity changes. Using simulation, we determine the ranges for these parameters for which our adaptive protocol can maintain collision-free schedules with an acceptable level of overhead. The stability of the protocol is also characterized by showing that the protocol can quickly return to a collision-free transmission schedule after a period of very rapid changes in connectivity. Our channel-access protocol does not require a contention-based random-access phase to adapt the transmission schedules, and thus its ability to adapt quickly does not deteriorate with an increase in the traffic load. 相似文献
9.
Energy use is a crucial design concern in wireless ad hoc networks since wireless terminals are typically battery-operated.
The design objectives of energy-aware routing are two folds: Selecting energy-efficient paths and minimizing the protocol
overhead incurred for acquiring such paths. To achieve these goals simultaneously, we present the design of several on-demand
energy-aware routing protocols. The key idea behind our design is to adaptively select the subset of nodes that are required
to involve in a route-searching process in order to acquire a high residual-energy path and/or the degree to which nodes are
required to participate in the process of searching for a low-power path in networks wherein nodes have transmission power
adjusting capability. Analytical and simulation results are given to demonstrate the high performance of the designed protocols
in energy-efficient utilization as well as in reducing the protocol overhead incurred in acquiring energy-efficient routes.
Baoxian Zhang received his B.S., M.S., and Ph.D. degrees in Electrical Engineering from Northern Jiaotong University, Beijing, China in
1994, 1997, and 2000, respectively. From January 2001 to August 2002, he was working with Department of Electrical and Computer
Engineering at Queen’s University in Kingston as a postdoctoral fellow. He is currently a research scientist with the School
of Information Technology and Engineering (SITE) of University of Ottawa in Ottawa, Ontario, Canada. He has published over
40 refereed technical papers in international journals and conference proceedings. His research interests include routing
algorithm and protocol design, QoS management, wireless ad hoc and sensor networks, survivable optical networks, multicast
communications, and performance evaluation. He is a member of the IEEE.
Hussein Mouftah joined the School of Information Technology and Engineering (SITE) of the University of Ottawa in September 2002 as a Canada
Research Chair (Tier 1) Professor in Optical Networks. He has been with the Department of Electrical and Computer Engineering
at Queen’s University (1979-2002), where he was prior to his departure a Full Professor and the Department Associate Head.
He has three years of industrial experience mainly at Bell Northern Research of Ottawa, now Nortel Networks (1977-79). He
has spent three sabbatical years also at Nortel Networks (1986-87, 1993-94, and 2000-01), always conducting research in the
area of broadband packet switching networks, mobile wireless networks and quality of service over the optical Internet. He
served as Editor-in-Chief of the IEEE Communications Magazine (1995-97) and IEEE Communications Society Director of Magazines
(1998-99) and Chair of the Awards Committee (2002-2003). He is a Distinguished Speaker of the IEEE Communications Society
since 2000.
Dr. Mouftah is the author or coauthor of five books, 22 book chapters and more than 700 technical papers and 8 patents in
this area. He is the recipient of the 1989 Engineering Medal for Research and Development of the Association of Professional
Engineers of Ontario (PEO), and the Ontario Distinguished Researcher Award of the Ontario Innovation Trust. He is the joint
holder of the Best Paper Award for a paper presented at SPECTS’2002, and the Outstanding Paper Award for papers presented
at the IEEE HPSR’2002 and the IEEE ISMVL’1985. Also he is the joint holder of a Honorable Mention for the Frederick W. Ellersick
Price Paper Award for Best Paper in the IEEE Communications Magazine in 1993. He is the recipient of the IEEE Canada (Region
7) Outstanding Service Award (1995). Also he is the recipient of the 2004 IEEE Communications Society Edwin Howard Armstrong
Achievement Award, and the 2004 George S. Glinski Award for Excellence in Research of the Faculty of Engineering, University
of Ottawa. Dr. Mouftah is a Fellow of the IEEE (1990) and Fellow of the Canadian Academy of Engineering (2003). 相似文献
10.
The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct an ad hoc network of wireless smart badges in order to acquire information from trapped survivors. We investigate the energy efficient routing problem that arises in such a network and show that since smart badges have very limited power sources and very low data rates, which may be inadequate in an emergency situation, the solution of the routing problem requires new protocols. The problem is formulated as an anycast routing problem in which the objective is to maximize the time until the first battery drains-out. We present iterative algorithms for obtaining the optimal solution of the problem. Then, we derive an upper bound on the network lifetime for specific topologies and describe a polynomial algorithm for obtaining the optimal solution in such topologies. Finally, numerical results regarding the upper bound and the algorithms are presented. 相似文献
11.
We propose and investigate the SPREAD scheme as a complementary mechanism to enhance secure data delivery in a mobile ad hoc
network. The basic idea is to transform a secret message into multiple shares, and then deliver the shares via multiple paths
to the destination so that even if a certain number of message shares are compromised, the secret message as a whole is not
compromised. We present the overall system architecture and discuss three major design issues: the mathematical model for
the generation and reconstruction of the secret message shares, the optimal allocation of the message shares onto multiple
paths in terms of security, and the multipath discovery techniques in a mobile ad hoc network. Our extensive simulation results
justify the feasibility and the effectiveness of the SPREAD approach.
相似文献
Yuguang Fang (Corresponding author)Email: |
12.
Noureddine Kettaf Hafid Abouaissa Thang Vu duong Pascal Lorenz 《Telecommunication Systems》2006,33(1-3):255-267
Providing guaranteed quality of service (QoS) in wireless networks is a key issue for deploying multimedia applications. To
support such a QoS, an arduous problem concerning how to find a feasible end to end path to satisfy multiple QoS constraints
should be studied. In general, multi-constrained path selection, with or without optimization, is an NP-complete problem that
cannot be exactly solved in polynomial time. Approximation algorithms and heuristics with polynomial and pseudo-polynomial
time complexities are often used to deal with this problem. However, existing solutions suffer either from excessive computational
complexities that cannot be used for multimedia applications in ad hoc networks characterized by mobility and performance
constraints (e.g., limited energy, wireless medium, etc.). Recently a promising heuristic algorithm H_MCOP using a non linear
Lagrange relaxation path functions has demonstrated an improvement in its success rate and in finding feasible paths. However,
the H_MCOP is not suitable for ad hoc networks and has not exploited the full capability that a Lagrange relaxation could
offer. In this paper, we propose an efficient multi-constrained path heuristic called E_MCP, which exploits efficiently the
Lagrange relaxation and enhances the path search process to be adequate to mobile ad hoc networks. Using extensive simulations
on random mobile network with correlated and uncorrelated link weights, we show that the same level of computational complexity,
E_MCP can achieve a higher success ratio of finding feasible paths. 相似文献
13.
Robust position-based routing for wireless ad hoc networks 总被引:1,自引:0,他引:1
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile hosts have been proposed in the literature. A typical assumption in these protocols is that all wireless nodes have uniform transmission regions modeled by unit disk centered at each wireless node. However, all these protocols are likely to fail if the transmission ranges of the mobile hosts vary due to natural or man-made obstacles or weather conditions. These protocols may fail because either some connections that are used by routing protocols do not exist, which effectively results in disconnecting the network, or the use of some connections causes livelocks. In this paper, we describe a robust routing protocol that tolerates up to roughly 40% of variation in the transmission ranges of the mobile hosts. More precisely, our protocol guarantees message delivery in a connected ad hoc network whenever the ratio of the maximum transmission range to the minimum transmission range is at most . 相似文献
14.
Secure routing in mobile wireless ad hoc networks 总被引:3,自引:0,他引:3
We discuss several well known contemporary protocols aimed at securing routing in mobile wireless ad hoc networks. We analyze each of these protocols against requirements of ad hoc routing and in some cases identify fallibilities and make recommendations to overcome these problems so as to improve the overall efficacy of these protocols in securing ad hoc routing, without adding any significant computational or communication overhead. 相似文献
15.
16.
17.
Although more than a decade has passed from the proposal of the Cognitive Radio paradigm, in these years the research has mainly focused on physical and medium access issues, and few recent works focused on the problem of routing in cognitive networks. This paper addresses such a problem by evaluating the feasibility of reactive routing for mobile cognitive radio ad hoc networks. More specifically, we design a reactive routing protocol for the considered scenario able to achieve three goals: (i) to avoid interferences to primary users during both route formation and data forwarding; (ii) to perform a joint path and channel selection at each forwarder; (iii) to take advantage of the availability of multiple channels to improve the overall performance. Two different versions of the same protocol, referred to as Cognitive Ad-hoc On-demand Distance Vector (CAODV), are presented. The first version exploits inter-route spectrum diversity, while the second one exploits intra-route spectrum diversity. An exhaustive performance analysis of both the versions of the proposed protocol in different environments and network conditions has been carried out via numerical simulations. The results state the suitability of the proposed protocol for small mobile cognitive radio ad hoc networks. 相似文献
18.
TianHui LiYingyang 《电子科学学刊(英文版)》2003,20(2):116-120
This letter presents the design and performance of a multi-channel MAC protocol that supports multiple traffics for IEEE 802.11 mobile ad-hoc networks.The dynamic channel selection scheme by receiver decision is implemented and the number of the data channel is independent of the network topology.The priority for real-time traffic is assured by the proposed adaptive back off algorithm and different IFS.The protocol is evaluated by simulation and the results have shown that it can support multiple traffics and the performance is better than the performance that IEEE 802.11 standard provides. 相似文献
19.
NS2的Ad hoc网络AODV协议的仿真 总被引:2,自引:0,他引:2
无线Ad hoc网络作为一种典型的自组织网络,其路由协议一直是研究的重点。以仿真AODV(Adhocon.demand distancevector)协议为例介绍了NS2仿真路由协议的详细步骤,给出了仿真结果图和一些性能分析。结果表明,对路由协议性能影响最大的是数据源的发送频率。 相似文献