MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen - PowerPoint PPT Presentation

1 / 25
About This Presentation
Title:

MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen

Description:

MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen ... Broch J., Maltx D. ,Johnson D.,Hu Y.,Jetcheva J., 'A Performance Comparison of ... – PowerPoint PPT presentation

Number of Views:14
Avg rating:3.0/5.0
Slides: 26
Provided by: mustaf5
Category:

less

Transcript and Presenter's Notes

Title: MOBILE AD HOC CONFERENCE , PARIS 2002 M. Ergen


1
MEWLANA-Mobile IP Enriched Wireless Local Area
Network ArchitecturebyMustafa Ergen Authors
Mustafa Ergen and Anuj Puriergen,anuj_at_eecs.berk
eley.eduBerkeley Web Over Wireless
Groupwow.eecs.berkeley.eduDepartment of
Electrical Engineering and Computer
ScienceUniversity of California Berkeley
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

3
Mobile IP Ad-Hoc Networks
  • 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

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.

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?

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

7
Network Architecture
  • Ad Hoc Routing Protocols
  • Table Driven Routing
  • DSDV,
  • On Demand Routing
  • AODV, DSR,
  • Route Driven Routing
  • TBBR (Tree Based Bidirectional Routing)

8
Tree Based Bidirectional Routing
Mesh Network Routes from Foreign Agent to
Mobiles Routes from Mobiles to Foreign Agent
9
Protocol-Main Components
  • 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
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
  • MNs new access point CoA
  • Mobile establish the route to the FA

11
Protocol-Registration
  • Normal Mobile IP Registration
  • Registration Request MN4-gtMN3-gtMN2-gtMN1-gtFA-gtHA
  • Registration Reply HA-gtFA-gtMN1-gtMN2-gtMN3-gtMN4
  • Registration Request can get lost MN HA not
    registered.
  • Registration Reply can get lost MN not
    registered but HA.
  • Periodic registration update.

12
Protocol-Tunneling
  • Tunneling from HA to FA.
  • Decapsulating in FA.
  • Sending from FA to MN.

Gateway Mobile Node MAC Address
13
Protocol-Hop Count
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
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

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

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

17
MEWLANA-TD
  • Dynamic Beaconing
  • There exists a route for each node
  • Low MIPO
  • High AHRO
  • NHIT depends on size

18
MEWLANA-RD
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
19
MEWLANA-RD
Multi Hop Registration Request
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

-
21
Empirical Classification
22
Simulation Parameters
  • NS-2
  • CBR Source 1-10
  • 10 packets per second
  • 512bytes
  • Beacon Period 1 sec.
  • Nodes4,8,32,64,128
  • PF Performance Factor
  • BCD1
  • A is scaling factor
  • PF Performance Factor

23
Simulation
Performance Factor
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.

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.
Write a Comment
User Comments (0)
About PowerShow.com