Towards Hierarchical Routing in Small World Wireless Networks
Juhani Latvakoski · 2009
A novel overlay based approach to enable hierarchical routing in small world and scale free wireless networks is provided and evaluated in this paper. In the solution, the wireless short-cuts are applied as dynamic links between overlay nodes, which apply bigger transmission power to reach larger communication range. The effects of such short-cuts into the end to end delay, route lengths and throughput are studied by means of simulations. The simulation results indicate that increasing the number of referred wireless short-cuts lowers the end to end delays, and makes the physical routes shorter, and also improves throughput. When the clustering degree increases, the physical routes become shorter and the performance of the system improves. The simulations carried out for evaluating the hierarchical routing approach indicates the feasibility of the approach, and the results also confirm quite well with small world and scale free networks phenomenon.