Route-count based anycast routing in wireless ad hoc networks

Martin Macuha, Takuro Sato

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Citations (Scopus)

    Abstract

    In anycast routing the packet is routed to anyone of the anycast group members. Anycast allows supporting many services and can significantly improve network performance of ad hoc networks. Unicast protocols have been extended to support anycast routing, however, these protocols consider solely the shortest path routing. The protocols based on a theory of potential fields have been proposed to improve packet delivery ratio in large mesh networks by routing to area with higher density of nodes instead of the shortest path routing. In this paper, we consider the density of nodes through count of routes. We propose simple anycast protocol which utilizes count of routes to the anycast group member as a routing metric and evaluate its performance.

    Original languageEnglish
    Title of host publicationIEEE Vehicular Technology Conference
    DOIs
    Publication statusPublished - 2009
    Event2009 IEEE 70th Vehicular Technology Conference Fall, VTC 2009 Fall - Anchorage, AK
    Duration: 2009 Sep 202009 Sep 23

    Other

    Other2009 IEEE 70th Vehicular Technology Conference Fall, VTC 2009 Fall
    CityAnchorage, AK
    Period09/9/2009/9/23

    Fingerprint

    Wireless Ad Hoc Networks
    Wireless ad hoc networks
    Count
    Routing
    Network protocols
    Shortest path
    Network performance
    Ad hoc networks
    Mesh Networks
    Potential Field
    Network Performance
    Vertex of a graph
    Ad Hoc Networks
    Metric
    Evaluate

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Science Applications
    • Applied Mathematics

    Cite this

    Route-count based anycast routing in wireless ad hoc networks. / Macuha, Martin; Sato, Takuro.

    IEEE Vehicular Technology Conference. 2009. 5379095.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Macuha, M & Sato, T 2009, Route-count based anycast routing in wireless ad hoc networks. in IEEE Vehicular Technology Conference., 5379095, 2009 IEEE 70th Vehicular Technology Conference Fall, VTC 2009 Fall, Anchorage, AK, 09/9/20. https://doi.org/10.1109/VETECF.2009.5379095
    Macuha, Martin ; Sato, Takuro. / Route-count based anycast routing in wireless ad hoc networks. IEEE Vehicular Technology Conference. 2009.
    @inproceedings{7b834350ea7b401499842bf6c7774d9b,
    title = "Route-count based anycast routing in wireless ad hoc networks",
    abstract = "In anycast routing the packet is routed to anyone of the anycast group members. Anycast allows supporting many services and can significantly improve network performance of ad hoc networks. Unicast protocols have been extended to support anycast routing, however, these protocols consider solely the shortest path routing. The protocols based on a theory of potential fields have been proposed to improve packet delivery ratio in large mesh networks by routing to area with higher density of nodes instead of the shortest path routing. In this paper, we consider the density of nodes through count of routes. We propose simple anycast protocol which utilizes count of routes to the anycast group member as a routing metric and evaluate its performance.",
    author = "Martin Macuha and Takuro Sato",
    year = "2009",
    doi = "10.1109/VETECF.2009.5379095",
    language = "English",
    isbn = "9781424425150",
    booktitle = "IEEE Vehicular Technology Conference",

    }

    TY - GEN

    T1 - Route-count based anycast routing in wireless ad hoc networks

    AU - Macuha, Martin

    AU - Sato, Takuro

    PY - 2009

    Y1 - 2009

    N2 - In anycast routing the packet is routed to anyone of the anycast group members. Anycast allows supporting many services and can significantly improve network performance of ad hoc networks. Unicast protocols have been extended to support anycast routing, however, these protocols consider solely the shortest path routing. The protocols based on a theory of potential fields have been proposed to improve packet delivery ratio in large mesh networks by routing to area with higher density of nodes instead of the shortest path routing. In this paper, we consider the density of nodes through count of routes. We propose simple anycast protocol which utilizes count of routes to the anycast group member as a routing metric and evaluate its performance.

    AB - In anycast routing the packet is routed to anyone of the anycast group members. Anycast allows supporting many services and can significantly improve network performance of ad hoc networks. Unicast protocols have been extended to support anycast routing, however, these protocols consider solely the shortest path routing. The protocols based on a theory of potential fields have been proposed to improve packet delivery ratio in large mesh networks by routing to area with higher density of nodes instead of the shortest path routing. In this paper, we consider the density of nodes through count of routes. We propose simple anycast protocol which utilizes count of routes to the anycast group member as a routing metric and evaluate its performance.

    UR - http://www.scopus.com/inward/record.url?scp=77951469731&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77951469731&partnerID=8YFLogxK

    U2 - 10.1109/VETECF.2009.5379095

    DO - 10.1109/VETECF.2009.5379095

    M3 - Conference contribution

    SN - 9781424425150

    BT - IEEE Vehicular Technology Conference

    ER -