NAME USMAN RAFIQUE SUPERVISOR Prof Rikku Jnttii Usman

  • Slides: 13
Download presentation
NAME : USMAN RAFIQUE SUPERVISOR: Prof Rikku Jänttii Usman Rafique

NAME : USMAN RAFIQUE SUPERVISOR: Prof Rikku Jänttii Usman Rafique

 • Mesh Networks • Routing Protocols in Mesh / ADHOC networks • Limitations

• Mesh Networks • Routing Protocols in Mesh / ADHOC networks • Limitations of Mesh Networks • Proposed modification Contents • Implementation Aspects • Simulation Aspects • Conclusion • Future Directions Usman Rafique

Mesh Networks • Future Wireless Network Architecture • Hot Research Area 010 01 1

Mesh Networks • Future Wireless Network Architecture • Hot Research Area 010 01 1 0 0 01 DIGITAL CLOUD 0100101010 0100 1010 Usman Rafique 101 0 10

Routing In Mesh Networks • Pro active Protocols • Reactive Protocols • AODV protocol

Routing In Mesh Networks • Pro active Protocols • Reactive Protocols • AODV protocol 0 01 Nodes are Routers 01 010 Usman Rafique 01010 0101 0 0 01010 01 1 0

Mesh Networks Limitations • • • Energy supply Security Service discovery Congestion and quality

Mesh Networks Limitations • • • Energy supply Security Service discovery Congestion and quality of service Current research focusing on these limitations Focus of this thesis is intelligent routing attacking battery life saving Usman Rafique

Proposed modification • • • Restrict to Layer 3 Cross layer solution is optimal

Proposed modification • • • Restrict to Layer 3 Cross layer solution is optimal Routing protocol modifications Send traffic to robust routes Sense network energy at traffic source Usman Rafique

Implementation Aspects • Test bed comprised of Laptops and PDAs • Open Source Linux

Implementation Aspects • Test bed comprised of Laptops and PDAs • Open Source Linux reference solutions • Lifetime estimation from instantanous bettery and traffic predictoins • Network energy sensing: Incorporated in route establishment procedure • Nodes tell their life in signaling phase Usman Rafique

Node Life Calculation Model Implementation ETotal Life time Packets format changes = 0 1

Node Life Calculation Model Implementation ETotal Life time Packets format changes = 0 1 2 3 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+++++++ | Type |J|R|G| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Flooding ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Source IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Source Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |Type ФTx. PTx + ФTx. PRx + PCPU Where ФTx= Transmitted traffic PTx= Transmitter power ФRx= Received traffic PRx= Received Power PCPU= CPU power consumption E_Total= Total Energy Of battery left | Length | Node Lifetime| RREQ packet Routing Table Updation Changes Type = RREQ_EXT if (fwd_rt->flags & RT_INV_SEQNO || rrep_seqno > fwd_rt->dest_seqno || (rrep_seqno == fwd_rt->dest_seqno && (fwd_rt->state == INVALID || fwd_rt->flags & RT_UNIDIR || rrep_new_hcnt < fwd_rt->hcnt || route_life > fwd_rt->life_um Usman Rafique

RREQ Life = 35 Implementation/Testing • Traffic source directs traffic to most robust route

RREQ Life = 35 Implementation/Testing • Traffic source directs traffic to most robust route possible at route establishment stage • Device recalcutaes its energy status in 2 sec intervals • Protocol validated and tested on Laptops and PDAs test bed • On table routes formation method was developed using iptables and netfilters in linux • Multihop topologies were tested Usman Rafique RREQ Life = 45 35 RREQ 45 RREQ Life = 45 RREP Life = 35 40 35 25 RREP Life = 35 RREP Life = 25 25 75 RREQ Life = 25 40 RREP 45 RREQ Life = 35 RREP Life = 35 75 RREP Life = 25

Simulation Aspects • NS-2 simulator is used • Ns 2: Easy network creation using

Simulation Aspects • NS-2 simulator is used • Ns 2: Easy network creation using TCL ecrpting front end • Open source impolementation with animation and tracing for analysis features • C++ is used in back end for performance gain • Our motivation: Testing protocol is scaled networks Usman Rafique

Conclusions and Future Directions Benefits • Long lasting routes • Hidden congestion control •

Conclusions and Future Directions Benefits • Long lasting routes • Hidden congestion control • Long operation of nodes Usman Rafique

Conclusions and Future Directions Drawbacks • Longer routes can be formed • Aggragate power

Conclusions and Future Directions Drawbacks • Longer routes can be formed • Aggragate power cosumtion (Total network power per route) may be increased • Packet delay increases Future • Porting the protocol on embedded devices • Do simulations in ns-2 with taking mobility into account Usman Rafique

Thank You Questions are Welcome Usman Rafique

Thank You Questions are Welcome Usman Rafique