Routing in ad hoc networks using a spine
暂无分享,去创建一个
Vaduvur Bharghavan | Raghupathy Sivakumar | Bevan Das | V. Bharghavan | B. Das | Raghupathy Sivakumar | Bevan Das
[1] Vaduvur Bharghavan,et al. Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.
[2] M. S. Corson,et al. A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.
[3] G. Sicuranza,et al. The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .
[4] Dhiraj K. Pradhan,et al. A Cluster-based Approach for Routing in Ad-Hoc Networks , 1995, Symposium on Mobile and Location-Independent Computing.
[5] Farouk Kamoun,et al. Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.
[6] C. V. Ramamoorthy,et al. An Adaptive Hierarchical Routing Protocol , 1989, IEEE Trans. Computers.
[7] Gregory Lauer,et al. Packet-radio routing , 1995 .
[8] Baruch Awerbuch,et al. Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[9] Philip N. Klein,et al. A parallel randomized approximation scheme for shortest paths , 1992, STOC '92.
[10] Madan Gopal,et al. Topology distribution cost vs. efficient routing in large networks , 1990, SIGCOMM '90.
[11] M. Gopal,et al. Topology distribution cost vs. efficient routing in large networks , 1990, SIGCOMM 1990.
[12] D. A. Hall. Tactical Internet system architecture for Task Force XXI , 1996, Proceedings of the 1996 Tactical Communications Conference. Ensuring Joint Force Superiority in the Information Age.