A distributed routing algorithm for mobile wireless networks
Wireless Networks
A routing protocol for packet radio networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
A New Hierarchical Routing Protocol for Dynamic Multihop Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Comparative Performance Evaluation of Routing Protocols for Mobile, Ad hoc
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Business Data Communications (5th Edition)
Business Data Communications (5th Edition)
Protocol for dynamic ad-hoc networks using distributed spanning trees
Wireless Networks
Dynamic route switching protocol in mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
The importance of location on trust in mobile networks
WSEAS TRANSACTIONS on COMMUNICATIONS
TrustRings in mobile wireless network settings
ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
| Hi-index | 0.00 |
In this paper, a new hierarchical multihop routing algorithm and its performance evaluation is presented for fully dynamic wireless networks. The routing algorithm operates on a virtual topology obtained by partitioning the routing information for mobile terminals and mobile base stations into a hierarchical, distributed database. Based on the virtual topology, each mobile base station stores a fraction of the routing information to balance the complexity of the location-update and the path-finding operations. Mobility of the network entities changes the load distribution and causes processing and memory bottlenecks in some parts of the network. However, since the network routing elements are also mobile, their movement can be used to distribute the load. Thus, new load balancing schemes are introduced to distribute the routing overhead uniformly among the mobile base stations. The performance of the hierarchical multihop routing algorithm is investigated through simulations. It is shown that the routing protocol can cope with high mobility and deliver packets to the destinations successfully.