9 citations · 33 across the 33 of their papers we have counts for
34 papers
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…
Bijective Enumeration and Sign-Imbalance for Permutation Depth and Excedances
Sen-Peng Eu, Tung-Shan Fu, Yuan-Hsun Lo
We present a simplified variant of Biane's bijection between permutations and 3-colored Motzkin paths with weight that keeps track of the inversion number, excedance number and a s…
Deadline-Constrained Opportunistic Spectrum Access With Spectrum Handoff
Zhaolong Xue, Aoyu Gong, Yuan-Hsun Lo +2
This paper considers designing an optimal policy for deadline-constrained access in cognitive radio networks, where a secondary user needs to complete a packet transmission over th…
Gamma-positivity for a Refinement of Median Genocchi Numbers
Sen-Peng Eu, Tung-Shan Fu, Hsin-Hao Lai +1
We study the generating function of descent numbers for the permutations with descent pairs of prescribed parities, the distribution of which turns out to be a refinement of median…
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…
The stresses on centrally symmetric complexes and the lower bound theorems
Isabella Novik, Hailun Zheng
In 1987, Stanley conjectured that if a centrally symmetric Cohen--Macaulay simplicial complex of dimension satisfies for some , then $h_j(Δ…
Signed Euler-Mahonian identities
Sen-Peng Eu, Zhicong Lin, Yuan-Hsun Lo
A relationship between signed Eulerian polynomials and the classical Eulerian polynomials on was given by Désarménien and Foata in 1992, and a refined version, cal…
The Undirected Optical Indices of Trees
Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang +1
For a connected graph , an instance is a set of pairs of vertices and a corresponding routing is a set of paths specified for all vertex-pairs in . Let $\mathfrak{R}_…
Forwarding and Optical Indices in an All-Optical BCube Network
Suzhen Wang, Jingjing Luo, Yuan-Hsun Lo +1
BCube is a highly scalable and cost-effective networking topology, which has been widely applied to modular datacenters. Optical technologies based on Wavelength Division Multiplex…
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…
The Undirected Optical Indices of Complete -ary Trees
Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang +1
The routing and wavelength assignment problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WD…
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…
On the Number of Rainbow Spanning Trees in Edge-Colored Complete Graphs
Hung-Lin Fu, Yuan-Hsun Lo, K. E. Perry +1
A spanning tree of a properly edge-colored complete graph, , is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectur…
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…
The Global Packing Number for an Optical Network
Yuan-Hsun Lo, Yijin Zhang, Wing Shing Wong +1
The global packing number problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WDM). Consider…
Toric -polynomials of hook shape lattice Path Matroid Polytopes and product of simplices
Sen-Peng Eu, Yuan-Hsun Lo, Ya-Lun Tsai
It is known that a lattice path matroid polytope can be associated with two given noncrossing lattice paths on with the same end points. In this short…