Weighted Cluster based Distributed Spanning Tree Routing Protocol for Mobile Ad-hoc Networks
暂无分享,去创建一个
[1] Orhan Dagdeviren,et al. A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks , 2006, International Conference on Computational Science.
[2] P.H.J. Chong,et al. A survey of clustering schemes for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.
[3] Govind Narayan Purohit,et al. Constructing Minimum Connected Dominating Set: Algorithmic approach , 2010 .
[4] Charles E. Perkins,et al. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.
[5] David A. Maltz,et al. DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .
[6] Marco Conti,et al. Mobile Ad-hoc Networking - Minitrack Introduction , 2001, HICSS.
[7] P. Dhavachelvan,et al. Improved Data Cache Scheme Using Distributed Spanning Tree in Mobile Adhoc Network , 2010 .
[8] Charles E. Perkins,et al. Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.
[9] Sung-Ju Lee,et al. Selecting a routing strategy for your ad hoc network , 2003, Comput. Commun..