20,092 research outputs found
A survey of self organisation in future cellular networks
This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks
Recommended from our members
Multimedia delivery in the future internet
The term âNetworked Mediaâ implies that all kinds of media including text, image, 3D graphics, audio
and video are produced, distributed, shared, managed and consumed on-line through various networks,
like the Internet, Fiber, WiFi, WiMAX, GPRS, 3G and so on, in a convergent manner [1]. This white
paper is the contribution of the Media Delivery Platform (MDP) cluster and aims to cover the Networked
challenges of the Networked Media in the transition to the Future of the Internet.
Internet has evolved and changed the way we work and live. End users of the Internet have been confronted
with a bewildering range of media, services and applications and of technological innovations concerning
media formats, wireless networks, terminal types and capabilities. And there is little evidence that the pace
of this innovation is slowing. Today, over one billion of users access the Internet on regular basis, more
than 100 million users have downloaded at least one (multi)media file and over 47 millions of them do so
regularly, searching in more than 160 Exabytes1 of content. In the near future these numbers are expected
to exponentially rise. It is expected that the Internet content will be increased by at least a factor of 6, rising
to more than 990 Exabytes before 2012, fuelled mainly by the users themselves. Moreover, it is envisaged
that in a near- to mid-term future, the Internet will provide the means to share and distribute (new)
multimedia content and services with superior quality and striking flexibility, in a trusted and personalized
way, improving citizensâ quality of life, working conditions, edutainment and safety.
In this evolving environment, new transport protocols, new multimedia encoding schemes, cross-layer inthe
network adaptation, machine-to-machine communication (including RFIDs), rich 3D content as well as
community networks and the use of peer-to-peer (P2P) overlays are expected to generate new models of
interaction and cooperation, and be able to support enhanced perceived quality-of-experience (PQoE) and
innovative applications âon the moveâ, like virtual collaboration environments, personalised services/
media, virtual sport groups, on-line gaming, edutainment. In this context, the interaction with content
combined with interactive/multimedia search capabilities across distributed repositories, opportunistic P2P
networks and the dynamic adaptation to the characteristics of diverse mobile terminals are expected to
contribute towards such a vision.
Based on work that has taken place in a number of EC co-funded projects, in Framework Program 6 (FP6)
and Framework Program 7 (FP7), a group of experts and technology visionaries have voluntarily
contributed in this white paper aiming to describe the status, the state-of-the art, the challenges and the way
ahead in the area of Content Aware media delivery platforms
On the security of software-defined next-generation cellular networks
In the recent years, mobile cellular networks are ndergoing fundamental changes and many established concepts are being revisited. Future 5G network architectures will be designed to employ a wide range of new and emerging technologies such as Software Defined Networking (SDN) and Network Functions Virtualization (NFV). These create new virtual network elements each affecting the logic of the network management and operation, enabling the creation of new generation services with substantially higher data rates and lower delays. However, new security challenges and threats are also introduced. Current Long-Term Evolution (LTE) networks are not able to accommodate these new trends in a secure and reliable way. At the same time, novel 5G systems have proffered invaluable opportunities of developing novel solutions for attack prevention, management, and recovery. In this paper, first we discuss the main security threats and possible attack vectors in cellular networks. Second, driven by the emerging next-generation cellular networks, we discuss the architectural and functional requirements to enable
appropriate levels of security
Multipath routing and QoS provisioning in mobile ad hoc networks
PhDA Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can
communicate with each other using multihop wireless links without utilizing any
fixed based-station infrastructure and centralized management. Each mobile node
in the network acts as both a host generating flows or being destination of flows
and a router forwarding flows directed to other nodes.
Future applications of MANETs are expected to be based on all-IP
architecture and be capable of carrying multitude real-time multimedia
applications such as voice and video as well as data. It is very necessary for
MANETs to have an efficient routing and quality of service (QoS) mechanism to
support diverse applications.
This thesis proposes an on-demand Node-Disjoint Multipath Routing protocol
(NDMR) with low broadcast redundancy. Multipath routing allows the
establishment of multiple paths between a single source and single destination
node. It is also beneficial to avoid traffic congestion and frequent link breaks in
communication because of the mobility of nodes. The important components of
the protocol, such as path accumulation, decreasing routing overhead and
selecting node-disjoint paths, are explained. Because the new protocol
significantly reduces the total number of Route Request packets, this results in an
increased delivery ratio, smaller end-to-end delays for data packets, lower control
overhead and fewer collisions of packets.
Although NDMR provides node-disjoint multipath routing with low route
overhead in MANETs, it is only a best-effort routing approach, which is not
enough to support QoS. DiffServ is a standard approach for a more scalable way
to achieve QoS in any IP network and could potentially be used to provide QoS
in MANETs because it minimises the need for signalling. However, one of the
biggest drawbacks of DiffServ is that the QoS provisioning is separate from the
routing process. This thesis presents a Multipath QoS Routing protocol for
iv
supporting DiffServ (MQRD), which combines the advantages of NDMR and
DiffServ. The protocol can classify network traffic into different priority levels
and apply priority scheduling and queuing management mechanisms to obtain
QoS guarantees
Coalition Formation Games for Collaborative Spectrum Sensing
Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in
cognitive networks exhibits an inherent tradeoff between minimizing the
probability of missing the detection of the primary user (PU) and maintaining a
reasonable false alarm probability (e.g., for maintaining a good spectrum
utilization). In this paper, we study the impact of this tradeoff on the
network structure and the cooperative incentives of the SUs that seek to
cooperate for improving their detection performance. We model the CSS problem
as a non-transferable coalitional game, and we propose distributed algorithms
for coalition formation. First, we construct a distributed coalition formation
(CF) algorithm that allows the SUs to self-organize into disjoint coalitions
while accounting for the CSS tradeoff. Then, the CF algorithm is complemented
with a coalitional voting game for enabling distributed coalition formation
with detection probability guarantees (CF-PD) when required by the PU. The
CF-PD algorithm allows the SUs to form minimal winning coalitions (MWCs), i.e.,
coalitions that achieve the target detection probability with minimal costs.
For both algorithms, we study and prove various properties pertaining to
network structure, adaptation to mobility and stability. Simulation results
show that CF reduces the average probability of miss per SU up to 88.45%
relative to the non-cooperative case, while maintaining a desired false alarm.
For CF-PD, the results show that up to 87.25% of the SUs achieve the required
detection probability through MWCComment: IEEE Transactions on Vehicular Technology, to appea
- âŠ