29 research outputs found
Recommended from our members
Analysis and improvement of medium access control protocols in wireless networks. Performance modelling and Quality-of-Service enhancement of IEEE 802.11e MAC in wireless local area networks under heterogeneous multimedia traffic.
In order to efficiently utilize the scarce wireless resource as well as keep up
with the ever-increasing demand for Quality-of-Service (QoS) of multimedia
applications, wireless networks are undergoing rapid development and dramatic
changes in the underlying technologies and protocols. The Medium Access Control
(MAC) protocol, which coordinates the channel access and data transmission of
wireless stations, plays a pivotal role in wireless networks.
Performance modelling and analysis has been and continues to be of great
theoretical and practical importance in the design and development of wireless
networks. This research is devoted to developing efficient and cost-effective
analytical tools for the performance analysis and enhancement of MAC protocols in
Wireless Local Area Networks (WLANs) under heterogeneous multimedia traffic.
To support the MAC-layer QoS in WLANs, the IEEE 802.11e Enhanced Distributed
Channel Access (EDCA) protocol has proposed three QoS differentiation schemes
in terms of Arbitrary Inter-Frame Space (AIFS), Contention Window (CW), and
Transmission Opportunity (TXOP). This research starts with the development of
new analytical models for the TXOP scheme specified in the EDCA protocol under
Poisson traffic. A dynamic TXOP scheme is then proposed to adjust the TXOP
limits according to the status of the transmission queue. Theoretical analysis and
simulation experiments show that the proposed dynamic scheme largely improves
the performance of TXOP. To evaluate the TXOP scheme in the presence of
ii
heterogeneous traffic, a versatile analytical model is developed to capture the traffic
heterogeneity and model the features of burst transmission. The performance results
highlight the importance of taking into account the heterogeneous traffic for the
accurate evaluation of the TXOP scheme in wireless multimedia networks.
To obtain a thorough and deep understanding of the performance attributes of
the EDCA protocol, a comprehensive analytical model is then proposed to
accommodate the integration of the three QoS schemes of EDCA in terms of AIFS,
CW, and TXOP under Poisson traffic. The performance results show that the TXOP
scheme can not only support service differentiation but also improve the network
performance, whereas the AIFS and CW schemes provide QoS differentiation only.
Moreover, the results demonstrate that the MAC buffer size has considerable impact
on the QoS performance of EDCA under Poisson traffic. To investigate the
performance of EDCA in wireless multimedia networks, an analytical model is
further developed for EDCA under heterogeneous traffic. The performance results
demonstrate the significant effects of heterogeneous traffic on the total delay and
frame losses of EDCA with different buffer sizes. Finally, an efficient admission
control scheme is presented for the IEEE 802.11e WLANs based on analytical
modelling and a game-theoretical approach. The admission control scheme can
maintain the system operation at an optimal point where the utility of the Access
Point (AP) is maximized with the QoS constraints of various users
Performance Modeling and Analysis of Wireless Local Area Networks with Bursty Traffic
The explosive increase in the use of mobile digital devices has posed great challenges in the design and implementation of Wireless Local Area Networks (WLANs). Ever-increasing demands for high-speed and ubiquitous digital communication have made WLANs an essential feature of everyday life. With audio and video forming the highest percentage of traffic generated by multimedia applications, a huge demand is placed for high speed WLANs that provide high Quality-of-Service (QoS) and can satisfy end user’s needs at a relatively low cost. Providing video and audio contents to end users at a satisfactory level with various channel quality and current battery capacities requires thorough studies on the properties of such traffic. In this regard, Medium Access Control (MAC) protocol of the 802.11 standard plays a vital role in the management and coordination of shared channel access and data transmission. Therefore, this research focuses on developing new efficient analytical models that evaluate the performance of WLANs and the MAC protocol in the presence of bursty, correlated and heterogeneous multimedia traffic using Batch Markovian Arrival Process (BMAP). BMAP can model the correlation between different packet size distributions and traffic rates while accurately modelling aggregated traffic which often possesses negative statistical properties.
The research starts with developing an accurate traffic generator using BMAP to capture the existing correlations in multimedia traffics. For validation, the developed traffic generator is used as an arrival process to a queueing model and is analyzed based on average queue length and mean waiting time. The performance of BMAP/M/1 queue is studied under various number of states and maximum batch sizes of BMAP. The results clearly indicate that any increase in the number of states of the underlying Markov Chain of BMAP or maximum batch size, lead to higher burstiness and correlation of the arrival process, prompting the speed of the queue towards saturation.
The developed traffic generator is then used to model traffic sources in IEEE 802.11 WLANs, measuring important QoS metrics of throughput, end-to-end delay, frame loss probability and energy consumption. Performance comparisons are conducted on WLANs under the influence of multimedia traffics modelled as BMAP, Markov Modulated Poisson Process and Poisson Process. The results clearly indicate that bursty traffics generated by BMAP demote network performance faster than other traffic sources under moderate to high loads.
The model is also used to study WLANs with unsaturated, heterogeneous and bursty traffic sources. The effects of traffic load and network size on the performance of WLANs are investigated to demonstrate the importance of burstiness and heterogeneity of traffic on accurate evaluation of MAC protocol in wireless multimedia networks.
The results of the thesis highlight the importance of taking into account the true characteristics of multimedia traffics for accurate evaluation of the MAC protocol in the design and analysis of wireless multimedia networks and technologies
End-to-End Delay Distribution Analysis for Stochastic Admission Control in Multi-hop Wireless Networks
published_or_final_versio
Design, Modeling, and Analysis for MAC Protocols in Ultra-wideband Networks
Ultra-wideband (UWB) is an appealing transmission technology for
short-range, bandwidth demanded wireless communications. With the
data rate of several hundred megabits per second, UWB demonstrates
great potential in supporting multimedia streams such as
high-definition television (HDTV), voice over Internet Protocol
(VoIP), and console gaming in office or home networks, known as the
wireless personal area network (WPAN). While vast research effort
has been made on the physical layer issues of UWB, the corresponding
medium access control (MAC) protocols that exploit UWB technology
have not been well developed.
Given an extremely wide bandwidth of UWB, a fundamental problem on
how to manage multiple users to efficiently utilize the bandwidth is
a MAC design issue. Without explicitly considering the physical
properties of UWB, existing MAC protocols are not optimized for
UWB-based networks. In addition, the limited processing capability
of UWB devices poses challenges to the design of low-complexity MAC
protocols. In this thesis, we comprehensively investigate the MAC
protocols for UWB networks. The objective is to link the physical
characteristics of UWB with the MAC protocols to fully exploit its
advantage. We consider two themes: centralized and distributed UWB
networks.
For centralized networks, the most critical issue surrounding the
MAC protocol is the resource allocation with fairness and quality of
service (QoS) provisioning. We address this issue by breaking down
into two scenarios: homogeneous and heterogeneous network
configurations. In the homogeneous case, users have the same
bandwidth requirement, and the objective of resource allocation is
to maximize the network throughput. In the heterogeneous case, users
have different bandwidth requirements, and the objective of resource
allocation is to provide differentiated services. For both design
objectives, the optimal scheduling problem is NP-hard. Our
contributions lie in the development of low-complexity scheduling
algorithms that fully exploit the characteristics of UWB.
For distributed networks, the MAC becomes node-based problems,
rather than link-based problems as in centralized networks. Each
node either contends for channel access or reserves transmission
opportunity through negotiation. We investigate two representative
protocols that have been adopted in the WiMedia specification for
future UWB-based WPANs. One is a contention-based protocol called
prioritized channel access (PCA), which employs the same mechanisms
as the enhanced distributed channel access (EDCA) in IEEE 802.11e
for providing differentiated services. The other is a
reservation-based protocol called distributed reservation protocol
(DRP), which allows time slots to be reserved in a distributed
manner. Our goal is to identify the capabilities of these two
protocols in supporting multimedia applications for UWB networks. To
achieve this, we develop analytical models and conduct detailed
analysis for respective protocols. The proposed analytical models
have several merits. They are accurate and provide close-form
expressions with low computational effort. Through a cross-layer
approach, our analytical models can capture the near-realistic
protocol behaviors, thus useful insights into the protocol can be
obtained to improve or fine-tune the protocol operations. The
proposed models can also be readily extended to incorporate more
sophisticated considerations, which should benefit future UWB
network design
Quality aspects of Internet telephony
Internet telephony has had a tremendous impact on how people communicate.
Many now maintain contact using some form of Internet telephony.
Therefore the motivation for this work has been to address the quality aspects
of real-world Internet telephony for both fixed and wireless telecommunication.
The focus has been on the quality aspects of voice communication,
since poor quality leads often to user dissatisfaction. The scope of the work
has been broad in order to address the main factors within IP-based voice
communication.
The first four chapters of this dissertation constitute the background
material. The first chapter outlines where Internet telephony is deployed
today. It also motivates the topics and techniques used in this research.
The second chapter provides the background on Internet telephony including
signalling, speech coding and voice Internetworking. The third chapter
focuses solely on quality measures for packetised voice systems and finally
the fourth chapter is devoted to the history of voice research.
The appendix of this dissertation constitutes the research contributions.
It includes an examination of the access network, focusing on how calls are
multiplexed in wired and wireless systems. Subsequently in the wireless
case, we consider how to handover calls from 802.11 networks to the cellular
infrastructure. We then consider the Internet backbone where most of our
work is devoted to measurements specifically for Internet telephony. The
applications of these measurements have been estimating telephony arrival
processes, measuring call quality, and quantifying the trend in Internet telephony
quality over several years. We also consider the end systems, since
they are responsible for reconstructing a voice stream given loss and delay
constraints. Finally we estimate voice quality using the ITU proposal PESQ
and the packet loss process.
The main contribution of this work is a systematic examination of Internet
telephony. We describe several methods to enable adaptable solutions
for maintaining consistent voice quality. We have also found that relatively
small technical changes can lead to substantial user quality improvements.
A second contribution of this work is a suite of software tools designed to
ascertain voice quality in IP networks. Some of these tools are in use within
commercial systems today
A Hardware Testbed for Measuring IEEE 802.11g DCF Performance
The Distributed Coordination Function (DCF) is the oldest and most widely-used IEEE 802.11 contention-based channel access control protocol. DCF adds a significant amount of overhead in the form of preambles, frame headers, randomised binary exponential back-off and inter-frame spaces. Having accurate and verified performance models for DCF is thus integral to understanding the performance of IEEE 802.11 as a whole. In this document DCF performance is measured subject to two different workload models using an IEEE 802.11g test bed.
Bianchi proposed the first accurate analytic model for measuring the performance of DCF. The model calculates normalised aggregate throughput as a function of the number of stations contending for channel access. The model also makes a number of assumptions about the system, including saturation conditions (all stations have a fixed-length packet to send at all times), full-connectivity between stations, constant collision probability and perfect channel conditions. Many authors have extended Bianchi's machine model to correct certain inconsistencies with the standard, while very few have considered alternative workload models. Owing to the complexities associated with prototyping, most models are verified against simulations and not experimentally using a test bed.
In addition to a saturation model we considered a more realistic workload model representing wireless Internet traffic. Producing a stochastic model for such a workload was a challenging task, as usage patterns change significantly between users and over time. We implemented and compared two Markov Arrival Processes (MAPs) for packet arrivals at each client - a Discrete-time Batch Markovian Arrival Process (D-BMAP) and a modified Hierarchical Markov Modulated Poisson Process (H-MMPP). Both models had parameters drawn from the same wireless trace data. It was found that, while the latter model exhibits better Long Range Dependency at the network level, the former represented traces more accurately at the client-level, which made it more appropriate for the test bed experiments.
A nine station IEEE 802.11 test bed was constructed to measure the real world performance of the DCF protocol experimentally. The stations used IEEE 802.11g cards based on the Atheros AR5212 chipset and ran a custom Linux distribution. The test bed was moved to a remote location where there was no measured risk of interference from neighbouring radio transmitters in the same band. The DCF machine model was fixed and normalised aggregate throughput was measured for one through to eight contending stations, subject to (i) saturation with fixed packet length equal to 1000 bytes, and (ii) the D-BMAP workload model for wireless Internet traffic. Control messages were forwarded on a separate wired backbone network so that they did not interfere with the experiments.
Analytic solver software was written to calculate numerical solutions for thee popular analytic models for DCF and compared the solutions to the saturation test bed experiments. Although the normalised aggregate throughput trends were the same, it was found that as the number of contending stations increases, so the measured aggregate DCF performance diverged from all three analytic model's predictions; for every station added to the network normalised aggregate throughput was measured lower than analytically predicted. We conclude that some property of the test bed was not captured by the simulation software used to verify the analytic models.
The D-BMAP experiments yielded a significantly lower normalised aggregate throughput than the saturation experiments, which is a clear result of channel underutilisation. Although this is a simple result, it highlights the importance of the traffic model on network performance. Normalised aggregate throughput appeared to scale more linearly when compared to the RTS/CTS access mechanism, but no firm conclusion could be drawn at 95% confidence. We conclude further that, although normalised aggregate throughput is appropriate for describing overall channel utilisation in the steady state, jitter, response time and error rate are more important performance metrics in the case of bursty traffic
Recommended from our members
Performance modelling and evaluation of heterogeneous wired / wireless networks under Bursty Traffic. Analytical models for performance analysis of communication networks in multi-computer systems, multi-cluster systems, and integrated wireless systems.
Computer networks can be classified into two broad categories: wired networks and
wireless networks, according to the hardware and software technologies used to
interconnect the individual devices. Wired interconnection networks are hardware
fabrics supporting communications between individual processors in highperformance
computing systems (e.g., multi-computer systems and cluster systems).
On the other hand, due to the rapid development of wireless technologies, wireless
networks have emerged and become an indispensable part for people¿s lives. The
integration of different wireless technologies is an effective approach to
accommodate the increasing demand of the users to communicate with each other
and access the Internet.
This thesis aims to investigate the performance of wired interconnection
networks and integrated wireless networks under the realistic working conditions.
Traffic patterns have a significant impact on network performance. A number of
recent measurement studies have convincingly demonstrated that the traffic
generated by many real-world applications in communication networks exhibits
bursty arrival nature and the message destinations are non-uniformly distributed.
Analytical models for the performance evaluation of wired interconnection networks
and integrated wireless networks have been widely reported. However, most of these
models are developed under the simplified assumption of non-bursty Poisson process
with uniformly distributed message destinations.
To fill this gap, this thesis first presents an analytical model to investigate the
performance of wired interconnection networks in multi-computer systems. Secondly,
the analytical models for wired interconnection networks in multi-cluster systems are
developed. Finally, this thesis proposes analytical models to evaluate the end-to-end
delay and throughput of integrated wireless local area networks and wireless mesh
networks. These models are derived when the networks are subject to bursty traffic
with non-uniformly distributed message destinations which can capture the
burstiness of real-world network traffic in the both temporal domain and spatial
domain. Extensive simulation experiments are conducted to validate the accuracy of
the analytical models. The models are then used as practical and cost-effective tools
to investigate the performance of heterogeneous wired or wireless networks under
the traffic patterns exhibited by real-world applications
Network-Layer Resource Allocation for Wireless Ad Hoc Networks
This thesis contributes toward the design of a quality-of-service (QoS) aware network layer for wireless ad hoc networks. With the lack of an infrastructure in ad hoc networks, the role of the network layer is not only to perform multihop routing between a source node and a destination node, but also to establish an end-to-end connection between communicating peers that satisfies the service level requirements of multimedia applications running on those peers.
Wireless ad hoc networks represent autonomous distributed systems that are infrastructure-less, fully distributed, and multi-hop in nature. Over the last few years, wireless ad hoc networks have attracted significant attention from researchers. This has been fueled by recent technological advances in the development of multifunction and low-cost wireless communication gadgets. Wireless ad hoc networks have diverse applications spanning several domains, including military, commercial, medical, and home networks. Projections indicate that these self-organizing wireless ad hoc networks will eventually become the dominant form of the architecture of telecommunications networks in the near future. Recently, due to increasing popularity of multimedia applications, QoS support in wireless ad hoc networks has become an important yet challenging objective. The challenge lies in the need to support the heterogeneous QoS requirements (e.g., data rate, packet loss probability, and delay constraints) for multimedia applications and, at the same time, to achieve efficient radio resource utilization, taking into account user mobility and dynamics of multimedia traffic.
In terms of research contributions, we first present a position-based QoS routing framework for wireless ad-hoc networks. The scheme provides QoS guarantee in terms of packet loss ratio and average end-to-end delay (or throughput) to ad hoc networks loaded with constant rate traffic. Via cross-layer design, we apply call admission control and temporary bandwidth reservation on discovered routes, taking into consideration the physical layer multi-rate capability and the medium access control (MAC) interactions such as simultaneous transmission and self interference from route members.
Next, we address the network-layer resource allocation where a single-hop ad hoc network is loaded with random traffic. As a starting point, we study the behavior of the service process of the widely deployed IEEE 802.11 DCF MAC when the network is under different traffic load conditions. Our study investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets successfully transmitted by any node over a time interval follows a general distribution, which is close to a Poisson distribution with an upper bounded distribution distance. We also show that the service time distribution can be approximated by the geometric distribution and illustrate that a simplified queuing system can be used efficiently as a resource allocation tool for single hop IEEE 802.11 ad hoc networks near saturation.
After that, we shift our focus to providing probabilistic packet delay guarantee to multimedia users in non-saturated IEEE 802.11 single hop ad hoc networks. We propose a novel stochastic link-layer channel model to characterize the variations of the IEEE 802.11 channel service process. We use the model to calculate the effective capacity of the IEEE 802.11 channel. The channel effective capacity concept is the dual of the effective bandwidth theory. Our approach offers a tool for distributed statistical resource allocation in single hop ad hoc networks, which combines both efficient resource utilization and QoS provisioning to a certain probabilistic limit.
Finally, we propose a statistical QoS routing scheme for multihop IEEE 802.11 ad hoc networks. Unlike most of QoS routing schemes in literature, the proposed scheme provides stochastic end-to-end delay guarantee, instead of average delay guarantee, to delay-sensitive bursty traffic sources. Via a cross-layer design approach, the scheme selects the routes based on a geographical on-demand ad hoc routing protocol and checks the availability of network resources by using traffic source and link-layer channel models, incorporating the IEEE 802.11 characteristics and interaction. Our scheme extends the well developed effective bandwidth theory and its dual effective capacity concept to multihop IEEE 802.11 ad hoc networks in order to achieve an efficient utilization of the shared radio channel while satisfying the end-to-end delay bound
Recommended from our members
Design and optimization of QoS-based medium access control protocols for next-generation wireless LANs
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In recent years, there have been tremendous advances in wireless & mobile communications, including wireless radio techniques, networking protocols, and mobile devices. It is expected that different
broadband wireless access technologies, e.g., WiFi (IEEE 802.11) and WiMAX (IEEE 802.16) will coexist in the future. In the meantime, multimedia applications have experienced an explosive growth with increasing user demands. Nowadays, people expect to receive high-speed video, audio, voice and web services even when being mobile. The key question that needs to be answered, then, is how do we ensure that users always have the "best" network performance with the "lowest" costs in such complicated situations? The latest IEEE 802.11n standards attains rates of more than 100 Mbps by introducing innovative enhancements at the PHY and MAC layer, e.g. MIMO and Frame Aggregation, respectively. However, in this thesis we demonstrate that frame aggregation's performance adheres due to the EDCA scheduler's priority mechanism and consequently resulting in the network's poor overall performance. Short waiting times for high priority flows into the aggregation queue resolves to poor channel utilization. A Delayed Channel Access algorithm was designed to intentionally postpone the channel access procedure so that the number of packets in a formed frame can be increased and so will the network's overall performance. However, in some cases, the DCA algorithm has a negative impact on the applications that utilize the TCP protocol, especially the when small TCP window sizes are engaged. So, the TCP process starts to refrain from sending data due to delayed acknowledgements and the overall throughput drops. In this thesis, we address the above issues by firstly demonstrating the potential performance benefits of frame aggregation over the next generation wireless networks. The efficiency and behaviour of frame aggregation within a single queue, are mathematically analysed with the aid of a M=G[a;b]=1=K model. Results show that a trade-off choice has to be taken into account over minimizing the waiting time or maximizing utilization. We also point out that there isn't an optimum batch collection rule which can be assumed as generally valid but individual cases have to be considered separately. Secondly, we demonstrate through extensive simulations that by introducing a method, the DCA algorithm, which dynamically determines and adapts batch collections based upon the traffic's characteristics, QoS requirements
and server's maximum capacity, also improves e ciency. Thirdly, it is important to understand the behaviour of the TCP
ows over the WLAN and the influence that DCA has over the degrading performance of the TCP protocol. We investigate the cause of the problem and provide the foundations of designing and implementing possible solutions. Fourthly, we introduce two innovative proposals, one amendment and one extension to the original DCA algorithm, called Adaptive DCA and Selective DCA, respectively. Both solutions have been implemented in OPNET and extensive simulation runs over a wide set of scenarios show their effectiveness over the network's overall performance, each in its own way.This study was supported by the Engineering and Physical Sciences Research Council (EPSRC)