An Enhanced Scheme of Target Coverage Scheduling in Rotatable Directional Sensor Networks 


Vol. 36,  No. 8, pp. 691-701, Aug.  2011


PDF Full-Text
  Abstract

In rotatable directional sensor networks, maximizing network lifetime while covering all the targets and forwarding the sensed data to the sink is a challenge problem. In this paper, we address the Maximum Directional Cover Tree (MDCT) problem of organizing the directional sensors into a group of non-disjoint subsets to extend the network lifetime. Each subset in which the directional sensors cover all the targets and forward the sensed data to the sink is activated at one time. For the MDCT problem, we first present an energy consumption model which mainly takes into account the energy consumption for rotation work. We also develop the Directional Coverage and Connectivity (DCC)-greedy algorithm to solve the MDCT problem. To evaluate the algorithm, we conduct simulations and show that it can extend the network lifetime.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

C. Kim, Y. Han, J. Gil, "An Enhanced Scheme of Target Coverage Scheduling in Rotatable Directional Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 8, pp. 691-701, 2011. DOI: .

[ACM Style]

Chan-Myung Kim, Youn-Hee Han, and Joon-Min Gil. 2011. An Enhanced Scheme of Target Coverage Scheduling in Rotatable Directional Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 36, 8, (2011), 691-701. DOI: .

[KICS Style]

Chan-Myung Kim, Youn-Hee Han, Joon-Min Gil, "An Enhanced Scheme of Target Coverage Scheduling in Rotatable Directional Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 8, pp. 691-701, 8. 2011.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880