IEICE TRANSACTIONS on Communications
NEAR: A Neighbor-Cooperation-Based Off-Duty Eligibility Acquisition Rule for Wireless Sensor Nodes
Summary :
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).
- Publication
- IEICE TRANSACTIONS on Communications Vol.E95-B No.5 pp.1839-1843
- Publication Date
- 2012/05/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E95.B.1839
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Juhua PU, Jia CHEN, Xiaolan TANG, Zhicheng HAN, "NEAR: A Neighbor-Cooperation-Based Off-Duty Eligibility Acquisition Rule for Wireless Sensor Nodes" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 5, pp. 1839-1843, May 2012, doi: 10.1587/transcom.E95.B.1839.
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).
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.1839/_p
Copy
@ARTICLE{e95-b_5_1839,
author={Juhua PU, Jia CHEN, Xiaolan TANG, Zhicheng HAN, },
journal={IEICE TRANSACTIONS on Communications},
title={NEAR: A Neighbor-Cooperation-Based Off-Duty Eligibility Acquisition Rule for Wireless Sensor Nodes},
year={2012},
volume={E95-B},
number={5},
pages={1839-1843},
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={},
doi={10.1587/transcom.E95.B.1839},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - NEAR: A Neighbor-Cooperation-Based Off-Duty Eligibility Acquisition Rule for Wireless Sensor Nodes
T2 - IEICE TRANSACTIONS on Communications
SP - 1839
EP - 1843
AU - Juhua PU
AU - Jia CHEN
AU - Xiaolan TANG
AU - Zhicheng HAN
PY - 2012
DO - 10.1587/transcom.E95.B.1839
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2012
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).
ER -
English
