[1]WANG XUDONG, LIM A O. IEEE 802.11s wireless mesh net-works: Framework and challenges [J]. IEEE Transactions on Mobile Computing, 2009, 6(6): 970-984.[2]PINTO R. WMM-Wireless mesh monitoring [J]. Ad Hoc Network, 2009, 6(6): 445-487.[3]刘少伟,罗丹彦,向琳,等.能量均衡的无线传感器网络拓扑控制算法[J].电子科学技术大学学报,2010,39(S1):89-93.[4]RAGHAVENDRA R, ACHARYA P, BELDING E M, et al. MeshMon: A multi-tiered framework for wireless mesh network monitoring [C]// MobiHoc S3'09: Proceedings of the 2009 MobiHoc S3 Workshop on MobiHoc S3. New York: ACM Press, 2009: 134-138.[5]ATHANASIOU G, KORAKIS T, ERCETIN O, et al. A cross-layer framework for association control in wireless mesh networks [J]. IEEE Transactions on Mobile Computing, 2009, 8(4): 952-957.[6]BREDEL M, FIDLER M. A measurement study of bandwidth esti-mation in IEEE 802.11g wireless LANs using the DCF [C]// NETWORKING'08: Proceedings of the 7th International IFIP-TC6 Networking Conference on Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet. Berlin: Springer-Verlag, 2008: 314-325.[7]RAMACHANDRAN K N, BELDING-ROYER E M, ALMEROTH K C. DAMON: A distributed architecture for monitoring multi-hop mobile networks [C]// IEEE SECON 2004: Proceedings of the First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks. Washington, DC: IEEE Computer Society, 2004: 347-357.[8]SCHOR L, SOMMER P, WATTENHOFER R. Towards a zero-configuration wireless sensor network architecture for smart buildings [C]// BuildSys'09: Proceedings of the First ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Buildings. New York: ACM Press, 2009: 762-769.[9]刘浩,鲍远律.A算法在矢量地图最优路径搜索中的应用[J].计算机仿真,2008,25(4):253-257.[10]PATRICK K-W. On path of decomposition of complete graphs [D]. Burnaby, British Columbia: Simon Fraser University, Department of Mathematics and Statistics, 2004.[11]PYBER L. Covering the edges of a connected graph by paths [J]. Journal of Combinatorial Theory: Series B, 1966, 66(1): 152-159.[12]ZHAI MING-QING, L CHANG-HONG. Path decomposition of graphs with given path length [J]. Acta Mathematicae Applicatae Sinica: English Series, 2006, 22(4): 633-638.[13]TEYPAZ N, RAPINE C. Graph decomposition into paths under length constraints [EB/OL]. [2011-04-10]. http://hal.archives-ouvertes.fr/docs/00/27/81/89/PDF/article.pdf.[14]周影,曹菡,李军霞.一种限制区域的最短路径查找算法[J].微电子学与计算机,2007,24(8):110-112. |