23,867 research outputs found
Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks
Multi-channel multi-interface Wireless Mesh Networks permit to spread the
load across orthogonal channels to improve network capacity. Although broadcast
is vital for many layer-3 protocols, proposals for taking advantage of multiple
channels mostly focus on unicast transmissions. In this paper, we propose
broadcast algorithms that fit any channel and interface assignment strategy.
They guarantee that a broadcast packet is delivered with a minimum probability
to all neighbors. Our simulations show that the proposed algorithms efficiently
limit the overhead
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks
Soaring capacity and coverage demands dictate that future cellular networks
need to soon migrate towards ultra-dense networks. However, network
densification comes with a host of challenges that include compromised energy
efficiency, complex interference management, cumbersome mobility management,
burdensome signaling overheads and higher backhaul costs. Interestingly, most
of the problems, that beleaguer network densification, stem from legacy
networks' one common feature i.e., tight coupling between the control and data
planes regardless of their degree of heterogeneity and cell density.
Consequently, in wake of 5G, control and data planes separation architecture
(SARC) has recently been conceived as a promising paradigm that has potential
to address most of aforementioned challenges. In this article, we review
various proposals that have been presented in literature so far to enable SARC.
More specifically, we analyze how and to what degree various SARC proposals
address the four main challenges in network densification namely: energy
efficiency, system level capacity maximization, interference management and
mobility management. We then focus on two salient features of future cellular
networks that have not yet been adapted in legacy networks at wide scale and
thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and
device-to-device (D2D) communications. After providing necessary background on
CoMP and D2D, we analyze how SARC can particularly act as a major enabler for
CoMP and D2D in context of 5G. This article thus serves as both a tutorial as
well as an up to date survey on SARC, CoMP and D2D. Most importantly, the
article provides an extensive outlook of challenges and opportunities that lie
at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201
Spectrum sharing models in cognitive radio networks
Spectrum scarcity demands thinking new ways to
manage the distribution of radio frequency bands so that its use is more effective. The emerging technology that can enable this paradigm shift is the cognitive radio. Different models for
organizing and managing cognitive radios have emerged, all with specific strategic purposes. In this article we review the allocation spectrum patterns of cognitive radio networks and
analyse which are the common basis of each model.We expose the vulnerabilities and open challenges that still threaten the adoption
and exploitation of cognitive radios for open civil networks.L'escassetat de demandes d'espectre fan pensar en noves formes de gestionar la distribució de les bandes de freqüència de ràdio perquè el seu ús sigui més efectiu. La tecnologia emergent que pot permetre aquest canvi de paradigma és la ràdio cognitiva. Han sorgit diferents models d'organització i gestió de les ràdios cognitives, tots amb determinats fins estratègics. En aquest article es revisen els patrons d'assignació de l'espectre de les xarxes de ràdio cognitiva i s'analitzen quals són la base comuna de cada model. S'exposen les vulnerabilitats i els desafiaments oberts que segueixen amenaçant l'adopció i l'explotació de les ràdios cognitives per obrir les xarxes civils.La escasez de demandas de espectro hacen pensar en nuevas formas de gestionar la distribución de las bandas de frecuencia de radio para que su uso sea más efectivo. La tecnología emergente que puede permitir este cambio de paradigma es la radio cognitiva. Han surgido diferentes modelos de organización y gestión de las radios cognitivas, todos con determinados fines estratégicos. En este artículo se revisan los patrones de asignación del espectro de las redes de radio cognitiva y se analizan cuales son la base común de cada modelo. Se exponen las vulnerabilidades y los desafíos abiertos que siguen amenazando la adopción y la explotación de las radios cognitivas para abrir las redes civiles
A Taxonomy for Congestion Control Algorithms in Vehicular Ad Hoc Networks
One of the main criteria in Vehicular Ad hoc Networks (VANETs) that has
attracted the researchers' consideration is congestion control. Accordingly,
many algorithms have been proposed to alleviate the congestion problem,
although it is hard to find an appropriate algorithm for applications and
safety messages among them. Safety messages encompass beacons and event-driven
messages. Delay and reliability are essential requirements for event-driven
messages. In crowded networks where beacon messages are broadcasted at a high
number of frequencies by many vehicles, the Control Channel (CCH), which used
for beacons sending, will be easily congested. On the other hand, to guarantee
the reliability and timely delivery of event-driven messages, having a
congestion free control channel is a necessity. Thus, consideration of this
study is given to find a solution for the congestion problem in VANETs by
taking a comprehensive look at the existent congestion control algorithms. In
addition, the taxonomy for congestion control algorithms in VANETs is presented
based on three classes, namely, proactive, reactive and hybrid. Finally, we
have found the criteria in which fulfill prerequisite of a good congestion
control algorithm
- …