Evidence map›Paper›PMID 33126492›Full record

ArticleSensors (Basel, Switzerland)2020

Energy-Efficient Connected-Coverage Scheme in Wireless Sensor Networks.

Yun Xu, Wanguo Jiao, Mengqiu Tian

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Yun XuCollege of Information Science and Technology, Nanjing Forestry University, Longpan Load 159, Nanjing 210037, China.
Wanguo JiaoCollege of Information Science and Technology, Nanjing Forestry University, Longpan Load 159, Nanjing 210037, China.ORCID 0000-0002-2075-3312
Mengqiu TianCollege of Information Science and Technology, Nanjing Forestry University, Longpan Load 159, Nanjing 210037, China.

Funding

National Natural Science Foundation of China 61701241Natural Science Foundation of Jiangsu Province BK20170935
6 · The paper itself

Abstract

In the wireless sensor network, the lifetime of the network can be prolonged by improving the efficiency of limited energy. Existing works achieve better energy utilization, either through node scheduling or routing optimization. In this paper, an efficient solution combining node scheduling with routing protocol optimization is proposed in order to improve the network lifetime. Firstly, to avoid the redundant coverage, a node scheduling scheme that is based on a genetic algorithm is proposed to find the minimum number of sensor nodes to monitor all target points. Subsequently, the algorithm prolongs the lifetime of the network through choosing redundant sleep nodes to replace the dead node. Based on the obtained minimum coverage set, a new routing protocol, named Improved-Distributed Energy-Efficient Clustering (I-DEEC), is proposed. When considering the energy and the distance of the sensor node to the sink, a new policy choosing the cluster head is proposed. To make the energy load more balanced, uneven clusters are constructed. Meanwhile, the data communication way of sensor nodes around the sink is also optimized. The simulation results show that the proposed sensor node scheduling algorithm can reduce the number of redundant sensor nodes, while the I-DEEC routing protocol can improve the energy efficiency of data transmission. The lifetime of the network is greatly extended.

Indexed as

energy efficiencyrouting protocolsensor node schedulingwireless sensor networks

Identifiers

PMID33126492
PMCPMC7662327

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.