QoS Aware Inter-Cluster Routing Protocol for IEEE Networks

Transcription

1 215 17th UKSIM-AMSS Internatonal Conference on Modellng and Smulaton QoS Aware Inter-Cluster outng Protocol for IEEE Networks Ahmed Ben Saleh Dept. Computer Scence &IT Unversty of Bsha Bsha K. S.A. Martn J N Sbley Dept. Engneerng & Technology Unversty of Huddersfeld Huddersfeld U.K. m.j.n.sbley@hud.ac.uk Peter Mather Dept. Engneerng & Technology Unversty of Huddersfeld Huddersfeld U.K. p.j.mather@hud.ac.uk Abstract In Qualty-of-servce (QoS) aware routng for IEEE Networks we address certan ssues n delay and relablty domans. To overcome these ssues, we propose to develop a routng protocol desgned n the cluster tree network whch conssts of few modules lke relablty module, packet classfer, hello protocol module and routng servce module. The data s transferred from MAC layer to network layer n relablty module whch takes care of transmsson of messages and acknowledgements. Usng the Packet classfer the packets are classfed nto the data and hello packets. The data packets are classfed based on the prorty. Hello protocol module construct neghbor table and mantan nformaton about neghbor nodes relabltes. Next usng the routng servce module routng table s bult. The delay n the route s controlled usng delay metrcs, whch s a sum of queung delay and transmsson delay. Keywords IEEE ; Qualty of Servce; elablty module; Packetclassfer ; Hello protocol. I. INTODUCTION A. IEEE Networks IEEE standard descrbe the physcal layer and the MAC sub-layer specfcatons for low rate wreless personal area networks (L-WPAN). The standard also states a carrer sense multple access wth collson avodance (CSMA-CA) protocol to deploy n Contenton Access Perod (CAP). It provdes a smple and energy effcent contenton based channel access mechansm and provdes same probablty for all devces to access the medum [1] [2] [4] [5]. Accordng to the physcal (PHY) and medum access control (MAC) layers of IEEE , the specfcaton for the upper layers (ncludng the network and applcaton layers) s defned n the ZgBee protocol stack. ZgBee support applcatons lke home automaton schemes, remote control and montorng systems, and health care devces [9]. B. Clusterng and Cluster Based outng Sensor networks collect data from a cluster of wreless sensor nodes usng a cluster head (CH) whch may be a moble node passng by or a regular node assgned the role of CH. The CH objectve s to quckly gather one packet of data from each sensor node wthn range [1]. The cluster tree topology suts much for ZgBee networks especally for low-power and low-cost WSNs as clusterng can enable power savng operatons and lght-weght routng. The nter cluster routng s the routng of the network from source of one cluster to destnaton of another cluster va some clusters and the cluster head s responsble for transmsson. Though the ZgBee cluster-tree network provdes a good soluton for WSNs, the restrcted routng paths s always a bottleneck n packet transmssons [11]. C. QoS Based Inter Cluster outng Conventonal routng n IEEE networks reles on Ad hoc On-demand Dstance Vector (AODV) whch smoothens the mesh network buldng for data dssemnaton[3][5]. IEEE MAC has dual operatonal mode features (non-beacon-enabled mode/beacon-enabled mode). Energy can be conserved n ts beacon-enabled mode usng the F sleep mechansm, though t suffers from lower data throughput. Meanwhle hgher data throughput can be acheved n the non-beaconenabled mode hence ths standard seems more attractve for provdng multmeda servces over the networked sensors, but wth much sgnfcant energy consumpton [4]. QoS s a measure of the servce qualty offered by the network to the applcatons and users. Some typcal wreless data networks QoS requrements are throughput, latency, jtter, packet loss and so on [1]. A WSN must satsfy four QoS requrements for relable mplementaton n ndustral envronment namely Scalablty, elablty, Tmeless, Energy effcency [6]. A msson-crtcal network servcng a geographc area wth rsk of people s lves or lvelhoods, the qualty of servce (QoS) for crtcal packet delvery s of prme mportance as any sgnfcant transmsson delay and packet loss could result n a terrble dsaster. However, n tradtonal ZgBee cluster-tree networks, t s dffcult to guarantee QoS for crtcal packet delveres because of transmsson bottlenecks [9] Many Qos protocols were proposed such as Feng Chen et al [4] proposed mode swtch, an adaptve load-senstve soluton to assst an energy-effcent operaton mode to transmt normal sensor data as well as a QoS-aware lowlatency mode for hgh prorty emergency data. However the much hgher reconstructon tme s due to the ncreased probablty of beacon collsons. Bogdan Pavkov et al [8] proposed to adapt the clustertree of IEEE to perform effcently PL (outng Protocol for Low power and Lossy Networks). However the delay was ncreased /15 $ IEEE DOI 1.119/UKSm

2 Zahoor A. Khan [11] proposed a routng protocol wth QoS requrements of BAN data wth strct relablty requrements. Ths algorthm enhanced the relable delvery of crtcal BAN data at the destnaton. The QoS based routng protocol mproved performance n relablty senstve data n terms of successful transmsson rate. In ths paper, we propose to develop a QoS aware routng protocol n the cluster tree network whch s the extenson of our prevous work n whch we have proposed an Energy Effcent Cluster Schedulng and Interference Mtgaton for IEEE Network[12]. Secton 2 presents the proposed soluton and secton 3 presents the smulaton results and the concluson s provded n secton 4. II. POPOSED SOLUTION A. Overvew In our prevous paper we proposed an Energy Effcent Cluster Schedulng and Interference Mtgaton for IEEE Network. Intally the nodes n the network are grouped to form a cluster. Then, a tme dvson cluster schedulng technque s consdered that offers energy effcency n the cluster-tree network. To schedule the tme dvson schedulng the dynamc mode and beacon nterval s calculated. The nterference n the channel s detected usng channel sensng technque. Fnally, an nterference mtgaton technque s used to mtgate the nterference based on packet-error detecton and repeated channelhandoff command transmsson [12]. In ths extenson paper work we have proposed a QoS aware routng protocol n the cluster tree network. It conssts of modules such as relablty module, packet classfer, hello protocol module, routng servce module. The data s transferred from MAC layer to network layer n relablty module whch takes care of transmsson of messages and acknowledgements. Packet classfer classfes the data and hello packets. The data packets are classfed based on the prorty. Hello protocol module construct neghbor table and mantan nformaton about neghbor nodes relabltes. Next usng the routng servce module routng table s bult and the data packets are classfed nto SP and OP. The delay n the route s controlled usng delay metrcs, whch s a sum of queung delay and transmsson delay. Fg 1. Block Dagram B. Packet Classfcaton The packet classfcaton s made by usng packet classfer. It dfferentates the data packets and the hello packets. The packet classfer forwards the data and the hello packets to the routng servce module and the hello protocol module. C. elablty module elablty module passes the nformaton of successful data packets transmsson acknowledgements from MAC layer to the network layer. It montors the number of packets sent to neghbor node j and the number of acknowledgements receved from neghbor node j. From ths nformaton the network layer calculates the lnk relablty between node to the neghbor node j Lnk relablty= lnk(,j) The average probablty of successful transmsson after 4 seconds s gven by, χ = N N Acks Trans The lnk relablty can be calculated as, lnk (, j) = (1 ) lnk (, j) ρ + ρ χ (2) where ρ s the average weghng factor that satsfes < ρ 1, The path relablty between node and destnaton node Dst( path(i,dst) ) s calculated by usng = path(, Dst) lnk (, j) path( j, Dst) (1) (3) 539

3 D. Hello protocol module The hello packets are broadcasted to the Hello protocol module. Ths module conssts of two sub-modules such as neghbor constructor table and neghbor table. In the neghbor constructor table the neghbor table s bult accordng to the nformaton obtaned from the Hello packet and MAC layer relablty module. By recevng a HELLO packet, the neghbor cluster head node updates ther neghbor table entres. A new entry s added nto the neghbor table when a new node moves nto the localty, and the exstng entry s deleted when a neghborng node breaks down. From ths we can determne when a HELLO packet s not receved durng a predefned perod of tme. After node I receves the Hello packet, the neghbor table constructor updates the Hello packet wth ts own path(,dst). Ths new hello packet broadcasts the message to the other node. ID Dst L Dst ID j L j D (j,dst) E j T j path(j,dst) Fg 2. Hello packet structure ID Dst destnaton ID L Dst destnaton locaton ID j neghbor node j ID L j neghbor node j locaton D (j,dst) dstance between neghbor node j and destnaton E j resdual energy of node j T j devce type of node j path(j,dst) path relablty between neghbor node j and destnaton. D1. Neghbor table constructor In addton to relablty, we add metrcs such as resdual energy, delay and current poston of nodes to uphold n the neghbor table. The resdual energy for the nodes s gven by, E (, j ) = T Tc (4) where T - total energy, Tc - total energy consumed at tme T. The current poston of the nodes can be estmated by the geographc locaton P. The delay n the route d ˆ( ) s controlled wth the sum of queung delay and transmsson delay. The queung delay contrbutes most sgnfcantly to the total latency followed by the transmsson delay. The queung delays for each packet types dˆ q [ packet. s gven by ˆ ˆ d q[ packet. = (1 η ) d q[ packet. + ηd q[ packet. (5) whereη - constant smoothng factor. The transmsson delay s measured as the tme duraton from the tme at whch the packet s ready for transmsson (becomng the head of the transmsson queue) to the tme of successful transfer of ts last bt. It s calculated as, where dˆ P d n= 1 tr tr = P ( n) ω n= 1 ω n P 2 ω n = 1, P 2 < n P P The overall delay control for a sngle node can be calculated as, d ˆ( ) = dˆ q + dˆ tr (7) Neghbor table contans the felds of relabltes for both hop-by-hop ( lnk(,j) ) and end-to-end ( path(j,dst) ), resdual energy, current poston and delay. Wth the recepton of Hello packets the neghbor table s updated perodcally. n n (6) ID Dst L Dst ID j L j D (j,dst) E j T j path(j,dst) lnk(,j) E (,j) P D Fg 3.Neghbor table Structure E (,j) - resdual energy for node and node j P current poston of node D delay of nodes E. Dynamc data packet classfcaton Dynamc packet classfer s used to dfferentate data packets based on ther prorty level. The four classes of data packets s gven by ordnary data packets (OP), relabltydrven data packets (P), delay-drven data packets (DP) and most crtcal data packets (CP). The CP packets are gven the hghest prorty due to ther strngent delay and relablty constrants. The next hgher prorty s gven to DP packets whch should be delvered wthn a predefned deadlne, but may tolerate reasonable packet loss. 54

4 Next to DP s the P packets whch should be delvered wthout loss, but do not need to be mmedate or wthn a hard deadlne. The lowest prorty s gven to the OP packets. F. outng Servce module The man functon of the routng servce module s to buld the routng table and to classfy data packets nto SP (relablty senstve packet) and OP (orgnal packet). The routng servce module conssts of routng table constructor, routng table, QoS classfer and path selector. In the routng table, the next hop entres are selected based on the metrcs such as relablty, hgh resdual energy, delay and maxmum of geographcal process towards snk. The node wth relablty less than predefned s dropped. ID Dst L Dst NH E NH 1 NH 2 NH 3 opton1(,dst) opton2(j,dst) opton3(j,dst) E (,j) P D Fg 4. outng Table Structure NH E energy aware next hop NH 1-1 st relable next hop NH 2 2 nd relable next hop NH 3 3 rd relable next hop opton1(,dst) 1 st opton relablty for sendng relablty senstve packets opton2(j,dst) - 2 nd opton relablty for sendng relablty senstve packets opton3(j,dst) 3 rd opton relablty for sendng relablty senstve packets. F1. outng Table Constructor The energy-aware routng algorthm (EA) and the relablty algorthm are used n routng table constructor. EA s used to fnd NH E for OP (ordnary packet) and s calculated by usng the resdual energy and the geographc locaton. For SP three possble paths were found to ensure the mnmum requred relablty. For the destnaton the three paths wth hghest relablty ( path1(, Dst), path2(, Dst), path3(, Dst)) s chosen, along wth the correspondng next hops (NH 1, NH 2 and NH 3 ) whch s stored n the routng table. The frst relablty path opton opton1(, Dst) s the relablty of the hghest path..e. path1(, Dst). opton1(, Dst) = path1(, Dst) (8) The error probabltes of the three paths are gven by, P error1 = 1- path1(, Dst) (9) P error2 = 1- path2(, Dst) (1) P error3 = 1- path3(, Dst) (11) The opton2(, Dst) s calculated by usng the error probabltes of the two paths havng the hghest relablty values. opton 2(, Dst ) = 1 ( Perror 1 Perror 2 ) (12) Error probabltes for all the three paths s gven by, opton 3(, Dst ) = 1 ( Perror 1 Perror 2 Perror 3 ) (13) F2. outng table constructon algorthm INPUT-Neghbor table 1. for each destnaton Dst do all neghbor nodes j NH 2. NH = } { (, Dst ) 3. f (NH = = NULL) then 4. put NULL n NH 1, NH 2, NH 3, opton1(,dst), opton2(j,dst), opton3(j,dst), E (,j), P, D 5. else 6. sort NH n descendng order of path(, Dst) 7. NH = frst neghbor node j NH 8. opton1(,dst) = path(, Dst) 9. P error = 1- opton1(,dst) 1. f ( NH > 1 ) 11. NH 2 = second neghbor node j NH 12. P error = P error * (1- opton1(,dst) ) 13. opton2(j,dst) = 1- P error 14. end f 15. f ( NH > 2 ) 16. NH 3 = thrd neghbor node j NH 17. P error = P error * (1- path(,dst) ) 18. opton3(j,dst) = 1- P error 19. end f 2. end f 21. end for F3. QoS classfer The data packets from both the upper and packet classfers are receved by QoS classfer. The QoS classfer dfferentates the packets nto SPs and OPs. F4. Path selector For each data packet the path selector checks the QoS requrement along wth resdual energy, delay and current poston of nodes. Next t chooses the sutable next hop usng the path selector algorthm. If the packet s SP, the 541

5 path selector sends the packets usng a sngle path through NH 1 for whch the relablty path s greater than req. Two paths are used for whch the relablty exceeds the req. Three paths are used f the aggregate relablty s greater than req. If not the packet s dropped. If the packet s an OP, the path selector returns the next hop NH E. F5. Path selector algorthm INPUT outng table 1. for each data packets from node ( (,Dst), E (,j), P, D ) do 2. f data packet relablty senstve packet (SP) 3. f ( opton1(,dst) > req ) 4. send to NH 1 5. else f ( opton2(,dst) > req ) 6. send to NH 1 and NH 2 7. else f ( opton3(,dst) > req ) 8. send to NH 1, NH 2 and NH 3 9. else 1. drop the packet mmedately 11. end f 12. else f data packet s Ordnary Packet (OP) 13. send to NH E 14. else 15. drop the packet mmedately 16. end f 17. end for G. Overall algorthm 1. Intally the packets are classfed as data packets and hello packets. 2. The data packets were classfed based on the prorty and they are sent to the routng servce module. 3. Usng the relablty module successve data transmsson s made from the from MAC layer to the network layer. 4. The hello packets are broadcasted nto the hello protocol module whch conssts of neghbor constructor table and neghbor table. 5. In the neghbor table n addton to relablty resdual energy, delay and geographcal routng of nodes are also added. 6. The node wth relablty less than predefned s dropped. The geographcal routng enables current poston estmaton. 7. The data packets are receved by QoS classfer by whch t dfferentates the packets nto SPs and OPs. 8. Next for sutable next hop, the path selector checks the QoS requrement wth resdual energy, delay and current poston of nodes. III. SIMULATION ESULTS A. Smulaton Setup The performance of the proposed QoS Aware Inter- Cluster outng Protocol (QAIC) s evaluated usng NS-2 smulaton. A network, whch s deployed n an area of 5X5 m s consdered. IEEE MAC layer s used for a relable and sngle hop communcaton among the devces, provdng access to the physcal channel for all types of transmssons and approprate securty mechansms. The IEEE specfcaton supports two PHY optons based on Drect Sequence Spread Spectrum (DSSS), whch allows the use of low-cost dgtal IC realzatons. The PHY adopts the same basc frame structure for low-duty-cycle low-power operaton, except that the two PHYs adopt dfferent frequency bands: low-band (868/915 MHz) and hgh band (2.4 GHz). The PHY layer uses a common frame structure, contanng a 32-bt preamble, a frame length.. The smulated traffc s CB wth UDP source and snk. Table I summarzes the smulaton parameters used. TABLE I. SIMULATION PAAMETES No. of 21,41,61,81 and 11 Area Sze 5 X 5 Mac IEEE Smulaton 5 Sec Transmsson ange 12m outng Protocol AODV Traffc Source CB and Exponental Packet Sze 8 bytes Antenna Omn Antenna Propagaton Two ay Ground Smulaton tme 5 seconds B. Performance Metrcs The proposed QAIC protocol s compared wth QoSaware Peerng outng Protocol (QP) [14]. The performance s evaluated manly, accordng to the followng metrcs. Average Packet delvery rato, packets receved, packets dropped, and energy consumpton. C. esults In our experment the number of nodes s vared as 21,41,61,81 and 11 for Exponental traffc. Delvery ato Vs Delveryato(Exp) Fg 5: Vs Delvery ato QAIC QP 542

6 Drop(pkts) Vs Drop(Exp) Fg 6: Vs Drop QAIC QP modules lke relablty module, packet classfer, hello protocol module, routng servce module. The data s transferred from MAC layer to network layer n relablty module whch takes care of transmsson of messages and acknowledgements. In the Packet classfer the packets are classfed nto the data and hello packets. The data packets are classfed based on the prorty. Hello protocol module construct neghbor table and mantan nformaton about neghbor nodes relabltes. Next usng the routng servce module, the routng table s bult. The delay n the route s controlled usng delay metrcs, whch s a sum of queung delay and transmsson delay. Vs Energy(Exp) EFEENCES Energy(J) Packets/sec Fg 7: Vs Energy Vs Throughput(EXP) Fg 8: Vs Throughput QAIC QP QAIC QP Fg.5 shows the delvery rato of QAIC and QP technques for dfferent rate scenaro. We can conclude that the delvery rato of our proposed QAIC approach has 86% hgher than QP approach. Fg.6 shows the drop of QAIC and QP technques for dfferent rate scenaro. We can conclude that the drop of our proposed QAIC approach has 66% less than QP approach. Fg.7 shows the energy consumpton of QAIC and QP technques for dfferent rate scenaro. We can conclude that the resdual energy of our proposed QAIC approach has 24% lesser than QP approach. Fg.8 shows the throughput of QAIC and QP technques for dfferent rate scenaro. We can conclude that the throughput of our proposed QAIC approach has 8 % more than QP approach. IV. CONCLUSION In ths paper we have proposed a routng protocol desgned n the cluster tree network whch conssts of few 1. Feng Shu, Performance Evaluaton of the IEEE CSMA-CA Protocol wth QoS Dfferentaton, Internatonal Conference on Intellgent Sensors, Sensor Networks and Informaton Processng, ISSNIP Ahmed Mohameden, Lla Boukhatem and Guy Pujolle, Class Aware Duty Cycle (CADC) to mprove QoS of IEEE Networks, 2nd IFIP Wreless Days (WD), Muhammad zwan Butt, Muhammad Mohsn Javed, Al Hamad Akbar, Qurat-ul-An Taj, Chae-Seong Lm and K-Hyung Km, LABILE: Lnk qualty-based lexical outng MEtrc for reactve routng protocols n IEEE networks, 5th Internatonal Conference on Future Informaton Technology (FutureTech), Feng Chen, Xaoyu Tong, Edth Nga and Falko Dressler, Mode Swtch - Adaptve Use of Delay-Senstve or Energy-Aware Communcaton n IEEE Based Networks, IEEE 7th Internatonal Conference on Moble Adhoc and Sensor Systems (MASS), A.S. aghuvansh and S. Twar, DYMO as routng protocol for IEEE Enabled Wreless Sensor Networks, Sxth Internatonal Conference on Wreless Communcaton and Sensor Networks (WCSN), Felpe D. M. Olvera, odrgo S. Semente and Tálson A. C. Melo, QoS Analyss of outng Protocols n Wreless Sensor Networks n the Montorng of Wnd Farms, Proceedngs IEEE Internatonal Instrumentaton and Measurement Technology Conference (I2MTC), Marwan Al-Jemel and Fawnzu A. Hussn, An Energy Effcent Cross-layer Network Operaton Model for IEEE based Moble Wreless Sensor Networks, IEEE Sensors Journal, Bogdan Pavkov, Fabrce Theoleyre and Andrzej Duda, Multpath Opportunstc PL outng over IEEE , Proceedngs of the 14th ACM nternatonal conference on Modelng, analyss and smulaton of wreless and moble systems, Yu-Ka Huang, Chn-Fu Kuo, A-Chun Pang and Wehua Zhuang, Stochastc Delay Guarantees n ZgBee Cluster-Tree Networks, IEEE ICC-Wreless Networks Symposum, Qngjang Tan and Edward J. Coyle, A MAC-Layer etransmsson Algorthm Desgned for the Physcal-Layer Characterstcs of Clustered Sensor Networks, IEEE Transactons on Wreless Communcatons, Vol. 5, No. 11, November Zahoor A. Khan, Shyamala Svakumar, Wllam Phllps and Bll obertson, A QoS-aware outng Protocol for elablty Senstve Data n Hosptal Body Area Networks, The 4th Internatonal Conference on Ambent Systems, Networks and Technologes (ANT 213). 12. Ben Saleh, Ahmed ; Sbley, Martn J N ; Mather, Peter, Energy effcent cluster schedulng and nterference mtgaton for IEEE network, Computer Scence and Engneerng Conference (ICSEC),214,Internatonal, DOI: 1.119/ICSEC , Publcaton Year: