Proceedings of the 48h IEEE Conference on Decision and Control (CDC) Held Jointly With 2009 28th Chinese Control Conference 2009
DOI: 10.1109/cdc.2009.5399718
|View full text |Cite
|
Sign up to set email alerts
|

Maximizing aggregated revenue in sensor networks under deadline constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
30
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 25 publications
(30 citation statements)
references
References 9 publications
0
30
0
Order By: Relevance
“…In [2], [4], the authors have considered the problem of minimizing the number of time slots required to send all the packets in a wireless network to a sink under different interference constraints. While these works do not consider in-network computation, in [7], the authors have studied this problem for a one-hop interference model with deadline constraints and in-network computation. Zhang et.…”
Section: Related Workmentioning
confidence: 98%
See 1 more Smart Citation
“…In [2], [4], the authors have considered the problem of minimizing the number of time slots required to send all the packets in a wireless network to a sink under different interference constraints. While these works do not consider in-network computation, in [7], the authors have studied this problem for a one-hop interference model with deadline constraints and in-network computation. Zhang et.…”
Section: Related Workmentioning
confidence: 98%
“…Further, the overall information is also of importance in practice for performing fusion (see Section 3.1). Note that expressing the overall information as a sum of individual sensor information has been assumed in a number of works in the data aggregation literature [7,9,10,13,16,20]. While these metrics of information model a large class of practical information metrics, they may not be suitable if the information gathered from multiple sensors is not a weighted sum of the individual sensor information.…”
Section: System Modelmentioning
confidence: 99%
“…However, long sleep time goes together with long delays, which can grow rapidly depending on the network topology [2], [3]. Besides, in some articles, such as [15], [11], the need for the long preamble implies that the effective channel bandwidth is reduced which brings more delay of the information transfer. In many timesensitive applications, the information will be invalid if the delay is too long.…”
Section: Introductionmentioning
confidence: 99%
“…Although Ye et al [10] formulated the energy-delay tradeoff problem as a semi-Markov decision process by depreciating the data revenue as aggregation holding time increases, no explicit end-to-end delivery delay bound was considered. To bound end-to-end delivery delay, many existing works [11]- [13] require time synchronization between neighboring nodes. Solis et al [11] employed the concept of cascading timeout where a node's aggregation timeout happens right before its parent's to achieve high aggregation degree with small delay overhead.…”
Section: B Related Workmentioning
confidence: 99%
“…Xiang et al [12] explored the joint data aggregation and timeliness of data delivery problem, and proposed a utilitybased scheme called tPack to minimize the whole network communication cost. Assuming a synchronized time-slotted system, [13] formulated the energy-delay tradeoff problem as an integer optimization problem. Different from these works, our scheme does not require synchronization.…”
Section: B Related Workmentioning
confidence: 99%