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

Relja Djapic

dblp:34/3100 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2005
0000-0001-8096-2450ORCID · reported

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

Computer 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
1 paper
Wireless networking · 77% Physical-layer communications · 23%

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

TopicWeightPapersLastEvidence papers
Wireless networking
mobile ad hoc networks
0.112005
Synchronization and packet separation in wireless ad hoc networks by known modulus algorithms · IEEE J. Sel. Areas Commun. 2005
Wireless networking
packet collision
0.112005
Synchronization and packet separation in wireless ad hoc networks by known modulus algorithms · IEEE J. Sel. Areas Commun. 2005
Physical-layer communications
antenna arrays
0.012005
Synchronization and packet separation in wireless ad hoc networks by known modulus algorithms · IEEE J. Sel. Areas Commun. 2005
Physical-layer communications
beamforming
0.012005
Synchronization and packet separation in wireless ad hoc networks by known modulus algorithms · IEEE J. Sel. Areas Commun. 2005

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

synchronization algorithms · 0.1known modulus algorithms · 0.1
YearPublicationVenuePosition
2005 Synchronization and packet separation in wireless ad hoc networks by known modulus algorithms
abstract
In mobile asynchronous ad hoc networks, multiple users may transmit packets at the same time. If a collision occurs, then in current systems both packets are lost and need to be retransmitted, reducing the overall throughput. To mitigate this, we consider to extend the receiver with a small antenna array, so that it can suppress interfering signals. To characterize the signal of interest, we propose to modulate it at the symbol rate by a known amplitude variation. This allows the corresponding multichannel receiver to estimate the beamformer weights that will suppress the interfering sources. We introduce "known modulus algorithms" to achieve this. We also derive synchronization algorithms to estimate the offset of the desired packet in an observation window, among interfering data packets. The algorithms are illustrated via simulations.
Relja Djapic, Alle-Jan van der Veen, Lang Tong 0001
IEEE J. Sel. Areas Commun.1