Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Norman Abramson

dblp:272/2174 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-authorComputer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
3 papers
Wireless networking · 46% Vehicular, aerial and satellite networks · 39% Physical-layer communications · 11%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Vehicular, aerial and satellite networks › satellite multiple access
spread ALOHA
0.021994
Multiple access in wireless digital networks · Proc. IEEE 1994
VSAT data networks · Proc. IEEE 1990
Wireless networking
medium access control
0.021994
Multiple access in wireless digital networks · Proc. IEEE 1994
VSAT data networks · Proc. IEEE 1990
Wireless networking
random access
0.021994
Multiple access in wireless digital networks · Proc. IEEE 1994
VSAT data networks · Proc. IEEE 1990
Vehicular, aerial and satellite networks › satellite networks
VSAT network
0.011990
VSAT data networks · Proc. IEEE 1990
Physical-layer communications
code-division multiple access
0.011994
Multiple access in wireless digital networks · Proc. IEEE 1994
Physical-layer communications
multiple access
0.011994
Multiple access in wireless digital networks · Proc. IEEE 1994
Wireless networking › random access
ALOHA
0.011990
VSAT data networks · Proc. IEEE 1990
Routing and switching
packet broadcasting
0.011977
The Throughput of Packet Broadcasting Channels · IEEE Trans. Commun. 1977
Network performance modeling
throughput analysis
0.011977
The Throughput of Packet Broadcasting Channels · IEEE Trans. Commun. 1977
Routing and switching
packet switching
0.011977
The Throughput of Packet Broadcasting Channels · IEEE Trans. Commun. 1977

Methods — techniques the papers use, named apart from their topics

linear transformation · 0.0spread spectrum · 0.0signal space analysis · 0.0queueing theory · 0.0
YearPublicationVenuePosition
1994 Multiple access in wireless digital networks
abstract
General principles for the design of a multiple-access system for large numbers of terminals transmitting to a single hub station are discussed. The importance of understanding the nature of the traffic to be carried by the network is emphasized. After some discussion of multiple access options for steady traffic and for slowly varying traffic, the use of random-access protocols for rapidly varying traffic is explained. Two general random-access protocols have been used in a variety of data networks, ALOHA and CDMA. Although these two techniques have different origins and are generally thought of as separate, they are in fact but different ways of looking at the same basic signals. The author shows that the use of multiple spreading codes in a CDMA network is not necessary in order to achieve multiple access capability. A single code can greatly reduce the complexity of a CDMA system. He introduces a spread-spectrum version of an ALOHA channel (spread ALOHA) which is equivalent to a CDMA channel with a common spreading code for all users. The equivalence the author demonstrates opens the door to a variety of techniques commonly used in ALOHA channels which can significantly increase both the throughput and the efficiency of the spread-spectrum channel.>
Norman Abramson
Proc. IEEE1
1990 VSAT data networks
abstract
The use of satellite channels for very small-aperture terminal (VSAT) data networks such as spread spectrum and ALOHA is reviewed. Certain basic aspects of the architecture of VSAT data networks are discussed. Although spread spectrum and ALOHA have different origins and are sometimes represented as competing technologies, they can in fact be characterized as different ways of viewing the same low-dimensional signals in a high-dimensional signal space. After a brief introduction to the architecture of VSAT networks, it is shown how a simple linear transformation of conventional ALOHA packets called spread ALOHA leads to signals identical in all respects to the most common form of spread-spectrum signals. Two practical consequences of this theoretical result are discussed. First, for the case of small earth stations it is not possible to find an Access technique with a higher throughput than spread ALOHA. Second, the use of different spreading sequences for different users in a packet network using spread spectrum is not necessary for user separation.>
Norman Abramson
Proc. IEEE1
1977 The Throughput of Packet Broadcasting Channels
abstract
Packet broadcasting is a form of data communications architecture which can combine the features of packet switching with those of broadcast channels for data communication networks. Much of the basic theory of packet broadcasting has been presented as a byproduct in a sequence of papers with a distinctly practical emphasis. In this paper we provide a unified presentation of packet broadcasting theory. In Section II we introduce the theory of packet broadcasting data networks. In Section III we provide some theoretical results dealing with the performance of a packet broadcasting network when the users of the network have a variety of data rates. In Section IV we deal with packet broadcasting networks distributed in space, and in Section V we derive some properties of power-limited packet broadcasting channels, showing that the throughput of such channels can approach that of equivalent point-to-point channels.
Norman Abramson
IEEE Trans. Commun.1