2014
DOI: 10.1109/tii.2013.2250910
|View full text |Cite
|
Sign up to set email alerts
|

An Energy-Balanced Routing Method Based on Forward-Aware Factor for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
236
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 446 publications
(236 citation statements)
references
References 20 publications
0
236
0
Order By: Relevance
“…In other words, FTA define forward energy density which constitutes forward-aware factor with link weight, and propose a new communication protocol based on forward-aware factor, thus balancing the energy consumption and prolonging the network function lifetime [11]. Thus, in forward aware factor [12],we measure the forward transmission area, by defining forward energy density, which constitutes forward-aware factor with link weight that balancing the energy consumption and increases the network lifetime. It has some key aspects such as a reduced number of messages for setting up a routing tree, maximized number of overlapping routes, high aggregation rate, and reliable data aggregation and transmission.…”
Section: Forward Aware Factor-energy Balanced Routing Methods (Fafmentioning
confidence: 99%
See 1 more Smart Citation
“…In other words, FTA define forward energy density which constitutes forward-aware factor with link weight, and propose a new communication protocol based on forward-aware factor, thus balancing the energy consumption and prolonging the network function lifetime [11]. Thus, in forward aware factor [12],we measure the forward transmission area, by defining forward energy density, which constitutes forward-aware factor with link weight that balancing the energy consumption and increases the network lifetime. It has some key aspects such as a reduced number of messages for setting up a routing tree, maximized number of overlapping routes, high aggregation rate, and reliable data aggregation and transmission.…”
Section: Forward Aware Factor-energy Balanced Routing Methods (Fafmentioning
confidence: 99%
“…The distance between the signal source and receiver can be computed based on the received signal strength. Regional central nodes are not selected at the beginning, on the contrary, they spring up during the topology evolution [13].…”
Section: Forward Aware Factor-energy Balanced Routing Methods (Fafmentioning
confidence: 99%
“…Hence, Eason's [6] paper first defines the coveragepreserving data gathering problem, which mainly selects a certain number of nodes to construct an energy-efficient tree while preserving the original coverage. This problem can be formalized into integer linear programming, and Zhang [7] presents a heuristic algorithm, CPDG, to solve this problem.…”
Section: Overview IImentioning
confidence: 99%
“…This problem can be formalized into integer linear programming, and Zhang [7] presents a heuristic algorithm, CPDG, to solve this problem. Simulation results show that CPDG can greatly improve the performance of the network.…”
Section: Overview IImentioning
confidence: 99%
“…Researchers find that different topics have different influence, even if influence of the same topic is also different in different groups [5,6,7]. Some scholars rank the events by the frequencies of event reported in time units and the number of consecutive effective time units [8], and a ranking algorithm is proposed to find the most authoritative news sources and identify the most interesting events in the different categories to which news article belongs [9].…”
Section: Introductionmentioning
confidence: 99%