Search results for "Ordination"
showing 10 items of 1367 documents
Resource allocation for clustered network MIMO OFDMA systems
2012
In this article, we address the resource allocation problem for the downlink of a large network multiple input multiple output orthogonal frequency division multiplexing system with 3-sector base stations. The system is statically divided into a number of disjoint clusters of sectors. A two-step resource allocation scheme is proposed involving the inter-cluster and the intra-cluster levels. As a first step or inter-cluster level, two cooperative frequency reuse approaches are designed to mitigate the inter-cluster interference. A user partition method is proposed to divide the users of each cluster into cluster-edge and cluster-center users. To balance the cell-edge and the cell-average per…
Refinements on IEEE 802.11 Distributed Coordination Function Modeling Approaches
2010
With the popularity of the IEEE 802.11 standards, many analytical saturation throughput studies for the distributed coordination function (DCF) have been reported. In this paper, we outline a number of issues and criticalities raised by previously proposed models. In particular, a careful look at backoff counter decrement rules allows us to conclude that, under saturation conditions, the slot immediately following a successful transmission can be accessed only by the station (STA) that has successfully transmitted in the previous channel access. Moreover, due to the specific acknowledgment (ACK) timeout setting adopted in the standard, the slot immediately following a collision cannot be ac…
Collusion Constrained Equilibrium
2018
First published: 01 February 2018 This is an open access article licensed under the Creative Commons Attribution-NonCommercial License 4.0 (http://econtheory.org) We study collusion within groups in noncooperative games. The primitives are the preferences of the players, their assignment to nonoverlapping groups, and the goals of the groups. Our notion of collusion is that a group coordinates the play of its members among different incentive compatible plans to best achieve its goals. Unfortunately, equilibria that meet this requirement need not exist. We instead introduce the weaker notion of collusion constrained equilibrium. This allows groups to put positive probability on alternatives …
A framework to determine maximum capacity of interconnecting DGs in distribution networks
2018
Interconnecting Distributed Generation (DG) in the distribution network is considered as an important area of power system planning. When the DG placed inappropriately, the DG can have negative impact on some important and critical characteristics of system performance such as increased power losses, degraded voltage profile, and mis-coordination between protection devices. This paper introduces a framework to determine the maximum capacity limits of interconnecting DG units in radial distribution networks in order to keep protection scheme unchanged, while the voltage profile remains within acceptable range and on the same time having the minimum power losses in the network; applying this …
Out-of-Band Signaling Scheme for High Speed Wireless LANs
2007
In recent years, the physical layer data rate provided by 802.11 Wireless LANs has dramatically increased thanks to significant advances in the modulation and coding techniques employed. However, previous studies show that the 802.11 MAC operation, namely the distributed coordination function (DCF), represents a limiting factor: the throughput efficiency drops as the channel bit rate increases, and a throughput upper limit does indeed exist when the channel bit rate goes to infinite high. These findings indicate that the performance of the DCF protocol will not be efficiently improved by merely increasing the channel bit rate. This paper shows that the DCF performance may significantly bene…
Remarks on IEEE 802.11 DCF performance analysis
2005
This letter presents a new approach to evaluate the throughput/delay performance of the 802.11 distributed coordination function (DCF). Our approach relies on elementary conditional probability arguments rather than bidimensional Markov chains (as proposed in previous models) and can be easily extended to account for backoff operation more general than DCF's one.
On-line Coordination in Complex Goal-directed Movements: a Matter of Interactions between Several Loops.
2012
International audience; Motor flexibility is the ability to rapidly modify behavior when unexpected perturbations occur. In goal directed movements, this process may be involved during the motor execution itself, by using on-line motor corrections, or off-line, on a trial-by-trial basis. A consensus has emerged to describe and unify these two dependant processes within the framework of the internal models theory in which the cerebellum is involved in error processing. However, this general framework may be incomplete to describe on-line motor corrections when complex motor coordination is involved in the task. In particular, interaction torques existing between different effectors limit the…
The body talks: Sensorimotor communication and its brain and kinematic signatures
2019
Human communication is a traditional topic of research in many disciplines such as psychology, linguistics and philosophy, all of which mainly focused on language, gestures and deictics. However, these do not constitute the sole channels of communication, especially during online social interaction, where instead an additional critical role may be played by sensorimotor communication (SMC). SMC refers here to (often subtle) communicative signals embedded within pragmatic actions - for example, a soccer player carving his body movements in ways that inform a partner about his intention, or to feint an adversary; or the many ways we offer a glass of wine, rudely or politely. SMC is a natural …
The role of the Access Point in Wi-Fi networks with selfish nodes
2009
In Wi-Fi networks, mobile nodes compete for accessing the shared channel by means of a random access protocol called Distributed Coordination Function (DCF), which is long term fair. But recent drivers allow users to configure protocol parameters differently from their standard values in order to break the protocol fairness and obtain a larger share of the available bandwidth at the expense of other users. This motivates a game theoretical analysis of DCF. Previous studies have already modeled access to a shared wireless channel in terms of non-cooperative games among the nodes, but they have mainly considered ad hoc mode operation. In this paper we consider the role of the Access Point (AP…
Resource sharing optimality in WiFi infrastructure networks
2009
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios. Assuming that a contending node can dynamically change its strategy, by tuning its contention parameters to non-standard values on the basis of channel observations, we prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium condi…