Simulation of Traffic Management Mechanism in Mobile Ad hoc Network

Simulation of Traffic Management Mechanism in Mobile Ad hoc Network

Ms. Pritam Hatwar

Student of M. E. Electronics & Telecommunication

Prof. A. O. Vyas

Faculty of Electronics & Telecommunication Department of Electronics & Telecommunication Engineering G.H.Raisoni College of Engineering, Amravati, Maharashtra.

Abstract

Mobile devices and connectivity through mobile networks are growing at an increasing rate. Next generation mobile networks are not only used for cellular phone applications, but they are carrying different types of traffic like voice, video, and data. Call admission control(CAC) algorithm helps to regulate traffic which improves the performance by increasing the utilization of network capacity. Users of next generation networks expect a Quality of Service (QoS) depending on their application and service contracts.The proposed design will be applicable to any network generation and adhoc network by just changing the parameters according to the system need. The proposed design will define the CAC algorithm, which will balance therequest blocking and dropping in order to reduce the network congestion. Handoff request will be given higher precedence over a new request in the cell whenever there will be the inadequate bandwidth in the cell. QoS for Mobile Adhoc network will get improve by minimizing the probability of new request blocking and probability of handoff request dropping during rush hours in the network.Traffic management mechanism will be simulated and tested using MATLAB.

1. Introduction

   The Mobile adhoc network (MANET) aims to provide integrated applications such as voice, data and real- time interactive multimedia such as email, video chat, video conferencing via inexpensive low-powered

   mobile computing devices over wireless infrastructures. To support various integrated applications with certain quality of service (QoS) requirement in the MANET, managing traffic is a major issue. The purpose of Quality of Service (QoS) term is to provide services to the end user with assurance in terms of delay in service, bandwidth allocation, voice quality, signal quality, etc. Due to the congestion during rush hours in the network there is a need of traffic management mechanism to avoid blocking.

   The call admission control(CAC) is the traffic management mechanism which controls the admission of new request in the network. Here request means a signal which is carrying any type of data like voice, video, or multimedia data. Managing resources in the network is also the responsibility of CAC. Call admission control (CAC) is the practice or process of regulating traffic volume in voice communications, particularly in wireless mobile networks and in VoIP (voice over Internet Protocol, also known as Internet telephony). Call admission control can also be used to ensure, or maintain, a certain level of audio quality in voice communications networks, or a certain level of performance in Internet nodes and servers where VoIP traffic exists. Most CAC algorithms work by regulating the total utilized bandwidth, the total number of request, or the total number of packets or data bits passing a specific point per unit time. If a defined boundaryvalueis reached or exceeded, a new request may be prohibited from entering the network until at least one current request satisfied. Alternatively, a graceful degradation methodology can be implemented.

2. Literature Survey

   In [1] CAC protocol depending on degrading the quality of existing calls, according to their degradation priority, by reducing the bandwidth allocated to them in order to accommodate new calls according to their admission priority. This protocol depends on borrowing bandwidth from connections that can afford some performance degradation in order to admit new users to the network. This strategy can be useful to increase the revenue of company. But due to degrading the required bandwidth, the quality of service is reduced.

3. Traffic Management Mechanism

   Traffic management mechanism manage theentry of active users in the network by calladmission. It manages the operation of thenetwork in such a way that ensuresuninterrupted service provision, andaccommodates in an optimal way newconnection requests. AdmissionControl estimates whether a new usershould have access to the system withoutspoiling the basic requirements ofongoing users in the network. Admission control gives admission to the new user without degrading the performance of the existing users. Thus proficient and effectiveAdmission Control is crucial for the capacity and the performance of the network. Traffic management mechanism which implements admission control algorithm is called Interrupt Precedence mechanism.

   In this mechanism, precedence is given to ongoing requests rather than accepting new requests in the cell.The Mechanism works as follows:

   Firstly the threshold is defined depending on maximumnumber of users that a cell can accommodates. If the number of on-going requestsin a cell exceeds a threshold value and a newrequest arrives, then in that casenew request will be blocked; otherwise it will beadmitted.

   The handoff request is rejected only when allchannels in the cell are busy in servingon-going requests.This technique has been analyzed in many papers, and analytical results for request blocking probabilities are obtained under the assumption that the average new request channel holding time and average handoff request channel holding time are equal so that one- dimensional Markov chain theory can be used. But when the average channel holding times for bothtype ofrequest are different, the approach will not work [18]. Thus, the one-dimensional Markov chain model for some new call bounding scheme, the assumption of

   equally distributed new and handoff requests are may not be appropriate; the multidimensional Markov chain may be needed to get expected simulation result.

   The multidimensional Markov chain theory could solve the problem when the average channel holding times are different for both streams. However, dimensionality gives birth to another problem. As observed in research of multidimensional Markov chain modeling, the states dimension increases very rapidly. Hence it will be desirable to study some approximate solutions to evade solving a large set of balance equations. It is also a observation in the literature [18] that the peculiarity between channel holding times for new request and handoff request is not made. We can find the average channel holding time for cell traffic (the combined traffic of new request and handoff request), use this parameter to form the exponential distribution to approximate the channel holding-time distribution, and then apply the one-dimensional Markov chain model to find the call blocking probabilities.

   Parameters defined in the system are as follows:

   • C – No. of channels in the cell.

   • t – Threshold for the Interrupt precedence mechanism.

   • – The arrival rate of new request.

   • h – The arrival rate of handoff request.

   • 1/ – Average channel holding time for new request.

   • 1/h – Average channel holding time for handoff request.

   • – Traffic intensity of new request.

   • – Traffic intensity of Handoff request.

     h

     The two-dimensional Markov chain is used to model the system. Let (r1, r2) denote the state, where r1 and r2 denote the number of new requests and handoff requests in the cell, respectively. In transition diagram the state changes in two cases, first when new request gets serviced then the state changes to a next state in vertical direction. Second, when a handoff call request gets serviced then the state changes to a next state in horizontal direction.Following are the transition sates:

     q(r1,r2: r1 -1,r2)= r1 µ(0 <r1 t, 0 r1+ r2 C ) q(r1,r2: r1 +1,r2)= (s0 <r1 t, 0 r1+ r2 t ) q(r1,r2: r1 ,r2-1)= r2 µ h(0 <r1 t, 0 r1+ r2 C ) q(r1,r2: r1,r2+1)= h (0 <r1 t, 0 r1+ r2 C )

     It is observed that in some states, such as those when r1+ r2> t, then the stream no longer have the symmetric nature.

     p

     To find the steady-state probability distribution p(r1,r2) a

     ,solving balance equation may be computationally nb

     difficult when the state dimension is large.

     t it

     To solve this computational problem we use approximation in which we attempt to reduce the two-

     C

     it

     h h

     i!

     dimensional Markov chain model to the one-

     i

     t it

     dimensional Markov chain model by normalizing the

     t h C

     h h

     average service time for each flow so that the average service time becomes equal for both streams [20]. Then

     i0 i!

     it1 i!

     one-dimensional Markov chain model is used to find the request blocking probabilities.

     And handoff requests blocking probability is given by

     p

     By normalizing the average service time to unity, the a arriving traffic for that stream will be scaled hb appropriately. This normalization process does not

     change the traffic intensity. Hopefully, the resulting

     h

     t C t

     h

     blocking probability can be approximated[13].

     The new request and handoff request arrival stream is

     C!

     t h C h h

     Poisson with arrival rate and h respectively, with their service rate equals unity. Let Pai denote the probability that there are i busy channels in steady state

     i

     i0 i!

     it1

     t it

     t!

     for the approximate model where variable i can take maximum value as C i.e. total no. of channels in cell. Then, the following stationary distribution for the approximate model is obtained:

     These equations are used to approximate the request blocking probability of the new requests and handoff requests for the Interrupt Precedence mechanism.

     i

     h

     o

     P

     Pa i!

     ,i t

4. Flow Chart

   The simulation model can be described using flow

   i

   • h

   t

   it

   h

   P ,t 1 i C

   chart as shown in figure 1.

   Initially new request will be generated in the cell, the

   i! 0

   where,

   0

   Pa

   t i C

   t it 1

   new request would be granted for admission if the total number of ongoing requests value less than the threshold value and also if the channel would be available in that cell. Once the new request will be received in the system, distance and velocity of that session would be updated. And also the other parameters like Locations and signal strength of the accepted request would be checked for every moment and accordingly updated. If signal strength of the

   i0

   h

   i! it 1

   h h

   i!

   previously accepted signal will be less than handoff threshold value and channel will be existing in the target cell, then handoff this request from source cell to target cell, otherwise handoff request will be blocked.

   From this stationary distribution, the blocking probabilities are obtained for new requests as follows

   The traffic management mechanism will give precedence to the handoff request over new request whenever there will be inadequate bandwidth in the

   New request blocking probability =

   No. of blocked requests

   Total no. of requests

   cell.

   In this way the new request blocking probability and handoff request dropping probability will be minimized.

   Figure1.Flow Chart for Traffic Management Mechanism

5. Simulation Result

   Following are the assumed values for the parameters.

   • Channel Capacity C=30

   • Cell Radius = 2000 meters

   • New request traffic intensity = 6 to 20

   • Handoff traffic intensity h=10

   • Threshold t=26

   • Total Average Traffic (+h) = 6 to 60

   • Each requestrequires only one channel for giving service.

   • Distance between two hop = 20 meter

     Figure 2. Graph of Blocking probability of new request against Traffic Load

     Figure 3. Graph of Blocking probability of Handoff Request against Traffic Load

     Above figure 2 and figure 3shows that handoff request dropping probability isminimum as compared to the new requestblocking probability.

6. Conclusion

In this paper, we propose the Interrupt precedence traffic management mechanism which reduces the blocking during rush hours.

References

1. AymanElnaggar, MokhtarAboelazeMaanMusleh, A Call Admission Control protocol for Multimedia Cellular Networks, Journal of networks, vol.3, no. 8, November 2008.

2. Yuguang Fang and Yi Zhang, Call Admission Control Techniques and Performance Analysis in Wireless Mobile

   Networks IEEE Transactions On Vehicular Technology, Vol. 51, NO. 2, PP. 371 382, MARCH 2002.

3. S. Das, S. K. Sen, K. Basu, and H. Lin A Framework for bandwidth degradation and call admission control Techniques for mobile multiclass traffic in next-generation wireless networks, IEEE Journal on Selected Areas in Communications, Vol. 21, No. 10, pp 1790- 1802. Dec. 2003

4. M. El-Kadi, S. Olariu, and H. Abdel-Wahab A rate based borrowing Technique for qos provisioning in multimedia wireless networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 2 pp 156-166,

   Feb. 2002

5. M. Aboelaze A call admission protocol for cellular networks that supports differentiated fairness Proceeding of the IEEE 59th Vehicular Technology Conference VTC2004 Spring. May 2004.

6. J.-Y Chang, and H.-L.Chen A Borrowing-based call admission control policy for mobile multimedia wireless networks.IEICE Trans on Communications. Vol. E89-B,No. 10, Oct 2006. Pp 2722-2732

7. Al-Sharaeh Dynamic rate-based borrowing Technique for QoS provisioning in high speed multimedia wireless cellular networks Journal of Applied Mathematics an Computations. 179(2006) pp 714-724

8. Ryuji Kohno, ReuvenMeidan, and Laurence B. Milstein, Spread Spectrum Access Method for Wireless Communications. IEEE Communication Magazine, Jan. 1995, pp 58-67.

[9]P. Pahalawatta, R. Berry, T. Pappas, and A. Katsaggeos Content-aware resource allocation and packet scheduling for video transmission over wireless networks IEEE Journal on Selected Areas in Communications Vol. 25, No. pp 749-759. 4 may 2007

1. Wen Chen, Jinming Yu "Optimal Priority-based Call Admission Control Scheme For QoS Provisioning in Heterogeneous Wireless Networks" Journal of Networks, vol.6, No. 2, February 2011.

2. Mahesh G "Channel Partitioning with Queuing Model for User Class based Call Admission Control in Next Generation Wireless Networks " International Journal of

   Computer Applications (0975 8887) Volume 45 No.12,

   May 2012

3. Felipe A. Cruz-Perez "Link Quality-Aware Call Admission Strategy for Mobile Cellular Networks with Link Adaptation" IEEE Transaction on Wireless Communication,

   Vol. 5, No. 9, September 2006

4. Ramesh Babu H.S. "Call admission control for next generation wireless networks using Higher Order Markov Model", Computer and Information Science, Vol.3, No. 1,

   February 2010

5. Mohammed M. Alkhawlani "Intelligent Joint Admission Control for Next Generation Wireless Networks" International Journal of Advanced Computer Science and Applications, Vol. 3, No.4, 2012

[15]V.S.Kolate "Improving QoS in 3G Wireless Mobile N/W Using Call Admission Control Scheme" IJCSET , , Vol 2,

Issue 3,1016-1019,March 2012

1. Jun-Zhao Sun, Mobile Ad Hoc Networking: An Essential Technology for Pervasive Computing,Info-tech and Info-net, 2001 Proceedings. ICII 2001 – Beijing. 2001 International Conferences on, PP. 316 321, vol.3,

2. Peyton Z. Peebles, Jr., Probability, Random Variables, and Random Signal Principles McGraw Hill Book Inc, 3rd edition.

[18]M. I. Kim, and S. J. Kim A 2-level call admission control scheme using priority queue for decreasing new call blocking & handoff call dropping The 57th Semiannual Vehicular Technology Conference VTC2003-Spring Volume 1 pp 459-461 April 22-25, 2003

[19]Y. C. Lai, and Y. D. Lin A fair admission control for large bandwidth multimedia applications proceedings of The 22nd International Conference on Distributed Computing Systems Workshops, 2-5 July 2002. pp 317 -322

[20]Hwei Hsu, "Probability ,Random variables & Random Processes" Schaum's Outline Series, McGraw-Hill