1 / 25

M.EWLANA: Mobile IP Enriched Wireless Local Area Network Architecture

This paper explores the M.EWLANA architecture, which combines Mobile IP and ad-hoc networks for improved wireless local area network performance. It discusses the network architecture, protocol, and performance analysis.

camerone
Download Presentation

M.EWLANA: Mobile IP Enriched Wireless Local Area Network Architecture

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. MEWLANA-Mobile IP Enriched Wireless Local Area Network ArchitecturebyMustafa ErgenAuthors: Mustafa Ergen and Anuj Puri{ergen,anuj}@eecs.berkeley.edu}Berkeley Web Over Wireless Groupwow.eecs.berkeley.eduDepartment of Electrical Engineering and Computer ScienceUniversity of California Berkeley MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  2. Introduction • Mobile IP & Ad-Hoc Networks Overview • Motivation • Network Architecture • Protocol • Previous Work -MIPMANET -on demand routing • MEWLANA-TD - table driven routing • MEWLANA-RD –root driven routing (mesh networks) • Performance Analysis • Conclusion MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  3. Mobile IP & Ad-Hoc Networks Internet HA CH B A FA FA MN Mobile IP • Retain a fixed IP identity while moving. • Mobile Node (MN) • Home Agent (HA) • Foreign Agent (FA) • Correspondent Host (CH) • Agent Advertisement • Registration • Tunneling Ad-Hoc Network • No network infrastructure. • Special routing protocol MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  4. Motivation Mobile IP in Ad hoc Network • High cost for building a large number of bases • Total throughput limited by the number of cells in the area. • High power consumption of mobile stations having the same transmission range as bases. • Ad hoc networks are limited to be small scale. • The number of bases or the transmission ranges of both mobile stations can be reduced. • Connections are still allowed without base stations • Multiple packets can be simultaneously transmitted within a cell • Paths are less vulnerable than the ones in ad hoc networks because the bases can help reduce the wireless hop count. MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  5. Motivation • Does this new architecture impose new traffic characteristic? • Inside traffic, Outside Traffic • Can we classify the environments based on the traffic characteristics? • Small or large size ad hoc network • Intensity of inside and outside traffic • Does using one kind of ad hoc routing give optimum result in all environments? MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  6. Motivation Example; Intensity of outside traffic = constant • A conference • Big Size Network • High Inside Traffic • A subway • Big Size Network • Negligible Inside Traffic • A rescue mission • Small Size Network • High Inside Traffic MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  7. Network Architecture Internet/MIP none FA HA CH FA Domain MN1 MN4 MN2 MN3 MIP MIP Adhoc/MIP Adhoc/MIP Adhoc/MIP Adhoc/MIP Ad Hoc Domain • Ad Hoc Routing Protocols • Table Driven Routing : • DSDV, … • On Demand Routing • AODV, DSR, … • Route Driven Routing • TBBR (Tree Based Bidirectional Routing) MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  8. Tree Based Bidirectional Routing Mesh Network: Routes from Foreign Agent to Mobiles Routes from Mobiles to Foreign Agent MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  9. Protocol-Main Components FA Domain MN2 FA Ad hoc Domain MN1 Ad hoc Domain • Discovering Base Station • Unicast or Broadcast • Registration Mechanism • Inform the HA of the current location of the mobile • Tunneling Mechanism from HA to FA • Delivery from FA to mobile • FA keeps a table of MAC address and IP address pair Gateway Mobile MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  10. Protocol-Agent Discovery • Beacon: Agent Advertisement Message (modified ICMP) • Domain specific info: DNS, CoA, hop count, source address. • FA and MN duplicates the beacon : hop count ++ • Hop count is to limit the serviced nodes and a decision mechanism • MN`s new access point = CoA • Mobile establish the route to the FA MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  11. Protocol-Registration • Normal Mobile IP Registration • Registration Request: MN4->MN3->MN2->MN1->FA->HA • Registration Reply: HA->FA->MN1->MN2->MN3->MN4 • Registration Request can get lost: MN & HA not registered. • Registration Reply can get lost: MN not registered but HA. • Periodic registration update. MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  12. Protocol-Tunneling Ethernet HeaderFA addr. HA addr. MN addr. CH addr. Packet MN addr. CH addr. Packet Ethernet Header MN addr. CH addr. Packet • Tunneling from HA to FA. • Decapsulating in FA. • Sending from FA to MN. Gateway Mobile Node MAC Address MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  13. Protocol-Hop Count FA1 FA2 FA FA2 • Lifetime of agent advertisement = X hop count • Change access point by considering hop count. MN2 MN1 Ad hoc Domain C E A B F D MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  14. Protocol-OVERHEAD • MIPO: Mobile IP Overhead • Beacon Flooding • AHRO: Ad Hoc Routing Overhead • Routing Table Formation • NHIT: Number of Hops for Inside Traffic • Source and Destination is in the same ad hoc domain • NHOT: Number of Hops for Outside Traffic Load = constant • Source and Destination is in different domains MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  15. Previous Work-MIPMANET • Designed with on demand routing • Agent Advertisement Beacon Flooding • Ad Hoc Routing AODV Create route before send • High MIPO • AHRO reduced • NHIT depends on size MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  16. MEWLANA-TD • Designed with table driven routing • Agent Advertisement :Dynamic Beaconing Initiate advertisement when the routing table changes • Ad Hoc Routing DSDV- route table exchange • Low MIPO • High AHRO • NHIT depends on size MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  17. MEWLANA-TD Registration Data Packets via HA Route Optimization CH HA Internet FA FA Domain MN1 MN2 Ad hoc Domain MN3 MN4 • Dynamic Beaconing • There exists a route for each node • Low MIPO • High AHRO • NHIT depends on size MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  18. MEWLANA-RD MN1 dst nexth . FA (1) * FA Internet (1) FA FA (2) MN2 MN2 (2) MN4 MN2 (2) MN5 MN2 (2) MN3 MN3 DLN=1 MN1 (2) MN6 MN3 MN2 dst nexth . (1) * MN1 MN3 dst nexth . (2) MN1 MN1 (1) * MN1 MN3 (2) MN4 MN4 (1) MN1 MN1 DLN=2 (2) MN5 MN5 (2) MN6 MN6 MN2 DLN=2 MN6 MN4 dst nexth . MN4 (1) * MN2 DLN=3 (1) MN2 MN2 MN6 dst nexth . (1) * MN3 DLN=3 MN5 dst nexth . MN5 (1) MN3 MN3 (1) * MN2 (1) MN2 MN2 DLN=3 (1) Beacon (2) Reg. Request . Depth Level Number (DLN): Hop Count: eliminate loop Routes (1) From mobile to FA : Beacon Routes (2) From FA to mobiles: Multi Hop Registration Request MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  19. MEWLANA-RD Ethernet Header Ethernet Header Ethernet Header Ethernet Header MN4 MN2 MN1 Source IP Address MN2 MN1 FA Destination IP Address UDP Header UDP Header UDP Header UDP Header Type| Service Bits| Life Time Type| Service Bits| Life Time Type| Service Bits| Life Time Type| Service Bits| Life Time MN4 MN4 MN4 Home Address HA HA HA Home Agent Registration Request Fields Registration Request Fields Registration Request Fields FA FA FA Registration Request Fields Care of Address Identification Identification Identification Identification Extensions Extensions Extensions Extensions - - - - MN4 MN2 MN1 FA Multi Hop Registration Request MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  20. MEWLANA-RD • Beacon flooding • Create tree • Performance degradation in inside traffic • If in different tree, connect with Mobile IP • High MIPO • No AHRO • Higher NHIT compared to others - MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  21. Empirical Classification MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  22. Simulation Parameters NS-2 • CBR Source : 1-10 • 10 packets per second • 512bytes • Beacon Period: 1 sec. • Nodes:{4,8,32,64,128} • PF Performance Factor • B=C=D=1 • A is scaling factor • PF: Performance Factor MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  23. Simulation Performance Factor MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  24. Conclusion • Classification of the environment • Size and traffic intensity • MEWLANA-TD : Small size and High inside traffic • Dynamic Beaconing • MEWLANA-RD: Large size and Low inside traffic • Eliminate Ad hoc Routing Protocol Overhead • MIPMANET : Large size and High inside traffic • Demand routing protocol when there is need. MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

  25. Reference • Royer, C. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks” IEEE Personal Communications, Vol. 6, No.2, pp.46-55, April 1999. • Broch J., Maltx D. ,Johnson D.,Hu Y.,Jetcheva J., “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols”, The fourth annual ACM/IEEE international conference on Mobile computing and networking, October 25-30, 1998, Dallas, TX USA • Ulf Jonsson, Fredrik Alriksson, Tony Larsson, Per Johansson, Gerald Q. Maquire Jr. MIPMANET-Mobile IP for Mobile Ad Hoc Networks, MOBIHOC 2000. • Hui Lei and Charles E. Perkins, “Ad hoc networking with Mobile IP” in Proceedings of 2nd European Personal Mobile Communication Conference, Sept. 1997. MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

More Related