Kinetic Multipoint Relaying: Improvements using Mobility Predictions - - PowerPoint PPT Presentation

▶
kinetic multipoint relaying improvements using mobility
SMART_READER_LITE
LIVE PREVIEW

Kinetic Multipoint Relaying: Improvements using Mobility Predictions - - PowerPoint PPT Presentation

Nov 30, 2023 314 likes •460 views

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPRs Properties Conclusion Kinetic Multipoint Relaying: Improvements using Mobility Predictions Jrme Hrri 1 Fethi Filali 1 Christian Bonnet 1

slide-1
SLIDE 1

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Kinetic Multipoint Relaying: Improvements using Mobility Predictions

Jérôme Härri1 Fethi Filali1 Christian Bonnet1 jerome.haerri@eurecom.fr fethi.filali@eurecom.fr christian.bonnet@eurecom.fr

1Institut Eurécom Department of Mobile Communications

06904 Sophia Antipolis, B.P . 193, France

7st International Working Conference on Active and Programmable Network (IWAN’05), Sophia Antipolis, France, November 21st-23rd, 2005

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-2
SLIDE 2

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Outline

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-3
SLIDE 3

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Mobility Prediction ?

  • Reactive Approach to Mobile Environment.
  • Position Awareness=> Need some kind of geo-localization.

→ GPS for outdoor localization. → GPS-free protocols for indoor localization.

  • Piecewise Linear Motion Model.
  • First order model giving a node’s velocity.
  • Complex higher order model involving nodes acceleration is

possible.

  • Deterministic or Probabilistic.
  • Nodes are assumed to keep a fixed trajectory over a relative short

period of time.

  • Trajectory changes are reactively annouced by broadcast

messages.

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-4
SLIDE 4

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Kinetic Nodal Degree

  • Nodes position as a function of time is then described by

Posi(t) = xi + dxi · t yi + dyi · t

  • ,
  • Node j’s trajectory with respect to node i

D2

ij (t)

= D2

ji (t) = Posj(t) − Posi(t)2 2

= aijt2 + bijt + cij, where aij ≥ 0, cij ≥ 0.

  • Solving

D2

ij (t) − r 2 ≤ 0

gives the time intervals tfrom

ij

and tto

ij during which nodes i and j

are neighbors.

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-5
SLIDE 5

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Kinetic Nodal Degree (Cont’d)

  • Node i’s kinetic degree function is

Degi(t) =

nbrsi

  • k=0
✁

1 1 + exp(−a · (t − tfrom

k

)) · 1 1 + exp(a · (t − tto

k ))

✂
  • the Kinetic Degree is obtained by
✄

Degi (t) =

☎

∞ t

✆✝

k=nbrsi

  • k=0

( 1 1 + exp(−a · (t − tfrom

k

)) · 1 1 + exp(a · (t − tto

k ))

)

✞✟
  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-6
SLIDE 6

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Kinetic Nodal Degree (Cont’d)

i r k j t=20 t=4 t=16

Figure: Node i kinetic neighborhood

  • ✁✄✂
  • ✁✆☎
✝✞ ✁✠✟ ✡
  • ☛
☞ ✌ ✍✏✎ ✑✓✒ ✎ ✎ ☎ ✟

Figure: Node i kinetic nodal degree

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-7
SLIDE 7

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Kinetic Multipoint Relays

Definition (Covering Interval)

The covering interval is a time interval during which a node in N 2(i) is covered by a node in N(i)

Definition (Logical Kinetic Degree)

The logical kinetic degree is the nodal degree obtained when considering covering intervals instead of covering instants

Definition (Activation)

When a node is elected KMPR, it is said to be active and its covering interval is called its activation

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-8
SLIDE 8

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Kinetic Multipoint Relays

Kinetic Multipoint Relaying (KMPR)

The KMPR protocol applied to an initiator node i is defined as follows:

  • Begin with an empty KMPR set.
  • First Step: Compute the logical kinetic degree of each node in

N(i).

  • Second Step: Add in the KMPR set the node in N(i) that has the

maximum logical kinetic degree.

  • Compute the activation of the KMPR node as the maximum

covering interval this node can provide.

  • Update all other covering intervals of nodes in N2(i) and all logical

kinetic degrees

  • Repeat this step until all nodes in N2(i) are fully covered
  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-9
SLIDE 9

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Simulation environment

  • Random Waypoint from the Random Trip

Framework [LEBOU:05]

  • 20 nodes uniformly distributed in a 1500 × 300 grid.
  • 250m transmission range.
  • Average Velicity: 10m/s, 20m/s, 25m/s, 30m/s, 40m/s.
  • Simulation time: 100s.
  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-10
SLIDE 10

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Flooding Reduction

10 15 20 25 30 35 40 5 10 15 20 25 30

Average Speed [s] Duplicate Packets ratio

MPR KMPR

Figure: Duplicate reception

10 15 20 25 30 35 40 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2

Average Speed [s] Forwared Packets ratio

MPR KMPR

Figure: Forwarding Nodes

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-11
SLIDE 11

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Broadcast Efficiency and Routing Overhead

10 15 20 25 30 35 40 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5

Average Speed [s] Delivery Delay [s]

MPR KMPR

Figure: Broadcast efficiency

10 15 20 25 30 35 40 0.5 1 1.5 2 2.5 3 3.5 4 4.5 x 10

5

Average Speed [s] Routing Overhead [bytes]

MPR KMPR

Figure: Routing overhead

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-12
SLIDE 12

Mobility Prediction Kinetic Nodal Degree Kinetic Multipoint Relays KMPR’s Properties Conclusion

Conclusion

  • KMPR construct and maintains a MPR set, yet without relying on

periodic beacons.

  • KMPR has similar flooding properties as MPR.
  • KMPR improves MPR broadcast delay by ≈ 50 % and MPR

channel access by ≈ 75 % .

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-13
SLIDE 13

Appendix For Further Reading

For Further Reading I

  • A. Laouiti et al., "Multipoint Relaying: An Efficient Technique for

Flooding in Mobile Wireless Networks", 35th Annual Hawaii International Conference on System Sciences (HICSS’2001), Hawaii, USA, 2001.

  • T. Clausen and P

. Jacquet, "Optimized Link State Routing Protocol (OLSR)", www.ietf.org/rfc/rfc3626.txt, Project Hipercom, INRIA, France, October 2003. Jerome Haerri, Fethi Filali, Christian Bonnet, "On the Application

  • f Mobility Predictions to Multipoint Relaying in MANETs: Kinetic

Multipoint Relays", Eurécom Technical Report RR_05_148, Institut Eurécom, France, 2005.

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying

slide-14
SLIDE 14

Appendix For Further Reading

For Further Reading II

Jean-Yves Le Boudec and Milan Vojnovic, "Perfect Simulation and Stationarity of a Class of Mobility Models", In Proc. of the Infocom’05, USA, 2005.

  • J. Haerri,F. Filali,C. Bonnet

Kinetic Multipoint Relaying