EFFICIENT ENERGY BASED CONGESTION CONTROL SCHEME FOR MOBILE AD HOC NETWORKS

Transcription

1 FFICINT NRGY BASD CONGSTION CONTROL SCHM FOR MOBIL AD HOC NTWORKS 1 S.SHJA, 2 DR.RAMACHANDRA V PUJRI 1 Reseach Schola, Bhaathia Univesity, Coimbatoe. 2 Vice-Pincipal, KGiSL Institute of Technology, Saavanampatti, Coimbatoe. -mail: 1 sheejaajize@gmail.com, 2 siamu.vp@gmail.com ABSTRACT In ecent yeas, MANT is the popula and gowing netwok used in vaious applications. Hee the mobile nodes ae andomly moving without any access point. Due to mobility of nodes, enegy consumption of the netwok goes highe. Moe enegy consumption occus due to etansmission of packets and occuence of packet loss unlimitedly. So the main goal of the netwok is to ensue moe enegy efficiency. To povide minimum enegy consumption and avoiding moe congestion, enegy consumption model and multipath outing scheme is needed in netwoks. In this eseach pape, we developed an fficient negy based Congestion Contol Scheme (CCS) fo congestion avoidance and to impove enegy efficiency of the mobile nodes. Hee the coss laye design is deployed to impove the netwok pefomance. The multipath outing is focussed to avoid congestion and to incease netwok lifetime. We also demonstated the enegy consumption mathematical model to illustate the node s minimum enegy consumption level in the netwok. Pobability of the etansmission of packets is educed with the help of calculating the enegy level of data and acknowledgment packets. By using extensive simulation, the poposed scheme achieves minimum enegy consumption, low packet loss atio, high packet delivey atio, low end to end delay and ovehead than ou pevious schemes like CAS, CLSMRSCA. Keywods: MANT, Pobability of etansmission of packets, Coss Laye design, Multipath Routing, enegy consumption model, packet delivey atio, packet loss atio, end to end delay, ovehead and netwok lifetime 1 INTRODUCTION 1.1 Mobile Ad Hoc Netwoks (MANT) Mobile Ad hoc Netwoks (MANT) consist of wieless nodes that fom a communications netwok among themselves without a fixed infastuctue. Topology changes in MANT usually occu due to the mobility of a paticipating node o beakdown of a node due to loss of enegy in that node. These dynamic conditions disupt the smooth communication between needs in the netwok. Conceptually, in MANT, a node may eithe function as an end node o as a oute fowading data packets between end nodes. Hence the fitness of the node in tems of available enegy in the node becomes an impotant issue duing the selection of an intemediate node 1.2 Need fo Coss laye Design in MANT The equiement of Coss Laye design in ad hoc netwoks is given below Adaptive and self-oganization Netwok potocols fo MANTs must be adaptive to many factos to effectively suppot fai shaing of devices and esouces and to hide the system dynamics to the uppe layes. The system dynamics include a wide ange of communication conditions a wieless node can expeience inside a MANT, including changing topology, shaed medium contention, vaying taffic pattens and distibutions. negy Consevation It is a limiting facto in the successful deployment of MANTs, because nodes ae expected to ely on potable, limited powe souces. Moeove, enegy consevation is extemely challenging in multi-hop envionments, whee the wieless nodes should also consume enegy to oute packets fo othe nodes and to guaantee the connectivity of the netwok. At the MAC laye, some techniques can be used to educe the enegy consumed duing tansmission and eception; additionally, a caeful policy may tun off the 205

2 wieless device when the node is idle. At the netwok laye, the oute selection pocess should be pefomed by educing the end-to end powe needed to fowad the packet. If the netwok laye may have access to enegy infomation, batteylevel metics can be used in the outing pocess. 1.3 Congestion Contol in MANTs Congestion contol is the main poblem in ad-hoc netwoks. Congestion contol is associated to contolling taffic incoming into a telecommunication netwok. To avoid congestive cumple o link capabilities of the intemediate nodes and netwoks and to educe the ate of sending packets congestion contol is used extensively. Congestion contol and dependability mechanisms ae combined by TCP to pefom the congestion contol without explicit feedback about the congestion position and without the intemediate nodes being diectly intemittent. Packet failue in MANTs is pimaily caused due to obstuction. The packet loss can be condensed by involving congestion contol ove a mobility and failue adaptive outing potocol at the netwok laye. The congestion non-adaptive outing potocols, leads to the following difficulties: xtensive delay, Moe Ovehead, Heavy packet losses 2 RLATD WORK Iman Chowdhuy et.al [1] poposed an enegy efficient and coopeative congestion contol potocol (CCCP) fo coopeative multicasting in mobile ad hoc netwoks. It ovecomes the disadvantages of existing multicast congestion contol potocols such as AODV and RCCP. In the fist phase it builds a coopeative multicast tee ooted at the souce, by including the nodes with highe esidual enegy towads the eceives. In the second phase an admission contol scheme in which a coopeative multicast flow is admitted o ejected depending upon on the output queue size. Finally tests whethe the elay node has the potential path to the equied destination, if not then choose anothe node which has the second highest esidual enegy as a new elay node. K.Sinivas and A.A. Chai poposed [2] negy fficient Coss Layeed Congestion Detection and Contol Routing Potocol to delive an enegy efficient mechanism to quantify the degee of congestion at victim node with maximal accuacy. The poposed model involves contolling of congestion in two steps with effective enegy efficient congestion detection and optimal utilization of esouces. Packet loss in netwok outing is pimaily due to link failue and congestion. Most of the existing congestion contol solutions do not possess the ability to distinguish between packet loss due to link failue and packet loss due to congestion. Appaji and Seedha [3] poposed a coss layeed outing topology in shot CRT to impove the congestion detection and handling stategy. The CRT is Mac, application and physical laye centic in paticula. With the motivation gained fom CRT, hee in this pape we popose a coss layeed powe conseved outing topology (CPCRT) fo mobile ad hoc netwoks. The goal is to impove tansmission pefomance by distinguishing between packet loss due to link failue and abitay loss of packets along with powe consevation that used fo packet tansmission. Suyapakash Reddy et.al [4] poposed the outing algoithm called negy efficient Odeed Congestion Contol using Coss laye suppot. In this aticle, it is efined the OCC to gain the ability of enegy consevation in congestion discovey. In this effot it attempts to limit the ole of MAC laye to detect link failue and developed a new stategy to detect the congestion at a elay node level and path level. Vishnu kuma [5] poposed an Congestion and Powe Contol Technique Based on Agent in MANT. The mobile agent fom souce stats fowading the data packets though the path which has minimum cost and congestion. The status of evey node is composed and lastly it is deliveed to destination node. In powe contol technique, the nodes ae selected based on the powe level. Rajesh babu et.al [6] poposed to develop an negy fficient Secue Authenticated Routing Potocol (SARP) fo mobile adhoc netwoks, which uses a lightweight, attack esistant authentication mechanism. The potocol povides efficient secuity against oute discovey attacks using hop-by-hop signatues. It also uses an efficient node selection mechanism which maximizes netwok life time and minimizes delay. Mohammad Amin Kheiandish Fad [7] exploed an end-to-end theshold-based algoithm which enhances congestion contol to addess link failue loss in MANT. It consists of two pats. Thesholdbased loss classification algoithm uses queue usage to classify netwok state peiodically into congestion o non-congestion mode. Any etansmission timeout in peiod which MANT is no congested mode is an indication of link failue 206

3 loss. Afte detecting losses due to link failue, it should adjust RTO fo econstucted oute by compaing its capabilities with boken oute using available infomation in tanspot laye. V. Thilagavathe and D. K. Duaiswamy [8] poposed the a coss-laye based technique to ovecome congestion that occus in MAC and tanspot laye in MANT. The poposed technique was applied ove a Adhoc On demand Multipath Reliable and negy Awae QoS Routing Potocol (AOMP-RQR). If souce eceives congestion status infomation fom both MAC and tanspot laye simultaneously fo the same oute, then congestion fee oute can be established fo tansmission, without pefoming ate contol. Kaunakaan et.al [9] pesented a Cluste Based Congestion Contol (CBCC) potocol that consists of scalable and distibuted cluste-based mechanisms fo suppoting congestion contol in adhoc netwoks. The distinctive featue of appoach was that it was based on the self-oganization of the netwok into clustes. Afte estimating the taffic ate along a path, the sending ate of the souce nodes was adjusted accodingly. In ou pevious wok [10] & [11], the congestion avoidance scheme and efficient secuity scheme is poposed using coss laye appoach. The congestion less outing is established to educe the highest packet loss in this appoach. Choong Seon Hong and Sungwon Lee [12] poposed joint congestion and powe contol appoach to attain an optimal solution via message passing while maintaining the achitectual modulaity between the layes. Shengming Jiang and Gang Wei [13] poposed distibuted pediction-based cognitive topology contol (PCTC) scheme fo outing in Cognitive Radio MANTs. The main aim is to pedict the available duation of the links. The pape is oganized as follows. The Section 1 descibes with oveview of MANT, Need fo Coss laye Design and congestion contol in MANTs. Section 2 deals with the Related Wok. Section 3 is devoted fo the implementation of fficient negy based Congestion Contol Scheme. Section 4 descibes the pefomance analysis and the last section concludes the wok. 3 IMPLMNTATION OF FFICINT NRGY BASD CONGSTION CONTROL SCHM Ou poposed fficient negy based Congestion Contol Scheme (CCS) is implemented with the thee phases. In fist phase, the coss laye based multipath outing is developed to educe effect of packet loss, packet dops and to achieve the load balancing in MANT. In second phase, the enegy consumption model is integated in the coss laye model to acquie minimum enegy consumption of mobile nodes. In thid phase, the packet fomat of the poposed scheme is exploed to monito the status of the congestion level, enegy level and packet loss level. The flow diagam of the CCS is given in Fig.1. Souce Node sends RRQ messages to Multipath Route stablishment Deploying Coss laye Design If yes, link quality is impoved Implementation of negy Link quality is not Figue.1. Flow Chat Of Poposed Scheme The flow diagam of the poposed scheme is show in fig.1. In this scenaio, each cluste heads communicate though the cluste paticipants while keeping the multipath outing. The enegy consumption is also deployed in each and evey packet fom souce to destination. This makes data with minimum enegy consumption and to monito the enegy level of each path. 3.1 Coss Laye Based Multipath Routing Appoach The coss laye design is used infomation shaing acoss diffeent layes. In Wieless netwok, physical laye, Media Access Contol (MAC) laye and outing Laye is combined fo netwok 207

4 esouce. At physical laye, tansmission powe and data ate is decided which affects MAC and outing decisions. The MAC laye is esponsible fo scheduling and allocating the wieless channel, it also veifies the available tansmitte bandwidth and the packet delay. Routing laye also depends on bandwidth and delay to select the link. The outing laye chooses the oute to send the data packets to the destination. The outing decision will change the contention level at the MAC laye and accodingly the physical laye paametes. Multipath outing is oganized in tems of path with disjoint links and path with disjoint nodes. To ensue the netwok connectivity, educing the packet loss, the multipath outing is implemented in ou poposed wok. The poposed wok is mainly focusing on congestion contol to avoid the etansmission and packet dop as well as packet loss. Fo an example in Fig. 2, the multipath outing concept is enabled between the souce S and Destination node D. Conside a packet tansmission tavels though the 1st path. In case, the packet tavels though path which exceeds the capacity of the path, the dop will occu apidly. So in this case, the multipath is deployed to ovecome the effect of congestion. The altenative disjoint links and disjoints nodes ae integated to each the packet to its destination without affecting othe tansmission and loss. In altenate path outing, the shotest path between exchanges is typically one hop acoss the backbone netwok; the netwok coe consists of a fully connected switches. Wheneve the shotest path fo a paticula souce destination pai becomes unavailable (due to eithe link failue o full capacity), athe than blocking the connection, altenate path which is nomally uses two hops. Multipath outing inceases fault-toleance and eliability. The oute can split the same label taffic flow into diffeent paths with the given taffic engineeing constains. Minimum delay and maximum bandwidth ae consideed fo splitting a given dynamic flow into these multiple paths Cluste Head 2 (CH2) Cluste paticipant nodes (CP1, CP2,CP3, CP31, CP21, CR1, CR2, CR3) 1 st path Path with displace lines Path with displace nodes 3.2 negy Consumption Model In MANT, mobile node consumes moe enegy due to its mobility. In case any misbehavio o link failue occus, packet has to be tansmitted again. To maintain the minimum enegy consumption, the pobability of the packet etansmission should be educed. Position of node may be of thee states like tansmission, eception and idle mode. ach state epesents the diffeent level of enegy consumption. Steps in negy consumption model as follows: Step 1: In tansmission state, node is tansmitting a packet with tansmission enegy P t. In eception state, node is eceiving a packet with powe P. Hee the enegy is consumed even if the packet is dopped by the node due to unintended to the destination o the packet was not coectly decoded. In listening state, even if the packets ae not being tansmitted, the nodes may stay idle and keep listening the paticula medium P idle. In sleeping state, node consumes less powe than any othe powe. The enegy spent on both tansmission and eception of one packet is given as, = P delay (1) t t Pt = delay (2) Hee, delay means the time taken fo the packet duing tansmission and eception. Step 2: Fig.3, shows the enegy status of mobile nodes. If a souce node tansmits a packet to the next hop, all its neighbous eceive this packet even it is intended to only one of them due to wieless natue of the medium. Fist souce node finds its neighbos duing tansmission ange. Nodes ae situated between tansmitte ange and intefeence ange eceives the packet but it cannot decode it. These two cases geneate loss of enegy. Figue.2. Implementation of Multipath Routing Cluste Head 1 (CH1) 208 Ovehea Slee Tansmit

5 Figue.3. Mobile node s enegy Status In ode to compute the enegy dissipated by one tansmission, these losses ae taken in to account as follows, cost t ( k) = t + m + Pta (3) whee m epesents the numbe of nonsleeping nodes belonging to the intefeence zone of the tansmitte k and P ta epesents the pobability of packet loss occued duing tansmission and eception phases. epesents the enegy is spent duing eception. cost t ( k) epesents the angle whee the oute is taken fo tansmitting a packet. It is nothing but how fa the souce and destination nodes ae communicating with each othe at cetain location. Step 3: The estimation of enegy fo both packet ( ) and acknowledgement packets ( ) ae pkt also detemined as follows pkt ack = λ d τ pkt (4) ack = λ d τ ack (5) Hee, d is the distance between the souce node m and destination node n. λ is the appoximated simulation value. τ pkt andτ ack ae the delay on tansmission of both acknowledgement and data packets. Step 4: The total enegy is calculated fo tansmitting a packet is given by, + + n 1 = λ d k ( k + 1) ( τ pkts ack) k = 1 n 1 k = 1 n 1 λ k = 1 λ d d kk + 1 ) ( τ pkts ack ) k ( k + 1) ( τ pkts ack s cs) (6) In the above equation, k is the single oute and k+1 is the neaest multipath oute in case if any link beak occus. τs and τ ts ae the delay occus on equest to send packets and clea to send packets. Step 5: The total enegy is an impotant metic to all the enegy outing schemes and it should be kept minimum. Wheneve the souce node chooses the packet to destination node, it will select only the minimum enegy consumption path to each the intended destination. The condition fo minimum enegy consumption is min m k = 1 0 = 0 (7) Step 6: If node s enegy consumption exceeds theshold value, it is identified that moe packets ae dopped. In this peiod, nodes have to etansmit the packets. So the enegy is lost. 3.3 Poposed packet fomat Souc e ID Destinatio n ID Hop Coun t neg y Level Packe t loss Ratio FC S Figue.4. Packet fomat In Fig. 4, the poposed packet fomat is shown. Hee the souce and destination node ID caies 2 bytes. The thid field hop count detemines the numbe of n does connected to the paticula node in the cluste. It occupies 1 byte. The enegy level occupies which induces the whethe the etansmission of packets ae occued with high enegy consumption fom the souce node to the destination node. Packet loss atio status is veified duing the infomation shaing phase. It occupies 4 bytes. The last filed FCS i.e. Fame Check Sequence which is fo eo coection and detection in the packet while tansmission. Algoithm: Step 1: Detemine enegy spent on both tansmission and eception. Step 2: Compute the enegy cost that includes losses in the tansmission. Step 3: Calculate the enegy spent fo data packet and acknowledgement packet tansmission. Step 4: Detemine the total enegy fo tansmitting a packet. Step 5: Define the condition fo enegy consumption. 4 5 PRFORMANC ANALYSIS 209

6 The poposed coss laye design is integated with the Dynamic Souce Routing (DSR) potocol. The Netwok Simulato (NS 2.34) is used to simulate ou poposed algoithm. In ou simulation, 300 mobile nodes move in a 1500 mete x 1500 mete squae egion fo 120 seconds simulation time. All the nodes have the same tansmission ange of 250 metes. The simulated taffic used is Constant Bit Rate (CBR) and Poisson taffic. Ou simulation settings and paametes of CCS ae summaized in Table 1.Table1. Simulation settings and paametes No. of Nodes 300 Aea Size 1500 X 1500 Radio Range 250 m Simulation Time 120 sec Taffic Souce CBR and Poisson Packet Size 512 bytes Mobility Model Random Way Point Potocol DSR Pause time 5 msec Packet Queuing Dop Tail 5.1 Pefomance Metics We assess the pefomance mainly accoding to the following metics. Contol ovehead: This is defined as the total numbe of outing contol packets nomalized by the total numbe of eceived data packets. nd-to-end delay: The end-to-end-delay is aveage ove all suviving of data packets fom the souces to the destinations. Packet Delivey Ratio: It is the atio of the numbe.of packets eceived successfully and the total numbe of packets tansmitted. Packet Loss Ratio: The atio of occuence of packet lost to the total numbe of packets used in the netwok duing one tansmission phase is defined as packet loss ate. negy consumption level: It keeps the enegy level of node which is spent fo sending and eceiving a data to the total enegy spent on the netwok. Netwok Lifetime: It shows the lifetime of the nodes fo the enegy spent on oute maintenance phase. The simulation esults ae pesented in the following analysis. We compae ou CCS with the CAS [10] and CLSMRSCA [11] in pesence of congestion envionment. Figue.5. Topology and Taffic ceation Fig. 5 shows that taffic ceation with the nodes. To identify the packet loss, the constant bit ate taffic is implemented. The delay is poduced in packet fom souce node to destination node via neighbou nodes. Souce may choose the diffeent paths to achieve the high packet delivey faction. Fig.6 shows the esults of packet delivey atio fo vaying the nodes 10, 20, 300. Fom the esults, we can see that CCS scheme has highe delivey atio than the CLSMRSCA and CAS schemes. Figue.6. No.of Nodes Vs delivey atio Figue. 7. Mobility Vs negy Consumption 210

7 Figue.8. No. of Nodes Vs negy Consumption Figue.10.Speed Vs Netwok lifetime Fig.10, shows the esults of Speed Vs Netwok Lifetime. Fom the esults, we can see that CCS scheme has highe Netwok Lifetime than the CLSMRCSA and CAS while vaying the speed fom 20 to 200. Analysis of the poposed scheme is shown in Table 2. Figue. 9. Time Vs nd to nd Delay Fig.7, pesents the compaison of enegy consumption and mobility. It is clealy shown that the CCS has low enegy consumption than the CAS and CLSMRSCA. Fig.8, pesents the compaison of enegy consumption and Numbe of Nodes. Nodes ae vaied as 5, 10,. 50. It is clealy shown that the CCS has low enegy consumption than the CAS and CLSMRSCA. Fig.9, pesents the compaison of nd to end delay while vaying the time fom 10 to 100. It is clealy shown that the delay of CCS has low than the CAS and CLSMRSCA potocol. Table 2. Analysis Of Poposed Method (CCS) And xisting Methods (CAS And CLSMRSCA) In Tems Of Diffeent Paametes Metics CCS CLSMRSCA CAS Packet loss atio (%) Packet Delivey Ratio (pkts) Netwok lifetime (msec) nd to end delay (msec) 27.4 negy Consumption (Joules) Vs No. of Nodes negy Consumption (Joules) Vs Mobility CONCLUSION Mobile nodes ae moving andomly without any centalized administation in MANT. Due to high mobility, the packet loss occus unnecessaily and 211

8 unlimited etansmission of packets happens. So the enegy consumption of netwok goes vey high. In this pape, we have developed an fficient negy based Congestion Contol Scheme fo minimum enegy consumption which attains the moe enegy efficiency and educed congestion among nodes. In the fist phase of the scheme, multipath outing is poposed to achieve high netwok lifetime and thoughput. In second phase, Coss Laye design is achieved. Hee the infomation is sent to the souce node depends upon the fading of channel detemined fom destination node. In thid phase, the negy Consumption model is poposed to achieve minimum enegy consumption of nodes, acknowledgement and data packets. By using the extensive simulation esults, the poposed scheme CCS achieves the bette packet delivey atio, high netwok lifetime, low delay and ovehead, minimum enegy consumption than the existing schemes like CLSMRSCA and CAS while vaying the mobility, time, speed, thoughput and numbe of nodes. RFRNCS: [1] Iman Chowdhuy, Asaduzzaman, Saki Kowsa, An negy fficient and Coopeative Congestion Contol Potocol in MANT, Intenational Jounal of Compute Applications ( ) Volume 58 No.17, Novembe 2012, pp [2] K. Sinivas, A. A. Chai, CDC: negy fficient Coss Layeed Congestion Detection and Contol Routing Potocol, Intenational Jounal of Soft Computing and ngineeing (IJSC) ISSN: , Volume-2, Issue-2, May 2012, pp [3] V. V. Appaji, D. Seedha, CPCRT: Coss layeed and Powe Conseved Routing Topology fo congestion Contol in mobile ad hoc netwoks, IOSR Jounal of Compute ngineeing (IOSRJC), Volume 3, Issue 5 (July-Aug. 2012), pp [4] T.Suyapakash Reddy, D. P. Chenna Reddy, OCC: negy-fficient Odeed congestion contol using coss laye suppot in Mobile Ad Hoc Netwok outing, Intenational Jounal of Scientific & ngineeing Reseach, Volume 3, Issue 10, Octobe-2012, pp.1-9. [5] Vishnu Kuma Shama and D. Saita Singh Bhadauia, Congestion and Powe Contol Technique Based on Mobile Agent and ffect of Vaying Rates in MANT, Intenational Jounal of Advancements in Compute Science and Infomation Technology [ ] Vol. 01, No. 1, 2011, pp [6] M. Rajesh Babu, S. Selvan, An negy fficient Secue Authenticated Routing Potocol fo Mobile Adhoc Netwoks, Ameican Jounal of Scientific Reseach, ISSN X Issue 9(2010), pp [7] Mohammad Amin Kheiandish Fad, Sasan Kaamizadeh1, Mohammad Aflaki, nhancing Congestion Contol to Addess Link Failue Loss ove Mobile Ad-Hoc Netwok Intenational Jounal of Compute Netwoks & Communications (IJCNC) Vol.3, No.5, Sep 2011,pp [8] V. Thilagavathe and D. K. Duaiswamy, Coss Laye based Congestion Contol Technique fo Reliable and negy Awae Routing in MANT, Intenational Jounal of Compute Applications ( ), Volume 36 No.12, Decembe 2011, pp.1-6. [9] S.Kaunakaan & P.Thangaaj, A Cluste Based Congestion Contol Potocol Fo Mobile Ad hoc Netwoks, Intenational Jounal of Infomation Technology and Knowledge Management, July-Decembe 2010, Volume 2, No. 2, pp [10] S.Sheeja and Ramachanda.V.Pujei, ffective Congestion Avoidance Scheme fo Mobile Ad Hoc Netwoks, Intenational Jounal of Compute Netwok and Infomation Secuity, Januay 2013, Vol.1, pp [11] S.Sheeja and Ramachanda.V.Pujei, Coss Laye Based Secue Multipath Routing Scheme fo Congestion Avoidance in MANT, uopean Jounal of Scientific Reseach, Vol. 97, No. 3, 2013, pp [12] Choong Seon Hong, Sungwon Lee, Coss- Laye Optimization fo Congestion and Powe Contol in OFDM-Based Multi-Hop Cognitive Radio Netwoks, I Tansactions on Communications, Vol.60, Issue 8, 2012, pp [13] Shengming Jiang, Gang Wei, Pediction- Based Topology Contol and Routing in Cognitive Radio Mobile Ad Hoc Netwoks, I Tansactions on Vehicula Technology, Vol.59, Issue 9, 2010, pp