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ę "scheme" wg kryterium: Temat


Wyświetlanie 1-8 z 8
Tytuł:
ID-based, Proxy, Threshold Signature Scheme
Autorzy:
Pomykała, Jacek
Kułakowski, Henryk
Sapiecha, Piotr
Grela, Błażej
Powiązania:
https://bibliotekanauki.pl/articles/1844644.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
ID-based
proxy
threshold
signature
scheme
Opis:
We propose the proxy threshold signature scheme with the application of elegant construction of verifiable delegating key in the ID-based infrastructure, and also with the bilinear pairings. The protocol satisfies the classical security requirements used in the proxy delegation of signing rights. The description of the system architecture and the possible application of the protocol in edge computing designs is enclosed.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 2; 201-205
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Efficient Data Transmission in VANET Using Clustering Method
Autorzy:
Suganthi Evangeline, C.
Appu, S.
Powiązania:
https://bibliotekanauki.pl/articles/227295.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
VANET
RSU
2-layer stable clustering scheme
Opis:
A special type of Mobile Ad-hoc Networks (MANETs) which has frequent changes of topology and higher mobility is known as Vehicular Ad-hoc Networks (VANETs). In order to divide the network into groups of mobile vehicles and improve routing, data gathering, clustering is applied in VANETs. A stable clustering scheme based on adaptive multiple metric combining both the features of static and dynamic clustering methods is proposed in this work. Based on a new multiple metric method, a cluster head is selected among the cluster members which is taken from the mobility metrics such as position and time to leave the road segment, relative speed and Quality of Service metrics which includes neighborhood degree, link quality of the RSU and bandwidth. A higher QoS and cluster stability are achieved through the adaptive multiple metric. The results are simulated using NS2 and shows that this technique provides more stable cluster structured with the other methods.
Źródło:
International Journal of Electronics and Telecommunications; 2017, 63, 3; 309-313
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improving Security of Existentially Unforgeable Signature Schemes
Autorzy:
Jurkiewicz, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/225969.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
digital signature scheme (DSS)
strongly unforgeable DSS
pairing
Opis:
In this paper we present a family of transforms that map existentially unforgeable signature schemes to signature schemes being strongly unforgeable. In spite of rising security, the transforms let us make a signature on a union of messages at once. The number of elements in this union depends on the signing algorithm of a scheme being transformed. In addition to that we define an existentially unforgeable signature scheme based on pairings, which satisfies all assumptions of the first part and is able to be subjected to transformation.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 3; 473-480
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Subcarrier Filtering For Spectrally Efficient Multicarrier Modulation Schemes and Its Impact on PAPR: A Unified Approach
Autorzy:
Shanbhag, Kiran V.
Sathish, Dayakshini
Powiązania:
https://bibliotekanauki.pl/articles/27311957.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
OFDMA
PAPR
subcarrier filtering
MCM scheme
spectral efficiency
prototype filter
Opis:
Multicarrier modulation (MCM) based schemes have been a major contributing factor in revolutionizing cellular networks due to their ability to overcome fading. One of the popular scheme orthogonal frequency division multiple access (OFDMA), having been part of 4G, is also adapted as part of 5G enhanced mobile broadband (eMBB). Though it has several advantages, spectral efficiency (SE) and peak to average power ratio (PAPR) have been two major concerns which have attracted lot of attention resulting in proposals of several other MCM schemes. But most of these studies have treated the two issues independently. This paper in particular studies the subcarrier filtering approach to improve the spectral efficiency of MCM scheme and its impact on the overall PAPR of such schemes. The analysis shows that the PAPR improvement is also achieved by such filters meant for spectral confinement and the simulation results validate the same provoking.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 4; 785--791
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Overcoming Localization Errors due to Node Power Drooping in a Wireless Sensor Network
Autorzy:
Khan, S. A.
Daachi, B.
Djouani, K.
Powiązania:
https://bibliotekanauki.pl/articles/226280.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
wireless sensor networks
RSSI
localization
range-free scheme
energy considerations
neural networks
Opis:
Received Signal Strength Indication (RSSI) plays a vital role in the range-free localization of sensor nodes in a wireless sensor network and a good amount of research has been made in this regard. One important factor is the battery voltage of the nodes (i.e., the MICAz sensors) which is not taken into account in the existing literature. As battery voltage level performs an indispensable role for the position estimation of sensor nodes through anchor nodes therefore, in this paper, we take into a account this crucial factor and propose an algorithm that overcomes the problem of decaying battery. We show the results, in terms of more precise localization of sensor nodes through simulation. This work is an extension to [1] and now we also use neural network to overcome the localization errors generated due to gradual battery voltage drooping.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 3; 341-346
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Evaluation of Handover Exchange Schemes Between Two Cognitive Radio Base Stations with and without Buffers
Autorzy:
Esenogho, E.
Mambou, E. N.
Ferreira, H. C.
Powiązania:
https://bibliotekanauki.pl/articles/226444.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
cognitive radio networks
channel handover exchange scheme
blocking probability
force termination
handover failure
Opis:
This article investigates and evaluates a handover exchange scheme between two secondary users (SUs) moving in different directions across the handover region of neighboring cell in a cognitive radio network. More specifically, this investigation compares the performance of SUs in a cellular cognitive radio network with and without channel exchange scheme. The investigation shows reduced handover failure, blocking, forced and access probabilities respectively, for handover exchange scheme with buffer as compared to exchange scheme without buffer. It also shows transaction within two cognitive nodes within a network region. The system setup is evaluated through system simulation.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 4; 513-518
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Investigation of the Stability and Convergence of Difference Schemes for the Three-dimensional Equations of the Atmospheric Boundary Layer
Autorzy:
Temirbekov, A. N.
Urmashev, B. A.
Gromaszek, K.
Powiązania:
https://bibliotekanauki.pl/articles/226826.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
atmospheric boundary layer equations
difference scheme
approximation error
stability
convergence algorithms
numerical solution
Opis:
In this article we construct a finite-difference scheme for the three-dimensional equations of the atmospheric boundary layer. The solvability of the mathematical model is proved and quality properties of the solutions are studied. A priori estimates are derived for the solution of the differential equations. The mathematical questions of the difference schemes for the equations of the atmospheric boundary layer are studied. Nonlinear terms are approximated such that the integral term of the identity vanishes when it is scalar multiplied. This property of the difference scheme is formulated as a lemma. Main a priori estimates for the solution of the difference problem are derived. Approximation properties are investigated and the theorem of convergence of the difference solution to the solution of the differential problem is proved.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 3; 391-396
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model
Autorzy:
Jurkiewicz, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/2055214.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
forward secure digital signature scheme
bilinear pairing of Type 3
random oracle model
bilinear Diffie-Hellman inversion problem
Opis:
In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a completely abstract fashion it ought to be viewed as being actually defined over E(Fqn )[p] × E(Fqnk )[p] → Fqnk [p]. The crucial element of the scheme is the key updater algorithm. With the adoption of pairings and binary trees where a number of leaves is the same as a number of time periods, we are assured that an updated secret key can not be used to recover any of its predecessors. This, in consequence, means that the scheme is forward-secure. To formally justify this assertion, we conduct analysis in fu-cma security model by reducing the security of the scheme to the computational hardness of solving the Weak ℓ-th Bilinear Diffie-Hellman Inversion problem type. We define this problem and explain why it can be treated as a source of security for cryptographic schemes. As for the reduction itself, in general case, it could be possible to make only in the random oracle model.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 4; 717--726
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-8 z 8

    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