To explore the potential fruitfulness of the mathematical theory of communication for information science, we examine the question of how to encode a message at the time it is encountered so that it will come to mind at the time it is needed or can be used. After describing some examples of this problem, we propose a prototype computer program and an experiment, and use these to analyze ways of...

This paper reviews results from a number of field trials assessing speech recognition feasibility for telecommunications services. Several applications incorporating speech automation are explored: Directory Assistance Call Completion (DACC), partial speech automation of Directory Assistance (OSF-Operator Store and Forward), banking over the telephone (Money Talks) and partial speech automation...

We consider various relaying strategies for wireless networks by comparatively examining direct transmission, conventional relaying, and the novel concepts of cooperative relaying. The latter build on two inherent benefits of relaying systems: the spatial diversity offered by the relay channel, and the ability to exploit the broadcast nature of the wireless medium. Studied cooperative protocols...

The \arrowhead torus" is a broadcast graph that we deene on the 6-valent grid as a Cayley graph. A 3-port wormhole broadcasting protocol is derived rst from construction, then improved by using edge-disjoint forests. A store-and-forward broadcasting protocol is derived afterwards, then improved by mixing pipelining and arc-disjoint spanning trees. Costs are given in constant and linear time and...

Distributed systems and in particular sensor networks are in need of efficient asynchronous communication, message security and integrity, and scalability. These points are especially important in mobile environments where mobile remote sensors are connected to a control center only via intermittent communication, e.g. via satellite link. We present an approach that is able to deal with the iss...

A Message Channel is dejined as a tandem connection of single server queues in which the successive service times experienced by any particular customer are scaled versions of the same random variable, and thus it serves as a model for sparsely connected store-and-forward data communications networks (or network segments) where messages typically preserve their lengths as they traverse the syst...

This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic dependencies among virtual channels. A novel fully adaptive nonminimal deadlock-free routing algorithm has been developed for k-ary n-cube torus network. Since our technique is based on decomposing a network into several su...

An encounter-based network is a frequently-disconnected wireless ad-hoc network requiring nearby neighbors to store and forward data utilizing mobility and encounters over time. Using traditional approaches such as gateways or firewalls for deterring worm propagation in encounter-based networks is inappropriate. We propose models for the worm interaction approach that relies upon automated bene...

The explosive growth of the Internet exposes unprecedented commercial opportunities over the network. The vast comptiter networks easily bring together customers and vendors who are physically distributed in diflerent continents. Current research in electronic commerce mainly focuses on payment mechanisms. However, the global presence of customers and vendors makes at dificult to build trust am...

This column focuses on a new feature defined in the CORBA Messaging Specification [1] called time-independent invocation (TII), which adds store-and-forward features to CORBA. Prior to the Messaging spec, CORBA requests were sent by a client and handled immediately by the server, with the server returning any response as soon as it finished processing the request, as shown in Figure 1. As shown in