Maximum lifetime coverage preserving scheduling algorithms in sensor networks

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.51, Iss.3, 2011-11, pp. : 447-462

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Sensor scheduling for p-percent coverage in wireless sensor networks

By Li Yingshu Ai Chunyu Cai Zhipeng Beyah Raheem

Cluster Computing, Vol. 14, Iss. 1, 2011-03 ,pp. : 27-40

Springer Publishing Company

Access to resources Recommend Favorite

A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks

International Journal of Business Data Communications and Networking (IJBDCN), Vol. 11, Iss. 2, 2015-07 ,pp. : 1-21

IGI Global_journal

Access to resources Recommend Favorite

Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation

By Stanford Jeffrey Tongngam Sutep

International Journal of Sensor Networks, Vol. 6, Iss. 1, 2009-08 ,pp. : 44-50

Inderscience Publishers

Access to resources Recommend Favorite

Quasi-optimal scheduling algorithm for area coverage in multi-functional sensor networks

By MolnÁr Miklós Simon Gyula Gönczy LÁszló

International Journal of Ad Hoc and Ubiquitous Computing, Vol. 14, Iss. 2, 2013-09 ,pp. : 109-122

Inderscience Publishers

Access to resources Recommend Favorite

Sleep–wake up scheduling with probabilistic coverage model in sensor networks¹

By Chen Pingsheng Hu Weidong

International Journal of Parallel, Emergent and Distributed Systems, Vol. 29, Iss. 1, 2014-01 ,pp. : 1-16

Taylor & Francis Ltd

Access to resources Recommend Favorite