Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 管理學院
  3. 資訊管理學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28627
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor林永松
dc.contributor.authorPei-Ling Chiuen
dc.contributor.author邱佩玲zh_TW
dc.date.accessioned2021-06-13T00:14:48Z-
dc.date.available2009-07-30
dc.date.copyright2007-07-30
dc.date.issued2007
dc.date.submitted2007-07-25
dc.identifier.citation[AGP04] Z. Abrams, A. Goel, and S. Plotkin, “Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks,” in Proc. 3rd International Symposium on Information Processing in Sensor Networks (IPSN’04), April 2004, pp. 424-432.
[AS03] S. Adlakha and M. Srivastava, “Critical Density Thresholds for Coverage in Wireless Sensor Networks,” IEEE Wireless Communication and Networking, vol. 3, March 2003, pp. 1615-1620.
[ASC02a] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless Sensor Networks: a Survey,” Computer Networks, vol. 38, March 2002, pp. 393-422.
[ASC02b] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Communications Magazine, August 2002, pp. 102-114.
[BG77] M. L. Bazarra and J. J. Goode, “The Traveling Salesman Problem: A Duality Approach,” Math. Programming, vol. 13, 1977, pp. 221-237.
[BHE00] N. Bulusu, J. Heidemann, and D. Estrin, “GPS-less Low-Cost Outdoor Localization for Very Small Devices,” IEEE Personal Communications, October 2000.
[BKX06] X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. H. Lai, “Deploying Wireless Sensors to Achieve both Coverage and Connectivity,” in Proc. 7th International Symposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc’06), 2006.
[BP00] P. Bahl and V. N. Padmanabhan, “RADAR: an In-Building RF-based User Location and Tracking System,” in Proc. IEEE INFOCOM 2000, vol. 2, March 2000, pp. 775-784.
[CCK06] Y. H. Cho, S. P. Choi, W. Y. Kim, and E. C. Choi, “Development of Sensor Network Nodes for Ultrasonic Sensor-Driven Position System Inside Buildings,” in Proc. IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, vol. 2, 2006, pp. 232–236.
[CCR01] P. Castro, P. Chiu, T. Rremenek, and R. R. Muntz, “A Probabilistic Room Location Service for Wireless Networked Environments,” in Proc. ACM UbiComp 2001.
[CCZ05] Y. Chen, C. N. Chuah, and Q. Zhao, “Sensor Placement for Maximizing Lifetime per Unit Cost in Wireless Sensor Networks,” in Proc. IEEE Conference on Military Communications (MILCOM2005), vol. 2, October 2005, pp. 1097-1102.
[CD05] M. Cardei and D.-Z. Du, “Improving Wireless Sensor Network Lifetime through Power Aware Organization,” ACM Wireless Networks, vol. 11, Issue 3, May 2005, pp. 333-340.
[CHL03] I. Charon , O. Hudry, and A. Lobstein, “Minimizing the Size of an Identifying or Locating-Dominating Code in a Graph is NP-hard,” Theoretical Computer Science, vol. 290, 2003, pp. 2109 – 2120.
[CHS04] W. P. Chen, J. C. Hou, and L. Sha, “Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks,” IEEE Trans. on Mobile Computing, vol. 3, Issue 3, July 2004, pp. 258-271.
[CIQ01] K. Chakrabarty, S. S. Iyengar, H. Qi, and E. Cho, “Coding Theory Framework for Target Location in Distributed Sensor Networks,” in Proc. IEEE International Conference on Information Technology: Coding and Computing, April 2001, pp. 130-134.
[CIQ02] K. Chakrabarty, S. S. Iyengar, H. Qi, and E. Cho, “Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks,” IEEE Trans. on Computers, vol. 51, no. 12, Dec. 2002, pp. 1148-1153.
[CKN07] Z. Chaczko, R. Klempous, J. Nikodem, and M. Nikodem,”Methods of Sensors Localization in Wireless Sensor Networks,” in Proc. 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07), 2007.
[CL04] P. L. Chiu and Frank Y. S. Lin, “A Simulated Annealing Algorithm to Support the Sensor Placement for Target Location,” in Proc. IEEE CCECE, May, 2004.
[CMC02] M. Cardei, D. Maccallum, X. Cheng, M. Min, X. Jia, D. Li, and D.-Z. Du, “Wireless Sensor Networks with Energy Efficient Organization,” Journal of Interconnection Networks, vol 3, No 3-4, 2002, pp. 213-229.
[CT06] T. M. Cover and J. A. Thomas, “Elements of Information Theory,” 2nd ed., published by John Wiley and Sons, Inc., New Jersey, 2006.
[CTL05] M. Cardei, M. T. Thai, Y. Li, and W. Wu, “Energy-Efficient Target Coverage in Wireless Sensor Networks,” in Proc. IEEE INFOCOM 2005, vol. 3, March 2005, pp.1976-1984.
[CW06] M. Cardei and J. Wu, “Energy-Efficient Coverage Problems in Wireless Ad Hoc Sensor Networks,” Computer Communications, vol. 29, 2006, pp. 413-420.
[CWL05] M. Cardei, J. Wu, M. Lu, and M. O. Pervaiz, “Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges,” in Proc. WiMob 2005, vol. 3, pp. 438-445.
[DC03] S. S. Dhillon and K. Chakrabarty, “Sensor Placement for Effective Coverage and Surveillance in Distributed Sensor Networks,” in Proc. IEEE WCNC, vol. 3, March 2003, pp. 1609-1614.
[DCI02] S. S. Dhillon, K. Chakrabarty, and S.S. Iyengar, “Sensor Placement for Grid Coverage under Imprecise Detections,” in Proc. 15th International Conference on Information Fusion, vol. 2, July 2002, pp. 1581-1587.
[DCT05] M. Ding, D. Chen, A. Thaeler, and X. Cheng, “Fault-Tolerant Target Detection in Sensor Networks,” in Proc. IEEE Conference on Wireless Communications and Networking, vol. 4, March 2005, pp. 2362–2368.
[DVZ06] A. Dhawan, C. T. Vu, A. Zelikovsky, Y. Li, and S. K. Prasad, “Maximum Lifetime of Sensor Networks with Adjustable Sensing Range,” in Proc. 7th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, (SNPD 2006), June 2006, pp. 285 – 289.
[EGH99] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” in Proc. MOBICOM, 1999, pp. 263-270.
[Egl90] R. W. Eglese, “Simulated Annealing: A tool for Operational Research,” European Journal of Operational Research, vol. 46, 1990.
[Etc77] J. Etcheberry, “The Set-Covering Problem: A New Implicit Enumeration Algorithm,” Operations Res., vol. 25, 1977, pp. 760-772.
[Fis73] M. L. Fisher, “Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I,” Operations Res., vol. 21, pp. 1114-1127, 1973.
[Fis76] M. L. Fisher, “A Dual Algorithm for One-Machine Scheduling Problem,” Math. Programming, vol. 11, 1976, pp. 229-251.
[Fis81] M. L. Fisher, “The Lagrangean Relaxation Method for Solving Integer Programming Problem,” Management Science, vol. 27, no. 1, January 1981, pp. 1-18.
[Fis85] M. L. Fisher, “An Applications Oriented Guide to Lagrangian Relaxation,” Interfaces, vol. 15, no. 2, March-April 1985, pp. 10-21.
[FS74] M. L. Fisher and J. F. Shapiro, “Constructive Duality in Integer Programming,” SIAM J. Appl. Math., vol. 27, pp. 31-52, 1974.
[GCB06] D. Ganesan, R. Cristescu, and B. Beferull-Lozano, “Power-Efficient Sensor Placement and Transmission Structure for Data Gathering under Distortion Constraints,” ACM Trans. on Sensor Networks, vol. 2, issue 2, May 2006.
[Geo74] M. Geoffrion, “Lagrangean Relaxation and Its Uses in Integer Programming,” Math. Programming Study, vol. 2, 1974, pp. 82-114.
[GJ79] M. R. Garey and D. S. Johnson, “Computers and intractability: A guide to the theory of NP-Completeness,” Freeman, New York, 1979.
[Gof77] J. L. Goffin, “On the Convergence Rates of Subgradient Optimization Methods,” Mathematical Programming, vol. 13, 1977, pp. 329-347.
[GT02] M. T. Goodrich and R. Tamassia, “Algorithm Design – Foundations, Analysis, and Internet Examples,” John Wiley & Sons, Inc., ISBN: 0-471-38365-1, 2002, p. 611.
[HA07] M. Hefeeda and H. Ahmadi, “ Probabilistic Coverage in Wireless Sensor Networks,” Technical Report: TR 2006-21, Simon Fraser University, Surrey, Canada, March 2007.
[HB01] J. Hightower and G. Borriello, “A Survey and Taxonomy of Location Systems for Ubiquitous Computing,” Technical Report UW-CSE 01-08-03, University of Washington, Computer Science and Engineering, August 24, 2001.
[HWC74] M. Held, P. Wolfe, and H. D. Crowder, “Validation of Subgradient Optimization,” Math. Programming, vol. 6, 1974, pp. 62-88.
[IMP05] A. Iranli, M. Maleki, and M. Pedram, “Energy Efficient Strategies for Deployment of a Two-Level Wireless Sensor Network,” in Proc. International Symposium on Low Power Electronics and Design (ISLPED’05), August 2005, pp. 233 – 238.
[KCL98] M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, “On a New Class of Codes for Identifying Vertices in Graphs,” IEEE Transactions on Information Theory, vol. 44, no. 2, 1998, pp. 599-611.
[KGG06] A. Krause, C. Guestrin, A. Gupta, and J. Kleinberg, “Near-Optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost,” in Proc. 1st International Conference on Information Processing in Sensor Networks (IPSN2006), April 2006, pp. 2-10.
[KGM83] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by Simulated Annealing,” Science, vol. 220, no. 4596, May 1983, pp. 671-680.
[KKL06] Y. G. Kim, H. K. Kim, S. G. Lee, and K. D. Lee, “Ubiquitous Home Security Robot based on Sensor Network,” in Proc. IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT '06), December 2006, pp. 700–704.
[LAR01] Q. Li, J. Aslam, and D. Rus, “Hierarchical Power-aware Routing in Sensor Networks,” in Proc. DIMACS Workshop on Pervasive Networking, May 2001.
[LBA02] C. Lu, B. M. Blum, T. F. Abdelzaher, J. A. Stankovic, and T. He, “RAP: A Real Time Communication Architecture for Large-Scale Wireless Sensor Networks,” in Proc. IEEE RTAS 2002.
[LC05] Frank Y. S. Lin and P. L. Chiu, “A Near-optimal Sensor Placement Algorithm to Achieve Complete Coverage/Discrimination in Sensor Networks,” IEEE Communications Letters, vol. 9, no. 1, January 2005.
[LC06] M. H. Lu and T. Chen, “CMUseum: A Location-aware Wireless Video Streaming System,” in Proc. IEEE International Conference on Multimedia and Expo, July 2006, pp. 2129 – 213.
[LP06] L. Lazos and R. Poovendran, “HiRLoc: High-Resolution Robust Localization for Wireless Sensor Networks,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 2, February 2006.
[LRS05] M. Leoncini, G. Resta, and P. Santi, “Analysis of a Wireless Sensor Dropping Problem in Wide-Area Environmental Monitoring,” in Proc. 4th IEEE/ACM Symposium on Information Processing in Sensor Networks (IPSN’05), April 2005, pp. 239-245.
[LT04] B. Liu and D. Towsley, “A Study of the Coverage of Large-scale Sensor Networks,” in Proc. IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS’04), Fort Lauderdale, Florida, October 2004, pp. 475-483.
[Lue84] D. G. Luenberger, “Linear and Nonlinear Programming,” 2nd edition, Addison-Wesley Publishing Company, 1984.
[LXP05] S. Li, C. Xu, W. Pan, and Y. Pan, “Sensor Deployment Optimization for Detecting Maneuvering Targets,” in Proc. 7th International Conference on Information Fusion (FUSION), 2005, pp. 1629–1635.
[MKP01] S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, “Coverage Problems in Wireless Ad-Hoc Sensor Networks,” in Proc. IEEE INFOCOM 2001, pp. 1380–1387.
[MP03] S. Megerian and M. Potkonjak, “Low power 0/1 coverage and scheduling techniques in sensor networks,” UCLA Technical Reports 030001, January 2003.
[MP05] M. Maleki and M. Pedram, “QoM and Lifetime-Constrained Random Deployment of Sensor Networks for Minimum Energy Consumption,” in Proc. 4th International Conference on Information Processing in Sensor Networks (IPSN '05), April 2005.
[MRK05] V. P. Mhatre, C. Rosenberg, D. Kofman, R. Mazumdar, and N. Shroff, “A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint,” IEEE Trans. on Mobile Computing, vol. 4, no. 1, January/February, 2005, pp. 4-15.
[MV04] M. J. Miller and N. H. Vaidya, “Minimizing Energy Consumption in Sensor Networks using a Wakeup Radio,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), vol. 4 , March 2004, pp.2335–2340.
[NKJ05] A. Nadeem, S.S. Kanhere, and S. Jha, “Probanilistic Coverage in Wireless Sensor Networks”, in Proc. IEEE Conference on Local Computer Networks 30th Anniversary (LCN’05) , 2005.
[NN04] R. E. Neapolitan and K. Naimipour, “Foundations of Algorithms using C++ Pseudocode,” 3rd edition, Jones and Bartlett Publishers, 2004.
[PCB00] N. B. Priyantha, A. Chakraborty, and H. Balakrishnan, “The Cricket Location-Support System,” in Proc. ACM MOBICOM 2000.
[PK00] G. J. Pottie and W.J. Kaiser, “Wireless Integrated Network Sensors,” Communications of the ACM, vol.43, no. 5, 2000, pp. 551-558.
[PME00] A.Porret, T. Melly, C.C. Enz, and E.A. Vittoz, “A Low-power Low-voltage Transceiver Architecture Suitable for Wireless Distributed Sensors Network,” in Proc. IEEE International Symposium on Circuits and Systems, vol. 1, 2000, pp. 56-59.
[QIC01] H. Qi, S. S. Iyengar, and K. Chakrabarty, “Distributed Sensor Networks-a Review of Recent Research,” Journal of the Franklin Institute, vol. 338, no. 6, September 2001, pp. 655-668.
[Rap96] T. S. Rappaport, “Wireless Communications: Principles and Practice,” New Jersey: Prentice Hall, 1996.
[RSP02] V. Raghunathan, C. Schurgers, S. Park, and B. Srivastava, “Energy Aware Wireless Microsensor Networks,” IEEE Signal Processing Magazine, pp. 40-50, March, 2002.
[RST04] S. Ray, D. Starobinski, A. Trachtenberg, and R. Ungrangsi, “Robust Location Detection With Sensor Networks,” IEEE Journal on Selected Area in Communications, vol. 22, no. 6, August 2004.
[RUP03] S. Ray, R. Ungrangsi, F. D. Pellegrini, A. Trachtenberg, and D. Starobinski, “Robust Location Detection In Emergency Sensor Networks,” in Proc. IEEE INFOCOM 2003.
[SCI01] E. Shih, S.H. Cho, N. Ickes, R. Min, A. Sinha, A. Wang, and A. Chandrakasan, “Physical Layer Driven Protocol and Algorithm Design for Energy-Efficient Wireless Sensor Networks,” in Proc. 7th Annual ACM/IEEE International Conference on Mobile Computing and Networking, July 2001, pp. 272-286.
[SP01] S. Slijepcevic and M. Potkonjak, “Power Efficient Organization of Wireless Sensor Networks,” in Proc. IEEE International Conference on Communications (ICC’01), vol. 2, June 2001, pp. 472–476.
[SR02] R.C. Shah and J. Rabaey, “Energy Aware Routing for Low Energy Ad Hoc Sensor Networks,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC), March 2002.
[SS05] Y. Shang and H. Shi, “Coverage and Energy Tradeoff in Density Control on Sensor Networks,” in Proc. 11th International Conference on Parallel and Distributed Systems, vol. 1, July 2005, pp. 564–570.
[SSS03] S. Shakkottai, R. Srikant, and N. Shroff, “Unreliable sensor grids: Coverage, connectivity and diameter,” in Proc. IEEE INFOCOM 2003.
[VGD06] C. T. Vu, S. Gao, W. P. Deshmukh, and Y. Li, “Distributed Energy-Efficient Scheduling Approach for K-Coverage in Sensor Networks,” in Proc. MILCOM 2006.
[VVB04] L. F. M. Vieira, M. A. M. Vieira, L. R. Beatriz, A. A. F. Loureiro, D. C. Silva, and A. O. Fernandes, “Efficient Incremental Sensor Network Deployment Algorithm,” in Proc. Brazilian Symposium on Computer Networks, 2004.
[Wan06] B. Wang, “A Survey on Coverage Problems in Wireless Sensor Networks”, Tech. Rep., National University of Singapore, 2006.
[WLY06]
Y. Wang, X. Liu, and J. Yin, “Requirements of Quality of Service in Wireless Sensor Network,” in Proc. International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies ( ICN/ICONS/MCL 2006), April 2006.
[WWS05] B. Wang, W. Wang, V. Srinivasan, and K. C. Chua, “Information Coverage for Wireless Sensor Networks,” IEEE Communications Letters, vol. 9, no. 11, 2005, pp. 967–969.
[WX07] C. Wang and L. Xiao, “Sensor Localization under Limited Measurement Capabilities,” IEEE Network, vol. 21, Issue 3, May-June 2007, pp.16 – 23.
[WXZ03] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated coverage and connectivity configuration in wireless sensor networks,” in Proc. 1st ACM Conference on Embedded Networked Sensor Systems (SenSys’03), November 2003.
[WY04] J. Wu and S. Yang, “Coverage and Connectivity in Sensor Networks with Adjustable Ranges,” in Proc. International Workshop on Mobile and Wireless Networking (MWN), 2004.
[Xu03] N. Xu, “A Survey of Sensor Network Applications,” Survey Paper for CS694a, Computer Science Department, University of Southern California, 2003. http: //enl.usc.edu/ ~ningxu/papers/survey.pdf
[XWH05] K. Xu, Q. Wang, H. Hassanein, and G. Takahara, “Optimal Wireless Sensor Networks (WSNs) Deployment: Minimum Cost with Lifetime Constraint,” in Proc. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob’05), August 2005, pp. 454–461.
[YHE02] W. Ye, J. Heidemann, and D. Estrin, “An Energy-Efficient MAC Protocol for Wireless Sensor Networks,” in Proc. 21st International Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), June 2002.
[YHS03] T. Yan, T. He, and J. A. Stankovic, “Differentiated Surveillance for Sensor Networks,” in Proc. 1st ACM Conference on Embedded Networked Sensor Systems (Sensys03), November 2003.
[ZC03a] Y. Zou and K. Chakrabarty, “Sensor Deployment and Target Localization based on Virtual Forces,” in Proc. IEEE INFOCOM 2003, vol. 2, pp. 1293-1302.
[ZC03b] Y. Zou and K. Chakrabarty, “Target Localization based on Energy Considerations in Distributed Sensor Networks,” Ad Hoc Networks, no. 1, 2003, pp. 261-272.
[ZDG04] Z. Zhou, S. Das, and H. Gupta, “Connected k-Coverage Problem in Sensor Networks,” in Proc. ICCCN 2004.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28627-
dc.description.abstract近年來,無論在實務或是學術領域,無線感測器網路(Wireless Sensor Networks, WSNs)的應用與技術發展都是極受關注的議題。目前已有許多重要的WSNs應用被熱切探討,如:環境監測、標的物定位、物體追蹤及健康照護等。預期未來在軍事與民用上,WSNs都會有更廣泛的應用出現。
感測器網路的設計有兩個典型的議題:一是如何建構一個能滿足應用所需之服務品質的感測器網路。另一則是如何延長感測網路生命期。從應用層的觀點來看,改善服務品質需求,必須考慮感測器網路對於應用的支援,如環境監測、標的物定位或追蹤等的能力。再者,感測器電力有限,通常很難再充電。因此,如何延長WSNs的生命期也是配置感測器網路所關注的議題。
此論文朝向提供具環境監測與標的物定位服務的應用方向,來探討感測器配置(sensor deployment)議題,由不同觀點進行一系列的深入研究。茲將每一研究主題之內涵與成果簡述如下:
zh_TW
dc.description.abstractFrom either practical or theoretical viewpoint, wireless sensor network (WSN) techniques are new and important research issues. Numbers of interesting applications for WSNs have been investigated, e.g., surveillance, target positioning, tracing, and health care. Sensor networks have been forecasted to apply variously, both the civilian and military domains.
There are two important issues usually are concerned on WSNs design. One is to construct a qualified WSN for applications to guarantee desired quality of service (QoS). The other challenge is to prolong the network lifetime. From application perspective, in order to improve the QoS supporting by WSNs, the ability of environment surveillance, target positioning, or target tracking have to be controlled carefully. Moreover, it is difficult to replace or recharge the battery for numerous sensors in the most scenarios. Hence, how to prolong the lifetime of WSNs also becomes a key challenge.
In this dissertation, we focus on the sensor deployment problem to support environment surveillance and target positioning services from various perspectives. Subsequently, we present each topic briefly as follows:
en
dc.description.provenanceMade available in DSpace on 2021-06-13T00:14:48Z (GMT). No. of bitstreams: 1
ntu-96-D87725001-1.pdf: 1363563 bytes, checksum: 5fc014eae1ea48877911cb66420f8f76 (MD5)
Previous issue date: 2007
en
dc.description.tableofcontentsCHAPTER 1 INTRODUCTION 1
1.1 OVERVIEW 1
1.2 RESEARCH SCOPE 5
CHAPTER 2 RESEARCH BACKGROUND 11
2.1 RELATED WORK 11
2.1.1 Coverage 11
2.1.2 QoS in WSNs 22
2.1.3 Energy Efficiency 23
2.1.4 Target Location 24
2.1.5 Sensor Deployment 35
2.2 LAGRANGEAN RELAXATION METHOD 46
2.3 SIMULATED ANNEALING METHOD 51
CHAPTER 3 SENSOR PLACEMENT ALGORITHMS FOR ACHIEVING COMPLETE COVERAGE AND DISCRIMINATION 54
3.1 OVERVIEW 54
3.2 PROBLEM DESCRIPTION 55
3.3 SENSOR PLACEMENT PROBLEM FOR ACHIEVING COMPLETE COVERAGE AND DISCRIMINATION 57
3.3.1 Mathematical Model 57
3.3.2 Algorithm 58
3.3.3 Computational Results 60
3.3.4 Concluding Remarks 65
3.4 CONSIDER ADJUSTABLE DETECTION RADIUS ON RANDOM SENSOR PLACEMENT PROBLEM 66
3.4.1 Simulated Annealing Based Algorithm 66
3.4.2 Computational Results 67
3.5 CONCLUDING REMARKS 74
CHAPTER 4 SENSOR PLACEMENT PROBLEM FOR DIFFERENTIATED QUALITY OF POSITIONING AND SURVEILLANCE SERVICES 75
4.1 OVERVIEW 75
4.2 PROBLEM DESCRIPTION 78
4.2.1 The Framework 78
4.2.2 An Example 80
4.3 MATHEMATICAL MODEL 82
4.4 LAGRANGEAN RELAXATION APPROACH 86
4.4.1 Equivalent Model 86
4.4.2 Transformation 88
4.4.3 Relaxation 90
4.4.4 Getting Primal Feasible Solutions 98
4.4.5 Computational Results 100
4.5 SIMULATED ANNEALING APPROACH 111
4.5.1 Algorithm SA_1 111
4.5.2 Algorithm SA_2 113
4.5.3 Computational Results 113
4.6 PERFORMANCE COMPARISONS 118
4.6.1 Performance Evaluations 118
4.6.2 Convergence Properties Analysis 119
4.6.3 Compare with Other Approaches 124
4.6.4 Results Analysis 127
4.7 CONCLUDING REMARKS 128
CHAPTER 5 ENERGY-EFFICIENT SENSOR NETWORKS DESIGN 130
5.1 OVERVIEW 130
5.2 PROBLEM DESCRIPTION 132
5.3 MATHEMATICAL MODEL 139
5.4 LAGRANGEAN RELAXATION APPROACH 141
5.4.1 Relaxation 141
5.4.2 Getting Primal Feasible Solutions 144
5.4.3 Computational Results 145
5.5 SIMULATED ANNEALING APPROACH 152
5.5.1 Algorithm 152
5.5.2 Computational Results 154
5.6 CONCLUDING REMARKS 164
CHAPTER 6 CONCLUSION AND FUTURE WORK 165
6.1 SUMMARY 165
6.2 FUTURE WORK 168
REFERENCES 169
PUBLICATIONS 176
APPENDIX A: SET-COVER AND SET K-COVER PROBLEMS 177
APPENDIX B: THEOREM A.1 179
APPENDIX C: 189
APPENDIX D: LIST OF NOTATIONS 192
dc.language.isoen
dc.subject電能效率zh_TW
dc.subject服務品質zh_TW
dc.subject完全辨識zh_TW
dc.subject完全覆蓋zh_TW
dc.subject標的物定位zh_TW
dc.subject感測器配置zh_TW
dc.subject拉格蘭日鬆弛法zh_TW
dc.subject模擬退火法zh_TW
dc.subject數學規劃zh_TW
dc.subject網路最佳化zh_TW
dc.subjectNetwork Optimizationen
dc.subjectsensor deploymenten
dc.subjecttarget positioningen
dc.subjectquality of positioning serviceen
dc.subjectEnergy-Efficiencyen
dc.subjectLagrangean Relaxationen
dc.subjectSimulated Annealingen
dc.subjectMathematical Modelingen
dc.title支援定位服務之感測器配置演算法zh_TW
dc.titleSensor Deployment Algorithms for Target Positioning Servicesen
dc.typeThesis
dc.date.schoolyear95-2
dc.description.degree博士
dc.contributor.oralexamcommittee呂俊賢,林一平,孫雅麗,莊東穎,廖婉君,趙啟超,鐘嘉德
dc.subject.keyword感測器配置,標的物定位,完全覆蓋,完全辨識,服務品質,電能效率,拉格蘭日鬆弛法,模擬退火法,數學規劃,網路最佳化,zh_TW
dc.subject.keywordsensor deployment,target positioning,quality of positioning service,Energy-Efficiency,Lagrangean Relaxation,Simulated Annealing,Mathematical Modeling,Network Optimization,en
dc.relation.page193
dc.rights.note有償授權
dc.date.accepted2007-07-27
dc.contributor.author-college管理學院zh_TW
dc.contributor.author-dept資訊管理學研究所zh_TW
顯示於系所單位:資訊管理學系

文件中的檔案:
檔案 大小格式 
ntu-96-1.pdf
  未授權公開取用
1.33 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved