Shortest paths for routing information over temporally dynamic communication networks

There has been a significant increase in the number of sensors deployed to accomplish military missions. These sensors might be on manned or unmanned resources, and might collect quantitative and/or qualitative information important for mission success. Of critical importance for mission success is...

Full description

Saved in:
Bibliographic Details
Published inMILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) pp. 587 - 591
Main Authors Hirsch, Michael J., Sadeghnejad, Azar, Ortiz-Pena, Hector
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2017
Subjects
Bandwidth
Communication networks
Electronic mail
Heuristic algorithms
Routing
Storage management
Vehicle dynamics
Online AccessGet full text

Cover

More Information
Summary:There has been a significant increase in the number of sensors deployed to accomplish military missions. These sensors might be on manned or unmanned resources, and might collect quantitative and/or qualitative information important for mission success. Of critical importance for mission success is ensuring that the collected information is routed to the people/systems that need the information for the proper making of decisions. For military applications, routing of information across a communication network has typically been accomplished using fixed, a priori defined, routing paths. When bandwidth between resources is unlimited, this presents no problems. However, in bandwidth constrained environments, when not all information is able to be routed across the network, then fixed routing paths presents limitations in information reaching appropriate consumers. In this research, we consider the advantages to using dynamic shortest temporal path routes for the information, as opposed to fixed routing paths. Multiple metrics show empirically the benefit to dynamic shortest path routes.
ISSN:2155-7586
DOI:10.1109/MILCOM.2017.8170722