449 research outputs found
Recommended from our members
A connection-level call admission control using genetic algorithm for MultiClass multimedia services in wireless networks
Call admission control in a wireless cell in a personal communication system (PCS) can be modeled as an M/M/C/C queuing system with m classes of users. Semi-Markov Decision Process (SMDP) can be used to optimize channel utilization with upper bounds on handoff blocking probabilities as Quality of Service constraints. However, this method is too time-consuming and therefore it fails when state space and action space are large. In this paper, we apply a genetic algorithm approach to address the situation when the SMDP approach fails. We code call admission control decisions as binary strings, where a value of “1” in the position i (i=1,…m) of a decision string stands for the decision of accepting a call in class-i; a value of “0” in the position i of the decision string stands for the decision of rejecting a call in class-i. The coded binary strings are feed into the genetic algorithm, and the resulting binary strings are founded to be near optimal call admission control decisions. Simulation results from the genetic algorithm are compared with the optimal solutions obtained from linear programming for the SMDP approach. The results reveal that the genetic algorithm approximates the optimal approach very well with less complexity
Modelling network memory servers with parallel processors, break-downs and repairs.
This paper presents an analytical method for the performability evaluation of a previously reported network memory server attached to a local area network. To increase the performance and availability of the proposed system, an additional server is added to the system. Such systems are prone to failures. With this in mind, a mathematical model has been developed to analyse the performability of the proposed system with break-downs and repairs. Mean queue lengths and the probability of job losses for the LAN feeding the network memory server is calculated and presented
An Optimal Query Assignment for Wireless Sensor Networks
A trade-off between two QoS requirements of wireless sensor networks: query
waiting time and validity (age) of the data feeding the queries, is
investigated. We propose a Continuous Time Markov Decision Process with a drift
that trades-off between the two QoS requirements by assigning incoming queries
to the wireless sensor network or to the database. To compute an optimal
assignment policy, we argue, by means of non-standard uniformization, a
discrete time Markov decision process, stochastically equivalent to the initial
continuous process. We determine an optimal query assignment policy for the
discrete time process by means of dynamic programming. Next, we assess
numerically the performance of the optimal policy and show that it outperforms
in terms of average assignment costs three other heuristics, commonly used in
practice. Lastly, the optimality of the our model is confirmed also in the case
of real query traffic, where our proposed policy achieves significant cost
savings compared to the heuristics.Comment: 27 pages, 20 figure
Towards a Collision-Free WLAN: Dynamic Parameter Adjustment in CSMA/E2CA
Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is
a distributed MAC protocol that allows collision-free access to the medium in
WLAN. The only difference between CSMA/ECA and the well-known CSMA/CA is that
the former uses a deterministic backoff after successful transmissions.
Collision-free operation is reached after a transient state during which some
collisions may occur. This article shows that the duration of the transient
state can be shortened by appropriately setting the contention parameters.
Standard absorbing Markov Chain theory can be used to describe the behaviour of
the system in the transient state and to predict the expected number of slots
to reach the collision-free operation.
The article also introduces CSMA/E2CA, in which a deterministic backoff is
used two consecutive times after a successful transmission. CSMA/E2CA converges
quicker to collision-free operation and delivers higher performance than
CSMA/CA in harsh wireless scenarios with high frame error rates.
To achieve collision-free operations when the number of contenders is large,
it may be necessary to dynamically adjust the contention parameter. The last
part of the article suggests an approach for such parameter adjustment which is
validated by simulation results
Channel estimation, synchronisation and contention resolution in wireless communication networks
In the past decade, the number of wireless communications users is increasing at an unprecedented rate. However, limited radio resources must accommodate the increasing number of users. Hence, the efficient use of radio spectrum is a critical issue that needs to be addressed. In order to improve the spectral efficiency for the wireless communication networks, we investigate two promising technologies, the relaying and the multiple access schemes. In the physical (PHY) layer of the open systems interconnect (OSI) model, the relaying schemes are capable to improve the transmission reliability and expand transmission coverage via cooperative communications by using relay nodes. Hence, the two-way relay network (TWRN), a cooperative communications network, is investigated in the first part of the thesis. In the media access control (MAC) layer of the OSI model, the multiple access schemes are able to schedule multiple transmissions by efficiently allocating limited radio resources. As a result, the contention-based multiple access schemes for contention resolution are explored in the second part of the thesis. In the first part of the thesis, the channel estimation for the two-way relay networks (TWRNs) is investigated. Firstly, the channel estimation issue is considered under the assumption of the perfect synchronisation. Then, the channel estimation is conducted, by relaxing the assumption of perfect synchronisation. Another challenge facing the wireless communication systems is the contention and interference due to multiple transmissions from multiple nodes, sharing the common communication medium. To improve the spectral efficiency in the media access control layer, a self-adaptive backoff (SAB) algorithm is proposed to resolve contention in the contention-based multiple access networks
- …