8,953 research outputs found
Cellular-Broadcast Service Convergence through Caching for CoMP Cloud RANs
Cellular and Broadcast services have been traditionally treated independently
due to the different market requirements, thus resulting in different business
models and orthogonal frequency allocations. However, with the advent of cheap
memory and smart caching, this traditional paradigm can converge into a single
system which can provide both services in an efficient manner. This paper
focuses on multimedia delivery through an integrated network, including both a
cellular (also known as unicast or broadband) and a broadcast last mile
operating over shared spectrum. The subscribers of the network are equipped
with a cache which can effectively create zero perceived latency for multimedia
delivery, assuming that the content has been proactively and intelligently
cached. The main objective of this work is to establish analytically the
optimal content popularity threshold, based on a intuitive cost function. In
other words, the aim is to derive which content should be broadcasted and which
content should be unicasted. To facilitate this, Cooperative Multi- Point
(CoMP) joint processing algorithms are employed for the uni and broad-cast PHY
transmissions. To practically implement this, the integrated network controller
is assumed to have access to traffic statistics in terms of content popularity.
Simulation results are provided to assess the gain in terms of total spectral
efficiency. A conventional system, where the two networks operate
independently, is used as benchmark.Comment: Submitted to IEEE PIMRC 201
Neighbour coverage: a dynamic probabilistic route discovery for mobile ad hoc networks
Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput
Proactive Highly Ambulatory Sensor Routing (PHASeR) protocol for mobile wireless sensor networks
This paper presents a novel multihop routing protocol for mobile wireless sensor networks called PHASeR (Proactive Highly Ambulatory Sensor Routing). The proposed protocol
uses a simple hop-count metric to enable the dynamic and robust routing of data towards the sink in mobile environments. It is motivated by the application of radiation mapping by unmanned vehicles, which requires the reliable and timely delivery of regular measurements to the sink. PHASeR maintains a gradient metric in mobile environments by using a global TDMA MAC layer. It also uses the technique of blind forwarding to pass messages through the network in a multipath manner. PHASeR is analysed mathematically based on packet delivery ratio, average packet delay, throughput and overhead. It is then simulated with varying mobility, scalability and traffic loads. The protocol gives good results over all measures, which suggests that it may also be suitable for a wider array of emerging applications
The Raincore Distributed Session Service for Networking Elements
Motivated by the explosive growth of the Internet, we study efficient and fault-tolerant distributed session layer
protocols for networking elements. These protocols are
designed to enable a network cluster to share the state
information necessary for balancing network traffic and
computation load among a group of networking elements.
In addition, in the presence of failures, they allow
network traffic to fail-over from failed networking
elements to healthy ones. To maximize the overall
network throughput of the networking cluster, we assume a unicast communication medium for these protocols. The Raincore Distributed Session Service is based on a fault-tolerant token protocol, and provides group membership, reliable multicast and mutual exclusion services in a networking environment. We show that this service provides atomic reliable multicast with consistent ordering. We also show that Raincore token protocol consumes less overhead than a broadcast-based protocol in this environment in terms of CPU task-switching. The Raincore technology was transferred to Rainfinity, a startup company that is focusing on software for Internet reliability and performance. Rainwall, Rainfinity’s first product, was developed using the Raincore Distributed Session Service. We present initial performance results of the Rainwall product that validates our design assumptions and goals
- …