Minimal connected dominating set algorithms and application for a MANET routing protocol
暂无分享,去创建一个
[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] Richard G. Ogier,et al. A reliable, efficient topology broadcast protocol for dynamic networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[3] Robert Sedgewick,et al. Algorithms in C , 1990 .
[4] John Moy,et al. OSPF Version 2 , 1998, RFC.
[5] Jie Wu,et al. A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..
[6] Samir Khuller,et al. Approximation Algorithms for Connected Dominating Sets , 1996, ESA.
[7] J. J. Garcia-Luna-Aceves,et al. Scalable link-state Internet routing , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).
[8] D. West. Introduction to Graph Theory , 1995 .
[9] Mahtab Seddigh,et al. Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..
[10] Fred L. Templin,et al. Topology Broadcast based on Reverse-Path Forwarding (TBRPF) , 2000 .