 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| – |
one
way to examine issues in designing algorithms for a
|
|
|
mobile
environment is to develop and use a formal
|
|
|
|
model
(Badrinath et al.):
|
|
|
|
n |
network
consists of MH and MSS (Mobile Support Stations)
|
|
|
|
n |
MSS
covers a cell, uses broadcast within cell
|
|
|
|
n |
MSS
connected via a wired backbone
|
|
|
|
n |
to
communicate between two mobile hosts MH1 and MH2,
|
|
|
message
is routed through the corresponding MSSs
|
|
|
|
n |
MSS
may have to determine location of serving MSS for
|
|
|
outgoing
call through broadcast
|
|
|
|
n |
MH
are mobile, no time bound between leaving a cell and
|
|
|
entering
the next
|
|
|
|
n |
FIFO
MH-MSS channel within cell. MH typically receives
|
|
|
only
prefix of the messages sent (might have left cell)
|
|
