R. E. Kahn et al., "Advances in packet radio technology," Proc. IEEE, vol. 66, pp. 1468--1496, Nov. 1978.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of packet drops, maximum delay, delay jitter or bandwidth. Much research was done in the early days of computer networking comparing circuit switching, packet switching and message switching (a variant of packet switching, in which the whole information flow is treated as a single switching unit) [96, 10, 164, 97, 175, 95]. Most of the work was done in the context of packet radio, satellite, and local area networks and shows how in these environments packet switching provided higher throughput for a given bound on the average delay. Packet switching not only made an effective use of the network bandwidth, but it ....

....3.3, but for the core of the network. These analytical results do not include many network effects that may affect the response time, and so Section 3.5 uses ns 2 simulations to validate the results for the core. Section 3.7 concludes this chapter. Early work in the late 60s and in the 70s [96, 10, 164, 97, 175, 95] studied the response time of packet and circuit switching in the context of radio networks, satellite communications and the ARPANET (the precursor of the modern Internet) These three network scenarios had something in common: links had less capacity than the bandwidth that an end host could ....

R.E. Kahn, S.A. Gronemeyer, J. Burchfiel, and R.C. Kunzelman. Advances in packet radio technology. Proceedings of the IEEE, 66(11):1468--1496, November 1978.

....TRANSACTIONS ON COMMUNICATIONS, VOL. COM 33, NO. 9, SEPTEMBER 1985 919 Virtual Time CSMA: Why T,Vo Clocks Are Better than One MART L. MOLLE, MEMBER, IEEE; AND LEONARD KLEINROCK, FELLOW, IEEE Abstract A new carrier sense multiple acces (CSMA) algorithm, called virtual time CSMA, is described and analyzed. This algorithm uses a novel approach to granting ....

....not it has a message belonging to that subset. Thus, for example, either the oldest remaining message at station N or the set of Paper approved by the Editor for Computer Communication of the IEEE Communications Society for publication without oral presentation. Mannscript received January 27, 1981; revised February 21, 1985. This work was supported by an Operating Grant from the Natural Sciences and Engineering Research Council of Canada, and by the Defense Advanced Research Projects Agency under Contract MDA903 77 C 0272. M. L. Molle is with the Computer Systems Research Institute, ....

[Article contains additional citation context not shown here]

R.E. Kahn, S. A. Gronemeyer, J. Burchfiei, and R. C. Kunzelman, "Advances in packet radio technology," Proc. [EEE, vol. 66, pp. 1468-1496, Nov. 1978.

....garrison and i n the battlefield. Another applicati9n is to replace regional wired packet,switching networks without the need for cable extension. Although some intensive experimental research on packet radio networks has taken place at several locations during the ast few years (e.g. PRNET in [7]) little theoretical work about their performa.nce evaluation seems to have been published so far. Compared. to the analysis of one hop broadcast networks, for which extensive literature has appeared, one of the difficulties in dealing with multihop networks is inherent in the fact that the ....

R.E. Kahn, S. A. Gronemeyer, J. Burclifiel, and R. C. Kunzelman, "Advances in packet radio technology," Proc. IEEE, vol. 66, pp. 1468-1496, Nov: 1978.

....[16] consider the problem of assigning transmission radii so as to maximize the expected one hop progress of a packet assuming randomly distributed packet radio terminals are broadcasting packets with fixed probability of transmission. A survey of packet radio network technology appears in [9], and [11] contains useful background information on wireless networks in general. 2 Range Assignments in One Dimension In this section we study range assignments when the points are arranged on a line. 2.1 The unit chain Consider a set N = f0; 1; ng of n 1 colinear points at unit ....

R. Kahn, S. Gronemeyer, J. Burchfiel and R. Kunzelman, "Advances in packet-radio technology, " Proceedings of the IEEE, 66 (1978), pp. 1468--1496.

....of the q channels on which to transmit, all with equal probability. If exactly one user transmits on a given channel, then the user on that channel is successful; if more than one user transmits on a given channel, then no users on that channel are successful. Such a model is discussed in [25] [26]. Computing the MPR matrix for such a channel is a combinatorial exercise, see [5] 27] for details. The end result of this exercise is that we have r 1 =1and for n 1, n(1 q [5] This same model can also be applied to a DS CDMA Aloha model such as the one described in [28] provided that ....

R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, and R. C. Kunzelman, "Advances in packet radio technology," Proc. IEEE, vol. 66, pp. 1468-- 1496, 1978.

....portion of the spectrum is large enough. In an autonomous network with a large number of users, data messages are usually transmitted only over short distances, allowing a frequent reuse of the spectrum. Long distance transmissions may still be feasible using multihop store and forward techniques [5,6]. Device power consumption is another problem since supply technology is not expected to make substantial progress (i.e. more than 1 2 orders of magnitude) in the next decade, why power consumption has to be limited. Clearly we see a trade off between range coverage and bandwidth on one side and ....

Kahn et al., "Advances in Packet Radio Technology," Proc IEEE, vol 66, Nov 1978.

....will in fact not even know (unless they asked to be notified) that they were disconnected. 7. RELATED WORK 7.1. Packet Radio Networks Driven by the military s need for communications in regions with poor infrastructures, ARPA initiated its pioneering packet radio program in the early t970s [12, 13]. The original program focused on algorithms for self configuring, self managing packet switch networks with support for mobile nodes. The ARPA Survivable Adaptive Networks (SURAN) program of the t980s focused on eliminating vulnerabilities, such as network partitioning, in packet radio networks. ....

R.E. Kahn, et al., "Advances in Packet Radio Technology," Proceeding IEEE, V 66, N 11, (Nov 1978), pp. 1468-1496.

....task for the designers of such networks to provide for adequate capacity, Quality of Service (QoS) reliability, and implementation complexity to make them viable. Aside from the original military application of multihop networks, which traces its roots to the packet radio network project [5], there has been great interest in several arenas: sensor networks, appliance networking, and wireless Internet. One of the recent attempts to deploy this technology for wide area high speed mobile wireless access to Internet was the Ricochet system developed by Metricom [2] This system provided ....

R.E. Kahn, S.A. Gronemeyer, J. Burchfiel, R.C. Kunzelman, "Advances in Packet Radio Technology," Proceedings of the IEEE, vol. 66, no. 11, Nov. 1978, pp. 1468-1496.

....of the human operators to route messages through the network. This solution worked well, as the topology was very static and the links very reliable. The first development of packet radio for computer communications was in 1970 as part of the ALOHANET project operated by the University of Hawaii [59, 36]. ALOHANET consisted of a radio network used to connect together university computers on each of the major Hawaiian islands. The network was single hop however, meaning that only nodes directly in reach of each other could communicate. From the ALOHANET project, packet radio grew in two main ....

....provide a good overview of the United States military packet radio efforts. Growing out of ALOHANET, the DARPA sponsored Packet Radio Network (PRNET) project extended the single hop packet radio into a mult hop packet radio network in a series of development efforts stretching from 1972 to 1983 [59]. Unlike most amateur packet radio networks, the PRNET project designed and tested protocols in environments where the nodes were expected to be mounted on mobile platforms, such as trucks. As a result, the protocols had to adapt automatically to changes in topology, although routes were expected ....

[Article contains additional citation context not shown here]

Robert E. Kahn, Steven A. Gronemeyer, Jerry Burchfiel, and Ronald Kunzelman. Advances in Packet Radio Technology. Proceedings of the IEEE, 66(11):1468--1496, November 1978.

....Ad hoc networks (or multi hop packet radio networks) consist of mobile hosts interconnected by routers that can also move. Considerable work has been done in the development of routing protocols for ad hoc networks, starting from the seventies with work on the DARPA PRNET and SURAN projects [5], 17] 12] In recent years, the interest in ad hoc networks has grown due to the availability of wireless communication devices that work in the ISM bands in the U.S. Routing for ad hoc networks can be classified in two main types: table driven and on demand. Table driven routing attempts to ....

R. E. Kahn et al. Advances in Packet Radio Technology. Proc. IEEE, 66(11):1468--1496, Nov 1978.

....version of this task [23, 34, 38, 58] processing nodes, with their associated acoustic sensors (of limited range and accuracy) are geographically distributed over the area to be monitored. Each processing node can communicate with other nearby nodes over a packet radio communication network [31]. Because acoustic sensors characteristically produce a significant amount of error, the purely localized processing of sensory data would result in the identification of nonexistent vehicles, the missed detection of actual vehicles, and the incorrect location and identification of actual ....

R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, and R. C. Kunzelman. Advances in packet radio technology. In Proceedings of the IEEE, pages 1468--1496, November 1978.

.... ARPANET FOO TENEX returns an address such as 10 2 0 9 (NET=10, HOST=2, LOGICALHOST=0, IMP=9; for details of host address formats see [8] User access to the name server has been implemented on several Arpanet DEC 10 TENEX and Packet Radio Network LSI 11 Terminal Interface Unit (TIU) hosts [9, 10]. While the TENEX program serves primarily as a demonstration vehicle, the LSI 11 program provides a valuable augmentation of the TIU s host table. A typical scenario is that when the packet radio TIU is initiated or initialized, it contains only a minimal host table, with the addresses of a ....

R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, and R. C. Kunzelman, "Advances in Packet Radio Technology," Proc. IEEE, Vol. 66, No. 11, pp. 1468-1496 (November 1978).

....key words: neural network, packet radio network, TDMA cycle, broadcast scheduling problem 1. Introduction With increas2fl demands foracces tocomputers data communication channels and dis535S2flS computer communication networks a packet radio (PR) network has beenextens4 elysy2jBj in literature [1] [1 ] A PR network provides data communications snicati to asS of geographicallydisaphical ssaph or nodes through asLKK5 high s eedbroadcas radio channel. Each nodeis equipped with a trans2fljfifij32s2s er unit and a control unit. The transNB2fljLBBL2s er unit may either transr2 or receive ....

....words: neural network, packet radio network, TDMA cycle, broadcast scheduling problem 1. Introduction With increas2fl demands foracces tocomputers data communication channels and dis535S2flS computer communication networks a packet radio (PR) network has beenextens4 elysy2jBj in literature [1] [1 ]. A PR network provides data communications snicati to asS of geographicallydisaphical ssaph or nodes through asLKK5 high s eedbroadcas radio channel. Each nodeis equipped with a trans2fljfifij32s2s er unit and a control unit. The transNB2fljLBBL2s er unit may either transr2 or receive packets via ....

[Article contains additional citation context not shown here]

R.E. Kahn, S.A. Gronemeyer, J. Burchfiel, and R.C. Kunzelman, "Advances in packet radio technology," Proc. IEEE, vol.66, no.11, pp.1468--1496, Nov. 1978.

....Route Cache, or can invoke Route Discovery again to find a new route. III. TESTBED OVERVIEW The design goal of the testbed was to challenge the network protocols to the point where they were stressed, by subjecting them to higher rates of topology change than previous testbeds had explored [2] [10]. With the vehicles, radios, and site used in our testbed, we forced the protocols to operate in an environment in which all links between nodes change status at least every 220 seconds. Ignoring the additional factor of packet loss due to wireless errors, on average, the network topology changed ....

Robert E. Kahn, Steven A. Gronemeyer, Jerry Burchfiel, and Ronald Kunzelman. Advances in Packet Radio Technology. Proceedings of the IEEE, 66(11):1468--1496, November 1978.

....processors succeed in hearing a message in a given round if and only if exactly one processor sends a message in that round; if more than one processor, or none of them, sends a message in that round, then nobody hears anything. Hence the communication model is equivalent to the radio model, cf. [1, 3, 4, 5, 6, 7, 8, 9, 16, 17, 18, 19, 21], in a complete graph. Evidently, the possibility of collisions makes broadcast systems harder to coordinate and control than standard pointto point message passing systems, and performing even simple tasks poses serious difficulties. A central problem in such systems is therefore to establish a ....

R. E. Kahn, S. A. Gronemeyer, J. Burchfiel and R. C. Kunzelman, Advances in Packet Radio Technology, Proc. IEEE 66, (1978).

....and the capture mechanism. 1. Packet Design In our analysis, we assume that a single packet is comprised of a special preamble code and an address message portion. In addition, we assume that every packet preamble employs an identical pseudo noise (PN) code (for more detailed examples, refer to [10]) This preamble code is used for both packet detection and synchronization. For packet detection and synchronization, a matched filter is used at the receiver system [10] 11] The advantage in using a matched filter lies in the fact that there is no need to search in time for the incoming ....

....we assume that every packet preamble employs an identical pseudo noise (PN) code (for more detailed examples, refer to [10] This preamble code is used for both packet detection and synchronization. For packet detection and synchronization, a matched filter is used at the receiver system [10], 11] The advantage in using a matched filter lies in the fact that there is no need to search in time for the incoming signal [12] Since the matched filter will respond whenever the target signal arrives at the receiver, the locations and magnitudes of the peaks in the matched filter output ....

R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, and R. C. Kunzelman, "Advances in packet radio technology, " Proc. IEEE, vol. 66, pp. 1468-1496, Nov. 1978.

.... be capable of autonomous operation) and to reliably control (if there system wide dependencies on topology in the slot assignment algorithms) Spread spectrum s anti jam capabilities have long been recognized as a potentially valuable tool for handling interference in packet radio networks (e.g. [7], 12] and [18] Spread spectrum techniques allow the designer to treat, to some extent, interfering signals as if they were random (thermal like) noise. To what extent this is true is discussed in [18] where it is suggested (on page 1109) that 5 dB of additional signal to noise margin more than ....

Robert E. Kahn, Steven A. Gronemeyer, Jerry Burchfiel, and Ronald C. Kunzelman. Advances in packet radio technology. Proceedings of the IEEE, 66(11):1468--1496, November 1978.

No context found.

R. E. Kahn et al., "Advances in packet radio technology," Proc. IEEE, vol. 66, pp. 1468--1496, Nov. 1978.

No context found.

R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, and R. C. Kunzelman, Advances in packet radio technology, Proceedings of the IEEE, 66 (1978), pp. 1468--1496.

No context found.

R.E. Kahn. Advances in packet radio technology. Proceedings of the IEEE, 66(11):1468--1496, 1978.

No context found.

R. Kahn, S. Gronemeyer, J. Burchfiel, and R. Kunzelman. Advances in packet radio technology. Proceedings of the IEEE, 66, November 1978.

No context found.

R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, and R. C. Kunzelman, Advances in packet radio technology, Proceedings of the IEEE, 66 (1978), pp. 1468--1496.

No context found.

R. E. Kahn et al., "Advances in packet radio technology," Proc. IEEE, vol. 66, pp. 1468--1496, Nov. 1978.

No context found.

Kahn, R.E. et. al., "Advances in packet radio technology," Proceedings of the IEEE pp. 1468-1496, November

No context found.

R .E. Kahn, S .A. Gronemeyer, J. Burdifiel , E. V. Hoversten, "Advances in Packet Radio Technology", Proceedings of the IEEE, Vol. 66, No. 11, November 1978, pp. 1408--1496.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC