Topology design of fully connected hierarchical Mobile Ad-Hoc Networks
暂无分享,去创建一个
[1] Martin Haenggi,et al. On distances in uniformly random networks , 2005, IEEE Transactions on Information Theory.
[2] Hsiao-Hwa Chen,et al. A novel k-hop Compound Metric Based Clustering scheme for ad hoc wireless networks , 2009, IEEE Transactions on Wireless Communications.
[3] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[4] Roberto Hincapie,et al. Survey of clustering techniques for mobile ad hoc networks , 2007, Revista Facultad de Ingeniería Universidad de Antioquia.
[5] Tracy Camp,et al. A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..
[6] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..
[7] Bing Liu,et al. Finding the Shortest Route Using Cases, Knowledge, and Djikstra's Algorithm , 1994, IEEE Expert.
[8] François Baccelli,et al. Stochastic geometry and wireless networks , 2009 .
[9] Ulrike von Luxburg,et al. A tutorial on spectral clustering , 2007, Stat. Comput..
[10] Lina Mroueh,et al. Radio resource dimensioning in a centralized Ad-Hoc maritime MIMO LTE network , 2015, 2015 36th IEEE Sarnoff Symposium.