EnergyEfficient Target Coverage in Wireless Sensor Networks无线传感器网络能量有效目标覆盖.pptVIP

下载本文档

8
0
约6.4千字
约 25页
2017-02-13 发布于上海
举报
版权申诉

EnergyEfficient Target Coverage in Wireless Sensor Networks无线传感器网络能量有效目标覆盖.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer and Communications Societies, 2005. INFOCOM 2005 Outline Itroduction Related Work Target Coverage Problem Maximum Set Covers Solutions To Compute Maximum Set Covers LP-MSC Heuristic Greedy-MSC Heuristic Simulation Conclusions Introduction Application of sensor networks： National security、Surveillance、Health care Environment monitoring A critical issue in wireless sensor networks is power scarcity. Methods that optimize the sensor energy utilization have great importance. Introduction A sensor node’s radio can be one of following four states： transmit、receive、idle、sleep A analysis of the power usage (presented in [14]) transmit 0.38w~0.7w receive 0.36w idle 0.34w sleep 0.03w Selecting the state of each sensor node’s radio is accomplished through a scheduling mechanism. Introduction Power saving techniques can generally be classified in the following categories： schedule the wireless nodes to alternate between active and sleep mode power control by adjusting the transmission range of wireless nodes energy efficient routing, data gathering reduce the amount of data transmitted and avoid useless activity. Related work Disjoint Set Covers Divide sensor nodes into disjoint sets Each set completely monitor all targets One set is active each time until ran out of energy Goal: To find the maximum number of disjoint sets This is NP-Complete Target Coverage Problem Definition：Target Coverage Problem(TCP) m targets with known location n sensors randomly deployed in the closed proximity of the targets schedule the sensor nodes activity all the targets are continuously observed and network lifetime is maximized. Scheduling mechanism Step1、Sensors send their location information to the BS Step2、BS executes the sensor scheduling algorithm and broadcasts the schedule when each node is active Step3、Every sensor