#### DMCA

## Article Retrieval of the Extreme Values under Deadline Constraints in Wireless Sensor Networks (2011)

### Citations

2311 | Directed diffusion: a scalable and robust communication paradigm for sensor networks, MobiCOM
- Intanagonwiwat, Govindan, et al.
- 2000
(Show Context)
Citation Context ... [1 − yi, 1], ∀i ∈ I. Thus the size of ECW for Sensor i is yi. Proposition 1. The probability that Sensor i wins the frame is given by [( n−i i+j ∑ j=0 ∏ k=1 z −1 k ) { }] i+j zi+j − zi+j i+j+1 i + j =-=(3)-=- where zj := yj/yi for j = 1, . . . , n and zn+1 := 0. Proof. We will assume i > 1: it is easy to verify that Equation (3) holds for the case where i = 1 using the similar arguments as below. Let us d... |

1868 | Performance analysis of the IEEE 802.11 distributed coordination function
- Bianchi
- 2000
(Show Context)
Citation Context ... the minislot δ cannot be indefinitely small. δ should account for propagation delay and should be sufficiently long such that the transmission from a station can be detected by its neighboring nodes =-=[28]-=-. For example in 802.11a, δ is given by 9 µs. We propose a fully distributed priority based scheme when δ is strictly positive and m is finite. The idea in the above case of continuous contention wind... |

769 | Fine-grained network time synchronization using reference broadcasts
- Elson, Girod, et al.
- 2002
(Show Context)
Citation Context ...ion of td, e.g., see Figure 1. Nodes are allowed to contend for channel access and transmit data only at the beginning of each frame. We will assume that fine-grained synchronization schemes, such as =-=[27]-=-, are available. Thus the nodes are assumed to be synchronized to the timeslots with negligible errors. Figure 1. A time diagram for frame structures. .*),%' tf tf !"#$%#&"#' ()$)'$*)#+,-++-"#' !"#$%#... |

400 | The impact of data aggregation in wireless sensor networks
- Krishnamachari, Estrin, et al.
(Show Context)
Citation Context ...+ t yk = yi − t yk Since the above events are mutually independent, the probability of Sensor i’s transmission is successful during [0, yi − yi+1] is given by ∫ yi−yi+1 ∏i−1 0 k=1 ( ) yi − t dt yk yi =-=(4)-=- By making the change of integration variables s = t/yi, Equation (4) is equal to ( i−1 ∏ yi yk k=1 ) ∫ 1−zi+1 (1 − s) i−1 ds = 0 ( i−1 ∏ k=1 z −1 k ) {1 } ( i i∏ − zi+1 = i k=1 z −1 k ) {z i i − zi }... |

257 | Building efficient wireless sensor networks with low-level naming.
- Heidemann, Silva, et al.
- 2001
(Show Context)
Citation Context ...st consider k-maximum data retrieval problem as follows. Let us denote k-th largest data from the scores y1, . . . , yn by y[k]. The k-maximum data retrieval problem is for the sink to collect y[1], y=-=[2]-=-, . . . , y[k]. Similar overhearing and selective forwarding can be applied with a small change. The selective forwarding can be modified such that a node forwards only the data larger than the k-th l... |

180 | A distributed CSMA algorithm for throughput and utility maximization in wireless networks
- Jiang, Walrand
- 2010
(Show Context)
Citation Context ...pacity region is defined to be the union of the set of all input rates which can be supported by the network, i.e., input loads under which the system can be stabilized. Among these studies, [17] and =-=[16]-=- use timers with exponentially distributed timeouts as a means to assign priorities in channel access. If a node has data to transmit, it first sets a timer whose timeout is exponentially distributed ... |

155 | Computing and Communicating Functions Over Sensor Networks.
- Giridhar, Kumar
- 2005
(Show Context)
Citation Context ...ission execution. Commonly an objective of WSNs is to provide a summary of the sensed data generated in the network. The relevant summary is defined as certain function applied to the raw sensor data =-=[1]-=-. Given the sensor readings x1, x2, . . . , xn, the goal is to compute f(x1, x2, . . . , xn). Examples of f(·) are mean, max, min, etc. When mean function is used, f(x1, . . . , xn) = ∑n i=1 xi/n. In ... |

138 | Gamal, “Energy-efficient transmission over a wireless link via lazy packet scheduling
- Prabhakar, Uysal-Biyikoglu, et al.
- 2002
(Show Context)
Citation Context ...hors study an aggregation strategy for minimizing energy dissipation exploiting the fact that longer transmission time of a packet can save energy expenditure, i.e., a link-level trade-off studied in =-=[7]-=-. A series of works [8–10] have focused on scheduling of data aggregation in order to minimize latency. In [10] a scheduling algorithm of the links in aggregation tree using maximal independent set to... |

115 | Energylatency tradeoffs for data gathering in wireless sensor networks
- Yu, Krishnamachari, et al.
- 2004
(Show Context)
Citation Context ...e extreme data.Sensors 2011, 11 5232 A number of data gathering problems aiming at achieving low latency have been studied. The trade-off between energy and data gathering latency is investigated in =-=[6]-=-. The authors study an aggregation strategy for minimizing energy dissipation exploiting the fact that longer transmission time of a packet can save energy expenditure, i.e., a link-level trade-off st... |

109 |
In-network aggregation techniques for wireless sensor networks: A survey
- Fasolo, Rossi, et al.
(Show Context)
Citation Context ...al f(·) computed at the sink. A collective term for the intermediate aggregation and combining techniques is in-network aggregation [2–4]. A survey on in-network aggregation techniques is provided in =-=[5]-=-.Sensors 2011, 11 5231 We propose a scheme for latency reduction based on priority-based medium access and data combining. The scheme consists of the following three schemes. The first scheme focuses... |

102 | Distributed Link Scheduling with Constant Overhead,” - Sanghavi, Bui, et al. - 2007 |

86 | Tina: a scheme for temporal coherency-aware in-network aggregation
- Sharaf, Beaver, et al.
(Show Context)
Citation Context ...reduction of traffic in sensor networks. The works [22,23] have proposed the routing protocols which carry out an efficient transportation of the most excessive values of sensed data. The TiNA scheme =-=[24]-=- is proposed to reduce power consumption by suppressing the generation of new data if its value does not differ from the previously transmitted values by more than certain threshold. A scheme to resol... |

81 | Low-Complexity Distributed Scheduling Algorithms for Wireless Networks,”
- Gupta, Lin, et al.
- 2007
(Show Context)
Citation Context ...orks. We consider a time-slotted system. The overall time is broken into frames where each frame has a constant duration denoted by tf. A frame is divided into two phases similar to the model used in =-=[18,20]-=-. The first phase, called contention phase, is used for contention-based channel access and contention resolution. A contention phase consists of m time slots which are called minislots of duration δ.... |

79 | Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks,” - Lin, Rasool - 2006 |

74 | Performance of Random Access Scheduling Schemes in
- Joo, Shroff
- 2009
(Show Context)
Citation Context ...orks. We consider a time-slotted system. The overall time is broken into frames where each frame has a constant duration denoted by tf. A frame is divided into two phases similar to the model used in =-=[18,20]-=-. The first phase, called contention phase, is used for contention-based channel access and contention resolution. A contention phase consists of m time slots which are called minislots of duration δ.... |

64 | Q-csma: Queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks,” in - Ni, Tan, et al. - 2010 |

49 | On tree-based convergecasting in wireless sensor networks,
- Annamalai, Gupta
- 2003
(Show Context)
Citation Context ...,k̸=i ( ) yi − t dt yk yi (7) By making the similar change of variables s = t/yi, (7) is given by ( i+1 ∏ yi yk k=1 ) ∫ 1−zi+2 (1 − s) i ds = 1−zi+1 ( i+1 ∏ k=1 z −1 k ) {z i+1 i+1 − zi+1 i+2 i + 1 } =-=(8)-=- By continuing the similar computations for the probability of successful transmission during intervals [yi − yi+2, yi − yi+3], [yi − yi+3, yi − yi+4], . . ., we obtain the expression (3). Let us cons... |

43 | Distributed random access algorithm: Scheduling and congestion control,” - Jiang, Shah, et al. - 2010 |

40 | Nearly constant approximation for data aggregation scheduling in wireless sensor networks, in
- Huang, Wan, et al.
- 2007
(Show Context)
Citation Context ...ion time of a packet can save energy expenditure, i.e., a link-level trade-off studied in [7]. A series of works [8–10] have focused on scheduling of data aggregation in order to minimize latency. In =-=[10]-=- a scheduling algorithm of the links in aggregation tree using maximal independent set to achieve a latency bound which scales additively in network radius and maximum degree. The efficiency of in-net... |

38 |
Minimum data aggregation time problem in wireless sensor networks.
- Chen, Hu, et al.
- 2005
(Show Context)
Citation Context ...ecial case such that y1 ≥ y2 = y3 = . . . = yn. Let us denote the probability of Sensor 1 winning the frame by p1. From Proposition 1 it is given by p1 = 1 − z2 + 1 z n−1 z 2 n 2 n ( ) n − 1 = 1 − z2 =-=(9)-=- nSensors 2011, 11 5239 where z2 = y2/y1. The probability of a Sensor other than Sensor 1 becoming the winner of frame is given by (1 − p1)/(n − 1) = z2/n = y2/(ny1) due to the symmetry among n − 1 s... |

24 |
Energy efficient and perceived qos aware video routing over wireless multimedia sensor networks, Ad Hoc Networks 9(4): 591 – 607. Multimedia Ad Hoc and Sensor Networks.
- Kandris, Tsagkaropoulos, et al.
- 2011
(Show Context)
Citation Context ... details and the relevance to our work will be discussed later in Section 4.4. In the following we mention additional related works which aim at the reduction of traffic in sensor networks. The works =-=[22,23]-=- have proposed the routing protocols which carry out an efficient transportation of the most excessive values of sensed data. The TiNA scheme [24] is proposed to reduce power consumption by suppressin... |

18 | Approaching throughput-optimality in distributed csma scheduling algorithms with collisions,”
- Jiang, Walrand
- 2011
(Show Context)
Citation Context ...s. The capacity region is defined to be the union of the set of all input rates which can be supported by the network, i.e., input loads under which the system can be stabilized. Among these studies, =-=[17]-=- and [16] use timers with exponentially distributed timeouts as a means to assign priorities in channel access. If a node has data to transmit, it first sets a timer whose timeout is exponentially dis... |

17 | Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks,”
- Ye, Abouzeid, et al.
- 2007
(Show Context)
Citation Context ...ime incurs extra latency in the data gathering process. Thus the question is how long nodes should wait before transmitting the aggregated information when there is a deadline constraint. The work of =-=[11]-=- formulates such decision making as semi-Markov Decision Process. They propose an approximation algorithm for finding the optimal waiting time for aggregation in order to maximize the ‘reward’. The re... |

16 | Power conservation through energy efficient routing in wireless sensor networks,"
- Kandris, Tsioumas, et al.
- 2009
(Show Context)
Citation Context ... details and the relevance to our work will be discussed later in Section 4.4. In the following we mention additional related works which aim at the reduction of traffic in sensor networks. The works =-=[22,23]-=- have proposed the routing protocols which carry out an efficient transportation of the most excessive values of sensed data. The TiNA scheme [24] is proposed to reduce power consumption by suppressin... |

9 | Maximizing Aggregated Revenue in Sensor Networks under Deadline Constraints.
- Hariharan, Shroff
- 2009
(Show Context)
Citation Context ...orithm for finding the optimal waiting time for aggregation in order to maximize the ‘reward’. The reward is defined as a function of the number of samples collected at the sink before deadline. Also =-=[12]-=- proposed a framework based on dynamic programming for maximizing the number of packets reaching the sink under energy and deadline constraints. The work [13] studies a similar problem of maximizing t... |

5 |
Concert: aggregation-based congestion control for sensor networks,”
- Galluccio, Campbell, et al.
- 2005
(Show Context)
Citation Context ...ts value does not differ from the previously transmitted values by more than certain threshold. A scheme to resolve the traffic congestion in sensor networks so-called funneling effect is proposed in =-=[25]-=- which uses spatially adaptive in-networkSensors 2011, 11 5233 aggregation. The trade-off between the power savings and preserving the integrity of aggregated information has been investigated in [26... |

4 | Efficient data aggregation in wireless sensor networks: an entropy-driven analysis,”
- Galluccio, Palazzo, et al.
- 2008
(Show Context)
Citation Context ...25] which uses spatially adaptive in-networkSensors 2011, 11 5233 aggregation. The trade-off between the power savings and preserving the integrity of aggregated information has been investigated in =-=[26]-=-. 3. Model The topology of the network is modeled by a graph G = (V, E) where V is set of node indices and E is the set of wireless links. We consider a node exclusive interference model for the wirel... |

2 | Real-time Data Aggregation in Contention-based Wireless Sensor Networks
- Zhang, Jia, et al.
- 2010
(Show Context)
Citation Context ...llected at the sink before deadline. Also [12] proposed a framework based on dynamic programming for maximizing the number of packets reaching the sink under energy and deadline constraints. The work =-=[13]-=- studies a similar problem of maximizing the amount of collected information using dynamic programming. They consider a contention-based MAC using CSMA/CA, and find the optimal waiting time for aggreg... |