Coded slotted ALOHA: A graph-based method for uncoordinated multiple access
In this paper, a random access scheme is introduced, which relies on the combination of
packet erasure correcting codes and successive interference cancellation (SIC). The …
packet erasure correcting codes and successive interference cancellation (SIC). The …
Spatially-coupled random access on graphs
In this paper we investigate the effect of spatial coupling applied to the recently-proposed
coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the …
coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the …
Construction and analysis of shift-invariant, asynchronous-symmetric channel-hopping sequences for cognitive radio networks
Besides designing channel-hopping (CH) sequences, finding good methods of
communication rendezvous is important for improving spectral efficiency and alleviating …
communication rendezvous is important for improving spectral efficiency and alleviating …
Age of information for periodic status updates under sequence based scheduling
This paper considers a system in which multiple users send periodically generated status
information to a common access point (AP) over a collision channel. To avoid high …
information to a common access point (AP) over a collision channel. To avoid high …
Graph-based random access for the collision channel without feedback: Capacity bound
A random access scheme for the collision channel without feedback is proposed. The
scheme is based on erasure correcting codes for the recovery of packet segments that are …
scheme is based on erasure correcting codes for the recovery of packet segments that are …
DV-Hop localization with protocol sequence based access
Among typical range-free localization schemes for sensor networks, DV-Hop has its
distinguishing advantage of the capability to localize unknown nodes, which have less than …
distinguishing advantage of the capability to localize unknown nodes, which have less than …
Time synchronization attack and countermeasure for multisystem scheduling in remote estimation
We consider time synchronization attack against multisystem scheduling in a remote state
estimation scenario where a number of sensors monitor different linear dynamical processes …
estimation scenario where a number of sensors monitor different linear dynamical processes …
Construction and applications of CRT sequences
Protocol sequences are used for channel access in the collision channel without feedback.
Each user accesses the channel according to a deterministic zero-one pattern, called the …
Each user accesses the channel according to a deterministic zero-one pattern, called the …
Protocol sequences for the multiple-packet reception channel without feedback
Consider a time-slotted communication channel that is shared by K active users transmitting
to a single receiver. It is assumed that the receiver has the ability of the multiple-packet …
to a single receiver. It is assumed that the receiver has the ability of the multiple-packet …
CRT sequences with applications to collision channels allowing successive interference cancellation
Protocol sequences are periodic zero-one sequences for the scheduling of packet
transmissions in a time-slotted channel. A special class of protocol sequences, called shift …
transmissions in a time-slotted channel. A special class of protocol sequences, called shift …