9 citations · 33 across the 33 of their papers we have counts for
17 papers · 1 filter
An AoI-oriented Time-Frequency Distributed Access Mechanism in Wireless Sensor Networks with Spectrum Division
Jingwei Liu, Fang Liu, Wing Shing Wong +2
The increasing adoption of spectrum-division techniques enables concurrent uplink transmissions over multiple orthogonal resources, yet low-overhead access design with effective in…
Multichannel Conflict-Avoiding Codes for Expanded Scenarios
Tsai-Lien Wong, Kangkang Xu, Yuan-Hsun Lo +2
A conflict-avoiding code (CAC) of length L and weight w is used for deterministic multiple-access without feedback. When the number of simultaneous active users is less than or equ…
Age of Information for Constrained Scheduling with Imperfect Feedback
Yuqing Zhu, Yuan-Hsun Lo, Yan Lin +1
This paper considers a downlink system where an access point sends the monitored status of multiple sources to multiple users. By jointly accounting for imperfect feedback and cons…
Color Multiset Codes based on Sunmao Construction
Wing Shing Wong, Chung Shue Chen, Yuan-Hsun Lo
We present results on coding using multisets instead of ordered sequences. The study is motivated by a moving object tracking problem in a sensor network and can find applications…
Analysis Methodology for Age of Information under Sequence Based Scheduling
Fang Liu, Wing Shing Wong, Yuan-Hsun Lo +2
We focus on the Age of Information (AoI) performance in a system where each user generates packets periodically to send to a common access point (AP) for status updating. To avoid…
Multiset Combinatorial Gray Codes with Application to Proximity Sensor Networks
Chung Shue Chen, Wing Shing Wong, Yuan-Hsun Lo +1
We investigate coding schemes that map source symbols into multisets of an alphabet set. Such a formulation of source coding is an alternative approach to the traditional framework…
Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes
Yuan-Hsun Lo, Tsai-Lien Wong, Kangkang Xu +1
A conflict-avoiding code (CAC) is a deterministic transmission scheme for asynchronous multiple access without feedback. When the number of simultaneously active users is less than…
Age-Gain-Dependent Random Access for Event-Driven Periodic Updating
Yuqing Zhu, Yiwen Zhu, Aoyu Gong +3
This paper considers utilizing the knowledge of age gains to reduce the network average age of information (AoI) in random access with event-driven periodic updating for the first…
Multichannel Conflict-Avoiding Codes of Weights Three and Four
Yuan-Hsun Lo, Kenneth W. Shum, Wing Shing Wong +1
Conflict-avoiding codes (CACs) were introduced by Levenshtein as a single-channel transmission scheme for a multiple-access collision channel without feedback. When the number of s…
Optimal Slotted ALOHA under Delivery Deadline Constraint for Multiple-Packet Reception
Yijin Zhang, Yuan-Hsun Lo, Feng Shu +1
This paper considers the slotted ALOHA protocol in a communication channel shared by N users. It is assumed that the channel has the multiple-packet reception (MPR) capability that…
New CRT sequence sets for a collision channel without feedback
Yijin Zhang, Yuan-Hsun Lo, Kenneth W. Shum +1
Protocol sequences are binary and periodic sequences used for deterministic multiple access in a collision channel without feedback. In this paper, we focus on user-irrepressible (…
Achieving Zero-Error Capacity 1 for a Collision Channel Without Feedback
Yijin Zhang, Yi Chen, Yuan-Hsun Lo +1
The collision channel without feedback (CCw/oFB) model introduced by Massey and Mathys, depicts a scenario in which M users share a thermal noise-free communication channel with ra…
Channel Hopping Sequences for Maximizing Rendezvous Diversity in Cognitive Radio Networks
Yijin Zhang, Yuan-Hsun Lo, Wing Shing Wong
In cognitive radio networks (CRNs), establishing a communication link between a pair of secondary users (SUs) requires them to rendezvous on a common channel which is not occupied…
Partially user-irrepressible sequence sets and conflict-avoiding codes
Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu
In this paper we give a partial shift version of user-irrepressible sequence sets and conflict-avoiding codes. By means of disjoint difference sets, we obtain an infinite number of…
Codes with the Identifiable Parent Property for Multimedia Fingerprinting
Minquan Cheng, Hung-Lin Fu, Jing Jiang +2
Let be a -ary code of length and size , and be the s…
Optimal strongly conflict-avoiding codes of even length and weight three
Yijin Zhang, Yuan-Hsun Lo, Wing Shing Wong
Strongly conflict-avoiding codes (SCACs) are employed in a slot-asynchronous multiple-access collision channel without feedback to guarantee that each active user can send at least…
Protocol Sequences for Multiple-Packet Reception
Yijin Zhang, Yuan-Hsun Lo, Feng Shu +1
Consider a time slotted communication channel shared by active users and a single receiver. It is assumed that the receiver has the ability of the multiple-packet reception (MP…