Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
The performance of query control schemes for the zone routing protocol
IEEE/ACM Transactions on Networking (TON)
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Hierarchical Routing Overhead in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The hierarchical routing protocols have been proposed to deal with the path search in wireless multi hop networks in various research works. As we know, hierarchical scheme has high complexity on the topology structure management. Some research works have researched the routing overhead in different routing protocols and others research the memory used by hierarchical cluster network. However, the robustness of the various protocols has not been researched, which means the performance of the networks in the presence of faulty nodes. The purpose of this paper is to investigate the performance of the flat routing and hierarchical routing protocols in ad hoc wireless networks. It is especially important to study the performance of the various routing protocols under some special environments, e.g. some fault nodes occurs in the networks. In this environment, we could study the robustness of different protocols.