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

Christian Kissling

dblp:82/4941 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2018
0000-0003-1809-4351ORCID · corroborated

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

Computer networks · 9 · 4 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
1 paper
Wireless networking · 46% Physical-layer communications · 46% Vehicular, aerial and satellite networks · 7%

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

TopicWeightPapersLastEvidence papers
Wireless networking › random access
ALOHA
0.312018
Enhancing Contention Resolution ALOHA Using Combining Techniques · IEEE Trans. Commun. 2018
Physical-layer communications
diversity combining
0.312018
Enhancing Contention Resolution ALOHA Using Combining Techniques · IEEE Trans. Commun. 2018
Physical-layer communications › diversity combining
generalized selection combining
0.312018
Enhancing Contention Resolution ALOHA Using Combining Techniques · IEEE Trans. Commun. 2018
Wireless networking
random access
0.312018
Enhancing Contention Resolution ALOHA Using Combining Techniques · IEEE Trans. Commun. 2018
Vehicular, aerial and satellite networks
satellite communication
0.112018
Enhancing Contention Resolution ALOHA Using Combining Techniques · IEEE Trans. Commun. 2018

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

spectral efficiency analysis · 0.3packet loss rate approximation · 0.3
YearPublicationVenuePosition
2018 Enhancing Contention Resolution ALOHA Using Combining Techniques
abstract
Recently, random access protocols have acquired a new wave of interest, not only from the satellite communication community, but also from researchers active in fields, such as Internet of Things and machine-to-machine. Asynchronous (slot- and frame-wise) ALOHA-like random access protocols, are very attractive for such applications, enabling low complexity transmitters and avoiding time synchronization requirements. Evolutions of ALOHA employ time diversity through proactive replication of packets, but the time diversity is not fully exploited at the receiver. Combining techniques, as selection combining and maximal-ratio combining, are beneficial and are adopted in the enhanced contention resolution ALOHA (ECRA) scheme, presented here. A tight approximation of the packet loss rate for asynchronous random access, including ECRA, well suited for the low channel load region is derived. Finally, ECRA is evaluated in terms of spectral efficiency, throughput and packet loss rate in comparison with recent protocols, showing that it is able to largely outperform both slotted synchronous and asynchronous schemes.
Federico Clazzer, Christian Kissling, Mario Marchese
IEEE Trans. Commun.2
2013 LDPC code performance and optimum code rate for Contention Resolution Diversity ALOHA
abstract
In this paper we investigate several central aspects of using the unslotted Contention Resolution Diversity ALOHA (CRA) scheme with Successive Interference Cancellation (SIC). A model for the co-user-interference under consideration of time-, phase- and frequency-offsets is presented. With this model, the throughput and Packet Loss Ratio (PLR) performance of CRA is investigated when using Low Density Parity Check (LDPC) codes, showing that CRA can achieve remarkable performance also in these conditions. Moreover, the throughput and PLR gain of CRA in presence of power unbalance is studied, showing that significant gains can be expected. Following this, the central question is answered which channel rates optimize the goodput of CRA, showing that for CRA with few replicas a low, robust channel rate achieves optimum while for high numbers of replicas a high channel rate performs optimum. Finally an investigation of the interference distribution of an asynchronous TDMA scheme with replicas and the SIC operations in it are shown.
Christian Kissling, Federico Clazzer
GLOBECOM1
2013 Reliable Aeronautical Services Protocol: Motivation, design, and performance
abstract
The most widely used transport protocols (i.e, TCP and UDP) are not suitable for aeronautical services because of the reliability and strict transfer delay requirements that cannot be met by TCP and UDP in such environment. In this respect, the paper proposes a novel message-oriented transport protocol Reliable Aeronautical Services Protocol (RASP) enabling reliable aeronautical services. Simulation campaigns carried out in ns-2 show the superiority of RASP with respect to TCP in terms of end-to-end message transfer delay and number of performed retransmissions.
Muhammad Muhammad, Tomaso de Cola, Christian Kissling, Matteo Berioli
GLOBECOM3
2013 Optimum header positioning in successive interference cancellation (SIC) based Aloha
abstract
Random Access MAC protocols are simple and effective when the nature of the traffic is unpredictable and sporadic. In the following paper, investigations on the new Enhanced Contention Resolution ALOHA (ECRA) are presented, where some new aspects of the protocol are investigated. Mathematical derivation and numerical evaluation of the symbol interference probability after SIC are here provided. Results of the optimum header positioning which is found to be in the beginning and in the end of the packets, are exploited for the evaluation of ECRA throughput and Packet Error Rate (PER) under imperfect knowledge of packets positions. Remarkable gains in the maximum throughput are observed for ECRA w.r.t. Contention Resolution ALOHA (CRA) under this assumption.
Federico Clazzer, Christian Kissling
ICC2
2013 On the integration of random access and DAMA channels for the return link of satellite networks
abstract
Recent advances in Random Access (RA), improving throughput and loss rates, make the usage of such technique particularly interesting to complement Demand Assigned Multiple Access (DAMA) channels for the return link of satellite systems. In this paper, a novel approach for the integration of the two access strategies aimed at transmission delay optimization is presented. An algorithm for DAMA and RA delay estimation is presented, and its accuracy shown by simulations. Furthermore, the benefits of the proposed integration concept are demonstrated with significant gains in delay and throughput in moderate to high load operating regions.
Christian Kissling, Andrea Munari
ICC1
2012 Sliding window-based Contention Resolution Diversity Slotted ALOHA
abstract
Contention Resolution Diversity Slotted ALOHA (CRDSA) and its burst degree optimizations (CRDSA++, IRSA) make use of MAC burst repetitions and Interference Cancellation (IC) making possible to reach throughput values as high as T ≃ 0.8 in practical implementations, whereas for the traditional slotted ALOHA T ≃ 0.37. However, these new techniques introduce a frame-based access to the channel that limits the performance in terms of throughput and packet delivery delay. In this paper, a new technique named Sliding Window CRDSA (SW-CRDSA) and its counterpart for irregular repetitions (SW-IRSA) are introduced in order to exploit the advantages of MAC burst repetition and Interference Cancellation (IC) with an unframed access scheme. Numerical results are also provided in order to validate the statement of better performance.
Alessio Meloni, Maurizio Murroni, Christian Kissling, Matteo Berioli
GLOBECOM3
2011 On the Stability of Contention Resolution Diversity Slotted ALOHA (CRDSA)
abstract
The stability of Random Access protocols is of high importance to ensure an efficient usage of resources and good service perception by the users. In this paper the stability region for the recently proposed Contention Resolution Diversity Slotted ALOHA random access protocol is discussed for finite user populations. The system dynamics of a CRDSA Random Access channel are described and a mathematical model is formulated, which allows predicting the stability of the system. From the derived model quantitative approximations of the stability regions and parameter selection for stable operation are provided. Numerical results are derived by means of simulations for validating the mathematical model and the quantitative approximations of the stability region.
Christian Kissling
GLOBECOM1
2011 Performance Enhancements for Asynchronous Random Access Protocols over Satellite
abstract
In this paper, a novel enhancement of the well known ALOHA random access mechanism is presented which largely extends the achievable throughput compared to traditional ALOHA and provides significantly lower packet loss rates. The novel mechanism, called Constant Rate Assignment (CRA), is based on transmitting multiple replicas of a packet in an unslotted ALOHA system and applying interference cancellation techniques. In this paper the methodology for this new random access technique is presented, also w.r.t. existing Interference Cancellation (IC) techniques. Moreover numerical results for performance comparison with state of the art random access mechanisms, such as Contention Resolution Diversity Slotted ALOHA (CRDSA) are provided. Finally the benefit of taking strong forward error correcting codes for the performance of CRA is shown.
Christian Kissling
ICC1
2010 Satellite constellation networks for aeronautical communication: traffic modelling and link load analysis
abstract
The authors examine two different non-geostationary satellite constellation networks with inter-satellite links for global air traffic control and air passenger communication. After developing a traffic model for aeronautical communication services, the authors derive bandwidth requirements for such a global system. The influence of different routing policies is discussed and they show that link loads are comparable for both medium earth orbit and low earth orbit constellations. All considerations are based on real global flight data of all commercial flights during 1 day.
Anton Donner, Christian Kissling, Romain Hermenier
IET Commun.2