Insights in the cost of continuous broadband Internet on trains for multi-service deployments by multiple actors with resource sharing

The economic viability of broadband Internet services on trains has always been proved difficult, mainly due to a high investment cost and low willingness to pay by train passengers, but also due to unused opportunities such as non-passenger services (e.g. train performance monitoring, crew services) and optimization of the resources consumed to offer Internet services. Evaluating opportunities to improve the return on investment is therefore essential towards profitability of the business case. By efficiently sharing resources amongst services, costs can be pooled over several services in order to reduce the investment cost per service. Current techno-economic evaluation models are hard to apply to cost allocation in a multi-service deployment with multiple actors and resource sharing. We therefore propose a new evaluation model and apply it to a deployment of Internet services on trains. We start with a detailed analysis of the technical architecture required to provide Internet access on trains. For each component, we investigate the impact by the different services on resource consumption. The proposed techno-economic evaluation model is then applied in order to calculate the total cost and allocate the used and unused resources to the appropriate services. In a final step, we calculate the business case for each stakeholder involved in the offering of these services. This paper details the proposed model and reports on our findings for a multi-service deployment by multiple actors. Results show important benefits for the case that considers the application of resource sharing in a multi-service, multi-actor scenario and the proposed model produces insights in the contributors to the cost per service and the unused amount of a resource. In addition, ex-ante insights in the cost flows per involved actor are obtained and the model can easily be extended to include revenue flows to evaluate the profitability per actor. As a consequence, the proposed model should be considered to support and stimulate upcoming multi-actor investment decisions for Internet-based multi-service offerings on-board trains with resource sharing

Modeling the relationship between network operators and venue owners in public Wi-Fi deployment using non-cooperative game theory

Wireless data demands keep rising at a fast rate. In 2016, Cisco measured a global mobile data traffic volume of 7.2 Exabytes per month and projected a growth to 49 Exabytes per month in 2021. Wi-Fi plays an important role in this as well. Up to 60% of the total mobile traffic was off-loaded via Wi-Fi (and femtocells) in 2016. This is further expected to increase to 63% in 2021. In this publication, we look into the roll-out of public Wi-Fi networks, public meaning in a public or semi-public place (pubs, restaurants, sport stadiums, etc.). More concretely we look into the collaboration between two parties, a technical party and a venue owner, for the roll-out of a new Wi-Fi network. The technical party is interested in reducing load on its mobile network and generating additional direct revenues, while the venue owner wants to improve the attractiveness of the venue and consequentially generate additional indirect revenues. Three Wi-Fi pricing models are considered: entirely free, slow access with ads or fast access via paid access (freemium), and paid access only (premium). The technical party prefers a premium model with high direct revenues, the venue owner a free/freemium model which is attractive to its customers, meaning both parties have conflicting interests. This conflict has been modeled using non-cooperative game theory incorporating detailed cost and revenue models for all three Wi-Fi pricing models. The initial outcome of the game is a premium Wi-Fi network, which is not the optimal solution from an outsider's perspective as a freemium network yields highest total payoffs. By introducing an additional compensation scheme which corresponds with negotiation in real life, the outcome of the game is steered toward a freemium solution

Feedforward data-aided phase noise estimation from a DCT basis expansion

This contribution deals with phase noise estimation from pilot symbols. The phase noise process is approximated by an expansion of discrete cosine transform (DCT) basis functions containing only a few terms. We propose a feedforward algorithm that estimates the DCT coefficients without requiring detailed knowledge about the phase noise statistics. We demonstrate that the resulting (linearized) mean-square phase estimation error consists of two contributions: a contribution from the additive noise, that equals the Cramer-Rao lower bound, and a noise independent contribution, that results front the phase noise modeling error. We investigate the effect of the symbol sequence length, the pilot symbol positions, the number of pilot symbols, and the number of estimated DCT coefficients it the estimation accuracy and on the corresponding bit error rate (PER). We propose a pilot symbol configuration allowing to estimate any number of DCT coefficients not exceeding the number of pilot Symbols, providing a considerable Performance improvement as compared to other pilot symbol configurations. For large block sizes, the DCT-based estimation algorithm substantially outperforms algorithms that estimate only the time-average or the linear trend of the carrier phase. Copyright (C) 2009 J. Bhatti and M. Moeneclaey

Impact of EU duty cycle and transmission power limitations for sub-GHz LPWAN SRDs : an overview and future challenges

Long-range sub-GHz technologies such as LoRaWAN, SigFox, IEEE 802.15.4, and DASH7 are increasingly popular for academic research and daily life applications. However, especially in the European Union (EU), the use of their corresponding frequency bands are tightly regulated, since they must confirm to the short-range device (SRD) regulations. Regulations and standards for SRDs exist on various levels, from global to national, but are often a source of confusion. Not only are multiple institutes responsible for drafting legislation and regulations, depending on the type of document can these rules be informational or mandatory. Regulations also vary from region to region; for example, regulations in the United States of America (USA) rely on electrical field strength and harmonic strength, while EU regulations are based on duty cycle and maximum transmission power. A common misconception is the presence of a common 1% duty cycle, while in fact the duty cycle is frequency band-specific and can be loosened under certain circumstances. This paper clarifies the various regulations for the European region, the parties involved in drafting and enforcing regulation, and the impact on recent technologies such as SigFox, LoRaWAN, and DASH7. Furthermore, an overview is given of potential mitigation approaches to cope with the duty cycle constraints, as well as future research directions

An Opportunistic Error Correction Layer for OFDM Systems

In this paper, we propose a novel cross layer scheme to lower power\ud consumption of ADCs in OFDM systems, which is based on resolution\ud adaptive ADCs and Fountain codes. The key part in the new proposed\ud system is that the dynamic range of ADCs can be reduced by\ud discarding the packets which are transmitted over 'bad' sub\ud carriers. Correspondingly, the power consumption in ADCs can be\ud reduced. Also, the new system does not process all the packets but\ud only processes surviving packets. This new error correction layer\ud does not require perfect channel knowledge, so it can be used in a\ud realistic system where the channel is estimated. With this new\ud approach, more than 70% of the energy consumption in the ADC can be\ud saved compared with the conventional IEEE 802.11a WLAN system under\ud the same channel conditions and throughput. The ADC in a receiver\ud can consume up to 50% of the total baseband energy. Moreover, to\ud reduce the overhead of Fountain codes, we apply message passing and\ud Gaussian elimination in the decoder. In this way, the overhead is\ud 3% for a small block size (i.e. 500 packets). Using both methods\ud results in an efficient system with low delay

An Optimal Medium Access Control with Partial Observations for Sensor Networks

We consider medium access control (MAC) in multihop sensor networks, where only partial information about the shared medium is available to the transmitter. We model our setting as a queuing problem in which the service rate of a queue is a function of a partially observed Markov chain representing the available bandwidth, and in which the arrivals are controlled based on the partial observations so as to keep the system in a desirable mildly unstable regime. The optimal controller for this problem satisfies a separation property: we first compute a probability measure on the state space of the chain, namely the information state, then use this measure as the new state on which the control decisions are based. We give a formal description of the system considered and of its dynamics, we formalize and solve an optimal control problem, and we show numerical simulations to illustrate with concrete examples properties of the optimal control law. We show how the ergodic behavior of our queuing model is characterized by an invariant measure over all possible information states, and we construct that measure. Our results can be specifically applied for designing efficient and stable algorithms for medium access control in multiple-accessed systems, in particular for sensor networks

Cores of Cooperative Games in Information Theory

Cores of cooperative games are ubiquitous in information theory, and arise most frequently in the characterization of fundamental limits in various scenarios involving multiple users. Examples include classical settings in network information theory such as Slepian-Wolf source coding and multiple access channels, classical settings in statistics such as robust hypothesis testing, and new settings at the intersection of networking and statistics such as distributed estimation problems for sensor networks. Cooperative game theory allows one to understand aspects of all of these problems from a fresh and unifying perspective that treats users as players in a game, sometimes leading to new insights. At the heart of these analyses are fundamental dualities that have been long studied in the context of cooperative games; for information theoretic purposes, these are dualities between information inequalities on the one hand and properties of rate, capacity or other resource allocation regions on the other.Comment: 12 pages, published at http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/318704 in EURASIP Journal on Wireless Communications and Networking, Special Issue on "Theory and Applications in Multiuser/Multiterminal Communications", April 200

A novel network architecture for train-to-wayside communication with quality of service over heterogeneous wireless networks

In the railway industry, there are nowadays different actors who would like to send or receive data from the wayside to an onboard device or vice versa. These actors are e.g., the Train Operation Company, the Train Constructing Company, a Content Provider, etc. This requires a communication module on each train and at the wayside. These modules interact with each other over heterogeneous wireless links. This system is referred to as the Train-to-Wayside Communication System (TWCS). While there are already a lot of deployments using a TWCS, the implementation of quality of service, performance enhancing proxies (PEP) and the network mobility functions have not yet been fully integrated in TWCS systems. Therefore, we propose a novel and modular IPv6-enabled TWCS architecture in this article. It jointly tackles these functions and considers their mutual dependencies and relationships. DiffServ is used to differentiate between service classes and priorities. Virtual local area networks are used to differentiate between different service level agreements. In the PEP, we propose to use a distributed TCP accelerator to optimize bandwidth usage. Concerning network mobility, we propose to use the SCTP protocol (with Dynamic Address Reconfiguration and PR-SCTP extensions) to create a tunnel per wireless link, in order to support the reliable transmission of data between the accelerators. We have analyzed different design choices, pinpointed the main implementation challenges and identified candidate solutions for the different modules in the TWCS system. As such, we present an elaborated framework that can be used for prototyping a fully featured TWCS

Maximum-Likelihood Sequence Detection of Multiple Antenna Systems over Dispersive Channels via Sphere Decoding

Multiple antenna systems are capable of providing high data rate transmissions over wireless channels. When the channels are dispersive, the signal at each receive antenna is a combination of both the current and past symbols sent from all transmit antennas corrupted by noise. The optimal receiver is a maximum-likelihood sequence detector and is often considered to be practically infeasible due to high computational complexity (exponential in number of antennas and channel memory). Therefore, in practice, one often settles for a less complex suboptimal receiver structure, typically with an equalizer meant to suppress both the intersymbol and interuser interference, followed by the decoder. We propose a sphere decoding for the sequence detection in multiple antenna communication systems over dispersive channels. The sphere decoding provides the maximum-likelihood estimate with computational complexity comparable to the standard space-time decision-feedback equalizing (DFE) algorithms. The performance and complexity of the sphere decoding are compared with the DFE algorithm by means of simulations