Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Call Admission Control Algorithm for Providing QoS in Wireless Systems
خوارزمية تحكم بقبول المكالمات لتقديم نوعية الخدمة في النظم اللاسلكية
1521
1 9
0
(
0
)
Added by
Aِl-Baath University ورقة بحثية
Publication date
2014
fields
Communication Engineering
and research's language is
العربية
Created by
Shamra Editor
Ask ChatGPT about the research
يشير مصطلح نوعية الخدمة إلى مقدرة شبكة على إعطاء أولويات و تمييز الخدمة لتقديم معالجة تفضيلية لبعض أصناف الخدمة و أنوع المكالمات. يعد تقديم نوعية الخدمة في مقدمة التحديات التي تواجه نظم الشبكات اللاسلكية الخلوية المتنقلة بسبب قلة الموارد من جهة و تنقل المستخدمين من جهة أخرى. يستخدم التحكم بقبول المكالمات لتقديم و تحقيق ضمانات نوعية الخدمة في نظم الشبكات اللاسلكية الخلوية المتنقلة. نقترح في هذا البحث خوارزمية جديدة للتحكم بقبول المكالمات مع دليل أولوية لتقديم و تحقيق ضمانات QoS على مستوى المكالمة في نظم الشبكات اللاسلكية الخلوية المتنقلة بمفهوم احتمالات توقيف المكالمات الجديدة باستخدام عتبات متعددة لتحديد عدد المكالمات المسموح بها من كل نوع خدمة. تبين نتائج المحاكاة الواردة في هذا البحث بأن تطبيق الخوارزمية الجديدة المقترحة مع دليل الأولوية على مخطط تحديد المكالمات الجديدة يقدم مخططاً جديداً له أداء أفضل بمفهوم احتمالات توقيف المكالمات الجديدة و هو يضمن أي مستوى مطلوب من نوعية الخدمة لأنواع المكالمات الجديدة مع المحافظة على أولوية المكالمات المسلمة.
The Quality of Service (QoS) term is refer to capability of network to prioritization and service distinguish for providing better service to some service classes and call types. Because of the lack of resources, from one side, and user's mobility from the other, provision of QoS guarantees is considered at the head of the challenges that wireless cellular mobile network systems face. Call Admission Control (CAC) is used for providing and achieving QoS guarantees in wireless systems. This paper proposes a new CAC algorithm with priority index for providing and achieving QoS guarantees on the call level in wireless systems in terms of new call blocking probabilities using multiple thresholds to determinate the number of acceptable new calls of each type of service. Results of simulation provided in this paper show that the application of proposed new CAC algorithm with priority index on the New Call Bounding Scheme (NCBS) provides a new CAC scheme which has better performance in terms of new call blocking Probabilities and guarantees any desired level of QoS for new call types with the keeping priority of handoff calls.
References used
Amandeep K, 2011- An overview of Quality of Service computer network. Indian Journal of Computer Science and Engineering (IJCSE), ISSN: 0976-5166, India, Vol. 3, 470-475
Geettam S; Shekhar V, 2008- New Call Admission and Handoff Techniques for 3-G Mobile Networks, Indian Institute of Information Technology, India, 697-701
Georgios I, Dimitrios G, 2010- Call Admission Control schemes in Mobile and Wireless Networks, National Technical University of Athens, Greece, 1-26
Georgios I, Stratogiannis G, John D, 2008- Efficiency Evaluation of Class-Based Call Admission Control Schemes for Wireless Communications, Wireless and Satellite Communication Group, IEEE, 69-73
Jukka M, Kimmo R., 2002- Extended Quality-of-Service for Mobile Networks, University of Helsinki, Dep. of Computer Science, Box. 26, FIN-00014, Finland, 1-6
rate research
Read More
Route discovery in infrastructure based network is an important problem. Normally, route selection or route discovery is done based on the shortest path principle. In infrastructure based networks، a number of issues for route discovery need to be ad
dressed as the packet flow are prone to errors making the routing operation failure. Reliability, for example، is an important issue for route discovery. Ensuring Quality of Service (QoS) is important and is to be taken care while forwarding a packet flow. In this paper، a model for route discovery in infrastructure based networks using GA is being proposed. Out of many paths available from the gateway of the network to the final destination, the one is selected which satisfies the desired QoS. Two important QoS parameters، path loss and processing time at the router (Base Station), have been considered. The experimental results for both the QoS parameters reveal the efficacy of the model.
Localization is an essential process in many wireless sensors networks applications like environmental surveillance and forest fires detection, where sensors are usually randomly thrown in difficult to reach places, considering the limited wireless s
ensors capability in terms of energy availability and the capacity of computations a low cost and energy conservation algorithms are needed to determine the approximate position of the sensors. In this research a new algorithm was proposed ‘Address Vector Multi-Hop (AV_MH)’ to determine the position of the randomly deployed sensors, this algorithm is based on the idea of making benefit from short address assignment in networks that support hierarchical addressing, considering that the most important techniques used in the field of sensor networks such as ZigBee and 6LowPAN which depend on the IEEE802.15.4 standard support this type of addressing.
The results showed the possibility of obtaining an approximate position of the wireless sensors in a rapid and inexpensive and cost-effective way in terms of the number of sent messages and required calculations.
Wireless Sensor Networks (WSNs) are often deployedrandomly;this makes the
positiondetermination of deployed nodes a very difficult issue, which is called localization
problem. The importance of node localization information becomes from the facilit
y of
routing operation and the network control, that makes the network works correctly.
Nowadays, Global Position System (GPS) is appeared as the most important position
system, but it is inapplicable for the low-cost self-configure sensor networks, and also it is
impossible to install GPS for each sensor nodebecause of high cost, large volume and high
complexity required of adding it to nodes, especially for large network.Therefore, a few
number of nodes may be configured with GPS.
In this paper,we will study the localization algorithmAd-hoc Positioning System
(APS) algorithmused inUnderwater WSN, andwill testthe effectiveness of usingitin
determining the node position based on the distance calculated by anchor nodes. These
nodes are the nodes which know their positions.
This research aims to achieve the observability of any electrical network by the
possibility compensation the lost measurements due to a defect, allowing the possibility of
state estimation of the electrical network ,ie, obtaining a single solution
for a state
estimation. This is done by means of the network observability analysing using the
available set of measurements and adding virtual pseudo-measurements if the network is
not observable. this is done using a numerical algorithm that ensures obtaining the
minimum and optimal number of added critical pseudo-measurements so that the result of
state estimation was not adversely affected. The algorithm depends on solving the
equation of the linear state estimation and the analysing to the triangular factors of the gain
matrix and an easy way to arrange the axis of the jacobian matrix ,ie, the measurements
matrix to ensure getting the minimum set of candidate pseudo- measurements to be added
to real measurements, the numerical algorithm was acheived by environment in the
MATLAB and tested to present the results on the network observabilty analysing and
adding the pseudo-measurements algorithm on state estimation .The results of the program
were tested on IEEE-14 network, and they showed that if a number of measurements were
lost, they would be compensated by critical and pseudo-measurements. The results of state
estimation showed small error ratio between estimated values using the real measurements
and the estimated values after added the critical pseudo-measurements.
This article examines the possibility of assigning the mobility
characteristics of the modifications carried out on the dynamic
algorithm to the static algorithm. Furthermore we used NS-2
simulator to evaluate our proposal and to compare it with t
he
performance of the standard algorithms. The results show the
superiority of the modified algorithms over the standard
algorithms, especially with network congestion.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
