 |
|
| |
Analysis of least-time and minimum-hop routing for clusteredtemporal networks
Haim, T.F.
Vickery, R.J.
Sch. of Comput. & Inf. Sci., South Alabama Univ., Mobile, AL;
This paper appears in: Military Communications Conference, 1995. MILCOM '95, Conference Record, IEEE
Publication Date: 8 Nov 1995
Volume: 3,
On page(s): 1144-1149 vol.3
Meeting Date: 11/05/1995 - 11/08/1995
Location: San Diego, CA, USA
ISBN: 0-7803-2489-7
References Cited: 22
INSPEC Accession Number: 5262312
Digital Object Identifier: 10.1109/MILCOM.1995.483674
Current Version Published: 2002-08-06
|
|
|
|
Networks of low-altitude multiple satellites (LAMS) have been
envisioned to provide such diverse tasks as global positioning, paging,
weather tracking, surveillance, and environmental observation and
disaster assessment. One theoretical model for such dynamically
reconfiguring networks, allowing the investigation of packet routing, is
the clustered temporal network (CTN). The store-and-forward routing in
such a network requires a quite different algorithmic approach to that
of static networks which have been studied extensively. While solutions
for optimal paths can be found only by NP complexity algorithms, a
polynomial algorithm using spanning graphs in conjunction with the CTN
model, and yielding very good, but not necessarily optimal, solutions
have been previously found. The time-complexities of the algorithm using
a full spanning graph, which yields optimal solutions relative to the
CTN model, and a reduced spanning graph that yields good but sub-optimal
solutions are investigated empirically. The algorithm using the reduced
spanning graph is shown, through stochastic simulation and descriptive
statistics, to be significantly faster than the algorithm using the full
spanning graph. It is also shown that the space-complexity of the
reduced spanning graph data structure is significantly less than the
corresponding full spanning graph. Finally, the average path latencies
and hop counts of the generated paths are compared for the full and
reduced spanning graphs, and show very little difference. The studies
are performed for networks of 5-80 nodes (satellites)
|
|
|
|
Index
Terms
Available to subscribers and IEEE members. |
|
|
|
References
Available to subscribers and IEEE members. |
|
|
|
Citing Documents
Available to subscribers and IEEE members. |
|
|
Cart
