The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We investigate adaptive transmission for tactical packet radio networks in which a source uses fountain coding to multicast a file to a number of destinations over time-varying links. We examine two strategies from the literature for packet-by-packet adaptation of the modulation and channel code. The maximum data-recovery rate philosophy attempts to maximize the throughput for each transmitted packet...
We investigate two approaches to fountain-coded broadcast file distribution in an ad hoc packet radio network. In the first method, all destinations receive fountain-coded packets directly from the source. In the second method, after one destination obtains the file, it acts as a relay node by applying continued fountain coding to the file and sending the encoded packets to other destinations. The...
We present results on the performance of a network-coding based method for broadcast file delivery in an ad hoc network consisting of half-duplex packet radios. Our technique allows a receiver to exploit the broadcast nature of the wireless medium by overhearing packets sent by a node that is not necessarily one of the receiver's designated relays. Delivery of the file to the remote destinations is...
Analytical methods are provided for use in performance evaluations, tradeoff studies, and preliminary designs of adaptive modulation and coding protocols that obtain their control information from practical sources. Our approach employs capacity limits and Markov chain models of fading to give analytical results on the throughput achieved by adaptive transmission in packet radio systems. The analytical...
We investigate the application of network coding to file transfers from a single source to multiple destinations in a two-hop ad hoc relay network that consists of half-duplex packet radios. Our network-coded file distribution techniques make simultaneous use of a pair of relay nodes. All transmissions by the source and the relay nodes employ packet-by-packet adaptive modulation and channel coding...
We employ a four-node network to obtain preliminary comparisons between two forms of network coding when they are used for broadcast distribution of files in tactical packet radio networks. Each of the four nodes in the network has a half-duplex packet radio, and the nodes are connected by radio links that have time-varying fading. We present two methods for network-coded broadcast distribution. One...
We present some preliminary results from our investigation of two forms of erasure-correction coding, fountain coding and network coding, when they are employed for file transfers in a distributed packet radio network. The radios adapt the modulation and channel coding of the transmitted signals in response to variations in fading on the links of the network. The control information for the adaptive...
Adaptive transmission protocols are required for efficient communications in packet radio systems that must transmit over time-varying wireless channels. We present a protocol that employs simple receiver statistics for adapting the error-control code and modulation format from packet to packet in response to changes in the channel's propagation loss, such as those caused by fading and shadowing.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.