1 / 34

PhD Research Proposal

PhD Research Proposal. Idris Skloul Ibrahim Supervisors: Dr. Peter King Prof. Rob Pooley. Ad Hoc Wireless Networks Architecture And Protocols. Proposal Outlines:. Proposal Outlines. Problem Statement & Objective Introduction MANET-based Applications

barb
Download Presentation

PhD Research Proposal

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. PhD Research Proposal Idris Skloul Ibrahim Supervisors: Dr. Peter King Prof. Rob Pooley Ad Hoc Wireless Networks Architecture And Protocols

  2. Proposal Outlines: Proposal Outlines • Problem Statement & Objective • Introduction • MANET-based Applications • MANET Routing Approaches • Related Work & Issues • Conclusion & Research Direction

  3. Proposal Outline Ad Hoc Wireless Networks Architecture & Protocols The Problem: Routing (and adaptation) challenges in dynamic and mobile ad-hoc networks (in addition to common constraints in a mobile ad-hoc environment); extended to ‘self-composable’ networks

  4. Proposal Objective: Ad Hoc Wireless Networks Architecture & Protocols • Low overhead=> few control messages • Provide a highly reactive serviceto help ensure successful delivery of data packets in spite of node movement or other changes in network conditions • Conservebatterypower • by not sending periodic advertisements and by not needing to receive them • Hosts wake-up from their sleep/standby modes to periodically check for messages • Scalability and Zone Radius relationship in networks with thousands of nodes e.g. WSNs (main objective)

  5. Ad Hoc Wireless Networks Architecture & Protocols Introduction Computer Network Classifications: Wired Wireless Wireless Communication 1 Wireless Communication 2 Infrastructure Non Infrastructure Mobile Ad Hoc N. (MANET)

  6. Ad Hoc Wireless Networks Architecture & Protocols Introduction • Infrastructure Based Networks Uses fixed base stations (infrastructure) which are responsible for coordinating communication between the mobile hosts (nodes)

  7. Ad Hoc Wireless Networks Architecture & Protocols Introduction • Ad-Hoc Networks Consists of mobile nodes which communicate with each other through wireless medium without any fixed infrastructure

  8. Wireless Net. Basic Architecture Ad Hoc Wireless Networks Architecture & Protocols AP Infrastructure Mode Ad hoc Mode

  9. Ad Hoc Wireless Networks Architecture & Protocols Introduction • Meaning of the word“Ad hoc” is “for this”, means “for this purpose only”, implies it is a special network for a particular application. • A mobile ad-hoc networkis a self configuring network of mobile routers (and associated hosts) connected by wireless links—the union of which form an arbitrary topology. • The routers are freeto move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably.

  10. History Of MANET Ad Hoc Wireless Networks Architecture & Protocols • The first generation goes back to 1972. At the time, they were called PRNET and were sponsored by DARPA • The second generation of ad-hoc networks emerged in 1980s,when the ad-hoc network systems were further enhanced and implemented as a part of the SURAN (Survivable Adaptive Radio Networks) program. This provided a PSN to the mobile battlefield in an environment without infrastructure. This program proved to be beneficial in improving the radios' performance by making them smaller and cheaper • In the 1990s, the concept of commercial ad-hoc networks arrived with NBC. and other communications equ. At the same time, the idea of a collection of mobile nodes was proposed at several research conferences. The IEEE 802.11 subcommittee had adopted the term "ad-hoc networks". • Mobile ad-hoc network was also be named as MANET by IETF.

  11. Ad Hoc Wireless Networks Architecture & Protocols Introduction • Easy of deployment • Speed of deployment • Decreased dependence on infrastructure Why we are need to Use Ad-Hoc Network?

  12. MANET Characteristics & Tradeoffs Ad Hoc Wireless Networks Architecture & Protocols • Characteristics • Decentralized • Self-organized • Self-deployed • Dynamic network topology • Tradeoffs • Bandwidth limited • Multi-hop router needed • Energy consumption problem • Security problem Why traditional routing protocols are not suitable for MANET networks ?

  13. MANET Medium Issues Ad Hoc Wireless Networks Architecture & Protocols • Hidden Terminal Problem Two nodes, out of each others’ radio range; simultaneously try to transmit data to an intermediate node, which is in radio range of both the sending nodes. None of the sending nodes will be aware of the other node’s transmission, causing a collision to occur at the intermediate node. Receiver Sender Sender

  14. The Hidden Terminal Problem Solution Ad Hoc Wireless Networks Architecture & Protocols • RTS-CTS handshake protocol A node that wishes to send data is required to ask for permission first, by sending a RTS to the receiving node. The receiving node then replies with a CTS message. The CTS message can be heard by all nodes within radio range of the receiving node, and instructs them not to use the wireless medium since another transmission is about to take place. The node that requested the transmission can then begin sending data to the receiving node Receiver Sender Sender RTS Data CTS

  15. MANET Medium Issues Ad Hoc Wireless Networks Architecture & Protocols • Exposed node problem When a node overhears another transmission and hence refrains to transmit any data of its own, even though such atransmission would not cause a collision due to the limited radio range of the nodes. Data S D Y X

  16. Exposed Node Problem Solution Ad Hoc Wireless Networks Architecture & Protocols • Directional Antennas / separate Channels The exposed node problem is leads to sub-optimal utilization of the wireless medium. Some proposed solutions are the usage of directional antennas (instead of omni-directional antennas) or separate channels for control messages and data. A technique called transmission power control could serve a dual purpose in this context. By adjusting the transmission power of nodes, interference can be reduced at the same time as nodes save valuable energy.

  17. MANET Application Ad Hoc Wireless Networks Architecture & Protocols • Personal area networking • Cell phone, laptop, ear phone • Emergency operations • Search and rescue • Policing and fire fighting • Civilian environments • Taxi cab network • Meeting rooms • Sports stadiums • Boats, aircrafts • Military use • On the battle field

  18. The Simpson's Be home early, Homer. Hmm, A MANET makes sense. Yes. What are you doing, Nelson? Dad, you can use Nelson if I am too fast. Hi, Marge. I miss you. I can hear u, Lisa. Can u hear me?

  19. Traditional routing • Adhoc routing • DSDV • Common • DSR • DYMO • AODV E B F G H D C A MANET X X X

  20. Traditional routing • Adhocrouting • DSDV • Common • DSR • DYMO • AODV MANET Routing Protocols Classification Source: MINEMA

  21. Traditional routing • Adhoc routing • DSDV • Common • DSR • DYMO • AODV MANET Main Classification Ad Hoc Routing Protocols Main Classification Proactive Table-Driven Reactive On-Demand Hybrid • DSDV • WARP • DREAM • DSR • AODV • TORA • ZRP • HARP

  22. Related Work &Issues Aim Of Proposed Protocol • Multipath Distance Vector Zone Routing ProtocolMDVZRP • Proactive Table Driven distance<=Zone Radius ,and reactive On demand distance>Zone’s Radius -Using Broadcast, and Unicast propagation techniques • We assume a Symmetricallinks network. Unidirectional Problem • Node uses a Hello message to discover its zone (R. table driven) • Node uses Route Request to discover any node outside its zone. (on demand) • Node should get Information from any route pass through it.

  23. Related Work &Issues Aim Of Proposed Protocol • Node broadcasts a forwardUpdate message when gets a new route where one of hop < R only (to reduce No. of messages.) • In case of broken link node generates Err msg. Including the Segment_No. (Route No.) to identify the right broken link. • Any node effected by Err msg. Deletes the specific route and Rebroadcasts Err msg. again and so on till reaches to a node which has no that route ( to prevent flooding the network by Err msg.) • Number of Optimum Routes depends on the Number of neighbours where maximum number of routes from each neighbour is less than or equal Radius Size

  24. Routing Algorithm Example1 • 1-2-4-3-8 • 1-2-4-7-8 • 1-2-4-3-7-8 • 1-2-4-7-3-8 • 1-2-5-4-3-8 • 1-2-5-4-7-8 • 1-2-5-4-3-7-8 • 1-2-5-4-7-3-8 • 1-3-8 • 1-3-7-8 • 1-3-4-7-8 • 1-4-7-8 • 1-4-3-8 • 1-4-7-3-8 • 1-4-3-7-8 5 4hops 2 6 Source 4 1 1 √ 2hops 7 3 √ 3hops 8 8 Destination

  25. Symmetric Network Node's Zone & Radius metric R=2 2 R>2 5 1 R=1 3 6 4

  26. A Simple network Example 2 1-2 1-3 2 5 1 3 4

  27. Example2 ROUTING Tables Nodes Routing Tables Node(1) Node(2) Node(3) Ds 1st No.h S_No ………. Ds 1st No.h S_No ………. Ds 1st No.h S_No ……… 1 1 0 1-1 ………. 1 1 1 1-2 ………. 1 1 1 1-3 ………. 2 2 1 1-2 ………. 2 2 0 2-2 ………. 2 1 2 1-2 ………. 3 3 1 1-3 ………. 3 1 1 1-3 ………. 3 3 0 3-3 ………. 4 3 2 3-4 ………. 5 5 1 2-5 ………. 4 4 1 3-4 ………. 5 2 2 2-5 ………. Node(4) Node(5) Ds 1st No.h S_No ………. Ds 1st No.h S_No ………. 1 3 2 1-3 ………. 1 2 2 1-2 ………. 3 3 1 3-4 ………. 2 2 1 2-5 ………. 4 4 0 4-4 ………. 5 5 0 5-5 ……….

  28. ROUTING TABLE DRIVEN A New Node Joins The Network Ds Nx No.h Seg_No 6 6 0 6-6 Initialization 5 5 1 5-6 4 4 1 4-6 2 5 2 2-5 3 4 2 3-4 2-5 3-4 2 1-2 1-3 1 5 5-6 Hello Hello 4-6 R.Upadte 3 6 R.Upadte 4

  29. ROUTING TABLE CREATION The New Node’s Routing Table Node(1) Node(2) Node(3) Ds 1st No.h S_No ………. Ds 1st No.h S_No ………. Ds 1st No.h S_No ……… 1 1 0 1-1 ………. 1 1 1 1-2 ………. 1 1 1 1-3 ………. 2 2 1 1-2 ………. 2 2 0 2-2 ………. 2 1 2 1-2 ………. 3 3 1 1-3 ………. 3 1 1 1-3 ………. 3 3 0 3-3 ………. 4 3 2 3-4 ………. 5 5 1 2-5 ………. 4 4 1 3-4 ………. 5 2 2 2-5 ……….6 5 2 5-6 ………. RUP6 4 2 4-6 ………. RUP Node(4) Node(5)Node(6) Ds 1st No.h S_No ………. Ds 1st No.h S_No ……….Ds 1st No.h S_No ……… 1 3 2 1-3 ………. 1 2 2 1-2 ……….2 5 2 2-5……….A H M 3 3 1 3-4 ………. 2 2 1 2-5 ……….3 4 2 3-4……….A H M 4 4 0 4-4 ………. 5 5 0 5-5 ……….4 4 1 4-6……….A H M 6 6 1 4-6 ………. Hello6 6 1 5-6 ……….Hello5 5 1 5-6……….A H M 6 6 0 6-6……….Initialization

  30. ROUTE ON- DEMAND Route Request Ds Nx No.h Seg_No 6 6 0 6-6 5 5 1 5-6 4 4 1 4-6 2 5 2 2-5 3 4 2 3-4 1 4 3 1-3 1 5 3 1-2 2-5 3-4 2 1-2 1-3 1 5 5-6 Hello Hello 4-6 RRPL 3 RREQ 6 RREQ 4 RRPL

  31. ROUTING TABLE CREATION New Node’s Entire Routing Table Node(1) Node(2) Node(3) Ds 1st No.h S_No ………. Ds 1st No.h S_No ………. Ds 1st No.h S_No ……… 1 1 0 1-1 ………. 1 1 1 1-2 ………. 1 1 1 1-3 ………. 2 2 1 1-2 ………. 2 2 0 2-2 ………. 2 1 2 1-2 ………. 3 3 1 1-3 ………. 3 1 1 1-3 ………. 3 3 0 3-3 ………. 4 3 2 3-4 ………. 5 5 1 2-5 ………. 4 4 1 3-4 ………. 5 2 2 2-5 ………. 6 5 2 5-6 ………. RUP 6 4 2 4-6 ………. RUP Node(4) Node(5) Node(6) Ds 1st No.h S_No ………. Ds 1st No.h S_No ………. Ds 1st No.h S_No ……… 1 3 2 1-3 ………. 1 2 2 1-2 ………. 2 5 2 2-5 ……….A H M 3 3 1 3-4 ………. 2 2 1 2-5 ………. 3 4 2 3-4 ……….A H M 4 4 0 4-4 ………. 5 5 0 5-5 ……….4 4 1 4-6 ……….A H M 6 6 1 4-6 ………. Hello 6 6 1 5-6 ……….Hello5 5 1 5-6 ……….A H m 6 6 0 6-6 ……….Initialization 1 4 3 1-3 …….…RREQ 1 4 3 1-3 ….……RREQ

  32. REER Error Message Broken Link Error REER 2-5 3-4 1-2 1-3 REER 2 5 1 5-6 4-6 REER REER REER 3 6 REER 4 REER

  33. ROUTING TABLES AFTER RERR Nodes Routing Tables After RERR Node(1) Node(2) Node(3) Ds 1st No.h S_No ………. Ds 1st No.h S_No ………. Ds 1st No.h S_No ……… 1 1 0 1-1 ………. 1 1 1 1-2 ………. 1 1 1 1-3 ………. 2 2 1 1-2 ………. 2 2 0 2-2 ………. 2 1 2 1-2 ………. 3 3 1 1-3 ………. 3 1 1 1-3 ………. 3 3 0 3-3 ………. 4 3 2 3-4 ………. 5 5 1 2-5 ………. 4 4 1 3-4 ………. 5 2 2 2-5 ………. 6 5 2 5-6 ……….RERR 6 4 2 4-6 ………. RUP Node(4) Node(5) Node(6) Ds 1st No.h S_No ………. Ds 1st No.h S_No ………. Ds 1st No.h S_No ……… 1 3 2 1-3 ………. 1 2 2 1-2 ………. 2 5 2 2-5 ……….RERR 3 3 1 3-4 ………. 2 2 1 2-5 ………. 3 4 2 3-4 ……….FULLD 4 4 0 4-4 ………. 5 5 0 5-5 ………. 4 4 1 4-6 ……….FULLD 6 6 1 4-6 ………. Hello 6 6 1 5-6 ……….RERR5 5 1 5-6 ……….RERR 6 6 0 6-6 ……….Initialization 1 4 3 1-3 …….…RREQ 1 5 3 1-2 ….……RREQ

  34. MDVZRP FOR MANET Conclusion • We proposedMDVZRP for MANET based on DV,AODV • Allows sending packets byalternative pathsand backward RERRto the source in case of unknown broken link • Number ofOptimum Routesdepends on the Number of neighbours where Maximum Number from each neighbour is less than or equal Radius Size • Low overhead and Faster than the standard protocols: • Latency is less than AODV (N( c/b +t ) – t R) • Routing table size is less than DSDV (<DSDV messages) • No periodic route update packets.(< ZRP control traffic ) • Network Performance v Radius sizeregarding to evaluation metrics data throughput, packet delivery ratio, routing overhead and average packet delay.

More Related