2,642 research outputs found
Random Access Game in Fading Channels with Capture: Equilibria and Braess-like Paradoxes
The Nash equilibrium point of the transmission probabilities in a slotted
ALOHA system with selfish nodes is analyzed. The system consists of a finite
number of heterogeneous nodes, each trying to minimize its average transmission
probability (or power investment) selfishly while meeting its average
throughput demand over the shared wireless channel to a common base station
(BS). We use a game-theoretic approach to analyze the network under two
reception models: one is called power capture, the other is called signal to
interference plus noise ratio (SINR) capture. It is shown that, in some
situations, Braess-like paradoxes may occur. That is, the performance of the
system may become worse instead of better when channel state information (CSI)
is available at the selfish nodes. In particular, for homogeneous nodes, we
analytically present that Braess-like paradoxes occur in the power capture
model, and in the SINR capture model with the capture ratio larger than one and
the noise to signal ratio sufficiently small.Comment: 30 pages, 5 figure
Random Access Protocols for Massive MIMO
5G wireless networks are expected to support new services with stringent
requirements on data rates, latency and reliability. One novel feature is the
ability to serve a dense crowd of devices, calling for radically new ways of
accessing the network. This is the case in machine-type communications, but
also in urban environments and hotspots. In those use cases, the high number of
devices and the relatively short channel coherence interval do not allow
per-device allocation of orthogonal pilot sequences. This article motivates the
need for random access by the devices to pilot sequences used for channel
estimation, and shows that Massive MIMO is a main enabler to achieve fast
access with high data rates, and delay-tolerant access with different data rate
levels. Three pilot access protocols along with data transmission protocols are
described, fulfilling different requirements of 5G services
Exploiting Capture Effect in Frameless ALOHA for Massive Wireless Random Access
The analogies between successive interference cancellation (SIC) in slotted
ALOHA framework and iterative belief-propagation erasure-decoding, established
recently, enabled the application of the erasure-coding theory and tools to
design random access schemes. This approach leads to throughput substantially
higher than the one offered by the traditional slotted ALOHA. In the simplest
setting, SIC progresses when a successful decoding occurs for a single user
transmission. In this paper we consider a more general setting of a channel
with capture and explore how such physical model affects the design of the
coded random access protocol. Specifically, we assess the impact of capture
effect in Rayleigh fading scenario on the design of SIC-enabled slotted ALOHA
schemes. We provide analytical treatment of frameless ALOHA, which is a special
case of SIC-enabled ALOHA scheme. We demonstrate both through analytical and
simulation results that the capture effect can be very beneficial in terms of
achieved throughput.Comment: Accepted for presentation at IEEE WCNC'14 Track 2 (MAC and
Cross-Layer Design
ISMA-DS/CDMA MAC protocol for mobile packet radio networks
In this paper an ISMA-DS/CDMA MAC protocol for a packet transmission network is presented. The main feature of this protocol is its ability to retain the inherent flexibility of random access protocols while at the same time reducing to some extent the randomness in the access in order to increase the system capacity. In this framework, the protocol is adapted to a frame structure similar to that specified in the UTRA ETSI proposal for third generation mobile communication systems. Additionally, some adaptive mechanisms are proposed that improve protocol performance by means of varying the transmission bit rate according to the channel load that is broadcast by the base station. As a result, an adaptive bit rate algorithm is presented that reaches a throughput value close to the optimumPeer ReviewedPostprint (published version
Performance analysis of feedback-free collision resolution NDMA protocol
To support communications of a large number of deployed devices while guaranteeing limited signaling load, low energy consumption, and high reliability, future cellular systems require efficient random access protocols. However, how to address the collision resolution at the receiver is still the main bottleneck of these protocols. The network-assisted diversity multiple access (NDMA) protocol solves the issue and attains the highest potential throughput at the cost of keeping devices active to acquire feedback and repeating transmissions until successful decoding. In contrast, another potential approach is the feedback-free NDMA (FF-NDMA) protocol, in which devices do repeat packets in a pre-defined number of consecutive time slots without waiting for feedback associated with repetitions. Here, we investigate the FF-NDMA protocol from a cellular network perspective in order to elucidate under what circumstances this scheme is more energy efficient than NDMA. We characterize analytically the FF-NDMA protocol along with the multipacket reception model and a finite Markov chain. Analytic expressions for throughput, delay, capture probability, energy, and energy efficiency are derived. Then, clues for system design are established according to the different trade-offs studied. Simulation results show that FF-NDMA is more energy efficient than classical NDMA and HARQ-NDMA at low signal-to-noise ratio (SNR) and at medium SNR when the load increases.Peer ReviewedPostprint (published version
CSMA Local Area Networking under Dynamic Altruism
In this paper, we consider medium access control of local area networks
(LANs) under limited-information conditions as befits a distributed system.
Rather than assuming "by rule" conformance to a protocol designed to regulate
packet-flow rates (e.g., CSMA windowing), we begin with a non-cooperative game
framework and build a dynamic altruism term into the net utility. The effects
of altruism are analyzed at Nash equilibrium for both the ALOHA and CSMA
frameworks in the quasistationary (fictitious play) regime. We consider either
power or throughput based costs of networking, and the cases of identical or
heterogeneous (independent) users/players. In a numerical study we consider
diverse players, and we see that the effects of altruism for similar players
can be beneficial in the presence of significant congestion, but excessive
altruism may lead to underuse of the channel when demand is low
- …