Energy-efficient coverage based on probabilistic sensing model in wireless sensor networks

Jiming Chen; Junkun Li; Shibo He; Youxian Sun; Hsiao Hwa Chen

doi:10.1109/LCOMM.2010.080210.100770

Energy-efficient coverage based on probabilistic sensing model in wireless sensor networks

Jiming Chen, Junkun Li, Shibo He, Youxian Sun, Hsiao Hwa Chen

Department of Engineering Science

Research output: Contribution to journal › Article › peer-review

81 Citations (Scopus)

Abstract

Network coverage is one of the most critical issues to implement Wireless Sensor Networks (WSNs). It is important to find out a sensor set with maximal residual energy to cover all points of interest (PoIs). This issue was named as minimum weight sensor coverage problem (MWSCP) based on a boolean disc model and a probabilistic sensing model in the literature. In this paper, we introduce intelligent algorithms to solve this problem, yielding a better solution to MWSCP to extend network lifetime. Simulation results are conducted to demonstrate the effectiveness of our proposed algorithm in terms of network lifetime over existing algorithms.

Original language	English
Article number	5547597
Pages (from-to)	833-835
Number of pages	3
Journal	IEEE Communications Letters
Volume	14
Issue number	9
DOIs	https://doi.org/10.1109/LCOMM.2010.080210.100770
Publication status	Published - 2010 Sept

All Science Journal Classification (ASJC) codes

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2010.080210.100770

Cite this

@article{a6f29e46c39d4b9f9bc88353c22b49b1,

title = "Energy-efficient coverage based on probabilistic sensing model in wireless sensor networks",

abstract = "Network coverage is one of the most critical issues to implement Wireless Sensor Networks (WSNs). It is important to find out a sensor set with maximal residual energy to cover all points of interest (PoIs). This issue was named as minimum weight sensor coverage problem (MWSCP) based on a boolean disc model and a probabilistic sensing model in the literature. In this paper, we introduce intelligent algorithms to solve this problem, yielding a better solution to MWSCP to extend network lifetime. Simulation results are conducted to demonstrate the effectiveness of our proposed algorithm in terms of network lifetime over existing algorithms.",

author = "Jiming Chen and Junkun Li and Shibo He and Youxian Sun and Chen, {Hsiao Hwa}",

note = "Funding Information: This research was supported in parts by NSFC-Guangdong joint Project Grant (U0735003); NSFC Grants (60736021 and 60974122); 111 Projects under Grant (B07031), FRFCU Grant (2009QNA5007), and Taiwan National Science Council Grant (NSC98-2219-E-006-011). Digital Object Identifier 10.1109/LCOMM.2010.080210.100770",

year = "2010",

month = sep,

doi = "10.1109/LCOMM.2010.080210.100770",

language = "English",

volume = "14",

pages = "833--835",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

T1 - Energy-efficient coverage based on probabilistic sensing model in wireless sensor networks

AU - Chen, Jiming

AU - Li, Junkun

AU - He, Shibo

AU - Sun, Youxian

AU - Chen, Hsiao Hwa

N1 - Funding Information: This research was supported in parts by NSFC-Guangdong joint Project Grant (U0735003); NSFC Grants (60736021 and 60974122); 111 Projects under Grant (B07031), FRFCU Grant (2009QNA5007), and Taiwan National Science Council Grant (NSC98-2219-E-006-011). Digital Object Identifier 10.1109/LCOMM.2010.080210.100770

PY - 2010/9

Y1 - 2010/9

N2 - Network coverage is one of the most critical issues to implement Wireless Sensor Networks (WSNs). It is important to find out a sensor set with maximal residual energy to cover all points of interest (PoIs). This issue was named as minimum weight sensor coverage problem (MWSCP) based on a boolean disc model and a probabilistic sensing model in the literature. In this paper, we introduce intelligent algorithms to solve this problem, yielding a better solution to MWSCP to extend network lifetime. Simulation results are conducted to demonstrate the effectiveness of our proposed algorithm in terms of network lifetime over existing algorithms.

AB - Network coverage is one of the most critical issues to implement Wireless Sensor Networks (WSNs). It is important to find out a sensor set with maximal residual energy to cover all points of interest (PoIs). This issue was named as minimum weight sensor coverage problem (MWSCP) based on a boolean disc model and a probabilistic sensing model in the literature. In this paper, we introduce intelligent algorithms to solve this problem, yielding a better solution to MWSCP to extend network lifetime. Simulation results are conducted to demonstrate the effectiveness of our proposed algorithm in terms of network lifetime over existing algorithms.

UR - http://www.scopus.com/inward/record.url?scp=77957712533&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957712533&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2010.080210.100770

DO - 10.1109/LCOMM.2010.080210.100770

M3 - Article

AN - SCOPUS:77957712533

SN - 1089-7798

VL - 14

SP - 833

EP - 835

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 9

M1 - 5547597

ER -

Energy-efficient coverage based on probabilistic sensing model in wireless sensor networks

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this