Available online at ScienceDirect. International Conference On DESIGN AND MANUFACTURING, IConDM 2013

Transcription

1 Availabl onlin at ScincDirct Procdia Enginring 64 ( 03 ) Intrnational Confrnc On DESIGN AND MANUFACTURING, IConDM 03 Rsourc utilization of multi-hop CDMA wirlss snsor ntworks with fficint forwarding protocols Commnt [S]: Elsvir to updat with volum and pag numbrs. Uma Datta a, *, A. Mukhrj b, P. K. Sahu c and S. Kundu d a,b,c Dpt. of Elctronics and Instrumntation,CSIR-CMERI, Durgapur 7309, India d Dpt. of Elctronics and Communication, National Institut of Tchnology, Durgapur 7309, India Abstract In this papr, w propos a nw forwarding schm for a multi-hop CDMA wirlss snsor ntwork (WSN). Slction of intrmdiat nods considrs dtction probability along with maximum forwarding distanc by taking into account th wirlss channl condition, lik path loss, and shadowing. Enrgy and latncy prformanc using infinit btwn sourc and final dstination of proposd schm is studid. Prformanc of this schm is compard with narst nighbor basd routing schm, whr an intrmdiat nod in th rout slcts th narst nod within a sctor angl, considrd as sarch angl, towards th dirction of th dstination as th nxt hop. Furthr a fram work for packt siz optimization basd on rsourc utilization, capturing both nrgy consumption and dlay, is prsntd. 03 Th Th Authors. Publishd Publishd by Elsvir by Ltd. Elsvir Ltd. Opn accss undr CC BY-NC-ND licns. and pr-rviw undr rsponsibility of th organizing and rviw committ of IConDM 03. Slction and pr-rviw undr rsponsibility of th organizing and rviw committ of IConDM 03 Kywords: multi hop communication; bit rror rat; rgnrativ rlays; corrlation; rsourc utilization. Introduction Enrgy consrvation is on of th ky tchnical challngs in wirlss snsor ntworks. It is ncssary to dvis ntworking schms which mak judicious us of limitd nrgy rsourcs without compromising th ntwork connctivity and th ability to dlivr data rliably to th intndd dstination. Many nw algorithms hav bn proposd for th problm of routing data in snsor ntworks. Ths routing mchanisms hav considrd th charactristics of snsor nods along with th application and architctur rquirmnts. Almost all of th routing protocols can b classifid as data-cntric, hirarchical or location-basd although thr ar fw distinct ons basd * Corrsponding author. Tl.: ; fax: / addrss: uma_datta58@yahoo.in Th Authors. Publishd by Elsvir Ltd. Opn accss undr CC BY-NC-ND licns. Slction and pr-rviw undr rsponsibility of th organizing and rviw committ of IConDM 03 doi: 0.06/j.prong

2 Uma Datta t al. / Procdia Enginring 64 ( 03 ) on ntwork flow or QoS awarnss []. Data-cntric protocols ar qury-basd and dpnd on th naming of dsird data, which hlps in liminating many rdundant transmissions. irarchical protocols aim at clustring th nods so that clustr hads can do som aggrgation and rduction of data in ordr to sav nrgy. Location-basd protocols utiliz th position information to rlay th data to th dsird rgions rathr than th whol ntwork. Th last catgory includs routing approachs that ar basd on gnral ntwork-flow modlling and protocols that striv for mting som QoS rquirmnts along with th routing function. Svral routing protocols ar dscribd in th litratur, basd on location information of snsor / rlay nods [, 3, 4, 5, 6, 7]. A routing schm whr ach intrmdiat nod in a multi-hop rout slcts th narst nod within a sctor of angl ( ) toward th dirction of th dstination as th nxt hop, is considrd in []. owvr, nod isolation may occur in cas of low sarch angl in such schm. Gographic information-basd forwarding (GIF) [3] is an fficint schm for finding th appropriat rlay nod for nxt hop utilizing th location information whil avoiding a larg numbr of control packts during rout discovry. Rlay nods ar slctd basd on a singl critrion, i.., th maximum advancd distanc, to minimiz th numbr of hops from th sourc to th dstination nod. Prformanc may dgrad substantially ovr a bad channl with incras in nrgy consumption for succssful transmission of a packt du to incras in numbr of rtransmissions. An ffctiv approach for th rduction of unncssary rtransmissions du to propagation impairmnt is to choos th nxt hop rlay nod that is in good channl condition. This will offr fficint packt transmission and incras nrgy fficincy. In dsigning fficint packt-forwarding stratgy in WSNs, an fficint advancmnt mtric (EAM), considring th forwarding distanc and th probability of succssful packt transmission in a wirlss channl within a spcifid rgion is proposd in [4]. owvr, in a wirlss channl with a fixd path loss factor and shadowing, slction of intrmdiat nods in a multi hop transmission, jointly basd on probability of dtction following [] and maximum advancd distanc, may b anothr promising approach to rduc rtransmissions du to propagation impairmnt. To handl a larg numbr of nods, whr a numbr of nods simultanously and asynchronously accss a channl, CDMA is a good choic as a MAC protocol [8, 9, 0]. CDMA has bn advocatd for WSN in [9, 0], whr distribution of intrfrnc powr in randomly distributd nods is discussd. Bit Error Rat (BER) and nrgy consumption in CDMA WSN multihop communication with fixd hop lngth is studid in [] using infinit Automatic Rpat rqust () with CRC. Abov analyss of multi hop communication do not includ any routing topology for th slction of nighbouring nods. In this papr, w propos a nw routing protocol basd on prslctd probability of dtction of nighbours considring a snsing rang in shadowd nvironmnt [] and combind with maximum advancd distanc with rspct to th final dstination for th slction of intrmdiat nods. Th slction paramtr is basd jointly on probability of dtction and maximum advancd distanc. Dtction probability includs paramtr of shadow fadd channl implicitly with an objctiv of rducing nrgy consumption (i.. nrgy spnt in communication). Maximum distanc mans that th chosn nod is narst to sink, with an objctiv of rducing numbr of hops in th multi hop transmission. W analyz th prformancs of CDMA basd multi-hop WSNs using th proposd routing protocol and compar with th routing protocol as proposd in [] undr th sam wirlss channl nvironmnt. Th papr is organizd as follows: Th systm modl along with th proposd protocol is prsntd in sction. Sction 3 prsnts our analytical approach to valuat th nd-to-nd BER, nrgy consumption, and dlay. Cross layr solution for packt optimization is discussd in sction 4. Rsults basd on our dvlopd fram work ar prsntd in Sction 5. Finally w conclud in Sction 6.. Ntwork Modl and Problm Dscription In this sction, w dscrib th wirlss snsor ntwork modl using two forwarding protocols and th basic assumptions considrd in th papr... Routing protocol basd on sarch angl W first considr th ntwork architctur for th narst nighbour basd forwarding protocol [], whr N numbrs of nods ar distributd ovr a rgion of ara A, obying random topology. To avoid dg ffct of a finit ara, as xplaind in [, 5], w assum th ntwork surfac to b th surfac of a torus with Y as lngth of

3 48 Uma Datta t al. / Procdia Enginring 64 ( 03 ) ach sid, i.. A ( Y ). A minimum distanc of r 0 btwn any two nods is considrd, which is sufficintly small as compard to th distanc btwn sourc and final dstination, i.. sink. Th nod spatial dnsity S may b approximatly dfind as S N / A. Following [], th avrag numbr of hops on a rout for a sarch angl undr th constraint of r 0 is stimatd as [3]: n rand ( ( Y [ 3 /( ) /( S S ) ln( )] r ) ( / ) sin( 0 r ) ( / ) sin( 0 Z / ) / ) whr Z rprsnts avrag lngth of th rfrnc path btwn a sourc and dstination nod. Lt w b a random variabl dnoting th distanc to th narst nighbour in a two dimnsional Poisson nod distribution. Following [], th CDF of th distanc to th narst nighbour within a sctor angl of in a torus, for fixd nod spatial dnsity with larg N undr th constraint of r 0 is stimatd as [3]: () ( ) F W ( w), w Y s ( w r0 ) /, 0, othrwis r 0 w Y ().. Forwarding protocol basd on probability of dtction combind with maximum forwarding distanc Th proposd forwarding protocol basd on dtction probability is dvlopd on a simulatd tst bd. In th nxt sctions, as w compar th prformanc of th proposd protocol with th protocol basd on sarch angl, sourc to sink distanc is considrd to b th sam ( Z ) in both cass. Though our modl is circular, w hav maintaind sam distanc from sourc to sink as considrd in [] whr th ntwork modl is squar. W considr th ntwork architctur whr nods ar uniformly distributd ovr a circular rgion of radius Z, as statd in (). Minimum distanc btwn two nods is qual to r 0. Sink is considrd to b at th cntr and sourcs ar at th priphry of th circular rgion, i.. at farthst distancs, to kp th rfrnc distanc btwn th sourc and sink sam in both protocols. Othr nods ar considrd only as intrmdiat rlay nods. Channl conditions, i.. path loss and shadowing ar assumd to b fixd at a particular lvl throughout th ntwork. Slction of intrmdiat rlay nods to snd th packt from sourc to th dstination i.. th sink is govrnd by th following algorithm, simulatd on MATLAB: Considring a maximum forwarding / snsing distanc and standard dviation of shadowing, avrag snsing distanc ( R ) is dtrmind following []. Nxt probability of dtction of all othr nods from th dsignatd sourc nod is stimatd using (3) of [] as: 0 log0( rrn ) / R) Pdt rrn Q( ), whr r Rn n- nod in th ara undr invstigation. Th nxt rlaying nod is slctd as th on with probability of dtction gratr than or qual to a prslctd valu at that channl condition and closst to th dstination, i.. th sink, and towards th sink. This nod bcoms in turn th transmittr for th nxt hop, and th packt rachs th final dstination through multi hop transmission. All link / hop distancs ( r Ri ) ar calculatd from th known locations of th slctd i-th hop of multi hop communication.

4 Uma Datta t al. / Procdia Enginring 64 ( 03 ) MAC protocol and transmission schm r w considr CDMA-basd MAC protocol. For xampl in Fig., dstination nod, i.. sink, D is rciving information from th sourc nods S, S, S, S3 tc., via multi-hop communication using digital rlays. Rlays rgnrat th rcivd signal and thn transmit th sam with powr control to th nxt hop. In CDMA snsor ntwork, any nod can transmit to its narst nxt nighbour nod at any tim. Thus at a particular instant, w assum that nods (f,h,i), (d,,h,i), (j,k,l), (a,b,c) ar usd as intrmdiat nods to rout th information from sourc nods S, S, S,S3 rspctivly to th sink. As pr proposd schm, nxt hop rlay nods ar slctd according to th algorithm prsntd in Sc.., whil in cas of narst nighbour basd schm, nods ar slctd following th algorithm in Sc... Furthr, ach transmittr adjusts its transmission powr so as to achiv a givn lvl of rcivd powr ( P r ) at its intndd rcivr. Accordingly th transmit powr dpnds upon th path loss btwn th transmittr and th rcivr pair ( r Ri ), and th statistics of shadowing. Svral concurrnt nods thos ar s rri would intrfrnc rang r Ii ( rii rri ), which dsird signal at ach rcivr nod is accompanid with MAI and NI. W obtain th intrfrnc powr distribution at ach nod following [0, ]. 3. Analysis of Rout BER, Enrgy Consumption and Dlay W assum is th avrag numbr of hops btwn sourc S and dstination D. Channl conditions ar assumd to b sam from sourc to sink. Following [0], th man valu of th collctd intrfrnc powr from an intrfring nod (i.. d is ) to any dsird rcivr (i.. h): Fig.. Signal flow at a particular instant in multi-hop communication msdh Sdh msd Sd can b found out as in [0] as: mrd Rd.. (3)

5 50 Uma Datta t al. / Procdia Enginring 64 ( 03 ) P R rr r0 ri r0 ri ri r0 4 0 R r r 0 r P R (4) whr m S d, m R d ar th man and S, d rspctivly for an arbitrary path d. Furthr is th path loss xponnt 6 and R ar th standard dviation of shadowing ( S d d ) and pc ( R ) d m S dh, S ar th man dh d btwn th nods d and h. Th xpctd numbrs of nods and standard dviation of shadowing of th path dh within th rciving and intrfrnc rang of th rcivr ar givn by (5) rspctivly [0] c c S S R I r -r R ) whr S is th nod dnsity. Activity factors dtrmin th numbr of activ nods at any instant contributing MAI and NI, which ar fractions of c and c as givn in (5). Following [4], th man probability of rror at any hop can b approximatd by m m 3 m 3 P Q Q Q (6) W considr multi-hop paths btwn sourc and th sink with avrag numbr of hops ( nrand), and avrag distanc at ach hop ( w rr ), as xprssd by () and () rspctivly. Th rout BER for hops, without any rror corrction mchanism applid at th intrmdiat rlay nods, is xprssd as [5], ( P ) (i) i P ( i) whr P is th man probability of rror at i-th hop. Furthr n f bits pr packt including CRC and ovrhad ( bits) is considrd in forward transmission of information and n b bits/packt for NACK /ACK with an assumption of instantanous rror fr rcption of NACK/ACK. Assuming prfct rror dtction of a CRC cod and infinit rtransmission, mchanism is usd for rror corrction. In th prsnt schm, th packt is chckd only at sink for rror control; rtransmissions of th packt ar rqustd to sourc, with a NACK coming back from sink to sourc through th sam multi-hop path till th packt is rcivd corrctly. Avrag nd-to-nd packt rror lvl for hops is f n f ( P ) ( ( P ) ) whr ( P ) is givn in (7). Avrag numbr of rtransmissions for succssful dlivry of a packt []: ( (9) N ) / ( P f ) Th nrgy E b rquird to communicat on bit of information from sourc to sink through -hop communication i.. nd-to-nd dlivry [6]: whr E b ( Pti Pr ) / Rb i (0) Rb is th data rat, P ti is th man of transmittd powr for i-th hop of lngth r Ri, and is rprsntd by (5) (7) (8)

6 Uma Datta t al. / Procdia Enginring 64 ( 03 ) P ti P r R Ri m Sd S m d Rd. Rd W hav includd th nrgy consumption du to start-up transints of transcivrs in stimating total nrgy consumption. Assuming avrag start-up nrgy from slp mod to ithr transmit/rciv mod is qual to 0 micro Joul [7, 8], th nrgy consumd pr packt from sourc to sink, i.. singl loop transmission of information from sourc to sink via hops, with ACK/NACK from sink to sourc via multi-hop is: 3 ( E ) E n E n 0 0. pkt b f b b Nods ar assumd to b wak up from slp stat to activ stat at th bginning of transmission and rmain in that stat till succssful dlivry of packt. Sinc on th avrag, ach packt rquirs ( numbr of N) rtransmissions from sourc to dstination for succssful dlivry, avrag nrgy consumd by a packt for succssful transmission via multi-hop is : Eav ( N).( Eb n f Eb nb ) 0 0. Avrag packt dlay for succssful transmission of packt is obtaind as [9]: av D ( N). n / R (4) 4. Packt Siz Optimization f b Following [0], U rs ), a mtric that considrs both nrgy consumptions and dlay for succssful packt transmissions undr prsnt routing schms as: rs av av U E D / l ( P ) (5) d f d whr l d ( n f ) is th mssag lngth. Minimizing this function by stting ( U rs ) 0 rsults in optimal dl packt siz ( L rs opt 3 ), that balancs th trad-off btwn nrgy consumption and latncy, spcially usful for dlay rs opt snsitiv WSN. Aftr simplification, L is obtaind as: d () () (3) rs opt L 4 ln ( P ) (6) 5. Rsults Sam channl condition and avrag rfrnc distanc btwn sourc and sink ar considrd for both schms. Paramtrs usd in prsnt analysis, basd on smi-analytic mthod, ar givn in Tabl. Man of all shadowing and pc componnts ar considrd to b zro. W assum that 50% of total nods within rciving distanc ( r R ) of sink ar activ for MAI whil 5% of nods btwn r R and r I of sink ar activ for NI. As w considr uniform distribution of nods, and ri rr, 5% of total nods within r R of othr intrmdiat rlay nods ar activ for MAI whil sam prcntag of nods btwn r R and r I of othr intrmdiat rlay nods ar activ for NI at any instant. All paramtrs at ach hop ar calculatd considring distanc btwn two conscutiv nods as r Ri mtr, whr r Ri calculatd by using () and () for sarch

7 5 Uma Datta t al. / Procdia Enginring 64 ( 03 ) angl basd protocol. Th procdur adoptd for th valuation of link BER, followd by rout BER and avrag rout BER for th stimation of diffrnt QoS paramtrs, using th two forwarding protocols, ar dscribd blow: Tabl : Paramtrs usd Paramtr Valu of Y Min. distanc btwn two nods ( r0 ) Procssing Gain ( pg ) Constant rciv powr ( PR ) Path loss paramtr ( ) Transmission rat (Rb) NACK/ACK (nb) Standard dviation of pc ( R) Standard dviation of Shadowing ( s) Band width Ovrhad ( ) Start up nrgy/nod Maximum forwarding / snsing distanc Valu 00 m m 8.0x 0-07 mw 3 0.0kbps bits db 3 db 5 Mz 8 bits 0micro Joul 30 m (A): Forwarding protocol basd on sarch angl with narst nighbour: Avrag numbr of hops btwn sourc and dstination n rand is calculatd by using () for a particular sarch angl ( ), and rfrnc distanc as xprssd in (), considring Y=00m. Avrag hop distancs ( r Ri ) ar stimatd by using () by gnrating n rand numbr of random variabls. Link BER at ach hop is valuatd using (7), followd by rout BER for that using (8). Avrag rout BER, rout nrgy consumption, and avrag dlay for succssful transfr of information from sourc to sink, and rsourc utilization ar valuatd. (B): Forwarding protocol basd on probability of dtction with maximum advancmnt: Undr th proposd protocol, r Ri aftr slction of intrmdiat rlay nods by th algorithm as dscribd in sction.. Nxt th QoS paramtrs ar valuatd in sam way as in schm A. Figur compars th variation of avrag rout BER with nod dnsitis undr two diffrnt protocols. Impact of sarch angls for narst nighbor basd protocol, and various probabilitis of dtctions with (i) Avrag rout BER 0-3 (ii) 0-4 (iii) Narst nighbor basd forwarding protocol with sarch angl in dgr: (iv) 0-5 (i) : 0, (ii): 60 Channl awar forwarding protocol with prob. of dtction: (iii): >=0.6, (iv): >= Nod dsnity/m Fig.: Variation of avrag rout BER with nod dnsity for two diffrnt forwarding protocols. snsing distanc of 30m for proposd protocol ar shown. In cas of narst nighbour basd protocol, with incras

8 Uma Datta t al. / Procdia Enginring 64 ( 03 ) in nod dnsity or sarch angl, numbr of nods within a particular incrass, which rsults in dcras in hop lngth and incras in avrag numbr of hops. In this cas, dcras in avrag hop lngth is associatd with rduction in intrfrnc, which improvs th link BER. This in turn rsults improvmnt in avrag rout BER with nod dnsity or (curvs i and ii). In cas of channl awar forwarding protocol, highr probability of dtction rducs distanc of nxt hop nighbour, which rsults in improvd link BER followd by lowr rout BER as sn in curvs iii and iv. With incras in nod dnsity, kping probability of dtction fixd at a lvl, numbr of intrfrrs incrass, thus avrag rout BER incrass. Thus channl awar forwarding protocol may outprform th othr in som cass and choic of sarch angl plays an important rol. Figur 3 compars th variation of avrag nrgy consumd by all participating rlay nods for succssful transmission of a packt of lngth 64 bits with sarch angl ( ) / probability of dtction for diffrnt valus of nod dnsitis. In cas of narst nighbour basd forwarding protocol, with incras in nod dnsity or sarch angl link distanc dcrass with incras in numbr of hops. Though transmit powr at ach nod dcrass, but combination of start up nrgy of all participating nods rsults in incras in avrag nrgy consumd for succssful transmission of a packt from sourc to sink (curv i, iv ). owvr, in cas of channl awar forwarding protocol, for a fixd shadowing and path loss, variation of link distanc is insignificant with incras in nod dnsity, thus avrag nrgy consumption for succssful transmission of packt from sourc to sink primarily dpnds upon th numbr of rtransmissions and total start-up-nrgis of participating rlay nods. igh dtction probability (i.. P dt >=0.99) rsults in low numbr of rtransmissions, but incrass combind start-up-nrgy significantly. This incrass avrag nrgy consumption for succssful transmission of information at a fixd nod dnsity (curv ii). With incras in nod dnsity, numbr of intrfrrs incrass followd by incras in numbr of rtransmissions for succssful dlivry of information and avrag nrgy consumptions. For lowr valu of dtction probability (P dt >=0.8), link distanc incrass which causs highr transmit nrgy at ach nod and incras in numbr of rtransmissions at highr nod dnsitis. owvr, it also rsults in significant rduction in th total start- up-nrgis du to lowr numbr of hops. Combination of ths two factors lowrs th avrag nrgy consumption with dcras in probability of dtction (curv iii). Av.total Enrgy consumption from sourc to sink in mj Packt lngth=64 bits Forwarding protocol basd on sarch angl in dgr: (i) :60, (iv) :0 Forwarding protocol basd on prob. of dtction: (ii) :>=0.99, (iii) : >=0.8 (i) (ii) (iii) (iv) Nod dsnity/m Fig.3: Variation of avrag nrgy consumptions with nod dnsity for two diffrnt forwarding protocols, considring succssful transmission of packt from sourc to sink. Figur 4 compars th variation of dlay/latncy with th two forwarding protocols for succssful transmission of a packt of lngth 64 bits for various nod dnsitis. Using narst nighbour basd forwarding protocol, avrag rout BER improvs with incras in nod dnsity or sarch angl. Thus avrag dlay of th ntwork dcrass with incras in or nod dnsity du to rduction in numbr of rtransmissions (curvs iii, iv). In cas of channl awar protocol, with incras in nod dnsity/dcras in probability of dtction, numbr of intrfrrs incrass, which incrass dlay (curvs i, ii) du to incras in numbr of rtransmissions.

9 54 Uma Datta t al. / Procdia Enginring 64 ( 03 ) Avrag rout Dlay in Sc Mssag lngth=64 bits Narst nighbor basd forwarding protocol with sarch angls in dgr: (iii): 0, (iv): 60 Channl awar forwarding protocol wih prob. of dtction: (i): >=0.6, (ii): >=0.99 (i) (ii) (iii) (iv) Nod dsnity/m Fig.4: Variation of avrag rout dlay with nod dnsity for two diffrnt forwarding protocols, considring succssful transmission of packt from sourc to sink. Figur 5 shows th variation of rsourc utilization ( U rs ) (as in qn. 5) with packt lngth undr two diffrnt forwarding protocols for a fixd nod dnsity 0.06/m. At low packt lngth rgion, U rs is significantly high du to rasonabl siz of ovrhad, which is comparabl with th mssag lngth. At high packt lngth rgion, incrass slowly. It is du to incras in numbr of rtransmissions bcaus of dgradation in PER. In cas of low sarch angl, th rat of incras is apprciably high (curv i) du to high link distanc. It is obsrvd that thr xists an optimum packt lngth, dpnding on th ntwork condition, which yilds minimum rsourc utilization byond which rsourc utilization incrass du to significant incras in rout PER. Th optimizd packt lngths as obsrvd from th curvs, for diffrnt sarch angls and dtction probabilitis, match with thos obtaind by using (6), as shown in tabl. U rs Rsourc Utilization.8 x 0-5 Ch. awar forwarding protocol:.6 (ii): dtction probability>=0.8 (iii):dtction probability>= Narst nighbor basd forwarding protocol with sarch angl:. (i): 40 dgr (iv): 60 dgr (i) (ii) (iii) (iv) Packt Lngth in Bits Fig.5: Variation of rsourc utilization with packt lngths for two diffrnt forwarding protocols, considring succssful transmission of packt from sourc to sink. Tabl : Optimizd packt lngth using (6) for diffrnt sarch angls, probabilitis of dtction ; nod dnsity 0.06/m in ach cas. Routing protocol basd on sarch angl Routing protocol basd on probability of dtction Sarch angl Probability of dtction >=0.99 >=0.8 Optimizd packt lngth (bits/packt) Optimizd packt lngth (bits/packt) Conclusions In this papr, using a smi-analytical modl, th nd-to-nd prformanc of a CDMA basd random wirlss

10 Uma Datta t al. / Procdia Enginring 64 ( 03 ) snsor ntwork in trms of avrag rout BER, avrag nrgy consumption pr nod, and dlay in succssful transmission of packtizd data from sourc to a sink via multi hop is stimatd using a nw channl awar forwarding protocol, whr slction of intrmdiat rlay nods for multi hop opration is basd on th probability of dtction combind with maximum advancd distanc with rspct to th dstination. Th prformanc is compard with th narst nighbour basd forwarding protocol, whr intrmdiat rlay nods is slctd as th narst nod within a sctor of angl ( ) towards th dirction of dstination. Variation of nrgy consumption with nod dnsity is lowr in cas of channl awar protocol than narst nighbour basd protocol. Rsourc utilization mtric which combins nrgy consumption and dlay is also compard for th two protocols. Optimum packt lngth which yilds bst rsourc utilization is indicatd undr two protocols. Bst rsourc utilization within a rang of packt lngth is obsrvd with channl awar protocol with high probability of dtction. This study is usful for dsigning nrgy fficint and dlay critical CDMA WSN with fficint rsourc utilization. Rfrncs [] publication, vol.3, issu 3, May 005, pp [] l Computing, Vol.5, No. 0, Octobr 006, pp [3] bil Comput., vol., no. 4, pp , Oct. Dc [4] -Efficint Cross-Layr Protocol of Channl-Awar Gographic-Informd Forwarding in Wirlss Snsor [5] Banrj S., and Misra A. Communication in Multi [6] Panigrahi B., D S., Panda B.S., and Lan Sun Luk J.D., Enrgy-Efficint Grdy Forwarding Protocol for Wirlss Snsor Ntworks gy Confrnc(vtc 00- spring), pp.-5. [7] Zhijun Cai, Mi Lu, Xiaodong Wang Minimum Avrag Transmission Powr Routing in CDMA Ad oc Ntworks Utilizing Procdings of th 6th Intrnational Paralll and Distributd Procssing Symposium (IPDPS '0), pp [8] w-xian Tan, Winston K. G. Sah, and Kwang- 3nd IEEE Confrnc on Local Computr Ntworks 007, pp [9] th -0. [0] - IEEE Journal on Slctd Aras in Communications, Sptmbr, Vol., No.7, pp [] Datta, U., Sahu, P. K., Kundu, C. and Kundu, S. -00), July 9- August 0, 00, Mangalor, India, pp [] Tsai Yuhon Vhicular Tchnology, January 008, Vol.57, No., pp [3] Datta, U.and Kundu, S. Third Intrnational Confrnc on Emrging Applications of Information Tchnology (EAIT 0). [4] Jrz, R., Ruiz-Garcia, M. and Diazl.4, No., pp [5] Thortic Prspctiv, Wily publication, John Wily and sons, 004, England. [6] Intrnational Confrnc on Computr Scinc and Softwar Enginring, pp [7] -TR000 Transcivr, Novmbr 00. [8] [9] - Vhicular Tchnology, Vol.49, No., March, pp [0] Mhmt C. Vuran, Ian F. Akyildiz -layr Packt Siz Optimization for Wirlss Trrstrial, Undrwatr, and Undrground Snsor pp