Maximum Lifetime Routing in Wireless Sensor Networks

Chang, Jae-Hwan; Tassiulas, Leandros

doi:10.1109/tnet.2004.833122

Cited by 1,173 publications

(801 citation statements)

References 28 publications

Supporting

Mentioning

793

Contrasting

Unclassified

Order By: Relevance

“…Residue Energy Based algorithm (REB) [10] considers remaining energy as well as connectivity quality of nodes. REB is based upon hierarchical clustering method in heterogeneous environment.…”

Section: Residual Energy Based Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Analysis on Performance Metrics for optimized Wireless Sensor Network

Priya¹

2016

IJAERS

View full text Add to dashboard Cite

show abstract

Section: Residual Energy Based Algorithmmentioning

confidence: 99%

“…Chang et al [23] presents a significant solution to the problem of routing in sensor networks which depends upon a network flow. The main aim of this approach is to maximize the network lifetime by defining connectivity cost as a function of node's residual energy and the needed transmission energy using that link.…”

Section: Maximum Lifetime Energy Routingmentioning

confidence: 99%

An Efficient Analysis on Performance Metrics for optimized Wireless Sensor Network

Priya¹

2016

IJAERS

View full text Add to dashboard Cite

show abstract

“…Chang and Tassiulas [9] give an LP-formulation similar to ours for the single commodity case, except they formulate the problem over the set of all paths from s to t and allow fractional packets. They also consider the multicommodity case.…”

Section: Other Variantsmentioning

confidence: 99%

“…[8,9,12,[16][17][18]20]) cast the problem into a Linear Programming (LP) form and assume fractional flows, i.e., splitting of packets into fractional portions is allowed. The corresponding LPformulations then have polynomial time algorithms.…”

Section: Introductionmentioning

confidence: 99%

Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint

Bodlaender

Tan

Dijk

et al. 2008

Algorithm Theory – SWAT 2008

View full text Add to dashboard Cite

We study the integer maximum flow problem on wireless sensor networks with energy constraint. In this problem, sensor nodes gather data and then relay them to a base station, before they run out of battery power. Packets are considered as integral units and not splittable. The problem is to find the maximum data flow in the sensor network subject to the energy constraint of the sensors. We show that this integral version of the problem is strongly NP-complete and in fact APX-hard. It follows that the problem is unlikely to have a polynomial time approximation scheme. Even when restricted to graphs with concrete geometrically defined connectivity and transmission costs, the problem is still strongly NP-complete. We provide some interesting polynomial time algorithms that give good approximations for the general case nonetheless. For networks with bounded treewidth greater than two, we show that the problem is weakly NP-complete and provide pseudo-polynomial time algorithms. For a special case of graphs with treewidth two, we give a polynomial time algorithm.

show abstract

“…In order to minimize energy consumption in wireless sensor networks, previous studies mainly focused on energy-effi cient MAC protocols [6,7] and energy-effi cient routing protocols [8,9]. Some other approaches try to address the energy conservation problem by suggesting a distributed clustering method for wireless sensor networks [10,11].…”

Section: Introductionmentioning

confidence: 99%

Node density control for maximizing wireless sensor network lifetime

Esseghir

Bouabdallah

2008

Int J Network Mgmt

View full text Add to dashboard Cite

SUMMARYOne of the major concerns in wireless sensor networks is improving the network lifetime. In this paper, we investigate the node density impact on network lifetime. We show that the average amount of energy required to report an event to the sink decreases when wireless sensor node density increases. Moreover, we show that network lifetime increases faster than network density. Based on this result, we derive the minimal number of wireless sensor nodes required to supervise a given area during a given period. Finally, we show that these nodes must be deployed at the same time and not over different deployment phases.

show abstract

Maximum Lifetime Routing in Wireless Sensor Networks

Cited by 1,173 publications

References 28 publications

An Efficient Analysis on Performance Metrics for optimized Wireless Sensor Network

An Efficient Analysis on Performance Metrics for optimized Wireless Sensor Network

Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint

Node density control for maximizing wireless sensor network lifetime

Contact Info

Product

Resources

About