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

Edward W. Chandler

dblp:167/4898 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2022
—ORCID · none

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

Computer networks · 3 · 3 first-author · 1 since 2021

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
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › physical layer security › anti-eavesdropping
low probability of intercept
0.011985
Low Probability of Intercept Performance Bounds for Spread-Spectrum Systems · IEEE J. Sel. Areas Commun. 1985
Physical-layer communications
spread spectrum
0.011985
Low Probability of Intercept Performance Bounds for Spread-Spectrum Systems · IEEE J. Sel. Areas Commun. 1985
Coding theory
error-correcting codes
0.011985
Low Probability of Intercept Performance Bounds for Spread-Spectrum Systems · IEEE J. Sel. Areas Commun. 1985
Physical-layer communications › interference › jamming
antijam communication
0.011985
Low Probability of Intercept Performance Bounds for Spread-Spectrum Systems · IEEE J. Sel. Areas Commun. 1985

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

performance bounds analysis · 0.0
YearPublicationVenuePosition
2022 Expanded Excel-Based Simulator Tool for Resource-Allocation Optimization for Distributed Network Protocols
abstract
A simple Excel-based simulation tool described in earlier papers was developed to simulate the operation and performance of distributed network systems having time-varying data traffic patterns. Such networks use protocols to increase or decrease resources allocated. These resource-allocation protocols can have settable parameters such as numerical thresholds. Improper choices of these parameters can cause undesirable results such as allocations oscillating between higher and lower values. This paper describes modifications to the simulator to analyze the degree to which oscillations occur, to generate and store multiple sets of message-generation data allowing faster simulations, and to present additional message-delivery performance results. Also, the user interface for the simulator has been expanded to clearly show all simulation results and to show them side by side for two protocols that are being compared. The new simulator features and new user interface are presented.
Edward W. Chandler
ISCC1
2017 A TDMA data-buffering technique that provides minimum throughput delays while allowing time-slot reassignments without data-transfer interruptions
abstract
Data-buffering techniques currently used in time-division-multiple-access (TDMA) networks are described, including a short-delay technique called sub-framing. The sub-framing technique produces minimum user-to-user streamed-data throughput delays but results in data-transfer interruptions when TDMA time-slot resources have reassigned positions in the time frame. A simple modification to the sub-framing data-buffering technique is proposed, and it accommodates dynamic TDMA time-slot resource reassignments without data-transfer interruptions. This proposed data buffering technique provides the same minimum user-to-user streamed-data throughput delay, which is approximately equal to the difference between the TDMA frame time and the TDMA time-slot duration, but does not have data-transfer interruptions when TDMA time-slot resources have reassigned positions in the time frame.
Edward W. Chandler
ISCC1
1985 Low Probability of Intercept Performance Bounds for Spread-Spectrum Systems
abstract
An important application of spread-spectrum (SS) in military communication systems is that of making the signal difficult to intercept by unauthorized receivers. Error-correction coding techniques may be employed to reduce the required input signal-to-noise ratio at the receiver, allowing the system to operate at a lower power level, hence resulting in a lower probability of interception. In the absence of error-correction coding, a specified message bit rate, transmitted signal bandwidth, and required bit-error probability at the receiver will yield a required signal-to-noise ratio for each type of spread-spectrum system. When coding is employed, a specified decoder delay time implies a specified code complexity, and can be used to determine bounds on the required receiver signal-to-noise ratio. These performance bounds are evaluated as functions of the specified parameters. In addition, one may specify a burst interference environment in that the system must operate. Presented is the evaluation of the increase in the upper bound on signal-to-noise ratio as a result of the specification of a correctable single-burst time. This increase indicates an antiintercept /antijam tradeoff.
Edward W. Chandler, George R. Cooper
IEEE J. Sel. Areas Commun.1