FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2122391889> ?p ?o ?g. }

• W2122391889 abstract "This thesis is concerned with problems in decentralized communication in large networks. Namely, we address the problems of joint rate allocation and transmission of data sources measured at nodes, and of controlling the multiple access of sources to a shared medium. In our study, we consider in particular the important case of a sensor network measuring correlated data. In the first part of this thesis, we consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two coding strategies are analyzed: a Slepian-Wolf model where optimal coding is complex and transmission optimization is simple, and a joint entropy coding model with explicit communication where coding is simple and transmission optimization is difficult. This problem requires a joint optimization of the rate allocation at the nodes and of the transmission structure. For the Slepian-Wolf setting, we derive a closed form solution and an efficient distributed approximation algorithm with a good performance. We generalize our results to the case of multiple sinks. For the explicit communication case, we prove that building an optimal data gathering tree is NP-complete and we propose various distributed approximation algorithms. We compare asymptotically, for dense networks, the total costs associated with Slepian-Wolf coding and explicit communication, by finding their corresponding scaling laws and analyzing the ratio of their respective costs. We argue that, for large networks and under certain conditions on the correlation structure, intelligent, but more complex Slepian-Wolf coding provides unbounded gains over the widely used straightforward approach of opportunistic aggregation and compression by explicit communication. In the second part of this thesis, we consider a queuing problem in which the service rate of a queue is a function of a partially observed Markov chain, and in which the arrivals are controlled based on those partial observations so as to keep the system in a desirable mildly unstable regime. The optimal controller for this problem satisfies a separation property: we first compute a probability measure on the state space of the chain, namely the information state, then use this measure as the new state based on which to make control decisions. We give a formal description of the system considered and of its dynamics, we formalize and solve an optimal control problem, and we show numerical simulations to illustrate with concrete examples properties of the optimal control law. We show how the ergodic behavior of our queuing model is characterized by an invariant measure over all possible information states, and we construct that measure. Our results may be applied for designing efficient and stable algorithms for medium access control in multiple accessed systems, in particular for sensor networks." @default.
• W2122391889 created "2016-06-24" @default.
• W2122391889 creator A5065172378 @default.
• W2122391889 date "2004-01-01" @default.
• W2122391889 modified "2023-10-15" @default.
• W2122391889 title "EFFICIENT DECENTRALIZED COMMUNICATIONS IN SENSOR NETWORKS" @default.
• W2122391889 cites W1479702306 @default.
• W2122391889 cites W1494674635 @default.
• W2122391889 cites W1512056429 @default.
• W2122391889 cites W1513905718 @default.
• W2122391889 cites W1528182918 @default.
• W2122391889 cites W1535136082 @default.
• W2122391889 cites W1542464532 @default.
• W2122391889 cites W1543628124 @default.
• W2122391889 cites W1559582792 @default.
• W2122391889 cites W1572736436 @default.
• W2122391889 cites W1581215653 @default.
• W2122391889 cites W168449061 @default.
• W2122391889 cites W1717493837 @default.
• W2122391889 cites W1749603848 @default.
• W2122391889 cites W1788696583 @default.
• W2122391889 cites W1848594422 @default.
• W2122391889 cites W1861683848 @default.
• W2122391889 cites W1868552688 @default.
• W2122391889 cites W1967029407 @default.
• W2122391889 cites W1971103086 @default.
• W2122391889 cites W197289647 @default.
• W2122391889 cites W1987787130 @default.
• W2122391889 cites W1990327548 @default.
• W2122391889 cites W1995713768 @default.
• W2122391889 cites W2002076319 @default.
• W2122391889 cites W2005119376 @default.
• W2122391889 cites W2005228957 @default.
• W2122391889 cites W2009797918 @default.
• W2122391889 cites W2015013423 @default.
• W2122391889 cites W2027682573 @default.
• W2122391889 cites W2037710455 @default.
• W2122391889 cites W2038781258 @default.
• W2122391889 cites W2045197925 @default.
• W2122391889 cites W2046948162 @default.
• W2122391889 cites W2047422346 @default.
• W2122391889 cites W2060069910 @default.
• W2122391889 cites W2065347079 @default.
• W2122391889 cites W2070664846 @default.
• W2122391889 cites W2077243267 @default.
• W2122391889 cites W2078595922 @default.
• W2122391889 cites W2089260676 @default.
• W2122391889 cites W2093218370 @default.
• W2122391889 cites W2096372789 @default.
• W2122391889 cites W2096707510 @default.
• W2122391889 cites W2097463269 @default.
• W2122391889 cites W2099111195 @default.
• W2122391889 cites W2099213070 @default.
• W2122391889 cites W2099831016 @default.
• W2122391889 cites W2100117806 @default.
• W2122391889 cites W2102258543 @default.
• W2122391889 cites W2106335692 @default.
• W2122391889 cites W2111604404 @default.
• W2122391889 cites W2113829484 @default.
• W2122391889 cites W2115763491 @default.
• W2122391889 cites W2117538122 @default.
• W2122391889 cites W2120417050 @default.
• W2122391889 cites W2121200972 @default.
• W2122391889 cites W2121255383 @default.
• W2122391889 cites W2123658379 @default.
• W2122391889 cites W2125805334 @default.
• W2122391889 cites W2129918940 @default.
• W2122391889 cites W2130057404 @default.
• W2122391889 cites W2130403046 @default.
• W2122391889 cites W2133480014 @default.
• W2122391889 cites W2135468625 @default.
• W2122391889 cites W2137775453 @default.
• W2122391889 cites W2138256990 @default.
• W2122391889 cites W2140480675 @default.
• W2122391889 cites W2142346726 @default.
• W2122391889 cites W2142928312 @default.
• W2122391889 cites W2144151691 @default.
• W2122391889 cites W2146416675 @default.
• W2122391889 cites W2148164553 @default.
• W2122391889 cites W2148578757 @default.
• W2122391889 cites W2151688044 @default.
• W2122391889 cites W2156216606 @default.
• W2122391889 cites W2160812719 @default.
• W2122391889 cites W2170469173 @default.
• W2122391889 cites W2261174815 @default.
• W2122391889 cites W2266946488 @default.
• W2122391889 cites W23086234 @default.
• W2122391889 cites W2327315803 @default.
• W2122391889 cites W2535879824 @default.
• W2122391889 cites W2610857016 @default.
• W2122391889 cites W2613173048 @default.
• W2122391889 cites W2730776868 @default.
• W2122391889 cites W2753542457 @default.
• W2122391889 cites W2914728119 @default.
• W2122391889 cites W307896644 @default.
• W2122391889 cites W3103987592 @default.
• W2122391889 cites W311413823 @default.
• W2122391889 cites W317922744 @default.
• W2122391889 cites W3819878 @default.
• W2122391889 cites W1607193361 @default.

• next