A Qos-Oriented Distributed Routing Protocol for Hybrid Wireless Networks

 

A QOS-ORIENTED DISTRIBUTED ROUTING PROTOCOL FOR HYBRID WIRELESS NETWORKS ABSTRACT: As wireless communication gains popularity, significant research has been devoted to supporting suppor ting real-time real-time transmiss transmission ion with stringent Quality of Service Service (QoS) requirements requirements for  wireless applications. At the same time, a wireless hybrid networ that integrates a mobile wireless ad hoc networ (!A"#$) and a wireless infrastructure networ has been proven to be a  better alternative for the ne%t generation wireless networs. &y directly adopting resource reservation-based QoS routing for !A"#$s, hybrids networs inherit invalid reservation and race condition problems in !A"#$s. 'ow to guarantee the QoS in hybrid networs remains an open problem. n this paper, we propose a QoS-riented *istributed routing protocol (Q*) to enhance the QoS support capability of hybrid networs. $aing advantage of fewer transmission hops and any cast transmission features of the hybrid networs, Q* transforms the pacet routing problem to a resource scheduling problem. Q* incorporates five algorithms+ ) a QoSguarant gua ranteed eed neighbo neighborr select selection ion algori algorithm thm to meet meet the tr trans ansmis missio sion n delay delay requir requireme ement, nt, ) a distributed pacet scheduling algorithm to further reduce transmission delay, ) a mobility-based segment resi/ing algorithm that adaptively ad0usts segment si/e according to node mobility in order to reduce transmission time, 1) a traffic redundant elimination algorithm to increase the transmission throughput, and 2) a data redundancy elimination-based transmission algorithm to eliminate the redundant data to further improve the transmission QoS. Analytical and simulation results based on the random way-point model and the real human mobility model show that

 

Q* can provide high QoS performance in terms of overhead, transmission delay, mobilityresilience, and scalability.

EXISTING SYSTEM: •

#%isting approaches for providing guaranteed services in the infrastructure networs are

•

 based on two models+ integrated services (ntServ) and differentiated differentiated service (*iffServ). ntServ is a stateful model that uses resource reservation for individual flow, and uses

•

admission control and a scheduler to maintain the QoS of traffic flows. n contr contras ast, t, *i *iff ffSe Serv rv is a st stat atel eles esss mode modell whic which h us uses es co coar arse se-gr -grai ained ned cl clas asss-ba base sed d mechanism for traffic management. A number of queuing scheduling algorithms have  been proposed for *iffServ to further minimi/e pacet droppings and bandwidth

•

consumption. Stoica.et al. proposed a dynamic pacet service (*3S) model to provide unicast ntServ-

•

guaranteed service and *iffserv-lie scalability. 4iang et al. proposed to reserve the resources from the nodes with higher lin stability to

•

reduce the effects of node mobility. 5iao et al. proposed an e%tension of the *S6 routing protocol by reserving resources  based on time slots.

•

•

7enataramanan et al. proposed a scheduling algorithm to ensure the smallest buffer usage of the nodes in the forwarding path to base stations. 8onti et al. proposed to use nodes9 local nowledge to estimate the reliability of routing  paths and an d select reliable routes. $he wors balance traffic load among multiple routes to

•

increase routing reliability. reliability. Shen et al. proposed to let a source node fetch the lost pacets from its neighbors to recover rec over the multic multicast ast traff traffic. ic. Shen and $homas $homas propos proposed ed a unifie unified d mechani mechanism sm to ma%imi/e both the QoS and security of the routing.

 

•

5i et al. al. prop propos osed ed a ce cent ntra rali li/e /ed d al algo gori rith thm m to op opti timi mi/e /e th thee QoS QoS pe perf rform ormanc ancee by

•

considering cross-layer design among the physical layer, !A8 layer, and networ layer. :elemban et al. and *eb et al. proposed to improve routing reliability by multipath

•

routing. 8ai et al. propos proposed ed a semi semi distri distribut buted ed relayi relaying ng algori algorithm thm to 0oi 0ointly ntly optimi/e optimi/e rel relay ay

•

selection and power allocation of the system. ;ei et al. proposed to use the first-order finite state !arov channels to appro%imate the timee variat tim variation ionss of the average average receiv received ed signal signal-to -to-noi -noise se rat ratio io (S"6) (S"6) for the pacet pacet transmission and use the adaptive modulation and coding scheme to achieve high spectral

•

efficiency. 5ee et al. presented a frame-wor of lin capacity analysis for optimal transmission over  uplin transmission in multihop cellular networs.

•

•

;eii et al. proposed a two-hop ;e two-hop pacet forwarding forwarding mechanism, mechanism, in which the source node adaptively chooses direct transmission and forward transmission to base stations. Disadva!a"#s:  ) $hese #%isting protocols can increase the QoS of the !A"#$s to a certain e%tent, they suffer from invalid reservation and race condition problems. ) t diffic dif ficult ult to gua guaran rantee tee QoS in !A"#$ !A"#$ss due to their their unique unique featur features es includ including ing user  user  mobility, channel variance errors, and limited bandwidth.

PROPOSED SYSTEM: •

n order to enhance the QoS support capability of hybrid networs, in this paper, we

•

 propose a QoS-riented *istributed routing protocol (Q*). <sually, a hybrid networ has widespread base stations. $he data transmission in hybrid

•

networs has two features. :irst,, an A3 can be a source :irst source or a destination destination to any mobile node. Second, the number of  transmiss trans mission ion hops between between a mobile mobile node and an A3 is small. $he first first feature allows a

 

stream to have any cast transmission along multiple transmission paths to its destination

•

through base stations. $he second feature enables a source node to connect to an A3 through an intermediate

•

node. $aing full advantage of the two features, Q* transforms the pacet routing problem into a dynamic resource scheduling problem. Specifically, in Q*, if a source node is not within the transmission range of the A3, a source node selects nearby neighbors that can

•

 provide QoS services to forward its pacets to base stations in in a distributed manner. $he source source node schedu schedules les the pacet pacet str stream eamss to neighbo neighbors rs based based on their their queuing queuing conditi cond ition, on, channel channel condit condition ion,, and mobili mobility ty,, aiming aiming to reduce reduce transm transmiss ission ion time time and

•

increase networ capacity. $he neighbors then forward pacets to base stations, which further forward pacets to the destination. n this paper, we focus on the neighbor node selection for QoS-guaranteed

•

transmission. Adva!a"#s:  ) $he source node schedules the pacet streams to neighbors based on their queuing condition, channel condition, and mobility, aiming to reduce transmission time and increase networ capacity. ) $aing full advantage of the two features, Q* transforms the pacet routing problem into a dynamic d ynamic resource scheduling problem.

Ha$d%a$# R#&'i$#(#!s  

P$)*#ss)$ T+,# T+,#

: 3entium 7

 

S,##d

: .1 ='>

 

RAM

:  =&

 

Ha$d dis

: ?@ =& 

 

S).!%a$# R#&'i$#(#!s

/

O,#$a!i !i" S+s! +s!#( P$ P$)" )"$a $a(( ((i i" " Pa* Pa*a" a"## C)di" La"'a"#

: ;indows  : "et &eans *# .. : 4*B .

C

T))0

:  Sun 0ava wireless toolit for 85*8 version .2.

/ /

SYSTEM ARCHITECTURE:

MODULES: . "etw "etwor or  :orm :ormat atio ion n . <pload <pload 3acet 3acetss using using Q* 3rotoc 3rotocol ol . *own *ownlo load ad 3a 3ac cet etss

NETWORK FORMATION: •

:irst create a hybrid wireless networ with an arbitrary number of base stations spreading

•

over the networ. " mobile nodes are moving around in the networ. Since a hybrid networ where nodes are equipped with multi interfaces that transmit  pacets through multi channels generate much less interference than a hybrid networ  where nodes are equipped with a single ;i:i interface, we assume that each node is equipped with a single ;i:i interface in order to deal with a more difficult problem.

 

•

$herefore, the base stations considered in this paper are access points (A3s). $he ;i:i interface enables nodes to communicate with both b oth A3s and mobile nodes.

UPLOAD PACKETS USING QOD PROTOCOL:

•

Scheduling feasibility is the ability of a node to guarantee a pacet to arrive at its de dest stin inat atio ion n wi with thin in QoS re requ quir irem ement ents. s. As ment mentio ioned ned,, when when th thee QoS QoS of th thee di dire rect ct transmission between a source node and an A3 cannot be guaranteed, the source node

•

sends a request message to its neighbor nodes. After receiving a forward request from a source node, a neighbor node with space utility

•

less than a threshold replies the source node. $he reply message contains information about available resources for checing pacet scheduling feasibility, pacet arrival interval, transmission delay, and pacet deadline of  the pacets in each flow being forwarded by the neighbor for queuing delay estimation and distribute distributed d pacet scheduling scheduling and the node9s mobility mobility speed for determining determining pacet

•

si/e. &ased &as ed on this this inform informati ation, on, the source source node chooses chooses the replie replied d neighbo neighbors rs that that can guarantee the delay QoS of pacet transmission to A3s. $he selected neighbor nodes  periodically report their statuses to the source node, which ensures their scheduling

•

feasibility and locally schedules the pacet stream to them. $he individual pacets are forwarded to the neighbor nodes that are scheduling feasible in a round-robin fashion from a longer delayed node to a shorter delayed node, aiming to

•

reduce the entire pacet transmission delay. $hen the pacets are stored to the base station through neighbor nodes.

DOWNLOAD PACKETS:

 

•

:inall :in ally y mobile mobile node node wants wants to downlo download ad this this fi file. le. So aga again in Q* 6outin 6outing g 3rotoc 3rotocol ol

•

e%ecuted. $hen the pacets are downloaded through neighbor nodes.