190 likes | 398 Views
RELAX: An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks. Bashir Yahya and Jalel Ben-Othman University of Versailles, PRiSM Laboratory 45 Avenue des Etats-Unis , 78000 Versailles, France. IEEE ICC 2010. Outline. Introduction Network Model RELAX
E N D
RELAX: An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks BashirYahya and Jalel Ben-Othman University of Versailles, PRiSM Laboratory 45 Avenue des Etats-Unis, 78000 Versailles, France IEEE ICC 2010
Outline • Introduction • Network Model • RELAX • Simulation • Conclusion
Introduction • Routing in sensor networks is a very challenging task and different • Negotiation • Query • Qos • Multipath • Reliability • Robustness R S
Introduction • One of the early proposed multipath routing protocols is the Directed Diffusion • Directed diffusion is a data-centric routing protocol • This proposed cause more energy consumption in handling such control traffic • Goal • proposed an N-to-1 multipath routing protocol that finds different node-disjoint paths between a sink and a source node
Network Model • N identical sensor nodes are distributed randomly in the sensing filed • Each sensor node is powered through the use of two alkaline batteries • relaxation phenomenon of certain batteries to increase the battery lifetime and hence increasing the overall lifetime of the sensor network “Experimental Analysis of Batteries under Continous and Intermittent Operations”, in the Proceedings of the International Conference on Embedded Systems and Application,, June 2004.
RELAX • Paths Discovery Phase • Initialization phase • Primary Path discovery phase • Alternative Paths discovery phase • Route Refreshing • Traffic allocation and Data Transmission • Message Segmentation and FEC Codes Generation • Message Forwarding and Recovery
RELAX Initialization phase • Each sensor node broadcast a HELLOmessage to its neighbours • Source ID • Hop Count • Residual Energy • Free Buffer • Link Quality
RELAX Primary Path discovery phase • the sink node out a RREQ message to its most preferred next hop • Erese,yis the current residual energy of node y • Bbuffer,yis the available buffer size of node y • Iinterference,xyis the SNR for the link between nodes x and y
RELAX Primary Path discovery phase • RREQ • Source ID • Dest ID • Route ID • ResidualEnergy • Free Buffer • Link Quality • Route Cost
RELAX Primary Path discovery phase 5 E = 5 B = 2 I= 5 0 9 E = 2 B = 2 I= 2 E = 3 B = 4 I= 2 2 RREQ 7 8 RREQ E = 7 B = 8 I= 7 3 E =5 B = 6 I= 2 RREQ E = 5 B = 4 I= 7 1 RREQ Source 6 4 E = 2 B = 2 I= 2 E = 2 B = 2 I= 2
RELAX Alternative Paths discovery phase RREQ RREQ 5 E = 5 B = 2 I= 5 0 9 RREQ E = 3 B = 4 I= 2 E = 2 B = 2 I= 2 2 RREQ RREQ 7 8 RREQ E = 7 B = 8 I= 7 3 E =5 B = 6 I= 2 RREQ E = 5 B = 4 I= 7 1 RREQ Source 6 4 E = 2 B = 2 I= 2 E = 2 B = 2 I= 2
RELAX Route Refreshing • source node periodically floods a KEEPALIVEmessage • Source ID • Next-Hop-ID • Residual Energy • Free Buffer • Link Quality
RELAX Message Segmentation and FEC Codes Generation • data message is split up into k equal sized segments (S0, S1, S2, … Sk-1) • SegmentsS • Segment Length • Source Address • Identification • Destination Address • More segments • Segment offset • Data
RELAX Message Segmentation and FEC Codes Generation • error correction codes (C0 C1, C2, C3, … CM) • C0= S0 ⊕ S1 ⊕ S2 ⊕ … ⊕ Sk-1 • C1 = S1 ⊕ S2 ⊕ S3 ⊕ … ⊕ SM • C2 = S2 ⊕ S3 ⊕ S4 ⊕ … ⊕ S(M+1) mod k • C3 = S3 ⊕ S4 ⊕ S5 ⊕ … ⊕ S(M+2) mod k • . • . • . • CM= SM ⊕ S1 ⊕ S2 ⊕ … ⊕ S(M+i) mod k
RELAX Message Forwarding and Recovery • The segments of the original message along with the error correction codes are sent out across the selected multiple paths • S1 = C0 ⊕ C2 • S2 = C0 ⊕ C3 • . • . • .
we have presented the RELAXprotocol an energy efficient multi-path routing protocol specifically designed for wireless sensor networks • RELAXprotocol utilizes the relaxation effect of the battery to increase the battery lifetime • Through computer simulation, we have evaluated and studied the performance of our routing protocol and compared it with Directed Diffusion, and N-to-1 routing protocols.