1. First Page

2. Index1 Overview of SAHN Routing in SAHN (SAHNR) Simulation Results Future Work Current Project Status Acknowledgements

3. Definition1 SAHN Definition An alternative to existing broadband services for cooperative users using wireless technology at an affordable cost

4. Why not existing solutions1 Dialup and high speed services (e.g. cable modems & xDSL) Provide mostly asymmetric bandwidth utilization Inadequate for file transfer, X protocol, interactive graphical programs etc Require costly wiring infrastructure Impose service charges Not widely available

5. Why not existing solutions2 Nokia RoofTop and other packet radio schemes Mostly centrally controlled Provide inadequate QoS Not optimized for Ad-Hoc networks

6. SAHN Motivation Commercial broadband solutions are: –Expensive –Not universally available –Provide restricted service Commercial service restrictions: –Asymmetric traffic characteristics –Poor QoS management –Only supports Internet protocols –Limited security, management and accounting support

7. Motivation Provide services not offered by commercial service providers Bypass expensive infrastructure for broadband Provide symmetric bandwidth WLAN in inadequate wiring infrastructure Bypass ongoing service charges for Telcos independent traffic

8. Motivation2 Feature QoS Security throughout all layers Utilizing link states ( e.g. available bandwidth, link stability, latency, jitter and security ) to select suitable routes Avoid selfish routing strategy Proper resource access control and management

9. SAHN Definition Ideal for cooperative nodes. E.g. spread over a suburban area, connecting houses and business Topology is quasi static Uses wireless technology Multi-hop QoS routing Decentralized Symmetric broadband, multi Mbits/sec bandwidth Security

10. SAHN Definitio2 No charges for SAHN traffic SAHN services run alongside TCP/IP Conceived by Ronald Pose & Carlo Kopp

11. Who should be using Home office and professionals requiring broadband connection to organisation’s systems Internetworking of businesses with their offices spread through a suburb, campus buildings etc People living around their campus can access the university’s network via SAHN without expensive commercial Telecom services

12. Users2 Cooperative users can communicate and share a speedy Internet connection with each other via SAHN Houses linked with video clubs can download video streams on demand Groups with online gaming interests

13. Standalone SAHN Appears to host like a cable modem Functionally more like a RF LAN repeater Embedded microprocessor protocol engine implements all SAHN protocols and manages and configures the system Each SAHN node has at least 2 wireless links Capable of achieveing link rate throughput

14. SAHN Issue1 Investigating wireless technology An appropriate routing solution A robust node authetication scheme Appropriate security models for various layers Integrating SAHN specific hardware and software solutions at minimum cost A suitable business model for exploiting the SAHN concept

15. Design Issues2 Investigating wireless technology An appropriate routing solution A robust node authetication scheme Appropriate security models for various layers Integrating SAHN specific hardware and software solutions at minimum cost A suitable business model for exploiting the SAHN concept

16. References1 R. Pose and C. Kopp. Bypassing the Home Computing Bottleneck: The Suburban Area Network. 3rd Australasian Comp. Architecture Conf. (ACAC). February, 1998. pp.87-100. A. Bickerstaffe, E. Makalic and S. Garic. CS honours theses. Monash University. www.csse.monash.edu.au/~rdp/SAN/. 2001 www.csse.monash.edu.au/~rdp/SAN/ Paul Conilione, “QoS for Suburban Ad Hoc Networks”. Honours Interim Presentation, CSSE, Monash University, 5th June 2003

17. Index2 Overview of SAHN Routing in SAHN (SAHNR) Simulation Results Future Work Current Project Status Acknowledgements

18. SAHN Goals Wireless medium inherently vulnerable to –Eavesdropping –DoS attacks –Node masquerading Requires security policies implemented at all levels Wireless technologies (e.g. 802.11) do not feature resource –Access control –Management Requires higher level protocols

19. SAHN Goals Ad-Hoc wireless networks have to –Handle node/link failures –Find routes on demand –Route packets with QoS Requires an efficient on-demand routing solution

20. Existing Routing0 Table Driven –Maintains multiple tables for route information –Constant overhead for routing control packets –e.g. DSDV, WRP, GSP, FSR, HSR On Demand –Finds routes on demand –Reduced overhead of routing control packets –e.g. AODV, DSR, AOMDV, MSR, TORA, ABR

21. Existing Routing1 Hybrid –Employes both table driven and on demand routing techniques –e.g. LANMAR Others –Ensures QoS routing –Can be any of the above three types

22. Existing Routing1 Dynamic source routing (DSR) –On demand –Emplyes source routing –Can find multiple routes –Network overhead increases for carrying source routes –No security at network layer –Does not consider QoS for route selection –Does not feature load balancing

23. Existing Routing1 Ad Hoc on demand distance vector routing (AODV) –On demand –Cannot find multiple routes to a destination –No security at network layer –Does not consider QoS for route selection –No support for load balancing

24. Why Hybrid Approach1 Existing solutions do not feautrure one or more of the following attributes –Multiple routes to a destination –Resource Access Control –QoS –Load balancing –Security at network layer –Optimization for quasi-static networks

25. SAHNR1 Keeps up-to-date neighbour information Employs source routing for route discovery Maintains routes dynamically –Employs features of DSR. e.g. gratuitous Route replies, salvaging data/error packets etc.

26. SAHNR1 Decreases network overhead –Excludes source route in every data packet Avoids selfish/uncoordinated routing strategy –Makes use of available paths having QoS –Chooses least congested paths –Balances load among available paths Features network level security by –Node authentication –Encryption of packet header information

27. SAHNR2 Neighbour Discovery and Authentication Periodically and on demand Route Discovery On demand Data Transmission On demand Route Maintenance Periodically and on demand

28. Neighbor Discovery1 Performed –When a node is powered up –After an idle period if needed Main tasks are –Node authentication –Negotiation of security scheme for network layer Requires –‘Hello’/‘Hello Reply’ packets

29. Nehbourhood Discovery2 Node N wants to join SAHN

30. Nehbourhood Discovery2

31. Node N broadcasts Hello packets and S, B, C, F, G receive them

32. Neighbor Discovery3

33. Nodes S, B, C, F and G unicast Hello Reply packet to N

34. Neighbor Discovery3 Now node N becomes a part of SAHN

35. Route Discovery1 Performed if –Route is not present in routing table –Route has expired Requires – RREQ and RREP packets Uses negotiated encrytion/decryption key for RREQ/RREP packet encrytion/decryption

36. Route Discovery2 S wants route to X. S broadcasts RREQ packets to its neighbours

37. Route Discovery2 Intermediate Nodes e.g. B does not have a route to Node X –B updates its routing table/forwarding table with unknown information –Appends its address and QoS information in RAQL –Broadcasts RREQ to its neighbours

38. Route Discovery2

39. Route Discovery3 Intermediate node H has routes to X –H updates its routing/forwarding table with unknown information –Appends H and QoS H with RAQL –Appends route to X and QoS information with RAQL –Reverses RAQL –Forwards RREP to E from RAQL Same steps for X if it receives a RREQ

40. Route Discovery3

41. Route Discovery4 Intermediate Nodes receive RREP packets –Update their routing/forwarding tables –Update QoS values of RAQL –Forward RREP Node S receives RREP packets –Updates its routing/forwarding table –Records routes –Selects suitable routes with acceptible QoS to send data

42. Route Discovery4

43. Data Transmission1 First few data packets contains full RAQL An intermediate node –Updates its routing/forwarding tables with unknown information –Forwards data packet to the next node from RAQL

44. Data Transmission2 Remaining data packets do not contain RAQL An intermediate node –Finds the next node from the forwarding table with –Updates Local Source with its own address –Updates its routing/forwarding tables

45. Route Maintenance1 Takes actions if A link fails A route error control packet is received Data packets are recieved for unknown destinations A neighbour/route/forward table entry is too old

46. Route Maintenance2 If the route maintenace module senses a link failure, it Tries to find alternate route to destination Sends RERR of the broken link to its neigbours Deletes corresponding entries of broken links from itsneighbour/route/forward tables

47. Route Maintenance3 If a node receives a RERR packet the route maintenance module –Sends RERR to its neigbours –Deletes corresponding entries from its neighbour/route/forward tables

48. Route Maintenance4 If a node receives a data packet for unknown destination, the route maintenance module –Tries to find a route to the destination If it fails, it –Sends RERR to the source of the data packet

49. Referenc e2 A. Bickerstaffe, E. Makalic and S. Garic. CS honours theses. Monash University. www.csse.monash.edu.au/~rdp/SAN/. 2001 www.csse.monash.edu.au/~rdp/SAN/ P. Misra. Routing Protocols for Ad Hoc Mobile Networks. www.cis.ohio-state.edu/~jain/cis788- 99/adhoc_routing/index.html. 02/07/2000 www.cis.ohio-state.edu/~jain/cis788- 99/adhoc_routing/index.html. 02/07/2000

50. Index2 Overview of SAHN Routing in SAHN (SAHNR) Simulation Results Future Work Current Project Status Acknowledgements

51. Simulation Setup Node 0 sends node 11 8000 items of 1460 bytes each between simulated times 30 sec to 10 hr through FTP. Node 11 sends node 0 11000 items of 1400 bytes each between simulated times 70 sec to 10 hr through FTP. Node 12 sends node 13 9000 items of 1500 bytes each between simulated times 100 sec to 10 hr through FTP. Node 0 sends node 11 13000 items of 512 bytes each between simulated times 15 sec to 10 hr. The inter departure time for each item is 3.1 sec. Node 11 sends node 0 20000 items of 1024 bytes each between simulated times 28.8 sec to 10 hr. The inter departure time for each item is 1.5 sec.

52. Simulation Result1 session duration for SAHNR session duration for DSR session duration for AODV Comparing data reception rates at FTP server 11 at normal condition

53. Simulation Result 2 session duration for SAHNR session duration for DSR session duration for AODV Comparing data reception rates at FTP server 11 when a node periodically switches off and on

54. Simulation Result3 Comparing load of CTRL packets in the network at normal condition

55. Simulation Result4 Comparing load of CTRL packets in the network when a node periodically switches off and on

56. Index4 Overview of SAHN Routing in SAHN (SAHNR) Simulation Results Future Work Current Project Status Acknowledgements

57. Future works Integrate all QoS metrics (bandwidth reservation, error rate, latency) for routing Incorporate security schemes i.e. node authentication, encryption/decryption Define a feasible network size & packet length Detect non-cooperative nodes Perform more simulations with varied network sizes, different topologies with presence of rouge nodes Test SAHNR in real environment

58. Index5 Overview of SAHN Routing in SAHN (SAHNR) Simulation Results Future Work Current Project Status Acknowledgements

59. Current status Eliminated the use of Hello & Hello Reply cycles for node authentication Incorporated authentication scheme with route discovery cycle Performed more simulations with different network topology

60. Current status2 Three more papers in press to be published Routing In Suburban Ad-Hoc Networks The 2003 International Conference on Computer Science and its Applications (ICCSA’03) A Hybrid QoS Routing Strategy for Suburban Ad- Hoc Networks The 11th IEEE International Conference on Networks (ICON’03) A Router Architecture To Achieve Link Rate Throughput In Suburban Ad-Hoc Networks The Eighth Asia-Pacific Computer Systems Architecture Conference (ACSAC’03)

61. Index 6 Overview of SAHN Routing in SAHN (SAHNR) Simulation Results Future Work Current Project Status Acknowledgements

62. Initial definition of the SAHN architecture was carried out by Adrian Bickerstaffe, Enes Makalic and Slavisa Garic in their computer science honours projects in 2001 at Monash University. They also implemented the testbed. The current project builds on their excellent work. Part of presentation was partly done with Paul Conilione, using exclusively the abilities given to him by his Chinese Buddhist Taoist Master, Shifu Chow Yuk Nen