Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete
暂无分享,去创建一个
[1] Alexandre Caminada,et al. Automatic mesh generation for mobile network dimensioning using evolutionary approach , 2005, IEEE Transactions on Evolutionary Computation.
[2] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[3] Gaurav S. Sukhatme,et al. An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.
[4] S. Sitharama Iyengar,et al. Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.
[5] Krishnendu Chakrabarty,et al. Location-aided flooding: an energy-efficient data dissemination protocol for wireless-sensor networks , 2005, IEEE Transactions on Computers.
[6] Miodrag Potkonjak,et al. Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[7] Krishnendu Chakrabarty,et al. A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks , 2005, IEEE Transactions on Computers.
[8] Kang G. Shin,et al. Soft tamper-proofing via program integrity verification in wireless sensor networks , 2005, IEEE Transactions on Mobile Computing.
[9] KeWei-Chieh,et al. Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete , 2007 .
[10] Krishnendu Chakrabarty,et al. Sensor deployment and target localization in distributed sensor networks , 2004, TECS.
[11] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[12] Mihaela Cardei,et al. Coverage in Wireless Sensor Networks , 2004, Handbook of Sensor Networks.