Home // CTRQ 2012, The Fifth International Conference on Communication Theory, Reliability, and Quality of Service // View article

A Hierarchical Routing Algorithm for Small World Wireless Networks

Authors:
Juhani Latvakoski

Keywords: dynamic wireless networks; small world; routing

Abstract:
Embedded devices are tomorrow working in dynamic wireless networks, which requires novel solutions for routing because of heterogeneity, long communication paths, long delays and weak performance. As a contribution of this research, a hierarchical routing algorithm called as, Hi-Search, is provided. The algorithm relies on the wireless short-cut based solution for small world wireless networks and hierarchical neighbor discovery. The provided hierarchical search algorithm is based on graph theoretical system model and network search tree analysis both on overlay and physical levels. The efficiency of the Hi-Search algorithm is analytically evaluated in terms of search path depths, number of control messages, and delay of the search, which are compared against the flat physical routing approach. The evaluation indicates that the search path depths for the Hi-Search algorithm are lower than the search path depths for the end to end physical routes. In addition, the number of control message send actions and search delays are lower compared with physical routing.

Pages: 68 to 73

Copyright: Copyright (c) IARIA, 2012

Publication date: April 29, 2012

Published in: conference

ISSN: 2308-4022

ISBN: 978-1-61208-192-2

Location: Chamonix, France

Dates: from April 29, 2012 to May 4, 2012