Merkourios Karaliopoulos

Spatio-temporal modeling of traffic workload in a campus WLAN

Campus wireless LANs (WLANs) are complex systems with hundreds of access points (APs) and thousands of users. Their performance analysis calls for realistic models of their elements, which can be input to simulation and testbed experiments but also taken into account for theoretical work. However, only few modeling results in this area are derived from real measurement data, and rarely do they provide a complete and consistent view of entire WLANs. In this work, we address this gap relying on extensive traces collected from the large wireless infrastructure of the University of North Carolina. We present a first system-wide, multi-level modeling approach for characterizing the traffic demand in a campus WLAN. Our approach focuses on two structures of wireless user activity, namely the wireless session and the network flow. We propose statistical distributions for their attributes, aiming at a parsimonious characterization that can be the most flexible foundation for simulation studies. We simulate our models and show that the synthesized traffic is in good agreement with the original trace data. Finally, we investigate to what extent these models can be valid at finer spatial aggregation levels of traffic load, e.g., for modeling traffic demand in hotspot APs.

User recruitment for mobile crowdsensing over opportunistic networks

We look into the realization of mobile crowdsensing campaigns that draw on the opportunistic networking paradigm, as practised in delay-tolerant networks but also in the emerging device-to-device communication mode in cellular networks. In particular, we ask how mobile users can be optimally selected in order to generate the required space-time paths across the network for collecting data from a set of fixed locations. The users hold different roles in these paths, from collecting data with their sensing-enabled devices to relaying them across the network and uploading them to data collection points with Internet connectivity. We first consider scenarios with deterministic node mobility and formulate the selection of users as a minimum-cost set cover problem with a submodular objective function. We then generalize to more realistic settings with uncertainty about the user mobility. A methodology is devised for translating the statistics of individual user mobility to statistics of spacetime path formation and feeding them to the set cover problem formulation. We describe practical greedy heuristics for the resulting NP-hard problems and compute their approximation ratios. Our experimentation with real mobility datasets (a) illustrates the multiple tradeoffs between the campaign cost and duration, the bound on the hopcount of space-time paths, and the number of collection points; and (b) provides evidence that in realistic problem instances the heuristics perform much better than what their pessimistic worst-case bounds suggest.

Interference-Aware Routing in Wireless Multihop Networks

Interference is an inherent characteristic of wireless (multihop) communications. Adding interference-awareness to important control functions, e.g., routing, could significantly enhance the overall network performance. Despite some initial efforts, it is not yet clearly understood how to best capture the effects of interference in routing protocol design. Most existing proposals aim at inferring its effect by actively probing the link. However, active probe measurements impose an overhead and may often misrepresent the link quality due to their interaction with other networking functions. Therefore, in this paper we follow a different approach and: 1) propose a simple yet accurate analytical model for the effect of interference on data reception probability, based only on passive measurements and information locally available at the node; 2) use this model to design an efficient interference-aware routing protocol that performs as well as probing-based protocols, yet avoids all pitfalls related to active probe measurements. To validate our proposal, we have performed experiments in a real testbed, setup in our indoor office environment. We show that the analytical predictions of our interference model exhibit good match with both experimental results as well as more complicated analytical models proposed in related literature. Furthermore, we demonstrate that a simple probeless routing protocol based on our model performs at least as good as well-known probe-based routing protocols in a large set of experiments including both intraflow and interflow interference.

Routing Metrics for Wireless Mesh Networks

Routing in wireless mesh networks has been an active area of research for many years, with many proposed routing protocols selecting shortest paths that minimize the path hop count. Whereas minimum hop count is the most popular metric in wired networks, in wireless networks interference- and energy- related considerations give rise to more complex trade-offs. Therefore, a variety of routing metrics has been proposed especially for wireless mesh networks providing routing algorithms with high flexibility in the selection of best path as a compromise among throughput, end-to-end delay, and energy consumption. In this paper, we present a detailed survey and taxonomy of routing metrics. These metrics may have broadly different optimization objectives (e.g., optimize application performance, maximize battery lifetime, maximize network throughput), different methods to collect the required information to produce metric values, and different ways to derive the end-to-end route quality out of the individual link quality metrics. The presentation of the metrics is highly comparative, with emphasis on their strengths and weaknesses and their application to various types of network scenarios. We also discuss the main implications for practitioners and identify open issues for further research in the area.

Satellite radio interface and radio resource management strategy for the delivery of multicast/broadcast services via an integrated satellite-terrestrial system

A variety of hybrid systems combining third-generation mobile communication networks with broadcast systems have been proposed for the delivery of multimedia broadcast multicast services (MBMS) to mobile users. The article discusses one of these alternatives, which involves the use of a geostationary satellite component for MBMS delivery. In particular, it proposes a radio access scheme for the satellite component of the system that features maximum commonalities with the standardized T-UMTS WCDMA-based interface. The ultimate advantages of this approach are more efficient delivery of MBMS as far as the mobile network operator is concerned. The required adaptations at the interface layers are described, and the radio resource management strategy that fulfills the particular requirements of the satellite system is presented.

Packet scheduling for the delivery of multicast and broadcast services over S-UMTS

SUMMARY We investigate the packet-scheduling function within the access scheme of a unidirectional satellite system providing point-to-multipoint services to mobile users. The satellite system may be regarded as an overlay multicast/broadcast layer complementing the point-to-point third generation (3G) mobile terrestrial networks. The satellite access scheme features maximum commonalties with the frequency division duplex (FDD) air interface of the terrestrial universal mobile telecommunications system (T-UMTS), also known as wideband code division multiple access (WCDMA), thus enabling close integration with the terrestrial 3G mobile networks and cost-efficient handset implementations. We draw our attention on one of the radio resource management entities relevant to this interface: the packet scheduler. The lack of channel-state information and the point-to-multipoint service offering differentiate the packet scheduler in the satellite radio interface from its counterpart in point-to-point terrestrial mobile networks. We formulate the scheduler tasks and describe adaptations of two well-known scheduling disciplines, the multilevel priority queuing and weighted fair queuing schemes, as candidates for the time-scheduling function. Simulation results confirm the significance of the transport format combination set (TFCS) with respect to both the resource utilization achieved by the scheduler and the performance obtained by the flows at packet-level. The performance gap of the two schemes regarding the fairness provided to competing flows can be narrowed via appropriate selection of the TFCS, whereas the achieved delay and delay variation scores are ultimately dependent on the packet-level dynamics of individual flows. Copyright # 2004 John Wiley & Sons, Ltd.

S-UMTS access network for broadcast and multicast service delivery: the SATIN approach

This paper proposes a complete satellite access network solution for multimedia broadcast multicast service (MBMS) delivery based on T-UMTS standards. First, the benefits of MBMS delivery via satellite (SAT-MBMS) for both S/T-UMTS network operators are shown with market and business analysis. A new integrated S/T-UMTS architecture for MBMS delivery is proposed featuring an intermediate module repeater (IMR) for coverage of urban areas. The architectural options of IMR and terminals are discussed considering the relevant cost and complexity. The IMR propagation channel conditions are investigated and a new propagation channel model is proposed. The potential of advanced coding schemes such as the layered coding technique to tackle the channel variations in broadcast/multicast environment is outlined. The functional and protocol architecture are defined along with the interface between the satellite access network and the UMTS core network. Required modifications on the terrestrial access scheme sub-layers to support MBMS data are investigated and the relevant logical, transport and physical channels are selected. Based on the channel selection and the point-to-multipoint service nature, we define a generic radio resource management (RRM) strategy that takes into account both QoS and GoS requirements. The efficiency of the proposed solutions is evaluated in the presented simulation results, advocating the feasibility of the overall approach. Copyright

Social Similarity Favors Cooperation: The Distributed Content Replication Case

This paper explores how the degree of similarity within a social group can dictate the behavior of the individual nodes, so as to best tradeoff the individual with the social benefit. More specifically, we investigate the impact of social similarity on the effectiveness of content placement and dissemination. We consider three schemes that represent well the spectrum of behavior-shaped content storage strategies: the selfish, the self-aware cooperative, and the optimally altruistic ones. Our study shows that when the social group is tight (high degree of similarity), the optimally altruistic behavior yields the best performance for both the entire group (by definition) and the individual nodes (contrary to typical expectations). When the group is made up of members with almost no similarity, altruism or cooperation cannot bring much benefit to either the group or the individuals and thus, selfish behavior emerges as the preferable choice due to its simplicity. Notably, from a theoretical point of view, our “similarity favors cooperation” argument is inline with sociological interpretations of human altruistic behavior. On a more practical note, the self-aware cooperative behavior could be adopted as an easy to implement distributed alternative to the optimally altruistic one; it has close to the optimal performance for tight social groups and the additional advantage of not allowing mistreatment of any node, i.e., its induced content retrieval cost is always smaller than the cost of the selfish strategy.

End-to-end vs. hop-by-hop transport under intermittent connectivity

This paper revisits the fundamental trade-off between end-to-end and hop-by-hop transport control. The end-to-end principle has been one of the building blocks of the Internet; but in real-world wireless scenarios, end-to-end connectivity is often intermittent, limiting the performance of end-to-end transport protocols. We use a stochastic model that captures both the availability ratio of links and the duration of link disruptions to represent intermittent connectivity. We compare the performance of end-to-end and hop-by-hop transport over an intermittently-connected path. End-to-end, perhaps surprisingly, may perform better than hop-by-hop transport under long disruption periods. We propose the spaced hop-by-hop policy which is found to dominate (in terms of delivery ratio) the end-to-end policy over the whole parameter range and the basic hop-by-hop policy over most of the relevant range.

On Leveraging Partial Paths in Partially-Connected Networks

Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either close to unity, assuming connected paths between all nodes (mobile ad hoc networks), or it is close to zero, assuming no multi-hop paths exist at all (delay-tolerant networks). In this paper, we argue that a sizable fraction of networks lies between these extremes and is characterized by the existence of partial paths, i.e., multi-hop path segments that allow forwarding data closer to the destination even when no end-to-end path is available. A fundamental issue in such networks is dealing with disruptions of end-to-end paths. Under a stochastic model, we compare the performance of the established end-to-end retransmission (ignoring partial paths), against a forwarding mechanism that leverages partial paths to forward data closer to the destination even during disruption periods. Perhaps surprisingly, the alternative mechanism is not necessarily superior. However, under a stochastic monotonicity condition between current vs. future path length, which we demonstrate to hold in typical network models, we manage to prove superiority of the alternative mechanism in stochastic dominance terms. We believe that this study could serve as a foundation to design more efficient data transfer protocols for partially-connected networks, which could potentially help reducing the gap between applications that can be supported over disconnected networks and those requiring full connectivity.