An Adaptive Hierarchical Routing Protocol
IEEE Transactions on Computers
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Multicluster, mobile, multimedia radio network
Wireless Networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Early measurements of a cluster-based architecture for P2P systems
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Loop-Free Internet Routing Using Hierarchical Routing Trees
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Dynamic Programming
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Comparison of routing metrics for static multi-hop wireless networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal solution of total routing table size for hierarchical networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Willow: DHT, aggregation, and publish/subscribe in one protocol
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Maya-Pyramid: A Scalable and Self-Organizing Unstructured P2P Overlay
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
HELC: a High Efficiency and Low Cost structured Peer-to-Peer overlay without Distributed Hash Table
International Journal of Autonomous and Adaptive Communications Systems
IPBGA: a hybrid P2P based grid architecture by using information pool protocol
The Journal of Supercomputing
A novel method to evaluate clustering algorithms for hierarchical optical networks
Photonic Network Communications
Tide: An effective and practical design for hierarchical-structured P2P model
Computer Communications
Hi-index | 0.00 |
Table-driven routing algorithms in flat networks have the scalability problem due to the need for global topology updates. To reduce update cost, networks are hierarchically organized. Clustering algorithms organize flat networks into hierarchical networks. One important problem, which has not been adequately addressed so far, is to evaluate how good a clustering algorithm is. In other words, it is useful to know what the desired properties of hierarchical networks are. In this paper, we address this issue by considering the routing update cost, which can be measured by the total routing table size and the variance of cluster size distribution. We provide a set of desired properties of clustering algorithms. Applying these properties to the cluster structure generated by an algorithm, we can determine how good a clustering algorithm is. Specifically, we discuss how to choose appropriate number of hierarchy levels, number of clusters, and cluster size distribution, such that the topology update cost is minimized. The desired properties obtained from the analysis can be used as guidelines in the design of clustering algorithms for table-driven hierarchical networks. We apply the idea developed in this paper to evaluate three routing algorithms, namely the lowest ID algorithm, the maximum degree algorithm, and the variable degree clustering algorithm. We show how the variable degree clustering algorithm, which takes into account these desired properties, improves routing performance.