An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks

Liang, Junbin; Wang, Jianxin; Cao, Jiannong; Chen, Jianer; Lu, Mingming

doi:10.1109/infcom.2010.5462181

Cited by 56 publications

(50 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(6) is generalized Eq.in [2]. The problem of construction maximum lifetime tree is formatted as following.…”

Section: E I L L E mentioning

confidence: 99%

“…It is much easier to optimize the reciprocal of L(T,i) than L(T,i) like in [2]. Because control parameters are on denominator in L(T,i), but they are on numerator in 1/ L(T,i).…”

Section: E I L L E mentioning

confidence: 99%

“…Packet loss is not considered in construction maximum lifetime tree in most of previous works, but in practice it reaches average 30% [2]. From this, Construction maximum lifetime tree considering packet loss is referred in this paper.…”

Section: Construction Maximum Lifetime Tree Considering Packet Lossmentioning

confidence: 99%

“…The network lifetime maximization techniques have attracted a lot of research attention owing to their importance in terms of extending the flawless operation of battery-constrained WSNs [6]. Construction maximum lifetime tree can be divided into two categories: with aggregation and without aggregation [2,4,5].…”

Section: Introductionmentioning

confidence: 99%

“…Moreover energy consumed on exchange of control messages is not considered at all. Some experiment results show that energy consumed on exchange of control messages is at most 30~50% of energy consumed on exchange of data message [2].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Construction Maximum Lifetime Tree and Adaptation in Wireless Sensor Networks

Lee¹,

Sin²,

Jang³

2017

IJCT

View full text Add to dashboard Cite

The maximum lifetime problem in wireless sensor network is important to monitor a set of interesting target locations and route the collected information to a central base station. In this paper, first, we consider the method of construction maximum lifetime tree taking into account general type of data aggregation, exchange of control messages and packet transmission loss. Second, we consider the method increasing lifetime of tree and reducing complexity and latency combining optimization of energy consumption in entire network through quasioptimization of local nodes and adapting. Experiment results show that the proposed method is more robust and valid than the previous method.

show abstract

“…(6) is generalized Eq.in [2]. The problem of construction maximum lifetime tree is formatted as following.…”

Section: E I L L E mentioning

confidence: 99%

“…It is much easier to optimize the reciprocal of L(T,i) than L(T,i) like in [2]. Because control parameters are on denominator in L(T,i), but they are on numerator in 1/ L(T,i).…”

Section: E I L L E mentioning

confidence: 99%

Section: Construction Maximum Lifetime Tree Considering Packet Lossmentioning

confidence: 99%