Wi-Fi Offload: Tragedy of the Commons or Land of Milk and Honey?

Fueled by its recent success in provisioning on-site wireless Internet access, Wi-Fi is currently perceived as the best positioned technology for pervasive mobile macro network offloading. However, the broad transitions of multiple collocated operators towards this new paradigm may result in fierce competition for the common unlicensed spectrum at hand. In this light, our paper game-theoretically dissects market convergence scenarios by assessing the competition between providers in terms of network performance, capacity constraints, cost reductions, and revenue prospects. We will closely compare the prospects and strategic positioning of fixed line operators offering Wi-Fi services with respect to competing mobile network operators utilizing unlicensed spectrum. Our results highlight important dependencies upon inter-operator collaboration models, and more importantly, upon the ratio between backhaul and Wi-Fi access bit-rates. Furthermore, our investigation of medium- to long-term convergence scenarios indicates that a rethinking of control measures targeting the large-scale monetization of unlicensed spectrum may be required, as otherwise the used free bands may become subject to tragedy-of-commons type of problems.Comment: Workshop on Spectrum Sharing Strategies for Wireless Broadband Services, IEEE PIMRC'13, to appear 201

Modelling the impact of Next Generation Access (NGA) on voice termination cost

Termination of a telephone call can only be realized by the network operator of the receiving party. For this reason, the markets for fixed and mobile call termination are regulated ex-ante including price control. To determine the costs of call termination the current regulatory regime considers only those parts of the network where customers compete for jointly used resources (mainly bandwidth). Therefore, the critical border is the "demarcation point" between the end customer dedicated access network and the aggregation network where customers compete for bandwidth. In addition to the extent of the overall network cost to be considered (depending on the location of the demarcation point) the traffic share of the voice termination service (which determines how much of the relevant cost is borne by voice termination) compared to all the other services sharing the same NGN/ NGA network needs to be taken into account. We analyse the cost effects with a cost model, which considers the part of the access network from the MPoP to the demarcation point, where the dedicated (access) network begins, in detail. This allows us to compare the impact of different demarcation points and service scenarios on the level of voice termination rates for three NGA architectures (FTTH/P2P, FTTH/PON and FTTC). We considered double and triple play service packages and ran sensitivities on data usage. In addition, we calculated termination cost for three different demarcation point locations in the case of FTTH/PON. --Voice Termination,Next Generation Access,FTTH,price regulation,termination monopoly,cost modelling

Wireless Networks with Energy Harvesting and Power Transfer: Joint Power and Time Allocation

In this paper, we consider wireless powered communication networks which could operate perpetually, as the base station (BS) broadcasts energy to the multiple energy harvesting (EH) information transmitters. These employ "harvest then transmit" mechanism, as they spend all of their energy harvested during the previous BS energy broadcast to transmit the information towards the BS. Assuming time division multiple access (TDMA), we propose a novel transmission scheme for jointly optimal allocation of the BS broadcasting power and time sharing among the wireless nodes, which maximizes the overall network throughput, under the constraint of average transmit power and maximum transmit power at the BS. The proposed scheme significantly outperforms "state of the art" schemes that employ only the optimal time allocation. If a single EH transmitter is considered, we generalize the optimal solutions for the case of fixed circuit power consumption, which refers to a much more practical scenario.Comment: 5 pages, 2 figures in IEEE Signal Processing Letters, vol. 23, no. 1, January 201

Implications of Selfish Neighbor Selection in Overlay Networks

In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.Marie Curie Outgoing International Fellowship of the EU (MOIF-CT-2005-007230); National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 020206

Coalitional Games for Transmitter Cooperation in MIMO Multiple Access Channels

Cooperation between nodes sharing a wireless channel is becoming increasingly necessary to achieve performance goals in a wireless network. The problem of determining the feasibility and stability of cooperation between rational nodes in a wireless network is of great importance in understanding cooperative behavior. This paper addresses the stability of the grand coalition of transmitters signaling over a multiple access channel using the framework of cooperative game theory. The external interference experienced by each TX is represented accurately by modeling the cooperation game between the TXs in \emph{partition form}. Single user decoding and successive interference cancelling strategies are examined at the receiver. In the absence of coordination costs, the grand coalition is shown to be \emph{sum-rate optimal} for both strategies. Transmitter cooperation is \emph{stable}, if and only if the core of the game (the set of all divisions of grand coalition utility such that no coalition deviates) is nonempty. Determining the stability of cooperation is a co-NP-complete problem in general. For a single user decoding receiver, transmitter cooperation is shown to be \emph{stable} at both high and low SNRs, while for an interference cancelling receiver with a fixed decoding order, cooperation is stable only at low SNRs and unstable at high SNR. When time sharing is allowed between decoding orders, it is shown using an approximate lower bound to the utility function that TX cooperation is also stable at high SNRs. Thus, this paper demonstrates that ideal zero cost TX cooperation over a MAC is stable and improves achievable rates for each individual user.Comment: in review for publication in IEEE Transactions on Signal Processin

The provision of spectrum for feeder links of non-geostationary mobile satellites

The possibility of sharing spectrum in the 30/20 GHz band between geostationary fixed-satellite systems and feeder-links of low-earth orbit (LEO) mobile-satellite systems is addressed, taking into account that International Telecommunications Union (ITU) Radio Regulation 2613 would be a factor in such sharing. Interference into each network in both the uplink at 30 GHz and the downlink at 20 GHz is considered. It is determined that if sharing were to take place the mobile-satellite may have to cease transmission often for intervals up to 10 seconds, may have to use high-gain tracking antennas on its spacecraft, and may find it an advantage to use code-division multiple access. An alternate solution suggested is to designate a band 50 to 100 MHz wide at 28 and 18 GHz to be used primarily for feeder links to LEO systems

Optimal job splitting in parallel processor sharing queues

The main barrier to the sustained growth of wireless communications is the Shannon limit that applies to the channel capacity. A promising means to realize high-capacity enhancements is the use of multi-path communication solutions to improve reliability and network performance in areas that are covered by a multitude of overlapping wireless access networks. Despite the enormous potential for capacity enhancements offered by multi-path communication techniques, little is known about how to effectively exploit this. Motivated by this, we study a model where jobs are split and downloaded over N multiple parallel networks, each of which is modeled as a processor sharing (PS) queue. Each job is fragmented, according to a fixed splitting rule α=