A hierarchical routing concept with key enabling mechanisms: hierarchical neighbor and route discovery, network optimization and service discovery, are provided and evaluated in this paper. The hierarchical routing concept is novel in the sense that both physical neighbors and logical neighbors are discovered to optimize the route and service discovery process as well as enable optimization of the network by means of the wireless short-cuts. Simulation results indicate that the number of physical hops increases the average neighbor discovery delay and the message losses in the radio channel increases variance in the delays. The service discovery delay was in feasible level in the simulated topology and the lost of messages in the wireless channels causes undiscovered services unless reliable delivery services is not provided by communication layer for the services layer. The measured performance of simulated service use indicates that the establishment of wireless short-cuts can be very useful, because it decreases the number of intermediate hops, makes end to end delay shorter and improves throughput.
|Title of host publication||6th International Conference on Wireless and Mobile Communications|
|Publisher||IEEE Institute of Electrical and Electronic Engineers|
|Number of pages||6|
|Publication status||Published - 2010|
|MoE publication type||A4 Article in a conference publication|
Latvakoski, J. (2010). Hierarchical routing concept for small world wireless networks. In 6th International Conference on Wireless and Mobile Communications (pp. 325-330). IEEE Institute of Electrical and Electronic Engineers. https://doi.org/10.1109/ICWMC.2010.43