Mobility in a description based clustered ad hoc network

Tharinda Nishantha Vidanagama, Hidenori Nakazato

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

    Abstract

    Wireless mobile ad hoc networks can be used as a means to ease and support life in an ordinary house. As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. This paper proposes a routing algorithm for mobility in a description-based clustered ad-hoc network where the nodes are given descriptions or keywords such as "living room TV", "kitchen oven", etc. as identifiers. In this paper, we discuss and compare the routing and the number of control messages required to achieve a higher message delivery success rate for frequent and infrequent communication of nodes with mobility. When communication is infrequent a search is performed for the destination regardless of mobility. The proposed algorithm handles mobility efficiently while ensuring a high accuracy on message delivery with the least amount of control messages.

    Original languageEnglish
    Title of host publication2010 IEEE Globecom Workshops, GC'10
    Pages148-152
    Number of pages5
    DOIs
    Publication statusPublished - 2010
    Event2010 IEEE Globecom Workshops, GC'10 - Miami, FL
    Duration: 2010 Dec 52010 Dec 10

    Other

    Other2010 IEEE Globecom Workshops, GC'10
    CityMiami, FL
    Period10/12/510/12/10

    Fingerprint

    Ad hoc networks
    communication
    Kitchens
    Domestic appliances
    Communication
    Wireless ad hoc networks
    Ovens
    Routing algorithms
    Mobile ad hoc networks
    Telecommunication networks

    Keywords

    • Ad-hoc network
    • Clustering
    • Description based addressing and routing
    • Mobility
    • Routing cache

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Communication

    Cite this

    Vidanagama, T. N., & Nakazato, H. (2010). Mobility in a description based clustered ad hoc network. In 2010 IEEE Globecom Workshops, GC'10 (pp. 148-152). [5700186] https://doi.org/10.1109/GLOCOMW.2010.5700186

    Mobility in a description based clustered ad hoc network. / Vidanagama, Tharinda Nishantha; Nakazato, Hidenori.

    2010 IEEE Globecom Workshops, GC'10. 2010. p. 148-152 5700186.

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

    Vidanagama, TN & Nakazato, H 2010, Mobility in a description based clustered ad hoc network. in 2010 IEEE Globecom Workshops, GC'10., 5700186, pp. 148-152, 2010 IEEE Globecom Workshops, GC'10, Miami, FL, 10/12/5. https://doi.org/10.1109/GLOCOMW.2010.5700186
    Vidanagama TN, Nakazato H. Mobility in a description based clustered ad hoc network. In 2010 IEEE Globecom Workshops, GC'10. 2010. p. 148-152. 5700186 https://doi.org/10.1109/GLOCOMW.2010.5700186
    Vidanagama, Tharinda Nishantha ; Nakazato, Hidenori. / Mobility in a description based clustered ad hoc network. 2010 IEEE Globecom Workshops, GC'10. 2010. pp. 148-152
    @inproceedings{a0399d0ed3ac4b188dce54c9faedc4af,
    title = "Mobility in a description based clustered ad hoc network",
    abstract = "Wireless mobile ad hoc networks can be used as a means to ease and support life in an ordinary house. As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. This paper proposes a routing algorithm for mobility in a description-based clustered ad-hoc network where the nodes are given descriptions or keywords such as {"}living room TV{"}, {"}kitchen oven{"}, etc. as identifiers. In this paper, we discuss and compare the routing and the number of control messages required to achieve a higher message delivery success rate for frequent and infrequent communication of nodes with mobility. When communication is infrequent a search is performed for the destination regardless of mobility. The proposed algorithm handles mobility efficiently while ensuring a high accuracy on message delivery with the least amount of control messages.",
    keywords = "Ad-hoc network, Clustering, Description based addressing and routing, Mobility, Routing cache",
    author = "Vidanagama, {Tharinda Nishantha} and Hidenori Nakazato",
    year = "2010",
    doi = "10.1109/GLOCOMW.2010.5700186",
    language = "English",
    isbn = "9781424488650",
    pages = "148--152",
    booktitle = "2010 IEEE Globecom Workshops, GC'10",

    }

    TY - GEN

    T1 - Mobility in a description based clustered ad hoc network

    AU - Vidanagama, Tharinda Nishantha

    AU - Nakazato, Hidenori

    PY - 2010

    Y1 - 2010

    N2 - Wireless mobile ad hoc networks can be used as a means to ease and support life in an ordinary house. As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. This paper proposes a routing algorithm for mobility in a description-based clustered ad-hoc network where the nodes are given descriptions or keywords such as "living room TV", "kitchen oven", etc. as identifiers. In this paper, we discuss and compare the routing and the number of control messages required to achieve a higher message delivery success rate for frequent and infrequent communication of nodes with mobility. When communication is infrequent a search is performed for the destination regardless of mobility. The proposed algorithm handles mobility efficiently while ensuring a high accuracy on message delivery with the least amount of control messages.

    AB - Wireless mobile ad hoc networks can be used as a means to ease and support life in an ordinary house. As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. This paper proposes a routing algorithm for mobility in a description-based clustered ad-hoc network where the nodes are given descriptions or keywords such as "living room TV", "kitchen oven", etc. as identifiers. In this paper, we discuss and compare the routing and the number of control messages required to achieve a higher message delivery success rate for frequent and infrequent communication of nodes with mobility. When communication is infrequent a search is performed for the destination regardless of mobility. The proposed algorithm handles mobility efficiently while ensuring a high accuracy on message delivery with the least amount of control messages.

    KW - Ad-hoc network

    KW - Clustering

    KW - Description based addressing and routing

    KW - Mobility

    KW - Routing cache

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

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

    U2 - 10.1109/GLOCOMW.2010.5700186

    DO - 10.1109/GLOCOMW.2010.5700186

    M3 - Conference contribution

    AN - SCOPUS:79951898099

    SN - 9781424488650

    SP - 148

    EP - 152

    BT - 2010 IEEE Globecom Workshops, GC'10

    ER -