Abstract: The customers use the best compromise criterion
between price and quality of service (QoS) to select or change
their Service Provider (SP). The SPs share the same market and
are competing to attract more customers to gain more profit. Due
to the divergence of SPs interests, we believe that this situation is a
non-cooperative game of price and QoS. The game converges to an
equilibrium position known Nash Equilibrium (NE). In this work, we
formulate a game theoretic framework for the dynamical behaviors
of SPs. We use Genetic Algorithms (GAs) to find the price and
QoS strategies that maximize the profit for each SP and illustrate
the corresponding strategy in NE. In order to quantify how this NE
point is performant, we perform a detailed analysis of the price of
anarchy induced by the NE solution. Finally, we provide an extensive
numerical study to point out the importance of considering price and
QoS as a joint decision parameter.
Abstract: The emerging Cognitive Radio is combo of both the
technologies i.e. Radio dynamics and software technology. It involve
wireless system with efficient coding, designing, and making them
artificial intelligent to take the decision according to the surrounding
environment and adopt themselves accordingly, so as to deliver the
best QoS. This is the breakthrough from fixed hardware and fixed
utilization of the spectrum. This software-defined approach of
research is centralized at user-definition and application driven
model, various software method are used for the optimization of the
wireless communication. This paper focused on the Spectrum
allocation technique using genetic algorithm GA to evolve radio,
represented by chromosomes. The chromosomes gene represents the
adjustable parameters in given radio and by using GA, evolving over
the generations, the optimized set of parameters are evolved, as per
the requirement of user and availability of the spectrum, in our
prototype the gene consist of 6 different parameters, and the best set
of parameters are evolved according to the application need and
availability of the spectrum holes and thus maintaining best QoS for
user, simultaneously maintaining licensed user rights. The analyzing
tool Matlab is used for the performance of the prototype.
Abstract: The aim of this paper is to propose a novel technique
to guarantee Quality of Service (QoS) in a highly dynamic
environment. The MANET changes its topology dynamically as the
nodes are moved frequently. This will cause link failure between
mobile nodes. MANET cannot ensure reliability without delay. The
relay node is selected based on achieving QoS in previous
transmission. It considers one more factor Connection Existence
Period (CEP) to ensure reliability. CEP is to find out the period
during that connection exists between the nodes. The node with
highest CEP becomes a next relay node. The relay node is selected
dynamically to avoid frequent failure. The bandwidth of each link
changed dynamically based on service rate and request rate. This
paper proposes Active bandwidth setting up algorithm to guarantee
the QoS. The series of results obtained by using the Network
Simulator (NS-2) demonstrate the viability of our proposed
techniques.
Abstract: Various fairness models and criteria proposed by academia and industries for wired networks can be applied for ad hoc wireless network. The end-to-end fairness in an ad hoc wireless network is a challenging task compared to wired networks, which has not been addressed effectively. Most of the traffic in an ad hoc network are transport layer flows and thus the fairness of transport layer flows has attracted the interest of the researchers. The factors such as MAC protocol, routing protocol, the length of a route, buffer size, active queue management algorithm and the congestion control algorithms affects the fairness of transport layer flows. In this paper, we have considered the rate of data transmission, the queue management and packet scheduling technique. The ad hoc network is dynamic in nature due to various parameters such as transmission of control packets, multihop nature of forwarding packets, changes in source and destination nodes, changes in the routing path influences determining throughput and fairness among the concurrent flows. In addition, the effect of interaction between the protocol in the data link and transport layers has also plays a role in determining the rate of the data transmission. We maintain queue for each flow and the delay information of each flow is maintained accordingly. The pre-processing of flow is done up to the network layer only. The source and destination address information is used for separating the flow and the transport layer information is not used. This minimizes the delay in the network. Each flow is attached to a timer and is updated dynamically. Finite State Machine (FSM) is proposed for queue and transmission control mechanism. The performance of the proposed approach is evaluated in ns-2 simulation environment. The throughput and fairness based on mobility for different flows used as performance metrics. We have compared the performance of the proposed approach with ATP and the transport layer information is used. This minimizes the delay in the network. Each flow is attached to a timer and is updated dynamically. Finite State Machine (FSM) is proposed for queue and transmission control mechanism. The performance of the proposed approach is evaluated in ns-2 simulation environment. The throughput and fairness based on not mobility for different flows used as performance metrics. We have compared the performance of the proposed approach with ATP and MC-MLAS and the performance of the proposed approach is encouraging.
Abstract: With the exponential rise in the number of multimedia
applications available, the best-effort service provided by the Internet
today is insufficient. Researchers have been working on new
architectures like the Next Generation Network (NGN) which, by
definition, will ensure Quality of Service (QoS) in an all-IP based
network [1]. For this approach to become a reality, reservation of
bandwidth is required per application per user. WiMAX (Worldwide
Interoperability for Microwave Access) is a wireless communication
technology which has predefined levels of QoS which can be
provided to the user [4]. IPv6 has been created as the successor for
IPv4 and resolves issues like the availability of IP addresses and
QoS. This paper provides a design to use the power of WiMAX as an
NSP (Network Service Provider) for NGN using IPv6. The use of the
Traffic Class (TC) field and the Flow Label (FL) field of IPv6 has
been explained for making QoS requests and grants [6], [7]. Using
these fields, the processing time is reduced and routing is simplified.
Also, we define the functioning of the ASN gateway and the NGN
gateway (NGNG) which are edge node interfaces in the NGNWiMAX
design. These gateways ensure QoS management through
built in functions and by certain physical resources and networking
capabilities.
Abstract: Traditionally, Internet has provided best-effort service to every user regardless of its requirements. However, as Internet becomes universally available, users demand more bandwidth and applications require more and more resources, and interest has developed in having the Internet provide some degree of Quality of Service. Although QoS is an important issue, the question of how it will be brought into the Internet has not been solved yet. Researches, due to the rapid advances in technology are proposing new and more desirable capabilities for the next generation of IP infrastructures. But neither all applications demand the same amount of resources, nor all users are service providers. In this way, this paper is the first of a series of papers that presents an architecture as a first step to the optimization of QoS in the Internet environment as a solution to a SMSE's problem whose objective is to provide public service to internet with certain Quality of Service expectations. The service provides new business opportunities, but also presents new challenges. We have designed and implemented a scalable service framework that supports adaptive bandwidth based on user demands, and the billing based on usage and on QoS. The developed application has been evaluated and the results show that traffic limiting works at optimum and so it does exceeding bandwidth distribution. However, some considerations are done and currently research is under way in two basic areas: (i) development and testing new transfer protocols, and (ii) developing new strategies for traffic improvements based on service differentiation.
Abstract: IEEE 802.16 is a new wireless technology standard, it
has some advantages, including wider coverage, higher bandwidth,
and QoS support. As the new wireless technology for last mile
solution, there are designed two models in IEEE 802.16 standard. One
is PMP (point to multipoint) and the other is Mesh. In this paper we
only focus on IEEE 802.16 Mesh model. According to the IEEE
802.16 standard description, Mesh model has two scheduling modes,
centralized and distributed. Considering the pros and cons of the two
scheduling, we present the combined scheduling QoS framework that
the BS (Base Station) controls time frame scheduling and selects the
shortest path from source to destination directly. On the other hand, we
propose the Expedited Queue mechanism to cut down the transmission
time. The EQ mechanism can reduce a lot of end-to-end delay in our
QoS framework. Simulation study has shown that the average delay is
smaller than contrasts. Furthermore, our proposed scheme can also
achieve higher performance.
Abstract: In this paper, we propose a routing scheme that guarantees
the residual lifetime of wireless sensor networks where each
sensor node operates with a limited budget of battery energy. The
scheme maximizes the communications QoS while sustaining the
residual battery lifetime of the network for a specified duration.
Communication paths of wireless nodes are translated into a directed
acyclic graph(DAG) and the maximum-flow algorithm is applied to
the graph. The found maximum flow are assigned to sender nodes, so
as to maximize their communication QoS. Based on assigned flows,
the scheme determines the routing path and the transmission rate of
data packet so that any sensor node on the path would not exhaust
its battery energy before a specified duration.
Abstract: Cross layer optimization based on utility functions has
been recently studied extensively, meanwhile, numerous types of
utility functions have been examined in the corresponding literature.
However, a major drawback is that most utility functions take a fixed
mathematical form or are based on simple combining, which can
not fully exploit available information. In this paper, we formulate a
framework of cross layer optimization based on Adaptively Weighted
Utility Functions (AWUF) for fairness balancing in OFDMA networks.
Under this framework, a two-step allocation algorithm is
provided as a sub-optimal solution, whose control parameters can be
updated in real-time to accommodate instantaneous QoS constrains.
The simulation results show that the proposed algorithm achieves
high throughput while balancing the fairness among multiple users.
Abstract: In this study, a network quality of service (QoS)
evaluation system was proposed. The system used a combination of
fuzzy C-means (FCM) and regression model to analyse and assess the
QoS in a simulated network. Network QoS parameters of multimedia
applications were intelligently analysed by FCM clustering
algorithm. The QoS parameters for each FCM cluster centre were
then inputted to a regression model in order to quantify the overall
QoS. The proposed QoS evaluation system provided valuable
information about the network-s QoS patterns and based on this
information, the overall network-s QoS was effectively quantified.
Abstract: Wireless Mesh Networking is a promising proposal
for broadband data transmission in a large area with low cost and
acceptable QoS. These features- trade offs in WMNs is a hot research
field nowadays. In this paper a mathematical optimization framework
has been developed to maximize throughput according to upper
bound delay constraints. IEEE 802.11 based infrastructure
backhauling mode of WMNs has been considered to formulate the
MINLP optimization problem. Proposed method gives the full
routing and scheduling procedure in WMN in order to obtain
mentioned goals.
Abstract: A mobile Ad-hoc network consists of wireless nodes
communicating without the need for a centralized administration. A
user can move anytime in an ad hoc scenario and, as a result, such a
network needs to have routing protocols which can adopt
dynamically changing topology. To accomplish this, a number of ad
hoc routing protocols have been proposed and implemented, which
include DSR, OLSR and AODV. This paper presents a study on the
QoS parameters for MANET application traffics in large-scale
scenarios with 50 and 120 nodes. The application traffics analyzed in
this study is File Transfer Protocol (FTP). In large scale networks
(120 nodes) OLSR shows better performance and in smaller scale
networks (50 nodes)AODV shows less packet drop rate and OLSR
shows better throughput.
Abstract: Available Bit Rate Service (ABR) is the lower priority
service and the better service for the transmission of data. On wireline
ATM networks ABR source is always getting the feedback from
switches about increase or decrease of bandwidth according to the
changing network conditions and minimum bandwidth is guaranteed.
In wireless networks guaranteeing the minimum bandwidth is really a
challenging task as the source is always in mobile and traveling from
one cell to another cell. Re establishment of virtual circuits from start
to end every time causes the delay in transmission. In our proposed
solution we proposed the mechanism to provide more available
bandwidth to the ABR source by re-usage of part of old Virtual
Channels and establishing the new ones. We want the ABR source to
transmit the data continuously (non-stop) inorderto avoid the delay.
In worst case scenario at least minimum bandwidth is to be allocated.
In order to keep the data flow continuously, priority is given to the
handoff ABR call against new ABR call.
Abstract: In an open real-time system environment, the coexistence of different kinds of real-time and non real-time applications makes the system scheduling mechanism face new requirements and challenges. One two-level scheduling scheme of the open real-time systems is introduced, and points out that hard and soft real-time applications are scheduled non-distinctively as the same type real-time applications, the Quality of Service (QoS) cannot be guaranteed. It has two flaws: The first, it can not differentiate scheduling priorities of hard and soft real-time applications, that is to say, it neglects characteristic differences between hard real-time applications and soft ones, so it does not suit a more complex real-time environment. The second, the worst case execution time of soft real-time applications cannot be predicted exactly, so it is not worth while to cost much spending in order to assure all soft real-time applications not to miss their deadlines, and doing that may cause resource wasting. In order to solve this problem, a novel two-level real-time scheduling mechanism (including scheduling profile and scheduling algorithm) which adds the process of dealing with soft real-time applications is proposed. Finally, we verify real-time scheduling mechanism from two aspects of theory and experiment. The results indicate that our scheduling mechanism can achieve the following objectives. (1) It can reflect the difference of priority when scheduling hard and soft real-time applications. (2) It can ensure schedulability of hard real-time applications, that is, their rate of missing deadline is 0. (3) The overall rate of missing deadline of soft real-time applications can be less than 1. (4) The deadline of a non-real-time application is not set, whereas the scheduling algorithm that server 0 S uses can avoid the “starvation" of jobs and increase QOS. By doing that, our scheduling mechanism is more compatible with different types of applications and it will be applied more widely.
Abstract: Advances in computing applications in recent years
have prompted the demand for more flexible scheduling models for
QoS demand. Moreover, in practical applications, partly violated
temporal constraints can be tolerated if the violation meets certain
distribution. So we need extend the traditional Liu and Lanland model
to adapt to these circumstances. There are two extensions, which are
the (m, k)-firm model and Window-Constrained model. This paper
researches on weakly hard real-time constraints and their combination
to support QoS. The fact that a practical application can tolerate some
violations of temporal constraint under certain distribution is
employed to support adaptive QoS on the open real-time system. The
experiment results show these approaches are effective compared to
traditional scheduling algorithms.
Abstract: Bandwidth allocation in wired network is less complex
and to allocate bandwidth in wireless networks is complex and
challenging, due to the mobility of source end system.This paper
proposes a new approach to bandwidth allocation to higher and lower
priority mobile nodes.In our proposal bandwidth allocation to new
mobile node is based on bandwidth utilization of existing mobile
nodes.The first section of the paper focuses on introduction to
bandwidth allocation in wireless networks and presents the existing
solutions available for allocation of bandwidth. The second section
proposes the new solution for the bandwidth allocation to higher and
lower priority nodes. Finally this paper ends with the analytical
evaluation of the proposed solution.
Abstract: In cellular networks, limited availability of resources
has to be tapped to its fullest potential. In view of this aspect, a
sophisticated averaging and voting technique has been discussed in
this paper, wherein the radio resources available are utilized to the
fullest value by taking into consideration, several network and radio
parameters which decide on when the handover has to be made and
thereby reducing the load on Base station .The increase in the load
on the Base station might be due to several unnecessary handover
taking place which can be eliminated by making judicious use of the
radio and network parameters.
Abstract: In this paper, we address the problem of adaptive radio
resource allocation (RRA) and packet scheduling in the downlink of a
cellular OFDMA system, and propose a downlink multi-carrier
proportional fair (MPF) scheduler and its joint with adaptive RRA
algorithm to distribute radio resources among multiple users according
to their individual QoS requirements. The allocation and scheduling
objective is to maximize the total throughput, while at the same time
maintaining the fairness among users. The simulation results
demonstrate that the methods presented provide for user more explicit
fairness relative to RRA algorithm, but the joint scheme achieves the
higher sum-rate capacity with flexible parameters setting compared
with MPF scheduler.
Abstract: This paper presents the findings of two experiments that were performed on the Redundancy in Wireless Connection Model (RiWC) using the 802.11b standard. The experiments were simulated using OPNET 11.5 Modeler software. The first was aimed at finding the maximum number of simultaneous Voice over Internet Protocol (VoIP) users the model would support under the G.711 and G.729 codec standards when the packetization interval was 10 milliseconds (ms). The second experiment examined the model?s VoIP user capacity using the G.729 codec standard along with background traffic using the same packetization interval as in the first experiment. To determine the capacity of the model under various experiments, we checked three metrics: jitter, delay and data loss. When background traffic was added, we checked the response time in addition to the previous three metrics. The findings of the first experiment indicated that the maximum number of simultaneous VoIP users the model was able to support was 5, which is consistent with recent research findings. When using the G.729 codec, the model was able to support up to 16 VoIP users; similar experiments in current literature have indicated a maximum of 7 users. The finding of the second experiment demonstrated that the maximum number of VoIP users the model was able to support was 12, with the existence of background traffic.
Abstract: In this paper, an adaptive radio resource allocation
(RRA) algorithm applying to multiple traffic OFDMA system is
proposed, which distributes sub-carrier and loading bits among users
according to their different QoS requirements and traffic class. By
classifying and prioritizing the users based on their traffic
characteristic and ensuring resource for higher priority users, the
scheme decreases tremendously the outage probability of the users
requiring a real time transmission without impact on the spectrum
efficiency of system, as well as the outage probability of data users is
not increased compared with the RRA methods published.