Điều khiển tối ưu cấu hình trong mạng vô tuyến AD HOC – SENSOR

u khin t tuyn AD HOC  SENSOR i i hc  Lu ThS.  K thuin t: 60 52 70 ng dn: PGS.TS. Trn H o v: 2008 Abstract. Gii thi m mt s ng dng kh thi c c v m cc gii quyc khi loi mc trin ru mt s n s d i quyu khin cu ng mng ad hoc -   c s d thut u khin cng ad i p cu khin co lun v  h u khin c v  t    ng(CHM) ad hoc and sensor, g     nh kho chn c nhng khong sao cho mng kt nc vng ti thiu. c ht s c gii trong mng mt chiu rn mng hai chi chiu v hiu qu ng ca CHM ti vn   i quyt v  thit k CHM t  m i vi mt s kiu truyn th m - m (unicast), mt  nhiu (broadcast). Keywords. K thun t; Mn; Vi; u khin t Content                ,                       .     ,     . ,        ,                       sensor. 4 . Error! Reference source not found.  Error! Reference source not found.:       ,                      . Error! Reference source not found.  Error! Reference source not found.:       ,      sensor.     : ,  , . Error! Reference source not found.  Error! Reference source not found.:               hoc      ,      Error! Reference source not found.  Error! Reference source not found.:     ,      ,        . References [1] Althaus E, Calinescu G, Mandoiu I, Prasad S, Tchervenski N, Zelikovsky A, 2003 Power efficient range assignment in ad hoc wireless networks. Proc. IEEE WCNC 03, New Orleans, LA, pp. 18891894. [2] Bai F, Sadagopan N, Helmy A 2003 Important: a framework to systematically analyze the impact of mobility on performance of routing protocols for ad hoc networks. Proc. IEEE Infocom, San Francisco, CA, pp. 825835. [3] Bettstetter C 2001a Mobility modeling in wireless networks: categorization, smooth movement, and border effects. ACM Mobile Computing and Communications Review 5(3), 5567. [4] Bettstetter C 2001b Smooth is better than sharp: a random mobility model for simulation of wireless networks. Proc. ACM Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), Rome, pp. 1927 [5] Bettstetter C and Krause O 2001 On border effects in modeling and simulation of wireless ad hoc networks. Proc. IEEE International Conference on Mobile and Wireless Communication Network (MWCN), Recife. [6] Bettstetter C, Resta G and Santi P 2003 The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transactions on Mobile Computing 2(3), 257269. [7] Blough D, Leoncini M, Resta G and Santi P 2002 On the symmetric range assignment problem in wireless ad hoc networks. Proc. IFIP Conference on Theoretical Computer Science, Montreal, pp. 7182. [8] Blough D, Resta G and Santi P 2004 A statistical analysis of the long-run node spatial distribution in mobile ad hoc networks. Wireless Networks 10, 43554 [9] Bluetooth 1999 Bluetooth specifications available at http://www.bluetooth.org. [10] Bose P, Morin P, Stojmenovic I and Urrutia J 2001 Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6), 609616. [11] Camp T, Boleng J and Davies V 2002 Mobility models for ad hoc network simulations. Wiley Wireless Communication & Mobile Computing (WCMC) 2(5), 483502. [12] Clementi A, Penna P and Silvestri R 1999 Hardness results for the power range assignment problem in packet radio networks. Proc. 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 208. [13] Gao J, Guibas L, Hershberger J, Zhang L and Zhu A 2001 Geometric spanners for routing in mobile networks. Proc. ACM MobiHoc 01, Long Beach, CA, pp. 4555. [14] Garey M and Johnson D 1977 The rectilinear steiner tree problem is np-complete. SIAM Journal of Applied Mathematics 32, 826834. [15]      997 Handbook of Discrete and Computational Geometry. CRC Press, New York. [16] Gupta P and Kumar P 2000 The capacity of wireless networks. IEEE Transactions Information Theory 46(2), 388404. [17] Haas Z and Pearlman M 1998 The performance of query control schemes for the zone routing protocol. Proc. ACM Sigcomm, Vancouver, pp. 167177. [18] Hong X, Gerla M, Pei G and Chiang C 1999 A group mobility model for ad hoc wireless networks. Proc. ACM MSWiM, Seattle, WA, pp. 5360. [19] IEEE 1999 Ansi/IEEE Standard 802.11: Medium Access Control and Physical Specifications. Sect. 15. [20] Jardosh A, Belding-Royer E, Almeroth K and Suri S 2003 Towards realistic mobility models for mobile ad hoc networks. Proc. ACM Mobicom, pp. 217229 [21] Johnson D and Maltz D 1996 Dynamic source routing in ad hoc wireless networks. Mobile Computing. Kluwer Academic Publishers, pp. 153181 [22] Jung A and Vaidya N 2002 A power control mac protocol for ad hoc networks. Proc. ACM Mobicom, Atlanta, GA, pp. 3647 [23] Karp B and Kung H 2000 Gpsr: greedy perimeter stateless routing for wireless networks. Proc. ACM Mobicom, Boston, MA, pp. 243254 [24] Khun F, Wattenhofer R and Zollinger A 2003 Worst-case optimal and average-case efficient geometric ad hoc routing. Proc. ACM MobiHoc, Annapolis, MD, pp. 267 278 [25] Kirousis L, Kranakis E, Krizanc D and Pelc A 2000 Power consumption in packet radio networks. Theoretical Computer Science 243, 289305. [26] Li X, Wan P, Wang Y and Frieder O 2002 Sparse power efficient topology for wireless networks. Proc. IEEE Hawaii International Conference on System Sciences (HICSS), Big Island, HI. [27] Li X, Wang Y and Song W 2004 Applications of k-local mst for topology control and broadcasting in wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems 15(12), 10571069 [28] Ns2 2002 The network simulator - ns-2 http://www.isi.edu/nsnam/ns/. [29] Pearlman M, Haas Z, Sholander P and Tabrizi S 2000b On the impact of alternate path routing for load balancing in mobile ad hoc networks. Proc. ACM MobiHoc, Boston, MA, pp. 310. [30] Pister K 2001 The smart dust project http://robotics.eecs.berkeley.edu/∼pister/SmartDust/. [31] Polastre J, Szewczyk R, Sharp C and Culler D 2004 The mote revolution: low power wireless sensor network devices. Proc. Hot Chips 16: A Symposium on High Performance Chips, Stanford, CA. [32] Raghunathan V, Schurgers C, Park S and Srivastava M 2002 Energy-aware wireless microsensor networks. IEEE Signal Processing Magazine 19(2), 4050. [33] Rappaport T 2002 Wireless Communications: Principles and Practice, Second Edition. Prentice Hall, Upper Saddle River, NJ [34] RockwellScienceCenter 2004 The wins project available at http://wins.rsc.rockwell.com. [35] Royer E, Melliar-Smith P and Moser L 2001 An analysis of the optimum node density for ad hoc mobile networks. Proc. IEEE International Conference on Communications, Helsinki, pp. 857861. [36] Santi P and Blough D 2003 The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Transactions on Mobile Computing 2(1), 2539. [37] Song W, Wang Y, Li X and Frieder O 2004 Localized algorithms for energy efficient topology in wireless ad hoc networks. Proc. ACM MobiHoc, Tokyo, pp. 98108. [38] Wan P, Calinescu G, Li X and Frieder O 2002 Minimum energy broadcasting in static ad hoc wireless networks. ACM/Kluwer Wireless Networks 8(6), 607617. [39] Wang K and Li B 2002 Group mobility and partition prediction in wireless ad hoc networks. Proc. IEEE International Conference on Communications, New York, pp. 10171021. [40] Wang Y, Li X and Frieder O 2002 Distributed spanners with bounded degree for wireless ad hoc networks. International Journal of Foundations of Computer Science, 14(2), pp. 183200. [41] Yoon J, Liu M and Noble B 2003 Random waypoint considered harmful. Proc. IEEE Infocom, San Francisco, CA, pp. 13121321. [42] Zeng X, Bagrodia R and Gerla M 1998 Glomosim: a library for parallel simulation of large-scale wireless networks. Workshop on Parallel and Distributed Simulations (PADS), Banff, Alberta. . models for mobile ad hoc networks. Proc. ACM Mobicom, pp. 217229 [21] Johnson D and Maltz D 1996 Dynamic source routing in ad hoc wireless networks. Mobile Computing. Kluwer Academic Publishers,. wireless ad hoc networks. IEEE Transactions on Mobile Computing 2(3), 257269. [7] Blough D, Leoncini M, Resta G and Santi P 2002 On the symmetric range assignment problem in wireless ad hoc networks Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6), 609616. [11] Camp T, Boleng J and Davies V 2002 Mobility models for ad hoc network simulations. Wiley Wireless