Strategic Contention Resolution in Multiple Channels

We consider the problem of resolving contention in communication networks with selfish users. In a \textit{contention game} each of $n \geq 2$ identical players has a single information packet that she wants to transmit using one of $k \geq 1$ multiple-access channels. To do that, a player chooses a slotted-time protocol that prescribes the probabilities with which at a given time-step she will attempt transmission at each channel. If more than one players try to transmit over the same channel (collision) then no transmission happens on that channel. Each player tries to minimize her own expected \textit{latency}, i.e. her expected time until successful transmission, by choosing her protocol. The natural problem that arises in such a setting is, given $n$ and $k$, to provide the players with a common, anonymous protocol (if it exists) such that no one would unilaterally deviate from it (equilibrium protocol). All previous theoretical results on strategic contention resolution examine only the case of a single channel and show that the equilibrium protocols depend on the feedback that the communication system gives to the players. Here we present multi-channel equilibrium protocols in two main feedback classes, namely \textit{acknowledgement-based} and \textit{ternary}. In particular, we provide equilibrium characterizations for more than one channels, and give specific anonymous, equilibrium protocols with finite and infinite expected latency. In the equilibrium protocols with infinite expected latency, all players transmit successfully in optimal time, i.e. $\Theta(n/k)$, with probability tending to 1 as $n/k \to \infty$.Comment: The results of this work are included in the 11th International Symposium on Algorithmic Game Theory (SAGT 2018) and the 16th Workshop on Approximation and Online Algorithms (WAOA 2018

Design of State-based Schedulers for a Network of Control Loops

For a closed-loop system, which has a contention-based multiple access network on its sensor link, the Medium Access Controller (MAC) may discard some packets when the traffic on the link is high. We use a local state-based scheduler to select a few critical data packets to send to the MAC. In this paper, we analyze the impact of such a scheduler on the closed-loop system in the presence of traffic, and show that there is a dual effect with state-based scheduling. In general, this makes the optimal scheduler and controller hard to find. However, by removing past controls from the scheduling criterion, we find that certainty equivalence holds. This condition is related to the classical result of Bar-Shalom and Tse, and it leads to the design of a scheduler with a certainty equivalent controller. This design, however, does not result in an equivalent system to the original problem, in the sense of Witsenhausen. Computing the estimate is difficult, but can be simplified by introducing a symmetry constraint on the scheduler. Based on these findings, we propose a dual predictor architecture for the closed-loop system, which ensures separation between scheduler, observer and controller. We present an example of this architecture, which illustrates a network-aware event-triggering mechanism.Comment: 17 pages, technical repor

Millimeter Wave Cellular Networks: A MAC Layer Perspective

The millimeter wave (mmWave) frequency band is seen as a key enabler of multi-gigabit wireless access in future cellular networks. In order to overcome the propagation challenges, mmWave systems use a large number of antenna elements both at the base station and at the user equipment, which lead to high directivity gains, fully-directional communications, and possible noise-limited operations. The fundamental differences between mmWave networks and traditional ones challenge the classical design constraints, objectives, and available degrees of freedom. This paper addresses the implications that highly directional communication has on the design of an efficient medium access control (MAC) layer. The paper discusses key MAC layer issues, such as synchronization, random access, handover, channelization, interference management, scheduling, and association. The paper provides an integrated view on MAC layer issues for cellular networks, identifies new challenges and tradeoffs, and provides novel insights and solution approaches.Comment: 21 pages, 9 figures, 2 tables, to appear in IEEE Transactions on Communication

Energy-Efficient Power Control for Contention-Based Synchronization in OFDMA Systems with Discrete Powers and Limited Feedback

This work derives a distributed and iterative algorithm by which mobile terminals can selfishly control their transmit powers during the synchronization procedure specified by the IEEE 802.16m and the 3GPP-LTE standards for orthogonal frequency-division multiple-access technologies. The proposed solution aims at maximizing the energy efficiency of the network and is derived on the basis of a finite noncooperative game in which the players have discrete action sets of transmit powers. The set of Nash equilibria of the game is investigated, and a distributed power control algorithm is proposed to achieve synchronization in an energy-efficient manner under the assumption that the feedback from the base station is limited. Numerical results show that the proposed solution improves the energy efficiency as well as the timing estimation accuracy of the network compared to existing alternatives, while requiring a reasonable amount of information to be exchanged on the return channel

The Global City as a Space for Transnational Identity Politics

Global Cities are key nodes in circuits of transnational political activity. As dense spaces of political interaction, cities provide bundles of material, political and ideational resources that allow for the generation of new identities and frames of meaning, shifts in tactical and strategic alliances, and network brokerage activities. The key function of cities in facilitating transnationalism has not been adequately explored in the existing International Relations literature on transnationalism. In this paper, we use the case of London as a Global City to examine how its features as a dense institutional context; a node in multiple global networks; and as a resource-rich environment creates a creative space for innovations in transnational politics. We focus on the strategies employed by identity-based transnational political entrepreneurs and discuss four mechanisms of mobilization: brokerage (the linking of disparate networks), strategic framing (the use of symbolic politics), coalition-building (the forging of alliances between organizations) and social learning or mediated diffusion (the adoption of new ideas and practices). Our analysis challenges both standard state-centric and single-case study accounts of transnational activity, suggesting a novel site of investigation for IR scholars

Rapid Convergecast on Commodity Hardware: Performance Limits and Optimal Policies

ReSensePromo

A Light Signalling Approach to Node Grouping for Massive MIMO IoT Networks

Massive MIMO is a promising technology to connect very large numbers of energy constrained nodes, as it offers both extensive spatial multiplexing and large array gain. A challenge resides in partitioning the many nodes in groups that can communicate simultaneously such that the mutual interference is minimized. We here propose node partitioning strategies that do not require full channel state information, but rather are based on nodes' respective directional channel properties. In our considered scenarios, these typically have a time constant that is far larger than the coherence time of the channel. We developed both an optimal and an approximation algorithm to partition users based on directional channel properties, and evaluated them numerically. Our results show that both algorithms, despite using only these directional channel properties, achieve similar performance in terms of the minimum signal-to-interference-plus-noise ratio for any user, compared with a reference method using full channel knowledge. In particular, we demonstrate that grouping nodes with related directional properties is to be avoided. We hence realise a simple partitioning method requiring minimal information to be collected from the nodes, and where this information typically remains stable over a long term, thus promoting their autonomy and energy efficiency

The U.S.-Iran Track II Dialogue (20022008): Lessons Learned and Implications for the Rockefeller Brothers Fund's Grantmaking Strategy

From 2002 through 2008, the Rockefeller Brothers Fund (RBF) supported a Track II dialogue involving influential American and Iranian citizens, co-organized and co-facilitated with the UnitedNations Association of the United States of America (UNA-USA), under the able leadership of Ambassador William Luers. Recognizing that the U.S.-Iranian relationship presents perhaps the most important and troubling foreign policy challenge facing both countries, the Track II dialogue was launched in December 2002.The purpose of this paper is to examine the RBF's experience with the practice of Track II dialogues in light of other experiments with similar dialogues both as a conflict prevention and management tool and as an important component of a peacemaking strategy

Reinventing Media Activism: Public Interest Advocacy in the Making of U.S. Communication-Information Policy, 1960-2002

This report is a long-term analysis of citizens' collective action to influence public policy toward communication and information. The work discusses in greater detail what is meant by communication and information policy (CIP) and why we think it is worthwhile to study it as a distinctive domain of public policy and citizen action. The report concentrates on citizen action in the United States and looks backwards, tracing the long-term evolutionary trajectory of communications-information advocacy in the USA since the 1960s. We focus on the concept of citizen collective action and explain its relevance to CIP.Research supported by the Ford Foundation's Knowledge, Creativity and Freedom Program. The views expressed are those of the author and do not necessarily represent the views of the School of Information Studies, Syracuse University, or the Ford Foundation