32,
pp. 130??“136, 1985.
66. Yu Wang and Xiang-Yang Li, ???Geometric spanners for wireless ad hoc networks,???
in Proc. of 22nd IEEE International Conference on Distributed Computing
Systems (ICDCS), 2002.
67. Piotr Berman, Matin Furer, and Alexander Zelikovsky, ???Applications of matroid
parity problem to approximating steiner trees,??? Tech. Rep. 980021, Computer
Science, UCLA, 1998.
144
Chapter 5 Topology Control for Wireless Sensor Networks
68. Xiuzhen Cheng, Xiao Huang, Deying Li, and Ding-Zhu Du, ???Polynomialtime
approximation scheme for minimum connected dominating set in ad hoc
wireless networks,??? Networks, vol. 42, no. 4, pp. 202??“208, 2003.
69. Khaled M. Alzoubi, Peng-Jun Wan, and Ophir Frieder, ???New distributed algorithm
for connected dominating set in wireless ad hoc networks,??? in HICSS,
Hawaii, 2002.
70. Alan D. Amis and Ravi Prakash, ???Load-balancing clusters in wireless ad hoc
networks,??? in Proc. of the 3rd IEEE Symposium on Application-Specific Systems
and Software Engineering Technology, 2000.
71. Alan D. Amis, Ravi Prakash, Dung Huynh, and Thai Vuong, ???Max-min dcluster
formation in wireless ad hoc networks,??? in Proc. of 19th Annual Joint
Conference of the IEEE Computer and Communications Societies INFOCOM,
2000.
72. Imrich Chlamtac and Andras Farago, ???A new approach to design and analysis
of peer to peer mobile networks,??? Wireless Networks, vol. 5, pp. 149??“156, 1999.
Pages:
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257