JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN (JCET) 2347-3916 (Online), Volume 1, Issue 1, July-December (2013) ISSN 2347-3908 (Print) ISSN 2347-3916 (Online) Volume 1, Issue 1, July-December (2013), pp. 36-45 IAEME: http://www.iaeme.com/JCET.asp

JCET

IAEME

OLCMCR: ORDERED LOAD-BALANCING COOPERATIVE MULTI CHANNEL ROUTING TOPOLOGY FOR VOICE TRANSMISSION OVER IP BASED 802.11 WLAN
Mohammed Sirajuddin1, Dr D. Rajya Lakshmi2 And Dr Syed Abdul Sattar3
1

Royal Institute of Technology and Science, Chevella, Hyderabad, India 2 Gitam Institute of Technology, Gitam University, Vizag, India 3 Royal Institute of Technology and Science, Chevella, Hyderabad, India

ABSTRACT In this paper, we propose a cooperative multi channel VoIP routing protocol for 802.11 WLAN networks that handles the congestion to improve the Quality of routing service. Part of the proposed protocol introduced a MAC layer level solution called Cooperative Multi Channel Routing (CMCR) that effectively handles the multi channel transmission at one hop relay node level cooperative multi channel group. The proposed model controls the congestion in hierarchical order to minimize the resource utilization. Limited bandwidth and a high degree of mobility require that routing protocols for ad hoc networks be adaptive, trouble-free, and energy saving. Here we proposed a new Ordered Load-balancing Cooperative Multi Channel Routing Topology (OLCMCR) for 802.11 WLANs, which handles congestion state. OLCMCR capable to adopt a any WLAN structure with enhanced similar resilience against mobility. And OLCMCR utilizes CMCR to reduce the overhead of route failure recovery, improve route efficiency and reduce data transmissions. Our simulation results show that OLCMCR handles congestion with reduced control overhead in various environments. Also can observe improved packet delivery ratio. Keyword: 802.11, WLAN, congestion control, OLCMCVR 1. INTRODUCTION The proposed model controls the congestion in hierarchical order to minimize the resource utilization. Limited bandwidth and a high degree of mobility require that routing protocols for ad hoc networks be adaptive, trouble-free, and energy saving. Here we proposed a new Ordered Load-balancing Cooperative Multi Channel Routing Topology (OLCMCR) for 802.11 WLANs, which handles congestion state. OLCMCR utilizes CMCR to reduce the overhead of route
36

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN 2347-3916 (Online), Volume 1, Issue 1, July-December (2013) failure recovery, improve route efficiency and reduce data transmissions. Our simulation results show that OLCMCR handles congestion with reduced control overhead in various environments. Also can observe improved packet delivery ratio. The projected model [1] uses a Markov process to model DCF to evaluate the channel throughput, and frame loss at wireless stations. The initiators [2],[3] to study the performance of real-time applications over 802.11. The inherent limitations of the 802.11 a/b DCF [4] in supporting VoIP calls over a WLAN. The research works projected by [5] and [6], the references they used and the enhanced DCF (EDCF) [7], [8] tend to afford distinguished service instead of stern QoS guarantee analyzed the interference model [9] in wireless mesh network and projected a call admission control with interference capacity. Several performance optimization schemes [10], [11], [12] are proposed for WLANs to improve the VoIP quality. Projected model [10] uses a dual queue of 802.11 MAC to provide priority to VoIP. In this regard [11] proposed packet aggregation to increase capacity and [12] proposed an adaptive transmission algorithm over an IEEE 802.11 WLAN, which supports integrated voice and data services, under this adaptive transmission model [12] the data traffic is transmitted with DCF, while voice transmission is carried out with PCF. The paper is organized as follows: Section 2 briefly describes the OLCMCR. Section 3 describes cooperative multi channel Group Clogging Estimation (CMCGCE). Section 4 briefly describes cooperative multi channel Group Egress Load-balancing (CMCGEL) Algorithm Section 5 describes the simulation and results Section 6 concludes the paper. 2. OLCMCR The frame dropping often occurs in WLAN. The reasons for this frame dropping are as below Transmission Link failure. Inferred Transmission due to overwhelming Inflow that leads Inflow load to low. This also can claim as frame dropping due to clogging at routing. An ordered order is used to handle the clogging state as follows The Status of clogging within cooperative multi channel Group The status of clogging between cooperative multi channel Groups This helps in minimizing of source level outflow regulation cost and balances the power consumption. A. Network and Node activities under proposed protocol: The network is to be split into cooperative multi channel groups with respect to nodes participating in multi channel routing such that multicast nodes as multi channel group heads For each multi channel group i where i = 1,..... MG ; ( MG is the total number of multi channel groups) Find transmission load threshold n for each multi channel group i .By using n of each multi channel group Transmission load threshold for entire network can be measured. B. Information sharing within cooperative multi channel Group Each node n that belongs to multi channel group MCGi verifies the outflow load and shares degree of outflow load d (ol )n with multi channel group head. Once nd (ol )k received
37

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN 2347-3916 (Online), Volume 1, Issue 1, July-December (2013) from each node k of the multi channel group MCGi , the multi channel group head MCGi (h ) calculates the degree of outflow load mcgd (ol )MCGi at cooperative multi channel Group MCGi (h ) .
MCGi k =1

nd (ol )

MCGi 3. Cooperative multi channel Group Clogging Estimation(CMCGCE) Algorithm Cooperative multi channel Group clogging Estimation (CMCGCE) algorithm is presented in this section. CMCGCE helps in locating the state of frame dropping due to clogging. This evaluation occurs under Mac layer. The algorithm CMCGCE follows CMCGCE Algorithm At an event of inflow loads at node i : Updating Inflow load:
f (( t T ) < 0 ) do T + 0.5 ( ' ) t + il T t T T ilcr il

mcgd (ol ) MCGi =

':= 0.5

il

:= ilcr t T T

endif if (( t ) 0 ) do T ilcr il T ':= t il T := ilcr

endif

Here in the above conditional statement

t : Time between last two transmissions of hop relay node level connected nodes in routing
path T : Time between two transmissions of hop relay node level connected nodes in routing path : Average slop threshold of the inflow load il cr : Current inflow load ratio
il T : Average inflow load threshold observed for predefined interval T

il cr : Current inflow load ratio il r : Inflow load ratio il ce : Expected inflow load threshold at current interval

38

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN 2347-3916 (Online), Volume 1, Issue 1, July-December (2013) Detecting frame drop:
il = il ce ' + T et

if (ilce <ilr ) do packet loss due to link failure else packet loss due to congestion endif

4. Cooperative multi channel Group Egress Load-balancing(CMCGEL) Algorithm CMCGEL initiates if clogging found at a node i in routing path. Upon receiving clogging alerts from Mac layer the routing protocol initiates CMCGEL. Let s be the node that transmits data to hop relay level node i . If node i affected by clogging, then CMCGEL alerts node s . Upon receiving alerts about the clogging state at the hop relay level target node i , s evaluates nd (ol ) s > mcgd (ol ) MCG , if true then verifies that ( nd ( ol ) s mcgd ( ol ) MCG ) is
c c

greater than or equal to s is true or not. If true then the node s balances its outflow load such that nd (ol ) s is not less than mcgd ( ol ) MCG
c

Here in the above description s is outflow threshold at node s , MCGc is current multi channel group such that s MCGc The node s balances its outflow load by increasing frame such that nd (ol ) s is greater or equal to
|MCGc | mcgd ( ol ) MCGc nd ( ol ) k {kMCGc and k is a node} mcgd ( ol ) + = k =1 MCGc MCGc MCGc |MCGc |

If ( nd (ol ) s mcgd (ol ) MCGc )or ( ( nd ( ol ) s

its outflow load and alerts the

mcgd ( ol )

MCGc

) < ) s

then node s avoids balancing

MCG ( h ) (multi c

channel group head of the MCGc , s MCGc ).

Then MCGc ( h) alerts all upstream unicast nodes to the node s of the multi channel group MGc . Upon receiving alerts from MCGc ( h) all upstream unicasting nodes attempts to balance their outflow load of the node s and updates their nd (ol ) . Each unicasting node that updated its nd (ol ) and alerts the MCGc ( h) , then MCGc ( h) estimates mcgd ( ol ) MCG and
c

checks the same with d (ol ) as follows mcgd (ol ) MCGc d (ol ) + is true or not. Here in this equation d (ol ) is the routing path level degree of outflow load and is outflow load threshold measured at the path level.

39

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN 2347-3916 (Online), Volume 1, Issue 1, July-December (2013)
If the given condition is true, then CMCGEL process ends, if not MCGc ( h) alerts MCG p (h ) then CMCGEL initiates at multi channel group MCG p , which is adjacent upstream multi channel group to MCGc . The CMCGEL process at MCG p is as follows: Upon receiving the alert from MCGc ( h) , the MCG p ( h ) alerts all upstream unicasting nodes of node s , which belongs to multi channel group MCG p . Then upstream unicasting nodes of the multi channel group MCG p , which are upstream nodes to node s balance their outflow load and define nd (ol ) then informs the same to MCG p ( h ) .Afterwards the MCG p (h ) measures
mcgd ( ol )
mcgd ( ol ) MCG p

and verifies it as follows:

MCG p

d ( ol ) +

If above equation is true then CMCGEL process ends at MCG p , if not that continues to next multi channel group in the upstream level of the MCG p This process continues till victim node i is free from clogging or if CMCGEL applied at all upstream multi channel groups of the MCGc . The process described above is attempting to avoid the clogging by balancing the outflow load between multi channel groups and the same can be referred as cooperative multi channel group level outflow load-balancing (CMCGEL). Once the CMCGEL ends then the source multi channel group evaluates the d (ol ) .Based on this d (ol ) value, the transmission source node balances its outflow load.

Cooperative multi channel Group egress Load-balancing (CMCGEL) Algorithm

P1:
|MCGc | mgd ( ol ) MCGc d ( ol )k MCG = k =1 |MCGc | c

If nd ( ol ) s

> mcgd ( ol )

MCGc

and

nd ( ol ) mcgd ( ol ) s MCGc MCGc

begin

Dt ( s ) = Dt ( s ) + bt Here Dt ( s) is delay time at the node s bt is buffering time threshold Value of buffering time threshold bt should be decided such that

d ( ol ) s mcgd (ol ) MCG + MCG c c

Return. Endif P2: Node s alerts multi channel group head MCGc ( h) about the clogging state of the node i . MCGc (h) Alerts all upstream unicasting nodes to node s nodes, which belongs to multi channel group MCGc Each node of {nu1 , nu 2 , ..., nuk }MCG updates their ndol and alerts about the same to
c

MCGC ( h)
40

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN 2347-3916 (Online), Volume 1, Issue 1, July-December (2013)
MCGc (h) Measures
mcgd (ol ) MCGc

by the subsequent equation:

|MCGc | nd ( ol )k mcgd ( ol ) = k =1 MCGc |MCGc |

If

mgd ( ol ) MG > dol c

and

( mgd ( ol ) MG dol ) c

begin

Alert: The victim node i is freed from clogging state Return. Endif P3: MCGc (h) Alerts MCG p (h)
MCG p ( h ) Alerts all unicasting upstream nodes to node s , which are belongs to multi channel

group MCG p For each upstream unicasting node {n | n MCG p } begin If nd (ol ) n
> mcgd ( ol ) MCG p

and

nd ( ol ) mcgd ( ol ) n MCG p MCG p

begin

d t ( n) = dt ( n) + bt The Value of buffer threshold bt should be decided such that nd (ol ) n Endif Find nd (ol ) n and send the same to MG p (h ) End-of-for each Then MCG p (h) measures mcgd (ol ) MCG
p
mcgd ( ol )

MCG p

MCG p

If mcgd (ol ) MCG

d ( ol )

and > 0

Alert: Balancing Outflow load at multi channel group MCG p removed clogging state at node
i. Return; Endif For each upstream multi channel group in sequence Begin Consider MCG p as MCGc

Consider immediate upstream multi channel group MCG p ' to multi channel group MCG p as
MCG p Go to P1 End-of-for each
{MCG | transmissioninitiation node is src and src MCG }Measures 1 1 |MCG| mcgd ( ol ) MCG i i d ( ol ) = =1 |MCG|

d (ol ) as

The transmission initiated node src that belongs to multi channel group MCG1 , balances the outflow load such that clogging state will be avoided.

41

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN 2347-3916 (Online), Volume 1, Issue 1, July-December (2013) 5. SIMULATIONS AND RESULTS DISCUSSION
The experiments were conducted using NS-2. We build a simulation network with hops under mobility and count of 50 to 200. The simulation parameters described in table 1. Authentication ensures that the buffer is properly allocated to valid frames. The simulation model aimed to compare OLCMCR and self-adaptive transmission scheme [12]. The performance check of these two carried out against to the metrics explored below

Table1: Simulation parameters that we considered for experiments

Number of nodes Range Dimensions of space Nominal radio range Sourcedestination pairs Source data pattern (each) Application data payload size Total application data load range Raw physical link bandwidth Initial ROUTE REQUEST timeout Maximum ROUTE REQUEST timeout Cache size Cache replacement policy Hash length Certificate life time 50 to 200 1500 m 300 m 250 m 20 4 frames/second 512 bytes/frame 128 to 512 kbps 2 Mbps 2 seconds 40 seconds 32 routes FIFO 80 bits 2 sec

The scalability of Frame Delivery Ratio with respect to the total number of source nodes that participating in routing and the traffic load emerged from them has been evaluated initially. When the source node count is up to 20, both self-adaptive transmission scheme and OLCMCR maintained their frame delivery ratio scalability in similar passion (see fig 1). During the increase in the source node count more than 20, the self-adaptive transmission scheme failed to retain its scalability (see fig 1). This is due to rise in the traffic load caused by increase in source nodes, and the clogging due to the overloaded traffic. The OLCMCR advantage over selfadaptive transmission scheme in frame delivery ratio observed is as follows: When node count between 10 to 20, the average 11% is the advantage of OLCMCR over selfadaptive transmission scheme observed in Frame Delivery Ratio. When node counts in between 25 to 45 the average 20% is the advantage of OLCMCR over self-adaptive transmission scheme observed in Frame Delivery Ratio. When node counts in between 50 to 40 the average 30% is the advantage of OLCMCR over selfadaptive transmission scheme observed in Frame Delivery Ratio. With these observations it is evident that self-adaptive transmission scheme is loosing its scalability an average of 10% per each 20 nodes increment in the cooperative multi channel routing path.

42

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN 2347-3916 (Online), Volume 1, Issue 1, July-December (2013)

Figure 1: The advantage of OLCMCR over self-adaptive transmission scheme in Frame Delivery ratio
The evaluation of the Frame Overhead metric (see fig 2) is evident that the OLCMCR is stable and scalable than self-adaptive transmission scheme. The observations indicate the following statistics: Average 73% of frame overhead for each 5 nodes increment in node count observed in self-adaptive transmission scheme over OLCMCR. Average 1% is the increment in frame overhead observed for each 5 nodes increment in node count observed for OLCMCR. Where as average 19% is the increment in frame overhead found for each 5 nodes increment in node count observed for OLCMCR.

Figure 2: The Scalability and Stability of OLCMCR over self-adaptive transmission scheme in frame overhead

43

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN 2347-3916 (Online), Volume 1, Issue 1, July-December (2013)

Figure 3: MAC load comparison report

6. CONCLUSION
This paper discussed a cooperative multi channel routing algorithm called Ordered Load-balancing Cooperative Multi Channel VoIP Routing Topology for clogging control in 802.11 WLAN networks in short referred as OLCMCR. This proposed routing strategy aimed to control clogging in ordered format, In this regard it first tries to control at hop relay node level outflow load balancing , if failed then attempts to control by group level outflow load balancing, if still not succeed then finally attempts to control the clogging with outflow load balancing between groups. Here in this protocol we derived set of algorithms called Cooperative Multi Channel Group Clogging Estimation (CMCGCE) and Cooperative Multi Channel Group Egress Load-balancing (CMCGEL). The CMCGCE algorithm is used to assess the state of the clogging at a group that caused frame dropping. CMCGEL initiates if the clogging state is observed and controls clogging in ordered order. The OLCMCR is network format independent. Hence it can work with a group of either tree or mesh. As a part of an experimental study, the proposed OLCMCR compared with ODMRP. The simulation results indicate that the OLCMCR improved the PDR and minimized the Frame overhead of self-adaptive transmission scheme in order of magnitude. With the motivation gained from simulation results of proposed routing topology OLCMCR, the future direction can be minimizing the energy usage in OLCMCR implementation.

REFERENCES
[1] G. Bianchi, "Performance analysis of the IEEE 802.11 distributed co-ordination function," IEEE J. Sel. Areas Commun. vol. 18, no. 3, pp. 535-547, Mar. 2000. [2] S. Garg and M. Kappes, "Can I add a VoIP call?," in IEEE International Conference on Communications(ICC), (Anchorage, Alaska), 2003. [3] H. Zhai, X. Chen and Y. Fang "A Call Admission and Rate Control Scheme for Multimedia Support over IEEE 802.11Wireless LANs," In Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE04) [4] S. Shin, H. Schulzrinne, "Experimental Measurement of the Capacity for VoIP Traffic in
44

Journal of Computer Engineering & Technology (JCET) ISSN 2347-3908 (Print), ISSN 2347-3916 (Online), Volume 1, Issue 1, July-December (2013)
IEEE 802.11 WLANs," in Preceeding of INFOCOM 2007. [5] C. Li, J. Almhana, J. Li, Z. Liu, and R. McGorman, "An Adaptive IEEE 802.11 Scheme for Voice and Data Services in Wireless LANs," in Proc. Fifth Annual Conference on Communication Networks and Services Research(CNSR'07) [6] Veres, A. T. Campbell, M. Barry, and L.-H. Sun, "Supporting service differentiation in wireless packet networks using distributed control," IEEE J. Sel. Areas Commun., vol. 19, no. 10, pp. 2081-2093, Oct. 2001. [7] S. Choi, J. Prado, S. Mangold, and S. Shankar, "IEEE 802.11e con- tentionbased channel access (EDCF) performance evaluation," in Proc. IEEE Int. Conf. Communications (ICC), Anchorage, AK, 2003, pp. 11511156. [8] Draft Supplement to Part 11: Medium Access Control (MAC) Enhancements for Quality of Service (QoS), IEEE Std 802.11e/D8.0, Feb. 2004. [9] H. Wei, K. Kim, A. Kashyap and S. Ganguly, "On Admission of VoIP Calls Over Wireless Mesh Network," In Proceedings of ICC 2006. [10] J. Yu, S. Choi, and J. Lee, "Enhancement of VoIP over ieee 802.11 WLAN via dual queue strategy," in In Proceedings of ICC 2004. [11] W.Wang, S. Liew, and V. Li, "Solutions to performance problems in VoIP over a 802.11 wireless lan," in In IEEE Trans. on Vehicular Technology, vol. 54, Jan 2005. [12] C. Li, J. Li, and X. Cai, "A novel self-adaptive transmission scheme over an IEEE 802.11 WLAN for supporting multi-service," Wireless Communications and Mobile Computing, vol. 6, no. 4, Jun. 2006, pp. 467-474.

45