Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nikos B. Pronios

dblp:48/5142 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
3 papers
Wireless networking · 47% Physical-layer communications · 38% Network performance modeling · 15%
Network and information security
1 paper
Network security · 100%

Topics — the 13 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking
random access
0.021990
On The Stability of Spread-Spectrum Networks, With Decentralized Recursive Retransmission Control, Under Jamming · INFOCOM 1990
Approximate methods for analyzing slotted random-access spread-spectrum networks · INFOCOM 1988
Wireless networking › radio networks
spread spectrum network
0.021990
On The Stability of Spread-Spectrum Networks, With Decentralized Recursive Retransmission Control, Under Jamming · INFOCOM 1990
Approximate methods for analyzing slotted random-access spread-spectrum networks · INFOCOM 1988
Physical-layer communications › spread spectrum
despreading
0.011990
On the Power Spectral Density of Certain Digitally Modulated Signals with Applications to Code Despreading · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications › signal processing for communications › statistical signal processing
power spectral density
0.011990
On the Power Spectral Density of Certain Digitally Modulated Signals with Applications to Code Despreading · IEEE J. Sel. Areas Commun. 1990
Wireless networking › retransmission
retransmission control
0.011990
On The Stability of Spread-Spectrum Networks, With Decentralized Recursive Retransmission Control, Under Jamming · INFOCOM 1990
Physical-layer communications
signal processing for communications
0.011990
On the Power Spectral Density of Certain Digitally Modulated Signals with Applications to Code Despreading · IEEE J. Sel. Areas Commun. 1990
Physical-layer communications
spread spectrum
0.011990
On the Power Spectral Density of Certain Digitally Modulated Signals with Applications to Code Despreading · IEEE J. Sel. Areas Commun. 1990
Network performance modeling › queueing analysis › queueing approximation
diffusion approximation
0.011988
Approximate methods for analyzing slotted random-access spread-spectrum networks · INFOCOM 1988
Network performance modeling
queueing analysis
0.011988
Approximate methods for analyzing slotted random-access spread-spectrum networks · INFOCOM 1988
Wireless networking › random access › ALOHA
slotted ALOHA
0.011988
Approximate methods for analyzing slotted random-access spread-spectrum networks · INFOCOM 1988
Physical-layer communications
modulation
0.011990
On the Power Spectral Density of Certain Digitally Modulated Signals with Applications to Code Despreading · IEEE J. Sel. Areas Commun. 1990
Network security › electronic warfare
jamming attack
0.011990
On The Stability of Spread-Spectrum Networks, With Decentralized Recursive Retransmission Control, Under Jamming · INFOCOM 1990
Network performance modeling
throughput analysis
0.011988
Approximate methods for analyzing slotted random-access spread-spectrum networks · INFOCOM 1988

Methods — techniques the papers use, named apart from their topics

queueing analysis · 0.0poisson approximation · 0.0fourier transform · 0.0analytical derivation · 0.0gaussian approximation · 0.0diffusion approximation · 0.0
YearPublicationVenuePosition
2005 Performance analysis of topology-unaware TDMA MAC schemes for ad hoc networks with topology control
Nikos B. Pronios, Ioannis Stavrakakis
Comput. Commun.2
1998 A DLC layer framework for wireless ATM networks
abstract
This paper presents a data link control layer for wireless ATM networks. The issues of wireless ATM and the necessity of a special DLC layer to support ATM functionality over the air are given. The medium access scheme principles are proposed in the paper, along with the DLC architecture. The major components and their functionality are described. The interactions of the DLC layer with higher layer entities along with intra-DLC interactions are proposed. The content of this paper is based on work carried out within the ACTS project AC08S Magic WAND.
Nikos B. Pronios, Ioannis E. Dravopoulos, Anastasia I. Andritsou
PIMRC1
1990 On The Stability of Spread-Spectrum Networks, With Decentralized Recursive Retransmission Control, Under Jamming
abstract
The effectiveness of the recursive retransmission control algorithm proposed by B. Hajek (Proc. Inf. Sci. and Syst., p.116-20, Mar. 1982) is examined in the presence of jamming. The spread-spectrum network subjected to jamming is assumed to have infinite user population, employing both forward-error control (FEC) and automatic repeat request (ARQ), and a fixed arrival rate of new packets. Although the composite traffic, consisting of new transmissions (NTxs) and retransmissions (RTxs), is not Poisson, it can be approximated as such. Details for the throughput and the stability of the system are given based on a local Poisson approximation. Stability conditions are given for different levels of user side information.>
Nikos B. Pronios
INFOCOM1
1990 On the Power Spectral Density of Certain Digitally Modulated Signals with Applications to Code Despreading
abstract
Techniques for deriving the power spectral density (PSD) of certain digitally modulated signals that are more general and easier to use than other similar methods are developed. These techniques are especially well suited for deriving the PSD of signal-product waveforms with arbitrary modulating pulse shapes. This is done by decomposing the PSD expression into two factors, one depending solely on the underlying sequences and the other depending only on the pulse shapes. General formulas are derived and, for some cases, they are expressed in terms of the discrete Fourier transform of appropriately defined sequences and the Fourier transform of the modulating pulse shape. Applications where these expressions would be useful include bit and code synchronizers, delay-and-multiply-type of detectors, and spread-spectrum and code-division multiple-access systems, either at radio or at optical frequencies.< >
Nikos B. Pronios, Andreas Polydoros
IEEE J. Sel. Areas Commun.1
1988 Approximate methods for analyzing slotted random-access spread-spectrum networks
abstract
The authors develop approximate methods for performance evaluation of a general class of slotted Aloha-type random-access spread-spectrum networks. Approximation is used in three levels: the diffusion approximation of the process Q(t) (a variant of the number of backlogged users), the approximation of the random-access channel and the existing receivers by a single server with equivalent queue-size-dependent service rate, and the approximation of the state-dependent composite traffic distribution by a Gaussian random variable with equivalent mean and variance. Applications and comparisons with the precise solutions are given.>
Nikos B. Pronios, Andreas Polydoros
INFOCOM1