NEAR: A neighbor-cooperation-based off-duty eligibility acquisition rule for wireless sensor nodes

Juhua Pu; Jia Chen; Xiaolan Tang; Zhicheng Han

doi:10.1587/transcom.E95.B.1839

NEAR: A neighbor-cooperation-based off-duty eligibility acquisition rule for wireless sensor nodes

Juhua Pu^*
, Jia Chen
, Xiaolan Tang
, Zhicheng Han

^*Corresponding author for this work

School of Cyber Science and Technology

Beihang University
Shenzhen Key Lab of Data Vitalization (Smart City)

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

Abstract

This paper presents an efficient algorithm, NEAR, that allows sensor nodes to acquire their off-duty eligibility. Any node only needs to calculate the coverage degrees of the intersections on its sensing boundary, and cooperates with its neighbors to know if it is redundant or not. The computing complexity of NEAR is only O(nlogn).

Original language	English
Pages (from-to)	1839-1843
Number of pages	5
Journal	IEICE Transactions on Communications
Volume	E95-B
Issue number	5
DOIs	https://doi.org/10.1587/transcom.E95.B.1839
State	Published - May 2012

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Keywords

Coverage control
Energy conservation
Low complexity
WSN

Access to Document

10.1587/transcom.E95.B.1839

Cite this

@article{0eefde720d63485390c967142a9cb234,

title = "NEAR: A neighbor-cooperation-based off-duty eligibility acquisition rule for wireless sensor nodes",

abstract = "This paper presents an efficient algorithm, NEAR, that allows sensor nodes to acquire their off-duty eligibility. Any node only needs to calculate the coverage degrees of the intersections on its sensing boundary, and cooperates with its neighbors to know if it is redundant or not. The computing complexity of NEAR is only O(nlogn).",

keywords = "Coverage control, Energy conservation, Low complexity, WSN",

author = "Juhua Pu and Jia Chen and Xiaolan Tang and Zhicheng Han",

year = "2012",

month = may,

doi = "10.1587/transcom.E95.B.1839",

language = "英语",

volume = "E95-B",

pages = "1839--1843",

journal = "IEICE Transactions on Communications",

issn = "0916-8516",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "5",

}

TY - JOUR

T1 - NEAR

T2 - A neighbor-cooperation-based off-duty eligibility acquisition rule for wireless sensor nodes

AU - Pu, Juhua

AU - Chen, Jia

AU - Tang, Xiaolan

AU - Han, Zhicheng

PY - 2012/5

Y1 - 2012/5

N2 - This paper presents an efficient algorithm, NEAR, that allows sensor nodes to acquire their off-duty eligibility. Any node only needs to calculate the coverage degrees of the intersections on its sensing boundary, and cooperates with its neighbors to know if it is redundant or not. The computing complexity of NEAR is only O(nlogn).

AB - This paper presents an efficient algorithm, NEAR, that allows sensor nodes to acquire their off-duty eligibility. Any node only needs to calculate the coverage degrees of the intersections on its sensing boundary, and cooperates with its neighbors to know if it is redundant or not. The computing complexity of NEAR is only O(nlogn).

KW - Coverage control

KW - Energy conservation

KW - Low complexity

KW - WSN

UR - https://www.scopus.com/pages/publications/84860610990

U2 - 10.1587/transcom.E95.B.1839

DO - 10.1587/transcom.E95.B.1839

M3 - 文章

AN - SCOPUS:84860610990

SN - 0916-8516

VL - E95-B

SP - 1839

EP - 1843

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

IS - 5

ER -

NEAR: A neighbor-cooperation-based off-duty eligibility acquisition rule for wireless sensor nodes

Abstract

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this