Journal of Electronics and Communication Engineering & Journal of Electronics and Communication Engineering & Technology (JECET) ISSN

Technology (JECET)
23474181 (Print), ISSN 2347 419X (Online), Volume 1, Issue 1, July-December(2013)

ISSN 2347-4181 (Print) ISSN 2347-419X (Online) Volume 1, Issue 1, July-December (2013), pp. 21-26 IAEME: http://www.iaeme.com/JECET.asp

JECET

IAEME

CCLVR: COOPERATIVE CHANNEL LOAD AWARE VOIP ROUTING TOPOLOGY FOR 802.11 WLAN
Mohammed Sirajuddin1, Dr D. Rajya Lakshmi2 and Dr Syed Abdul Sattar3 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.
1

ABSTRACT In this paper, we propose a new cooperative channel load aware VoIP routing topology for 802.11 WLAN networks. Cooperative Channel based 802.11 WLAN networks have been proposed as an addition to the conventional single-hop 802.11 WLAN networks by joining the fixed cellular infrastructure with the Cooperative Channel transmitting technology that is frequently used in ad hoc networks. Due to the potential of the Cooperative Channel transmitting to enhance coverage, ability and flexibility, the Cooperative Channel based 802.11 WLAN networks have been drawing considerable notice. This approach of augmenting cellular communication with Cooperative Channel transmitting was also used in the consistency effort to include the Cooperative Channel transmitting into the third-generation (3G) mobile communication systems [1]. Keyword: 802.11, WLAN, congestion control, ad hoc network, QoS and CCLVR 1. INTRODUCTION The main advantage of the Cooperative Channel transmitting arrives from the reduction in the overall path loss among a Base node (BN) and a Receiving node (RN) [2]. The simultaneous transmission [3] can improve the system capacity of the Cooperative Channel based 802.11 WLAN networks. Furthermore, more than a few studies accounted that it is not easy to improve the capacity of code-division multiple-access (CDMA) systems by utilize of the Cooperative Channel transmitting [5, 6, 7, 8, and 9]. In 802.11 WLAN networks, there is a transaction difficulty between system throughput and QoS fairness [4]. Since the received signal quality depends on the user location, it is not easy to give an even QoS over the entire cell service region and to maximize the system throughput at the similar time. The Cooperative Channel transmitting technology has been future as one of the key technologies for the selfconfiguring 802.11 WLAN networks [10], [11], there have been merely little numerical results clarifying how the self-configuring feature achieved during the Cooperative Channel transmitting can develop the system ability for non consistently distributed traffic case.
21

Journal of Electronics and Communication Engineering & Technology (JECET) ISSN 23474181 (Print), ISSN 2347 419X (Online), Volume 1, Issue 1, July-December(2013)

Although Wu et al.[12] evaluated the capacity of the Cooperative Channel system with non consistent traffic, such that when the traffic among adjacent cells is unstable, that chapter focused only on the channel borrowing between adjacent cells through Cooperative Channel transmitting. The paper is organized as follows: Section 2 briefly describes the Network Architecture and challenges. Section 3 describes Detection of Concurrent Transmission Scenarios Section 4 briefly describes Defining and Deriving the Greedy Approach Section 5 describes the Implementation methodology and results Section 6 concludes the paper. 2. NETWORK ARCHITECTURE AND CHALLENGES In an 802.11 WLAN networks with frame-based transmissions, base Station attach to transmission node and/or receiving node, and every transmission node can attach further to additional transmission node and/or receiving node. Relay node only forwards traffic to receiving node and produce no traffic of its own. Relay node is visible to a receiving node, and receiving node does not engage in routing packets for additional receiving node. Base node, transmission node, and receiving node all share the similar spectrum, thus no additional hardware such as a second physical interface is required. Base node needs to meet the downlink real time queue range of its related transmission node and this queue information is sent to the base node with uplink bandwidth. The resulting signaling change due to uplink queue status report is unimportant, and the matching uplink bandwidth consumption is neglect able. After gathering transmission node queue Implementation of Scheduling Algorithm under Linear Programming: A linear programming model to implement the scheduling algorithm for 802.11 WLAN Cooperative Channel transmission network. The main advantages of this algorithm are Restraint 1: Derives the throughput for Mobile Station node in border, informative the simultaneous broadcast nature of the multi hops 802.11 WLAN networks. Restraint 2: Indicates the queue consciousness of the proposed preparation algorithm by monitoring Restraint 3: The dynamic TN queue status and this queue consciousness are not addressed by the associated work. The capacity restraint of a link in situation Sk. Restraint 4: Applies Shannons Theorem to compute the upper bound of link data rate with thought of the obstruction caused by simultaneous transmissions. Restraint 5: The time moderation of all simultaneous scenarios in a frame is stated by this restraint, suggestive of the frame-based characteristic of this approach. Restraint 6: Transitive relation between BN and TN will be careful and this restraint power the real delay calculated at TN that connected directly to the BN. 3. DETECTION OF CONCURRENT TRANSMISSION SCENARIOS The number of links grows non-linearly with the number of nodes in the network; it is unpractical to use a comprehensive algorithm to search for all probable scenarios. We use a linear programming model confirmed to compute the transmission schedules for all simultaneous transmission scenarios, aiming at maximizing the throughput in each frame. Here we consider the transmission schedules those subjective by the transitive relations between BN and TN.
22

Journal of Electronics and Communication Engineering & Technology (JECET) ISSN 23474181 (Print), ISSN 2347 419X (Online), Volume 1, Issue 1, July-December(2013)

4. DEFINING AND DERIVING THE GREEDY APPROACH In this Greedy Approach we apply the back force flow control mechanism. This mechanism states that in order to maximize the end to- end throughput in Cooperative Channel wireless network, the chosen simultaneous transmissions must be able to get the most out of the object function. We use a greedy algorithm to get a set of simultaneous transmission scenarios, with the back force flow control mechanism included into the greedy algorithm. Which are defined as: F ( S ) = ( i , j )S wij Rij 5. IMPLEMENTATION METHODOLOGY AND RESULTS
The Queue aware scheduling under transitive connection considerations has been implemented using mxml and action script. The accomplishment is based on cooperative channel transmission based wireless 802.11 WLAN networks routing functions that are added. In additional to building QoS routes, the topology also establish a best schedule plan when it learns such obligation. The best-effort scheduling is used to enhance the throughput. A distributed topology which dynamically generates and updates broadcast schedules among the nodes has been used. Assumed transmission rate is 1Mbps. The model detects all simultaneous transmissions, and responds by invoking scheduling behavior as suitable. The transmission node queues that are transitively associated to BN also be measured to end the Queue capacity of the transmission node that relies in middle between BS and transitive transmission node. We apply greedy search technique to recognize simultaneous relations of the simulation. And finally end the scheduling strategy using the linear program technique proposed. The restraints that consider by the proposed linear model explored above. LP model for arrangement in cellular transmission networks under transitive relation considerations. OBJECTIVE: maximize

a (t )
m m

INPUT VARIABLES: 1: RN index m; 2: frame index t; 3: frame duration T; 4: Under transitive condition the count of transmission stations r; 5: TN node is queue status Qim (t ) ; 6: The buffer status of RS node i is under cooperative transmission

Q (t )
m ir r =1

tc

7: a set of simultaneous transmission scenarios S k , 1 k K ; 8: power used from node i to j , Pij ; 9: distance between node i to j , d ij ;

23

Journal of Electronics and Communication Engineering & Technology (JECET) ISSN 23474181 (Print), ISSN 2347 419X (Online), Volume 1, Issue 1, July-December(2013)

OUTPUT VARIABLES:
1:
m xij (k , t )) , scheduled packets transmitted from node i to j in S k at frame t that are intended for MS node m ; 2: Tk(t), scheduled time portion for scenario S k Restraints

S sm =
3.

x (k , t )
sm s , k =1 K

where s is RN node ms upstream node index;

a m (t ) = S sm ( k )
k =1

4.
tc K K tc

r =1

m ir

(t ) +

k =1,s

m si

(k ,t) =

w ,k =1

x im w ( k , t ) +

r =1

m ir

(t + 1)

Where i is TN index and r is transitive TN index and tc is transitively associated transmission node count. s and w stands for node is upstream and transmission node, correspondingly; m 5. x ij (k , t ) w ij (k , t ) * T k (t )
m

Pij

6. w ( k , t ) = log (1 + ij 2

d ij
p xy d xj

) where

is the route missing

N 0 + ( x , y ) S k , ( x , y ) (i , j )

exponent, and din state is represented by N 0 ; 7.

T (t ) = T
k k =1

Figure 1: Throughput Comparison report

24

Journal of Electronics and Communication Engineering & Technology (JECET) ISSN 23474181 (Print), ISSN 2347 419X (Online), Volume 1, Issue 1, July-December(2013)

Figure 2: Fairness Comparison report 6. CONCLUSION

We have offered a Transitive relation aware scheduling algorithm for Cooperative Channel transmission 802.11 WLAN networks. Through our analysis, we dispute that following a centralized approach for building cellular transmission networks best reflects the interest of the 802.11 WLAN networks. This central approach implies that transmission stations and receiving nodes do not form ad hoc networks and they are under the control of the base node. Other choices of building transmission 802.11 WLAN networks we follow include using in-band spectrum of transmission stations, not permit receiving nodes to provide as transmission stations, and applying a centralized scheduling algorithm. An essential scheduling algorithm is developed and all BS will run this. In this algorithm, initially a set of simultaneous transmission scenarios is resting and then it is used as input for a linear programming model that decide the transmission schedules for the cooperative channel transmission network. The linear programming model aims at maximizing the overall throughput of the all the receiving nodes, while taking into attention the frame-based environment of 802.11 WLAN networks and the dynamic queue modify in the transmission stations. The features of frame-based and queue-awareness of the scheduling algorithm are the single assistance that has not been addressed by previous efforts. Simulations evaluate performance metrics such as throughput and equality of the proposed scheduling algorithm. Two extra scheduling algorithms are evaluated with our approach via simulations. One is scheduling for straight transmission only, and the other is scheduling with no buffer in the transmission nodes. The efficiency of our approach is validated by the simulation results.

REFERENCES
[1] 3GPP TR25.924, Opportunity driven multiple access, 3GPP, ver. 1.0.0, Dec. 1999. [2] TR 101 146, UMTS; UTRA; Concept evaluation (UMTS 30.06), ETSI, ver. 3.0.0, Dec. 1997. [3] S. Toumpis and A. Goldsmith, Capacity regions for wireless ad hoc networks, in Proc. IEEE ICC 2002, New York, Apr. 2002, pp. 31683173. [4] M. Airy and K. Rohani, QoS and fairness for CDMA packer data, in Proc. IEEE Vehicular Technology Conf. 2000 Spring, Tokyo, Japan, May 2000, pp. 450454.

25

Journal of Electronics and Communication Engineering & Technology (JECET) ISSN 23474181 (Print), ISSN 2347 419X (Online), Volume 1, Issue 1, July-December(2013)

[5] A. Fujiwara et al., Area coverage and capacity enhancement by multi hop connection of CDMA cellular network, in Proc. IEEE Vehicular Technology Conf. 2002 Fall, Vancouver, BC, Canada, Sept. 2002, pp. 23712374. [6] A. N. Zadeh and B. Jabbari, Performance analysis of multi hop packet CDMA cellular networks, in Proc. IEEE GLOBECOM 2001, San Antonio, TX, Nov. 2001, pp. 2875 2879. [7] T. J. Harrold and A. R. Nix, Performance analysis of intelligent relaying in UTRA TDD, in Proc. IEEE Vehicular Technology Conf. 2002 Fall, Vancouver, BC, Canada, Sept. 2002, pp. 13741378. [8] T. Rouse, S. McLaughlin, and H. Haas, Coverage-capacity analysis of opportunity driven multiple access (ODMA) in UTRA TDD, in Proc. IEE 3G Mobile Communication Technologies, Mar. 2001, pp. 252256. [9] T. Rouse, I. Band, and S. McLaughlin, Capacity and power investigation of opportunity driven multiple access (ODMA) networks in TDDCDMA based systems, in Proc. IEEE ICC 2002, New York, Apr. 2002, pp. 32023206. [10] A. G. Spilling, A. R. Nix, M. A. Beach, and T. J. Harrold, Self-organization in future mobile communications, Electron. Commun. Eng. J., pp. 133147, June 2000. [11] R. Becher,M. Dillinger,M. Haardt, andW. Mohr, Broad-band wireless access and future communication networks, Proc. IEEE, vol. 89, pp. 5875, Jan. 2001. [12] H. Wu, C. Qiao, W. De, and O. Tonguz, Integrated cellular and ad hoc relaying systems: iCAR, IEEE J. Select. Areas Commun., vol. 19, pp. 21052115, Oct. 2001.

26