Packet-Switching Applique for Tactical VHF Radios

  title={Packet-Switching Applique for Tactical VHF Radios},
  author={M. Lewis and J. Garcia-Luna-Aceves},
  journal={MILCOM 1987 - IEEE Military Communications Conference - Crisis Communications: The Promise and Reality},
  • M. Lewis, J. Garcia-Luna-Aceves
  • Published 1987
  • Computer Science
  • MILCOM 1987 - IEEE Military Communications Conference - Crisis Communications: The Promise and Reality
Packet radio technology is being used to implement a data communication network based on tactical radios because of the advantages that packet radio technology offers in the tactical environment. These include fully distributed control for survivablity, self-initialization and mobility for easy deployment, automatic network management, extended coverage, and interconnection to other packet switching networks. This paper describes the design considerations for tailoring packet radio technology… Expand
High-Throughput, Survivable Protocols for CDMA Packet-Radio Networks (SRNTN-74)
A suite of practical, implementable algorithms that a software developer can use to build a high-throughput, survivable Code-Division Multiple Access (CDMA) mobile packet radio network with existing spread-spectrum packet-radio hardware. Expand
Efficiency of multiparty networking protocols over mobile tactical radios on VHF bands
  • L. Li, T. Kunz
  • Computer Science
  • 2010
It is found that the 2-hop neighborhood information based solution may generate high message overhead when disseminating the link status information and the typical alternative using 1-hop network clustering scheme may require improvement on its packet forwarding efficiency. Expand
Network properties of mobile tactical scenarios
A network science-based systematic modeling approach is applied to analyze typical deployment scenarios and identify fundamental tactical network properties to effectively capture the dynamic network behavior that needs to be considered for protocol design. Expand
Networking for next generation NBWF radios
  • L. Li, H. Rutagemwa, +4 authors T. Kunz
  • Engineering, Computer Science
  • MILCOM 2015 - 2015 IEEE Military Communications Conference
  • 2015
A network emulator is developed to evaluate two critical algorithms, the link metrics mapping algorithm and the relay node selection algorithm, employing realistic network scenario parameters, and results are illustrated and the options for dynamic algorithm adaptation are elaborated. Expand
A Minimum-Hop Routing Algorithm Based on Distributed Information
There is a need for algorithms with a stronger internodal coordination, such as those reported previously in the literature by Jaffe and Moss and the author, to help solve the counting-to-infinity problem. Expand


The DARPA packet radio network protocols
The algorithms are described and illustrated how the PRNET provides highly reliable network transport and datagram service, by dynamically determining optimal routes, effectively controlling congestion, and fairly allocating the channel in the face of changing link conditions, mobility, and varying traffic loads. Expand
Speech Transport in Packet-Radio Networks with Mobile Nodes
A research effort to provide speech-carrying capabilities to a data-oriented packet-switching radio network and a new protocol that enhances the network capabilities in a mobile environment, called duct routing, are described. Expand
Routing Techniques Used in Computer Communication Networks
An overview is provided in this paper of the routing procedures used in a number of operating networks, as well as in two commercial network architectures, which include the IBM SNA and the DEC DNA. Expand
A correctness proof of a topology information maintenance protocol for a distributed computer network
The Topology Information Protocol that was implemented on the MERIT Computer Network is presented and explained; this protocol is quite general and could be implemented on any computer network. Expand
A Responsive Distributed Routing Algorithm for Computer Networks
A new distributed algorithm is presented for dynamically determining weighted shortest paths used for message routing in computer networks that the paths defined do not form transient loops when weights change and the number of steps required to find new shortest paths when network links fail is less than for previous algorithms. Expand
Packet Switch Overlay
  • Final Design Plan, Contract No. DAAB0785-C-K581, SRI International,
  • 1986