Hierarchical routing for small world wireless networks

    Research output: Contribution to journalArticleScientificpeer-review

    Abstract

    The number of embedded systems capable for wireless machine-to-machine service communication has continuously been increasing in recent years. In these kinds of dynamic ecosystems, the problems related to complexity and heterogeneity seriously challenges interoperability. As a contribution to this research, the small world paradigm from social sciences is being applied in a wireless networks context. A novel hierarchical networking concept, related routing algorithm and network optimization solutions are created to enable solving these problems. Logical short cuts are established between neighboring overlay nodes in order to avoid global flooding in distant route searches. In addition, physical short cuts may be created to remove the bottlenecks from the communication paths. The concept has been evaluated by graph theoretical analysis of the Hi-Search algorithm, simulation of the network optimization step and service discovery procedure. The evaluation results indicate that the algorithm with network optimization functions is able to lower the search delays, make the physical routes shorter and also improve throughput. In addition, solving the complexity and heterogeneity problems is made possible by localizing route search and abstracting communication to two hierarchical routing layers.
    Original languageEnglish
    Pages (from-to)126-140
    Number of pages15
    JournalInternational Journal On Advances in Internet Technology
    Volume5
    Issue number4-5
    Publication statusPublished - 2012
    MoE publication typeA1 Journal article-refereed

    Fingerprint

    Small-world networks
    Wireless networks
    Communication
    Social sciences
    Routing algorithms
    Interoperability
    Embedded systems
    Ecosystems
    Throughput

    Cite this

    @article{192620e2040d4845bf093beff32065a4,
    title = "Hierarchical routing for small world wireless networks",
    abstract = "The number of embedded systems capable for wireless machine-to-machine service communication has continuously been increasing in recent years. In these kinds of dynamic ecosystems, the problems related to complexity and heterogeneity seriously challenges interoperability. As a contribution to this research, the small world paradigm from social sciences is being applied in a wireless networks context. A novel hierarchical networking concept, related routing algorithm and network optimization solutions are created to enable solving these problems. Logical short cuts are established between neighboring overlay nodes in order to avoid global flooding in distant route searches. In addition, physical short cuts may be created to remove the bottlenecks from the communication paths. The concept has been evaluated by graph theoretical analysis of the Hi-Search algorithm, simulation of the network optimization step and service discovery procedure. The evaluation results indicate that the algorithm with network optimization functions is able to lower the search delays, make the physical routes shorter and also improve throughput. In addition, solving the complexity and heterogeneity problems is made possible by localizing route search and abstracting communication to two hierarchical routing layers.",
    author = "Juhani Latvakoski",
    year = "2012",
    language = "English",
    volume = "5",
    pages = "126--140",
    journal = "International Journal On Advances in Internet Technology",
    issn = "1942-2652",
    publisher = "International Academy, Research, and Industry Association IARIA",
    number = "4-5",

    }

    Hierarchical routing for small world wireless networks. / Latvakoski, Juhani.

    In: International Journal On Advances in Internet Technology, Vol. 5, No. 4-5, 2012, p. 126-140.

    Research output: Contribution to journalArticleScientificpeer-review

    TY - JOUR

    T1 - Hierarchical routing for small world wireless networks

    AU - Latvakoski, Juhani

    PY - 2012

    Y1 - 2012

    N2 - The number of embedded systems capable for wireless machine-to-machine service communication has continuously been increasing in recent years. In these kinds of dynamic ecosystems, the problems related to complexity and heterogeneity seriously challenges interoperability. As a contribution to this research, the small world paradigm from social sciences is being applied in a wireless networks context. A novel hierarchical networking concept, related routing algorithm and network optimization solutions are created to enable solving these problems. Logical short cuts are established between neighboring overlay nodes in order to avoid global flooding in distant route searches. In addition, physical short cuts may be created to remove the bottlenecks from the communication paths. The concept has been evaluated by graph theoretical analysis of the Hi-Search algorithm, simulation of the network optimization step and service discovery procedure. The evaluation results indicate that the algorithm with network optimization functions is able to lower the search delays, make the physical routes shorter and also improve throughput. In addition, solving the complexity and heterogeneity problems is made possible by localizing route search and abstracting communication to two hierarchical routing layers.

    AB - The number of embedded systems capable for wireless machine-to-machine service communication has continuously been increasing in recent years. In these kinds of dynamic ecosystems, the problems related to complexity and heterogeneity seriously challenges interoperability. As a contribution to this research, the small world paradigm from social sciences is being applied in a wireless networks context. A novel hierarchical networking concept, related routing algorithm and network optimization solutions are created to enable solving these problems. Logical short cuts are established between neighboring overlay nodes in order to avoid global flooding in distant route searches. In addition, physical short cuts may be created to remove the bottlenecks from the communication paths. The concept has been evaluated by graph theoretical analysis of the Hi-Search algorithm, simulation of the network optimization step and service discovery procedure. The evaluation results indicate that the algorithm with network optimization functions is able to lower the search delays, make the physical routes shorter and also improve throughput. In addition, solving the complexity and heterogeneity problems is made possible by localizing route search and abstracting communication to two hierarchical routing layers.

    M3 - Article

    VL - 5

    SP - 126

    EP - 140

    JO - International Journal On Advances in Internet Technology

    JF - International Journal On Advances in Internet Technology

    SN - 1942-2652

    IS - 4-5

    ER -