scispace - formally typeset
Search or ask a question
Topic

Path vector protocol

About: Path vector protocol is a research topic. Over the lifetime, 6993 publications have been published within this topic receiving 153748 citations.


Papers
More filters
Proceedings ArticleDOI
18 Aug 2002
TL;DR: This paper presents a new on-demand routing algorithm for mobile, multi-hop ad-hoc networks based on swarm intelligence and especially on the ant colony based meta heuristic, which is highly adaptive, efficient and scalable.
Abstract: A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new on-demand routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence and especially on the ant colony based meta heuristic. These approaches try to map the solution capability of swarms to mathematical and engineering problems. The introduced routing protocol is highly adaptive, efficient and scalable. The main goal in the design of the protocol was to reduce the overhead for routing. We refer to the protocol as the ant-colony-based routing algorithm (ARA).

657 citations

Journal ArticleDOI
TL;DR: AOMDV as discussed by the authors is an on-demand, multipath distance vector routing protocol for mobile ad hoc networks, which guarantees loop freedom and disjointness of alternate paths.
Abstract: We develop an on-demand, multipath distance vector routing protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol guarantees loop freedom and disjointness of alternate paths. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to effectively cope with mobility-induced route failures. In particular, it reduces the packet loss by up to 40% and achieves a remarkable improvement in the end-to-end delay (often more than a factor of two). AOMDV also reduces routing overhead by about 30% by reducing the frequency of route discovery operations. Copyright © 2006 John Wiley & Sons, Ltd.

625 citations

Proceedings ArticleDOI
07 Nov 2002
TL;DR: The topological structure of the Internet in terms of customer-provider and peer-peer relationships between autonomous systems, as manifested in BGP routing policies, is investigated and a five-level classification of AS is proposed.
Abstract: The delivery of IP traffic through the Internet depends on the complex interactions between thousands of autonomous systems (AS) that exchange routing information using the border gateway protocol (BGP). This paper investigates the topological structure of the Internet in terms of customer-provider and peer-peer relationships between autonomous systems, as manifested in BGP routing policies. We describe a technique for inferring AS relationships by exploiting partial views of the AS graph available from different vantage points. Next we apply the technique to a collection of ten BGP routing tables to infer the relationships between neighboring autonomous systems. Based on these results, we analyze the hierarchical structure of the Internet and propose a five-level classification of AS. Our characterization differs from previous studies by focusing on the commercial relationships between autonomous systems rather than simply the connectivity between the nodes.

594 citations

Journal ArticleDOI
TL;DR: Simulation results show that the location search scheme generates less overhead than the schemes based on flooding, and results confirm that the communication overhead for creating and maintaining the topology in the proposed protocol is smaller than that in the flat LSR protocol.
Abstract: A new global positioning system (GPS)-based routing protocol for ad hoc networks, called zone-based hierarchical link state (ZHLS) routing protocol, is proposed. In this protocol, the network is divided into nonoverlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: focal node and global zone levels. Unlike other hierarchical protocols, there is no cluster head in this protocol. The zone level topological information is distributed to all nodes. This "peer-to-peer" manner mitigates traffic bottleneck, avoids single point of failure, and simplifies mobility management. Since only zone ID and node ID of a destination are needed for routing, the route from a source to a destination is adaptable to changing topology. The zone ID of the destination is found by sending one location request to every zone. Simulation results show that our location search scheme generates less overhead than the schemes based on flooding. The results also confirm that the communication overhead for creating and maintaining the topology in the proposed protocol is smaller than that in the flat LSR protocol. This new routing protocol provides a flexible, efficient, and effective approach to accommodate the changing topology in a wireless network environment.

555 citations

Journal ArticleDOI
TL;DR: This work proposes a bandwidth routing protocol for quality-of-service (QoS) support in a multihop mobile network and examines the system performance in various QoS traffic flows and mobility environments via simulation.
Abstract: The emergence of nomadic applications have generated much interest in wireless network infrastructures that support real-time communications. We propose a bandwidth routing protocol for quality-of-service (QoS) support in a multihop mobile network. The QoS routing feature is important for a mobile network to interconnect wired networks with QoS support (e.g., ATM, Internet, etc.). The QoS routing protocol can also work in a stand-alone multihop mobile network for real-time applications. This QoS routing protocol contains end-to-end bandwidth calculation and bandwidth allocation. Under such a routing protocol, the source (or the ATM gateway) is informed of the bandwidth and QoS available to any destination in the mobile network. This knowledge enables the establishment of QoS connections within the mobile network and the efficient support of real-time applications. In addition, it enables more efficient call admission control. In the case of ATM interconnection, the bandwidth information can be used to carry out intelligent handoff between ATM gateways and/or to extend the ATM virtual circuit (VC) service to the mobile network with possible renegotiation of QoS parameters at the gateway. We examine the system performance in various QoS traffic flows and mobility environments via simulation. Simulation results suggest distinct performance advantages of our protocol that calculates the bandwidth information. It is particularly useful in call admission control. Furthermore, "standby" routing enhances the performance in the mobile environment. Simulation experiments show this improvement.

552 citations


Network Information
Related Topics (5)
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
90% related
Wireless sensor network
142K papers, 2.4M citations
90% related
Wireless network
122.5K papers, 2.1M citations
89% related
Wireless ad hoc network
49K papers, 1.1M citations
89% related
Network packet
159.7K papers, 2.2M citations
89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202310
202224
20214
20206
201911
201830