scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Design & analysis of a distributed routing algorithm towards Internet-wide geocast

15 Oct 2019-Computer Communications (Elsevier)-Vol. 146, pp 201-218
TL;DR: This paper presents and implements two algorithms for geographic routing that are based purely on distance-vector data and another, more complicated algorithm based on path data, and shows that the algorithms converge relatively quickly following link drops.
About: This article is published in Computer Communications.The article was published on 2019-10-15. It has received 4 citations till now. The article focuses on the topics: Geocast & Geographic routing.
Citations
More filters
Journal ArticleDOI
TL;DR: This survey provided the technical direction for researchers on routing protocols for VANET using QoS using the major techniques in cross-layer protocol design and various performance parameters used in QoS routing protocols.
Abstract: VANET (Vehicular Ad Hoc Network) is a significant term in ITS (intelligent transportation systems). VANETs are also mentioned as ITN (intelligent transportation Networks), which are used to enhance road safety in growing technology. The connectivity of nodes is a challenging one because of its high mobility and the sparse network connectivity must be handled properly during its initial deployment of a VANET for avoiding accidents. Quality of service (QoS) in VANET becomes a significant term because of its increasing dare about unique features, like poor link quality, high mobility, and inadequate transporting distance. Routing is the foremost issue in the wireless ad hoc network, which is used to transmit data packets significantly. This paper provides a crucial review of the classification of existing QoS routing protocols, cross-layer design approach and classification, and various performance parameters used in QoS routing protocols. The corresponding cross-layer protocols are overviewed, followed by the major techniques in cross-layer protocol design. Moreover, VANET is presented with many exclusive networking research challenges in precise areas such as security, QoS, mobility, effective channel utilization, and scalability. Finally, the paper concluded by various comparison discussion, issues, and challenges of several routing protocols for VANET. No. of publications over the period from 2010 to 2019 in various scientific sources also showed in this review. This survey provided the technical direction for researchers on routing protocols for VANET using QoS.

11 citations

Proceedings ArticleDOI
01 Dec 2019
TL;DR: This paper proposes a slightly modified CBF algorithm for road side infrastructure to enable infrastructure assisted forwarding for geocast messages, without modifying theCBF algorithm in the vehicles.
Abstract: Geocast is an important forwarding method for vehicular networks. One standard of vehicular communication is ETSI ITS-G5 GeoNetworking. One of the forwarding methods for geocast in this standard is Contention Based Forwarding (CBF). CBF is dependent on a favourable vehicle distribution to forward messages over multiple hops. A method to extend the effective range of vehicles is to use road side infrastructure to help forward messages. We propose a slightly modified CBF algorithm for road side infrastructure to enable infrastructure assisted forwarding for geocast messages, without modifying the CBF algorithm in the vehicles. In this paper we show that such a relatively small modification can significantly increase delivery rates while also reducing wireless load and delivery delays.

2 citations


Cites methods from "Design & analysis of a distributed ..."

  • ...We have presented such a geocast routing algorithm in [7]....

    [...]

Book ChapterDOI
12 Oct 2020
TL;DR: In this paper, an unmanned cluster network routing protocol based on energy balance is proposed (EAODV), which calculates the remaining energy of the nodes by establishing the energy model of the unmanned swarm network; then, modify the AODV routing protocol format to use remaining energy as the basis for routing selection.
Abstract: The stable data transmission of the unmanned swarm network can provide an important guarantee for unmanned swarm operations. Aiming at the problem that the existing unmanned cluster network routing protocol does not consider energy consumption balance, an unmanned cluster network routing protocol based on energy balance is proposed (EAODV). First, calculate the remaining energy of the nodes by establishing the energy model of the unmanned cluster network; secondly, modify the AODV routing protocol format to use the remaining energy as the basis for routing selection. The simulation results show that the EAODV protocol improves the balance of energy consumption of each node, increases the network life of the unmanned cluster, and ensures the reliable transmission of information.
Proceedings ArticleDOI
22 Aug 2022
TL;DR: In this article , a geographic subdivision and coding method named EMD is used to subdivide the global region and then, the GeoIP is introduced as the network address and a GeoIP packet processing scheme is deployed at the edge of the network.
Abstract: Geocast is a one-to-many communication paradigm for sending the data packets to a designated area rather than an IP address. However, the traditional IP-based solutions cannot cope with the challenges in flexibility, mobility, and implementation overhead in situations where users are requiring a granularity-customizable geocast. Therefore, we propose to implement the granularity-customizable geocast at the edge of the network by embedding a novel network-layer addressing scheme using P4-based Software Defined Network (SDN). In this paper, a geographic subdivision and coding method named EMD is used to subdivide the global region. Then, we introduce the GeoIP as the network address and propose a GeoIP packet processing scheme by utilizing P4. The proposed GeoIP-based addressing scheme is deployed at the edge of the network. To make our design compatible with the current Internet, a Geolocation Name Service (GNS) system is designed to support the Internet-wide geocast. In addition, a prototype system is built to implement and evaluate our design. Experiment results show that the proposed design is feasible to provide granularity-customizable geocast at a relatively low cost.
References
More filters
Proceedings ArticleDOI
01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.

7,384 citations


"Design & analysis of a distributed ..." refers background in this paper

  • ...Another example is Greedy Perimeter Stateless Routing [11]....

    [...]

01 Jan 2008
TL;DR: Some of the recent work studying synchronization of coupled oscillators is discussed to demonstrate how NetworkX enables research in the field of computational networks.
Abstract: NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self-loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility makes NetworkX ideal for representing networks found in many dierent scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for easy exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdos-Renyi, Small World, and Barabasi-Albert models. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.

3,741 citations

01 Jul 1994
TL;DR: This document, together with its companion document, "Application of the Border Gateway Protocol in the Internet", define an inter- autonomous system routing protocol for the Internet.
Abstract: This document, together with its companion document, "Application of the Border Gateway Protocol in the Internet", define an inter- autonomous system routing protocol for the Internet.

2,832 citations


"Design & analysis of a distributed ..." refers background in this paper

  • ...To prevent the limited flooding effect (unnecessary links are used to reach the destinations) and also keep the amount of information that needs to be distributed in the network relatively low, we have investigated an approach where routers not only know the next hop to each destination, but also know the complete path to other routers, somewhat like the Border Gateway Protocol (BGP) [22]....

    [...]

  • ...approach where routers not only know the next hop to each destination, but also know the complete path to other routers, somewhat like the Border Gateway Protocol (BGP) [22]....

    [...]

  • ...Our path-based proposal might be suitable for inter-network routing like BGP using the aggregated address for a network....

    [...]

Proceedings ArticleDOI
01 Aug 2000
TL;DR: GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work, and compares favorably with Dynamic Source Routing.
Abstract: GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile nodes themselves, requiring no fixed infrastructure. Each mobile node periodically updates a small set of other nodes (its location servers) with its current location. A node sends its position updates to its location servers without knowing their actual identities, assisted by a predefined ordering of node identifiers and a predefined geographic hierarchy. Queries for a mobile node's location also use the predefined identifier ordering and spatial hierarchy to find a location server for that node.Experiments using the ns simulator for up to 600 mobile nodes show that the storage and bandwidth requirements of GLS grow slowly with the size of the network. Furthermore, GLS tolerates node failures well: each failure has only a limited effect and query performance degrades gracefully as nodes fail and restart. The query performance of GLS is also relatively insensitive to node speeds. Simple geographic forwarding combined with GLS compares favorably with Dynamic Source Routing (DSR): in larger networks (over 200 nodes) our approach delivers more packets, but consumes fewer network resources.

1,769 citations


"Design & analysis of a distributed ..." refers background in this paper

  • ...An interesting grid based ad-hoc routing system is the Grid Location Service (GLS) [12]....

    [...]

  • ...The geographic routing layer of GLS addresses nodes based on their current location and uses a distancevector protocol with two hop knowledge to route packets to their destination....

    [...]

Journal ArticleDOI
TL;DR: The Internet Topology Zoo is a store of network data created from the information that network operators make public, and is the most accurate large-scale collection of network topologies available, and includes meta-data that couldn't have been measured.
Abstract: The study of network topology has attracted a great deal of attention in the last decade, but has been hampered by a lack of accurate data. Existing methods for measuring topology have flaws, and arguments about the importance of these have overshadowed the more interesting questions about network structure. The Internet Topology Zoo is a store of network data created from the information that network operators make public. As such it is the most accurate large-scale collection of network topologies available, and includes meta-data that couldn't have been measured. With this data we can answer questions about network structure with more certainty than ever before - we illustrate its power through a preliminary analysis of the PoP-level topology of over 140 networks. We find a wide range of network designs not conforming as a whole to any obvious model.

1,333 citations


"Design & analysis of a distributed ..." refers methods in this paper

  • ...We evaluate our routing algorithm by running it on a collection of real world networks taken from the Topology Zoo project [21]....

    [...]

  • ...Networks and variable selection Like the evaluation in Section 4, we use real world network graphs taken from the Topologyzoo project [21] to evaluate our protocol on a set of realistic networks....

    [...]

  • ...We perform our evaluation over a large set of real world network graphs taken from the Topology Zoo [21]....

    [...]

  • ...All our evaluations are run over a set of real-world networks taken from the Topologyzoo [21] unless otherwise noted....

    [...]