共查询到20条相似文献,搜索用时 0 毫秒
1.
Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks 总被引:25,自引:0,他引:25
Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called Dynamic Source Routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Our modeling effort shows that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths. We perform some simulation experiments which validate these findings. 相似文献
2.
Predictive Caching Strategy for On-Demand Routing Protocols in Wireless Ad Hoc Networks 总被引:1,自引:0,他引:1
Route caching strategy is important in on-demand routing protocols in wireless ad hoc networks. While high routing overhead usually has a significant performance impact in low bandwidth wireless networks, a good route caching strategy can reduce routing overheads by making use of the available route information more efficiently. In this paper, we first study the effects of two cache schemes, link cache and path cache, on the performance of on-demand routing protocols through simulations based on the Dynamic Source Routing (DSR) protocol. Since the path cache DSR has been extensively studied, we focus in this paper on the link cache DSR in combination with timer-based stale link expiry mechanisms. The effects of different link lifetime values on the performance of routing protocol in terms of routing overhead, packet delivery ratio and packet latency are investigated. A caching strategy incorporating adaptive link timeout is then proposed, which aims at tracking the optimal link lifetime under various node mobility levels by adaptively adjusting the link lifetime based on the real link lifetime statistics. The performance of the proposed strategy is then compared with the conventional path cache DSR. The results show that without a timeout mechanism, a link cache scheme may suffer severe performance degradation due to the use of broken routes, while the proposed adaptive link cache strategy achieves significantly improved performance by reducing the routing overhead when the network traffic load is high. 相似文献
3.
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks 总被引:9,自引:0,他引:9
An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives. 相似文献
4.
A mobile ad hoc network (MANET) is characterized by multi-hop wireless links and frequent node mobility. Communication between non-neighboring nodes requires a multi-hop routing protocol to establish a route. But, the route often breaks due to mobility. The source must rediscover a new route for delivering the data packets. This wastes the resources that are limited in MANET. In this paper, a new on-demand routing protocol is proposed, named on-demand routing protocol with backtracking (ORB), for multi-hop mobile ad hoc networks. We use the multiple routes and cache data technique to reduce the rediscovery times and overhead. After executing the route discovery phase, we find out a set of nodes, named checkpoint, which has the multiple routes to the destination. When a checkpoint node receives a data packet, it caches this data packet in its buffer within a specific time period. When a node detects a broken route during the data packets delivery or receives an error packet, it will either recover the broken route or reply the error packet to the source. If a node can not forward the data packet to the next node, it replies an error packet to the source. This packet is backtracking to search a checkpoint to redeliver the data packet to the destination along other alternate routes. The main advantage of ORB is to reduce the flooding search times, maybe just delay and cost while a route has broken. The experimental results show that the proposed scheme can increase the performance of delivery but reduce the overhead efficiently comparing with that of AODV based routing protocols.
Hua-Wen Tsai received the B.S. degree in Information Management from Chang Jung Christian University, Taiwan, in June 1998 and the M.B.A. degree in Business and Operations Management from Chang Jung Christian University, Taiwan, in June 2001. Since September 2001, he has been working towards the Ph.D. degree and currently is a doctoral candidate in the Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan. His research interests include wireless communication, ad hoc networks, and sensor networks.
Tzung-Shi Chen received the B.S. degree in Computer Science and Information Engineering from Tamkang University, Taiwan, in June 1989 and the Ph.D. degree in Computer Science and Information Engineering from National Central University, Taiwan, in June 1994. He joined the faculty of the Department of Information Management, Chung Jung University, Tainan, Taiwan, as an Associate Professor in June 1996. Since November 2002, he has become a Full Professor at the Department of Information Management, Chung Jung University, Tainan, Taiwan. He was a visiting scholar at the Department of Computer Science, University of Illinois at Urbana-Champaign, USA, from June to September 2001. He was the chairman of the Department of Information Management at Chung Jung University from August 2000 to July 2003. Since August 2004, he has become a Full Professor at the Department of Information and Learning Technology, National University of Tainan, Tainan, Taiwan. Currently, he is the chairman of the Department of Information and Learning Technology, National University of Tainan. He co-received the best paper award of 2001 IEEE ICOIN-15. His current research interests include mobile computing and wireless networks, mobile learning, data mining, and pervasive computing. Dr. Chen is a member of the IEEE Computer Society.
Chih-Ping Chu received the B.S. degree in agricultural chemistry from National Chung Hsing University, Taiwan, the M.S. degree in computer science from the University of California, Riverside, and the Ph.D. degree in computer science from Louisiana State University. He is currently a Professor in the Department of Computer Science and Information Engineering of National Cheng Kung University, Taiwan. His current research interests include parallel computing, parallel processing, component-based software development, and internet computing. 相似文献
5.
6.
7.
Channel Adaptive Shortest Path Routing for Ad Hoc Networks 总被引:6,自引:2,他引:6
1 IntroductionAdhocnetworksareformedwithoutrequiringthepreexistinginfrastructureorcentralizedadminis tration ,incontrasttocellularnetworks.Asidefromtheoriginalmilitaryapplication ,ithasapplicationinpublicsafetyandcommercialareas,butadaptiveprotocolsarerequiredinorderforthemtodoso .Twoimportantcharacteristicsofacommunicationlinkinadhocnetworksareitsunreliabilityanditsvariability .Thelinksinsuchanetworkareunreli ablebecauseoffading ,interference,noise,andper hapsthefailureofthetransmittingorrec… 相似文献
8.
Geocasting is a variation on the notion of multicasting. A geographical area is associated with each geocast, and the geocast is delivered to the nodes within the specified geographical area. Thus, geocasting may be used for sending a message that is likely to be of interest to everyone in a specified area. In this paper, we propose three geocasting protocols for ad hoc networks, obtained as variations of a multicast flooding algorithm, and then evaluate these approaches by means of simulations. Proposed geocasting algorithms attempt to utilize physical location information to decrease the overhead of geocast delivery. 相似文献
9.
An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks 总被引:6,自引:0,他引:6
A mobile ad hoc network (or manet) is a group of mobile, wireless nodes which cooperatively form a network independent of any fixed infrastructure or centralized administration. In particular, a manet has no base stations: a node communicates directly with nodes within wireless range and indirectly with all other nodes using a dynamically-computed, multi-hop route via the other nodes of the manet.Simulation and experimental results are combined to show that energy and bandwidth are substantively different metrics and that resource utilization in manet routing protocols is not fully addressed by bandwidth-centric analysis. This report presents a model for evaluating the energy consumption behavior of a mobile ad hoc network. The model was used to examine the energy consumption of two well-known manet routing protocols. Energy-aware performance analysis is shown to provide new insights into costly protocol behaviors and suggests opportunities for improvement at the protocol and link layers. 相似文献
10.
In this paper, we propose a novel on-demand energy-aware routing protocol, UBPCR [utility-based power control routing], which
reduces the trade-offs that arise in the other energy-aware route selection mechanisms that have recently been proposed for
mobile ad hoc networks. Our approach is based on an economic framework that represents the degree of link's satisfaction (utility).
With UBPCR, the utility function for any transmitter-receiver pair is defined as a measure of the link's preference regarding
the signal-to-interference-and-noise ratio (SINR), the transmit power, and the transmitter's residual battery capacity. During
a route-searching process, each intermediate node between the source and the destination is executed via two consecutive phases:
the scheduling phase and the transmit power control phase. The scheduling algorithm finds the proper qualified data slot for
the receiving channel so that the transmissions of independent transmitters can be coordinated. The transmit power control
determines the optimal power, if one exists, that maximizes the corresponding link's utility. Extensive simulations show that
the UBPCR protocol can achieve incompatible goals simultaneously and fairly.
Chan-Ho Min received the B.S. degree in Industrial Management and the M.S. degree in Industrial Engineering from Korea Advanced Institute
of Science and Technology (KAIST) in 2000 and 2002, respectively, where he is currently pursuing the doctoral degree in Industrial
Engineering (Telecommunication Engineering Interdisciplinary Program) at KAIST. His research interests include the optimization
problems of radio resource management for broadband wireless/cellular/ad hoc/satellite communication networks. In particular,
he focuses on mobile ad hoc networking.
Sehun Kim received the B.S. degree in Physics from Seoul National University, Seoul, Korea, and the M.S .and Ph.D. degrees in Operations
Research from Stanford University. In 1982, he joined the faculty of the Korea Advanced Institute of Science and Technology
(KAIST), where he is currently a Professor of Industrial Engineering. His research has been in the areas of combinatorial
and nonlinear optimization. Recently, he is working on the application of optimization techniques to the design and analysis
of computer and communication systems. He has published a number of papers in Mathematical Programming, Operations Research
Letters, Journal of Optimization Theory and Applications, IEEE Trans. on Vehicular Technology, and International Journal of
Satellite Communications. 相似文献
11.
Azzedine Boukerche 《Mobile Networks and Applications》2004,9(4):333-342
A mobile ad hoc network is a collection of autonomous mobile nodes that communicate with each other over wireless links. Such networks are expected to play an increasingly important role in future civilian and military settings, being useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable and movement of communicating parties is possible. However, since there is no stationary infrastructure such as base stations, mobile hosts need to operate as routers in order to maintain the information about the network connectivity. Therefore, a number of routing protocols have been proposed for ad hoc wireless networks. In this paper, we study and compare the performance of the following routing protocols AODV, PAODV (preemptive AODV), CBRP, DSR, and DSDV. A variety of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. Our results indicate that despite its improvement in reducing route request packets, CBRP has a higher overhead than DSR because of its periodic hello messages while AODV's end-to-end packet delay is the shortest when compared to DSR and CBRP. PAODV has shown little improvements over AODV. 相似文献
12.
13.
Gomez Javier Campbell Andrew T. Naghshineh Mahmoud Bisdikian Chatschik 《Wireless Networks》2003,9(5):443-460
This paper introduces PARO, a dynamic power controlled routing scheme that helps to minimize the transmission power needed to forward packets between wireless devices in ad hoc networks. Using PARO, one or more intermediate nodes called redirectors elects to forward packets on behalf of source–destination pairs thus reducing the aggregate transmission power consumed by wireless devices. PARO is applicable to a number of networking environments including wireless sensor networks, home networks and mobile ad hoc networks. In this paper, we present the detailed design of PARO and evaluate the protocol using simulation and experimentation. We show through simulation that PARO is capable of outperforming traditional broadcast-based routing protocols (e.g., MANET routing protocols) due to its energy conserving point-to-point on-demand design. We discuss our experiences from an implementation of the protocol in an experimental wireless testbed using off-the-shelf radio technology. We also evaluate the impact of dynamic power controlled routing on traditional network performance metrics such as end-to-end delay and throughput. 相似文献
14.
ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks 总被引:2,自引:0,他引:2
Ad hoc networks, which do not rely on any infrastructure such as access points or base stations, can be deployed rapidly and
inexpensively even in situations with geographical or time constraints. Ad hoc networks are attractive in both military and
disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both
as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an
efficient routing protocol. As more and more wireless devices connect to the network, it is important to design a scalable
routing protocol for ad hoc networks. In this paper, we present Anchor-based Routing Protocol (ABRP), a scalable routing protocol
for ad hoc networks. It is a hybrid routing protocol, which combines the table-based routing strategy with the geographic
routing strategy. However, GPS (Global Positioning System) (Kaplan, Understanding GPS principles and Applications, Boston:
Artech House publishers, 1996) support is not needed. ABRP consists of a location-based clustering protocol, an intra-cell
routing protocol and an inter-cell routing protocol. The location-based clustering protocol divides the network region into
different cells. The intra-cell routing protocol routes packets within one cell. The inter-cell routing protocol is used to
route packets between nodes in different cells. The combination of intra-cell and inter-cell routing protocol makes ABRP highly
scalable, since each node needs to only maintain routes within a cell. The inter-cell routing protocol establishes multiple
routes between different cells, which makes ABRP reliable and efficient. We evaluate the performance of ABRP using ns2 simulator.
We simulated different size of networks from 200 nodes to 1600 nodes. Simulation results show that ABRP is efficient and scales
well to large networks. ABRP combines the advantages of multi-path routing strategy and geographic routing strategy—efficiency
and scalability, and avoids the burden—GPS support. 相似文献
15.
16.
AMRoute: Ad Hoc Multicast Routing Protocol 总被引:13,自引:0,他引:13
Jason Xie Rajesh R. Talpade Anthony McAuley Mingyan Liu 《Mobile Networks and Applications》2002,7(6):429-439
The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical cores. It creates a bidirectional, shared tree for data distribution using only group senders and receivers as tree nodes. Unicast tunnels are used as tree links to connect neighbors on the user-multicast tree. Thus, AMRoute does not need to be supported by network nodes that are not interested/capable of multicast, and group state cost is incurred only by group senders and receivers. Also, the use of tunnels as tree links implies that tree structure does not need to change even in case of a dynamic network topology, which reduces the signaling traffic and packet loss. Thus AMRoute does not need to track network dynamics; the underlying unicast protocol is solely responsible for this function. AMRoute does not require a specific unicast routing protocol; therefore, it can operate seamlessly over separate domains with different unicast protocols. Certain tree nodes are designated by AMRoute as logical cores, and are responsible for initiating and managing the signaling component of AMRoute, such as detection of group members and tree setup. Logical cores differ significantly from those in CBT and PIM-SM, since they are not a central point for data distribution and can migrate dynamically among member nodes. Simulation results (using ns-2) demonstrate that AMRoute signaling traffic remains at relatively low level for typical group sizes. The results also indicate that group members receive a high proportion of data multicast by senders, even in the case of a highly dynamic network. 相似文献
17.
Flood-search on-demand routing has received considerable interest for its application to mobile ad hoc networks. To alleviate the effects of flooding the network with control packets to discover a route, the concept of an expanding ring search (ERS) has been proposed elsewhere for reducing the packet transmission overhead of the route discovery process. Essentially, ERS consists of incrementally increasing the allowable hop radius of the flood search until a route to the target node is returned. However, ERS incurs additional latency to successfully complete the route discovery procedure. This paper presents a query scope agent (QSA) that assists in the selection of an appropriate ERS. The QSA accepts as input, from the user or network application, a maximum allowable value for route discovery delay. The QSA then estimates network parameter values to determine an ERS approach that satisfies the delay requirement while reducing expected packet transmission overhead. Simulation results show that it successfully achieves this objective. Further, the QSA incurs little communication and computation overhead, and operates in a distributed and asynchronous fashion. 相似文献
18.
Scalable Routing Protocol for Ad Hoc Networks 总被引:6,自引:0,他引:6
In this paper we present a scalable routing protocol for ad hoc networks. The protocol is based on a geographic location management strategy that keeps the overhead of routing packets relatively small. Nodes are assigned home regions and all nodes within a home region know the approximate location of the registered nodes. As nodes travel, they send location update messages to their home regions and this information is used to route data packets. In this paper, we derive theoretical performance results for the protocol and prove that the control packet overhead scales linearly with node speed and as N
3/2 with increasing number of nodes. These results indicate that our protocol is well suited to relatively large ad hoc networks where nodes travel at high speed. Finally, we use simulations to validate our analytical model. 相似文献
19.
The main purposes of this article are to relieve broadcast problem, to immunize to some prerequisites, and to reduce the number of transmitted control packets. Broadcasting control packets network-wide is the most direct and common method for finding the required destination node in ad hoc mobile wireless networks; however, this causes a lot of waste of wireless bandwidth. To remedy the problem, routing protocols demanding some prerequisites are proposed; nonetheless, hardly can they be used if these prerequisites are missed or become stale. To efficiently reduce the number of transmitted control packets, our routing protocol partitions the network into interlaced gray districts and white districts by the aid of GPS and inhibits an intermediate node residing in a white district from re-transmitting the received control packets. However, a mobile node residing in a gray district is responsible for re-transmitting them till they reach the destination node. Our routing protocol does not demand any prerequisite except the use of GPS. Each mobile node can always obtain its own location information; furthermore, the information may neither be missed nor become stale. Our routing protocol is easy to be implemented, saves precious wireless bandwidth, and reduces almost half a number of control packets as compared with pure flooding routing protocols.Ying-Kwei Ho received the B.S. degree and M.S. degree in applied mathematics and in electrical engineering from the Chung-Cheng Institute of Technology in 1987 and 1993 respectively and the Ph.D. degree in computer engineering and science from the Yuan-Ze University, Taiwan, R.O.C. He joined the Army of Taiwan, R.O.C. in 1987 and worked as a software engineer. From 1993 to 1997, he was an instructor in the War Game Center of Armed Forces University, Taiwan, R.O.C. He is currently an assistant professor of the Department of Computer Science at Chung-Cheng Institute of Technology. His research interests include mobile computing, wireless network performance simulation and evaluation, and modeling and simulation.Ru-Sheng Liu received the B.S. degree in electrical engineering from the National Cheng-Kung University, Taiwan, in 1972 and the M.S. and Ph.D. degrees in computer science from the University of Texas at Dallas, Richardson, Texas, in 1981 and1985, respectively. He is currently an associate professor in the Department of Computer Engineering and Science at Yuan-Ze University, Chungli, Taiwan. His research interests are in the areas of mobile computing, internet technology, and computer algorithms. 相似文献
20.
Most of the routing algorithms for ad hoc networks assume that all wireless links are bidirectional. In reality, some links may be unidirectional. In this paper we show that the presence of such links can jeopardize the performance of the existing distance vector routing algorithms. We also present modifications to distance vector based routing algorithms to make them work in ad hoc networks with unidirectional links. For a network of n nodes, neighbors exchange n×n matrices to propagate routing information. This results in loop-free routes. 相似文献