Andrea Hess
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Andrea Hess has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Karin Anna Hummel
VetCore Facility for Research, University of Veterinary Medicine, Vienna, Austria
12 shared publications - Francesco Malandrino
CNR-IEIIT, Torino, Italy
2 shared publications - Jose Maria Barcelo-Ordinas
Department of Computer Architecture, Universitat Politècnica de Catalunya (UPC), Barcelona, Spain
2 shared publications Michael Nussbaumer
University of Vienna, Department of Distributed and Multimedia Systems, Austria
2 shared publicationsAnders Lindgren
SICS Swedish ICT, Sweden
1 shared publicationClaudio Casetti
Politecnico di Torino, Turin, Italy
1 shared publication
Latest Publications
- 7 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 2 (4) , 381-396
Cognitive Radio Algorithms Coexisting in a Network: Performance and Parameter Sensitivity
This paper studies the performance of cognitive radios in a scenario where different pairs of radios adopt different cognition/decision making approaches. We want to assess: 1) if there is a category of cognitive radio algorithms that consistently outperforms the others and 2) how sensitive different algorithms are to suboptimal parameter setting. Our approach is to take a representative set of well-known classes of cognitive radio algorithms, mix and match them throughout thousands of simulations, and determine which seem to perform better. We find that choosing a cognitive radio algorithm means finding a balance between the best-case performance obtained by optimally setting all parameters, and the behavior in uncontrolled, unknown environments, where suboptimal decisions are likely to be made. The approaches we consider, namely reinforcement learning, optimization metaheuristics, multi-armed bandit solutions, and supervised learning, greatly differ in their performance. For example, schemes that are able to achieve a high throughput in our simulation study are more sensitive to suboptimally set parameters.
- 7 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 2 (4) , 381-396
Cognitive Radio Algorithms Coexisting in a Network: Performance and Parameter Sensitivity
This paper studies the performance of cognitive radios in a scenario where different pairs of radios adopt different cognition/decision making approaches. We want to assess: 1) if there is a category of cognitive radio algorithms that consistently outperforms the others and 2) how sensitive different algorithms are to suboptimal parameter setting. Our approach is to take a representative set of well-known classes of cognitive radio algorithms, mix and match them throughout thousands of simulations, and determine which seem to perform better. We find that choosing a cognitive radio algorithm means finding a balance between the best-case performance obtained by optimally setting all parameters, and the behavior in uncontrolled, unknown environments, where suboptimal decisions are likely to be made. The approaches we consider, namely reinforcement learning, optimization metaheuristics, multi-armed bandit solutions, and supervised learning, greatly differ in their performance. For example, schemes that are able to achieve a high throughput in our simulation study are more sensitive to suboptimally set parameters.
- Open Access
- 22 December 2015
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 48 (3) , 1-39
Data-driven Human Mobility Modeling
Over the last decades, modeling of user mobility has become increasingly important in mobile networking research and development. This has led to the adoption of modeling techniques from other disciplines such as kinetic theory or urban planning. Yet these techniques generate movement behavior that is often perceived as not “realistic” for humans or provides only a macroscopic view on mobility. More recent approaches infer mobility models from real traces provided by positioning technologies or by the marks the mobile users leave in the wireless network. However, there is no common framework for assessing and comparing mobility models. In an attempt to provide a solid foundation for realistic mobility modeling in mobile networking research, we take an engineering approach and thoroughly discuss the required steps of model creation and validation. In this context, we survey how and to what extent existing mobility modeling approaches implement the proposed steps. This also summarizes helpful information for readers who do not want to develop a new model, but rather intend to choose among existing ones.
- 22 December 2015
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 48 (3) , 1-39
Open AccessData-driven Human Mobility Modeling
Over the last decades, modeling of user mobility has become increasingly important in mobile networking research and development. This has led to the adoption of modeling techniques from other disciplines such as kinetic theory or urban planning. Yet these techniques generate movement behavior that is often perceived as not “realistic” for humans or provides only a macroscopic view on mobility. More recent approaches infer mobility models from real traces provided by positioning technologies or by the marks the mobile users leave in the wireless network. However, there is no common framework for assessing and comparing mobility models. In an attempt to provide a solid foundation for realistic mobility modeling in mobile networking research, we take an engineering approach and thoroughly discuss the required steps of model creation and validation. In this context, we survey how and to what extent existing mobility modeling approaches implement the proposed steps. This also summarizes helpful information for readers who do not want to develop a new model, but rather intend to choose among existing ones.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 581-587
Privacy-Preserving Mining of Frequent Routes in Cellular Network Data
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 581-587
Privacy-Preserving Mining of Frequent Routes in Cellular Network Data
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15503607,p. 5916-5921
Exploring communication and mobility behavior of 3G network users and its temporal consistency
Over the past decade, telecommunication network operators have more and more realized the added value of data analytics for their network deployment efficiency. Early studies targeted the global network perspective by localizing peak loads, both in terms of area and time period. Due to their higher granularity and information richness, current telecommunication datasets allow increasingly deeper insights into the network activities of the users. Existing network traffic classification studies tend to divide users into groups without considering the transitions between different groups caused by individual behavioral traits, which we expect to show observable regularities. Our approach defines a profiling model that characterizes the user behavior as well as its temporal dynamics from two perspectives: w.r.t. (i) the network load the users generate, and (ii) their mobility patterns. The model is evaluated with two unsupervised clustering algorithms of different complexity (namely, XMeans and EM) by means of a 3G trace dataset from a European operator.
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15503607,p. 5916-5921
Exploring communication and mobility behavior of 3G network users and its temporal consistency
Over the past decade, telecommunication network operators have more and more realized the added value of data analytics for their network deployment efficiency. Early studies targeted the global network perspective by localizing peak loads, both in terms of area and time period. Due to their higher granularity and information richness, current telecommunication datasets allow increasingly deeper insights into the network activities of the users. Existing network traffic classification studies tend to divide users into groups without considering the transitions between different groups caused by individual behavioral traits, which we expect to show observable regularities. Our approach defines a profiling model that characterizes the user behavior as well as its temporal dynamics from two perspectives: w.r.t. (i) the network load the users generate, and (ii) their mobility patterns. The model is evaluated with two unsupervised clustering algorithms of different complexity (namely, XMeans and EM) by means of a 3G trace dataset from a European operator.
- 1 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Observing software-defined networks using a decentralized link monitoring approach
Scalable and automated monitoring processes for testing, debugging, and operation of VNFs and service-chains are crucial components towards achieving the aims of network softwarization - i.e., cheaper, faster, and shorter service deployment and network management processes. In this paper we present a decentralized monitoring approach aimed at supporting automated deployment and operation of VNFs and service-chains. The approach is inspired by network tomography and is designed to address observability limitations and scalability issues that arise from performing measurements from an SDN controller. From successive end-to-end measurements link metrics are derived via in-network parameter estimation with no need of forwarding raw measurements to the controller, which significantly reduces the measurement overhead compared to when monitoring individual links explicitly from an SDN controller.
- 1 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Observing software-defined networks using a decentralized link monitoring approach
Scalable and automated monitoring processes for testing, debugging, and operation of VNFs and service-chains are crucial components towards achieving the aims of network softwarization - i.e., cheaper, faster, and shorter service deployment and network management processes. In this paper we present a decentralized monitoring approach aimed at supporting automated deployment and operation of VNFs and service-chains. The approach is inspired by network tomography and is designed to address observability limitations and scalability issues that arise from performing measurements from an SDN controller. From successive end-to-end measurements link metrics are derived via in-network parameter estimation with no need of forwarding raw measurements to the controller, which significantly reduces the measurement overhead compared to when monitoring individual links explicitly from an SDN controller.
- 1 January 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23319852,p. 570-575
Understanding usage and activity in cellular networks by investigating HTTP requests
The number of mobile devices is estimated to now exceed the world's population, using more and more cloud services, and hence generating more and more traffic. Smartphones generate 95% of the total global handset traffic, and while approximately half of this traffic is sent to cellular networks, other handsets such as tablets are also using increasingly the cellular networks. This paper provides a closer look at the traffic generated on cellular networks by exploring billions of HTTP requests sent by millions of users to a nation-wide cellular network during 41 days. We confirm that - as in many other contexts - 20% of the users are responsible for more than 80% of the requests and provide a deeper analysis of the cellular network usage. Furthermore, we characterise the activity of users on their mobile device and which cloud services they use. For instance, almost 30% of the users use the cellular network frequently, mainly using search services and social networks, but 20% of their requests are sent to advertisement and tracking systems.
- 1 January 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23319852,p. 570-575
Understanding usage and activity in cellular networks by investigating HTTP requests
The number of mobile devices is estimated to now exceed the world's population, using more and more cloud services, and hence generating more and more traffic. Smartphones generate 95% of the total global handset traffic, and while approximately half of this traffic is sent to cellular networks, other handsets such as tablets are also using increasingly the cellular networks. This paper provides a closer look at the traffic generated on cellular networks by exploring billions of HTTP requests sent by millions of users to a nation-wide cellular network during 41 days. We confirm that - as in many other contexts - 20% of the users are responsible for more than 80% of the requests and provide a deeper analysis of the cellular network usage. Furthermore, we characterise the activity of users on their mobile device and which cloud services they use. For instance, almost 30% of the users use the cellular network frequently, mainly using search services and social networks, but 20% of their requests are sent to advertisement and tracking systems.
- 1 January 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21552487,p. 1-8
Efficient neighbor discovery in mobile opportunistic networking using mobility awareness
To detect peers in mobile opportunistic networks, mobile devices transmit and listen for beacons (“scanning”). If networks are sparse, devices spend quite a bit of energy scanning the vicinity for possible contacts with their radios. Numerous techniques were developed to adapt the scanning intervals as a function of the observed node density. In this paper, we complement such techniques by considering that protocol exchanges between nodes require contacts of a minimal time span and infer scanning opportunities from node mobility. The adaptive beaconing presented in this paper reduces the scanning effort significantly without “losing” many contacts that last long enough to (i) fully establish an ad-hoc connection between two devices and to (ii) transfer a sizeable amount of data. We propose a theoretical model to derive connection probabilities from sojourn times in different mobility settings and evaluate the impact on energy consumption and data forwarding performance using simulations with different mobility models.
- 1 January 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21552487,p. 1-8
Efficient neighbor discovery in mobile opportunistic networking using mobility awareness
To detect peers in mobile opportunistic networks, mobile devices transmit and listen for beacons (“scanning”). If networks are sparse, devices spend quite a bit of energy scanning the vicinity for possible contacts with their radios. Numerous techniques were developed to adapt the scanning intervals as a function of the observed node density. In this paper, we complement such techniques by considering that protocol exchanges between nodes require contacts of a minimal time span and infer scanning opportunities from node mobility. The adaptive beaconing presented in this paper reduces the scanning effort significantly without “losing” many contacts that last long enough to (i) fully establish an ad-hoc connection between two devices and to (ii) transfer a sizeable amount of data. We propose a theoretical model to derive connection probabilities from sojourn times in different mobility settings and evaluate the impact on energy consumption and data forwarding performance using simulations with different mobility models.
- Open Access
- 16 August 2013
- Published by Association for Computing Machinery (ACM)
- p. 39-44
Extrapolating sparse large-scale GPS traces for contact evaluation
Human mobility traces are increasingly used for more realistic evaluation of mobile (opportunistic) communication systems. Although GPS traces yield the most detailed data sets, they are often limited in scale and may be incomplete since they are captured using mobile devices carried by volunteers. In this paper, we explore mechanisms to improve completeness and connectivity patterns of sparse GPS traces and assess their impact by means of the GeoLife data set. We also outline insights into geographic propagation that can be gained through these large-scale location measurements.
- 16 August 2013
- Published by Association for Computing Machinery (ACM)
- p. 39-44
Open AccessExtrapolating sparse large-scale GPS traces for contact evaluation
Human mobility traces are increasingly used for more realistic evaluation of mobile (opportunistic) communication systems. Although GPS traces yield the most detailed data sets, they are often limited in scale and may be incomplete since they are captured using mobile devices carried by volunteers. In this paper, we explore mechanisms to improve completeness and connectivity patterns of sparse GPS traces and assess their impact by means of the GeoLife data set. We also outline insights into geographic propagation that can be gained through these large-scale location measurements.
- 24 February 2013
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 13 (3) , 343-360
Movement activity estimation and forwarding effects for opportunistic networking based on urban mobility traces
- 24 February 2013
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 13 (3) , 343-360
Movement activity estimation and forwarding effects for opportunistic networking based on urban mobility traces
- Open Access
- 10 December 2012
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Optimal deployment of charging stations for electric vehicular networks
In a smart city environment, we look at a new, upcoming generation of vehicles running on electric power supplied by on-board batteries. Best recharging options include charging at home, as well as charging at public areas. In this setting, electric vehicles will be informed about public charging stations using wireless communications. As the charging stations are shared resources, cooperating electric vehicles have the potential to avoid unbalanced use of recharging stations and lengthy waiting times. We present a model for electric vehicles and their battery depletion, vehicle mobility, charging stations, and give a solution for optimal placement of charging stations in a smart city. Our placement approach is based on genetic programming and simulation of electric vehicles which move on a real map of a European city. We show that after a few evolution steps, an optimal solution of the charging infrastructure is derived based on mean trip times of electric vehicle
- 10 December 2012
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessOptimal deployment of charging stations for electric vehicular networks
In a smart city environment, we look at a new, upcoming generation of vehicles running on electric power supplied by on-board batteries. Best recharging options include charging at home, as well as charging at public areas. In this setting, electric vehicles will be informed about public charging stations using wireless communications. As the charging stations are shared resources, cooperating electric vehicles have the potential to avoid unbalanced use of recharging stations and lengthy waiting times. We present a model for electric vehicles and their battery depletion, vehicle mobility, charging stations, and give a solution for optimal placement of charging stations in a smart city. Our placement approach is based on genetic programming and simulation of electric vehicles which move on a real map of a European city. We show that after a few evolution steps, an optimal solution of the charging infrastructure is derived based on mean trip times of electric vehicle