2010
DOI: 10.1007/978-3-642-13651-1_21
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. This paper studies the data gathering problem in wireless networks, where data generated at the nodes has to be collected at a single sink. We investigate the relationship between routing optimality and fair resource management. In particular, we prove that for energy balanced data propagation, Pareto optimal routing and flow maximization are equivalent, and also prove that flow maximization is equivalent to maximizing the network lifetime. We algebraically characterize the network structures in whic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
14
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(14 citation statements)
references
References 19 publications
0
14
0
Order By: Relevance
“…The main objective (e.g. [2,3,9,10]) is to plan a proper order, usually with a total path length as short as possible, for the robot to visit waypoints of all clusters and gather all data from every sensor.…”
Section: B Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…The main objective (e.g. [2,3,9,10]) is to plan a proper order, usually with a total path length as short as possible, for the robot to visit waypoints of all clusters and gather all data from every sensor.…”
Section: B Problemmentioning
confidence: 99%
“…In unmanned planet exploration, sensors play an important role; a number of sensors are often distributed over a geographic area with the capacity to communicate with each other across limited distances. As a result, numerous studies focus on gathering data by sensor networks [1][2][3][4]. There are multiple ways to collect the data in a wireless sensor network.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Without a wake-up scheduling, choosing a forwarding node in this case turns out to be probabilistic and non-optimal. In [23], different network architectures were studied that support max-flow, and two distributed probabilistic on-line routing algorithms were proposed for energy balancing.…”
Section: Related Workmentioning
confidence: 99%
“…Unlike the optimisation approaches in [30 -34], it looks for a joint optimality criteria from the protocol operation viewpoint by combining the factors of greedy geographic forwarding, transceiver energy consumption, nodal residual energy and link layer retransmission, in data forwarding decision at each hop, which is also different from the protocol-level solutions in [12,13,18,20,21,23]. …”
Section: Related Workmentioning
confidence: 99%