9,835 research outputs found
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
Toward Reliable Contention-aware Data Dissemination in Multi-hop Cognitive Radio Ad Hoc Networks
This paper introduces a new channel selection strategy for reliable
contentionaware data dissemination in multi-hop cognitive radio network. The
key challenge here is to select channels providing a good tradeoff between
connectivity and contention. In other words, channels with good opportunities
for communication due to (1) low primary radio nodes (PRs) activities, and (2)
limited contention of cognitive ratio nodes (CRs) acceding that channel, have
to be selected. Thus, by dynamically exploring residual resources on channels
and by monitoring the number of CRs on a particular channel, SURF allows
building a connected network with limited contention where reliable
communication can take place. Through simulations, we study the performance of
SURF when compared with three other related approaches. Simulation results
confirm that our approach is effective in selecting the best channels for
efficient and reliable multi-hop data dissemination
CMD: A Multi-Channel Coordination Scheme for Emergency Message Dissemination in IEEE 1609.4
In the IEEE 1609.4 legacy standard for multi-channel communications in
vehicular ad hoc networks(VANETs), the control channel (CCH) is dedicated to
broadcast safety messages while the service channels (SCH's) are dedicated to
transmit infotainment service content. However, the SCH can be used as an
alternative to transmit high priority safety messages in the event that they
are invoked during the service channel interval (SCHI). This implies that there
is a need to transmit safety messages across multiple available utilized
channels to ensure that all vehicles receive the safety message. Transmission
across multiple SCH's using the legacy IEEE 1609.4 requires multiple channel
switching and therefore introduces further end-to-end delays. Given that safety
messaging is a life critical application, it is important that optimal
end-to-end delay performance is derived in multi-channel VANET scenarios to
ensure reliable safety message dissemination. To tackle this challenge, three
primary contributions are in this article: first, a channel coordinator
selection approach based on the least average separation distance (LAD) to the
vehicles that expect to tune to other SCH's and operates during the control
channel interval (CCHI) is proposed. Second, a model to determine the optimal
time intervals in which CMD operates during the CCHI is proposed. Third, a
contention back-off mechanism for safety message transmission during the SCHI
is proposed. Computer simulations and mathematical analysis show that CMD
performs better than the legacy IEEE 1609.4 and a selected state-of-the-art
multi-channel message dissemination schemes in terms of end-to-end delay and
packet reception ratio.Comment: 15 pages, 10 figures, 7 table
Goodbye, ALOHA!
©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft
DMT Optimal Cooperative Protocols with Destination-Based Selection of the Best Relay
We design a cooperative protocol in the context of wireless mesh networks in order to increase the reliability of wireless links. Destination terminals ask for cooperation when they fail in decoding data frames transmitted by source terminals. In that case, each destination terminal D calls a specific relay terminal B with a signaling frame to help its transmission with source terminal S. To select appropriate relays, destination terminals maintain tables of relay terminals, one for each possible source address. These tables are constituted by passively overhearing ongoing transmissions. Hence, when cooperation is needed between S and D, and when a relay B is found by terminal D in the relay table associated with terminal S, the destination terminal sends a negative acknowledgment frame that contains the address of B. When the best relay B has successfully decoded the source message, it sends a copy of the data frame to D using a selective decode-andforward transmission scheme. The on-demand approach allows maximization of the spatial multiplexing gain and the cooperation of the best relay allows maximization of the spatial diversity order. Hence, the proposed protocol achieves optimal diversitymultiplexing trade-off performance. Moreover, this performance is achieved through a collision-free selection process
- …