Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Bandwidth" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Impact of network architecture and aggregation proces on bandwidth allocation in wireless sensor networks
Autorzy:
Azizi, T.
Beghdad, R.
Powiązania:
https://bibliotekanauki.pl/articles/1839115.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
data aggregation
TDMA
bandwidth
superframe length
time slot
tree-based and spiral-based architecture
Opis:
Assigning bandwidth to sensors in a Wireless Sensor Network (WSN), while using Time Division Multiple Access (TDMA) protocol, remains an important problem. Even if many solutions were proposed in the literature, nevertheless, and since 2013, we are mainly focused on the critical study and the improvement of Masri’s approach published in Telecommunication Systems journal. In this paper, we introduce an extended version of our previous approaches (see Tarek Azizi and Rachid Beghdad, 2013, 2014, 2016) based on three fundamental concepts: network architecture, TDMA protocol, and data aggregation, in order to assign the maximum bandwidth to all sensor nodes. Three solutions will be presented in detail: Spiral-Based Clustered Data Aggregation (SBCDA) architecture, Tree-Based Clustered Data Aggregation (TBCDA), and Tree-Based ClusteredWireless Sensor Network (TBC-WSN). Aggregating data can reduce the number of the packets transmitted to the sink. This is the reason why, in the three approaches here described, each cluster head (CH) collects and aggregates received packets from its child nodes, before transmitting the resulting packet to its parent, until the data reaches the sink node (base station). With a number of simulations, we will demonstrate that our approaches are very competitive with Masri’s proposition, and also with two other recent works.
Źródło:
Control and Cybernetics; 2018, 47, 4; 411-437
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance of variance function estimators for autoregressive time series of order one: asymptotic normality and numerical study
Autorzy:
Borkowski, P.
Mielniczuk, J.
Powiązania:
https://bibliotekanauki.pl/articles/206217.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
autoregressive process
bandwidth
heteroscedasticity
integrated squared error
local linear and local maximum likelihood estimator
difference-based estimator
geometric moment contraction
variance function
volatility
Opis:
We study performance of several conditional variance estimators for an autoregressive time series which include local linear smoothers with various bandwidths, local likelihood and difference-based estimators. In the theoretical part, asymptotic normality of the local linear estimator of variance with no mixing assumptions imposed on the underlying process is proved. Moreover, numerical examples performed reveal that a two-stage local linear smoother with a bandwidth, proposed by Ruppert, Sheather and Wand, used to estimate the regression function and a simple rule of thumb bandwidth for variance estimation performs best for variances without much structure, whereas the bandwidth considered by Fan and Yao works very well for much more variable variances.
Źródło:
Control and Cybernetics; 2012, 41, 2; 415-441
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies