13 research outputs found
Temporal starvation in multi-channel CSMA networks: an analytical framework
In this paper we consider a stochastic model for a frequency-agile CSMA
protocol for wireless networks where multiple orthogonal frequency channels are
available. Even when the possible interference on the different channels is
described by different conflict graphs, we show that the network dynamics can
be equivalently described as that of a single-channel CSMA algorithm on an
appropriate virtual network. Our focus is on the asymptotic regime in which the
network nodes try to activate aggressively in order to achieve maximum
throughput. Of particular interest is the scenario where the number of
available channels is not sufficient for all nodes of the network to be
simultaneously active and the well-studied temporal starvation issues of the
single-channel CSMA dynamics persist. For most networks we expect that a larger
number of available channels should alleviate these temporal starvation issues.
However, we prove that the aggregate throughput is a non-increasing function of
the number of available channels. To investigate this trade-off that emerges
between aggregate throughput and temporal starvation phenomena, we propose an
analytical framework to study the transient dynamics of multi-channel CSMA
networks by means of first hitting times. Our analysis further reveals that the
mixing time of the activity process does not always correctly characterize the
temporal starvation in the multi-channel scenario and often leads to
pessimistic performance estimates.Comment: 15 pages, 4 figures. Accepted for publication at IFIP Performance
Conference 201
Temporal starvation in multi-channel CSMA networks: an analytical framework
In this paper, we consider a stochastic model for a frequency-agile CSMA protocol for wireless networks where multiple orthogonal frequency channels are available. Even when the possible interference on the different channels is described by different conflict graphs, we show that the network dynamics can be equivalently described as that of a single-channel CSMA algorithm on an appropriate virtual network. Our focus is on the asymptotic regime in which the network nodes try to activate aggressively in order to achieve maximum throughput. Of particular interest is the scenario where the number of available channels is not sufficient for all nodes of the network to be simultaneously active and the well-studied temporal starvation issues of the single-channel CSMA dynamics persist. For most networks, we expect that a larger number of available channels should alleviate these temporal starvation issues. However, we prove that the aggregate throughput is a non-increasing function of the number of available channels. To investigate this trade-off that emerges between aggregate throughput and temporal starvation phenomena, we propose an analytic framework to study the transient dynamics of multi-channel CSMA networks by means of first hitting times. Our analysis further reveals that the mixing time of the activity process does not always correctly characterize the temporal starvation in the multi-channel scenario and often leads to pessimistic performance estimates
Optimal CSMA-based Wireless Communication with Worst-case Delay and Non-uniform Sizes
Carrier Sense Multiple Access (CSMA) protocols have been shown to reach the
full capacity region for data communication in wireless networks, with
polynomial complexity. However, current literature achieves the throughput
optimality with an exponential delay scaling with the network size, even in a
simplified scenario for transmission jobs with uniform sizes. Although CSMA
protocols with order-optimal average delay have been proposed for specific
topologies, no existing work can provide worst-case delay guarantee for each
job in general network settings, not to mention the case when the jobs have
non-uniform lengths while the throughput optimality is still targeted. In this
paper, we tackle on this issue by proposing a two-timescale CSMA-based data
communication protocol with dynamic decisions on rate control, link scheduling,
job transmission and dropping in polynomial complexity. Through rigorous
analysis, we demonstrate that the proposed protocol can achieve a throughput
utility arbitrarily close to its offline optima for jobs with non-uniform sizes
and worst-case delay guarantees, with a tradeoff of longer maximum allowable
delay
Performance Optimization in Wireless Local Area Networks
Wireless Local Area Networks (WLAN) are becoming more and more important
for providing wireless broadband access. Applications and networking
scenarios evolve continuously and in an unpredictable way, attracting the
attention of academic institutions, research centers and industry. For designing
an e cient WLAN is necessary to carefully plan coverage and to
optimize the network design parameters, such as AP locations, channel assignment,
power allocation, MAC protocol, routing algorithm, etc... In this
thesis we approach performance optimization in WLAN at di erent layer
of the OSI model. Our rst approach is at Network layer. Starting from
a Hybrid System modeling the
ow of tra c in the network, we propose a
Hybrid Linear Varying Parameter algorithm for identifying the link quality
that could be used as metric in routing algorithms. Go down to Data Link,
it is well known that CSMA (Carrier Sense Multiple Access) protocols exhibit
very poor performance in case of multi-hop transmissions, because of
inter-link interference due to imperfect carrier sensing. We propose two novel
algorithms, that are combining Time Division Multiple Access for grouping
contending nodes in non-interfering sets with Carrier Sense Multiple Access
for managing the channel access behind a set. In the rst solution, a game
theoretical study of intra slot contention is introduced, in the second solution
we apply an optimization algorithm to nd the optimal degree between
contention and scheduling. Both the presented solutions improve the network
performance with respect to CSMA and TDMA algorithms. Finally we
analyze the network performance at Physical Layer. In case of WLAN, we
can only use three orthogonal channels in an unlicensed spectrum, so the frequency
assignments should be subject to frequent adjustments, according to
the time-varying amount of interference which is not under the control of the
provider. This problem make necessary the introduction of an automatic network
planning solution, since a network administrator cannot continuously
monitor and correct the interference conditions su ered in the network. We
propose a novel protocol based on a distributed machine learning mechanism
in which the nodes choose, automatically and autonomously in each time
slot, the optimal channel for transmitting through a weighted combination
of protocols
Recent Trends in Communication Networks
In recent years there has been many developments in communication technology. This has greatly enhanced the computing power of small handheld resource-constrained mobile devices. Different generations of communication technology have evolved. This had led to new research for communication of large volumes of data in different transmission media and the design of different communication protocols. Another direction of research concerns the secure and error-free communication between the sender and receiver despite the risk of the presence of an eavesdropper. For the communication requirement of a huge amount of multimedia streaming data, a lot of research has been carried out in the design of proper overlay networks. The book addresses new research techniques that have evolved to handle these challenges
Timing Signals and Radio Frequency Distribution Using Ethernet Networks for High Energy Physics Applications
Timing networks are used around the world in various applications from telecommunications systems to industrial processes, and from radio astronomy to high energy physics. Most timing networks are implemented using proprietary technologies at high operation and maintenance costs. This thesis presents a novel timing network capable of distributed timing with subnanosecond accuracy. The network, developed at CERN and codenamed “White- Rabbit”, uses a non-dedicated Ethernet link to distribute timing and data packets without infringing the sub-nanosecond timing accuracy required for high energy physics applications. The first part of this thesis proposes a new digital circuit capable of measuring time differences between two digital clock signals with sub-picosecond time resolution. The proposed digital circuit measures and compensates for the phase variations between the transmitted and received network clocks required to achieve the sub-nanosecond timing accuracy. Circuit design, implementation and performance verification are reported. The second part of this thesis investigates and proposes a new method to distribute radio frequency (RF) signals over Ethernet networks. The main goal of existing distributed RF schemes, such as Radio-Over-Fibre or Digitised Radio-Over-Fibre, is to increase the bandwidth capacity taking advantage of the higher performance of digital optical links. These schemes tend to employ dedicated and costly technologies, deemed unnecessary for applications with lower bandwidth requirements. This work proposes the distribution of RF signals over the “White-Rabbit” network, to convey phase and frequency information from a reference base node to a large numbers of remote nodes, thus achieving high performance and cost reduction of the timing network. Hence, this thesis reports the design and implementation of a new distributed RF system architecture; analysed and tested using a purpose-built simulation environment, with results used to optimise a new bespoke FPGA implementation. The performance is evaluated through phase-noise spectra, the Allan-Variance, and signalto- noise ratio measurements of the distributed signals
Building the Future Internet through FIRE
The Internet as we know it today is the result of a continuous activity for improving network communications, end user services, computational processes and also information technology infrastructures. The Internet has become a critical infrastructure for the human-being by offering complex networking services and end-user applications that all together have transformed all aspects, mainly economical, of our lives. Recently, with the advent of new paradigms and the progress in wireless technology, sensor networks and information systems and also the inexorable shift towards everything connected paradigm, first as known as the Internet of Things and lately envisioning into the Internet of Everything, a data-driven society has been created. In a data-driven society, productivity, knowledge, and experience are dependent on increasingly open, dynamic, interdependent and complex Internet services. The challenge for the Internet of the Future design is to build robust enabling technologies, implement and deploy adaptive systems, to create business opportunities considering increasing uncertainties and emergent systemic behaviors where humans and machines seamlessly cooperate
Recommended from our members
ReSCon '12, Research Student Conference: Book of Abstracts
The fifth SED Research Student Conference (ReSCon2012) was hosted over three days, 18-20 June 2012, in the Hamilton Centre at Brunel University. The conference consisted of 130 oral and 70 poster presentations, based on the high quality and diverse research being conducted within the School of Engineering and Design by postgraduate research students. The conference is held annually, and ReSCon plays a key role in contributing to research and innovations within the School