Timeliness of wireless sensor networks with random multiple access

Li, Liang; Dong, Yunquan; Pan, Chengsheng; Fan, Pingzhi

doi:10.23919/jcn.2023.000014

Cited by 2 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Maatouk et al used the SHS approach to model the state update system, calculate the average AoI, and verify the performance benefits on a carrier sense multiple access (CSMA) system [28]. Li studied the timeliness of the CSMA/CA and slotted Aloha wireless networks, verifying the effect of arrival rate on AoI [3]. From the above studies, we found that there is a lack of studies applying AoI freshness measures to interaction cohorts.…”

Section: Related Workmentioning

confidence: 99%

“…Stability and timeliness are two crucial metrics in wireless sensor networks. Traditional metrics, such as latency and throughput, which describe end-to-end delay and data processing capabilities [3], may not be effective for applications with strict timeliness requirements. These metrics cannot fully capture the issue of reduced timeliness caused by sudden information updates.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing the Timeliness of Hybrid OFDMA-NOMA Sensor Networks with Stability Constraints

Wang,

Dong,

Pan

2024

Electronics

Self Cite

View full text Add to dashboard Cite

In this paper, we analyze the timeliness of a multi-user system in terms of the age of information (AoI) and the corresponding stability region in which the packet rates of users lead to finite queue lengths. Specifically, we consider a hybrid OFDMA-NOMA system where the users are partitioned into several groups. While users in each group share the same resource block using non-orthogonal multiple access (NOMA), different groups access the fading channel using orthogonal frequency division multiple access (OFDMA). For this system, we consider three decoding schemes at the service terminals: interfering decoding, which treats signals from other users as interference; serial interference cancellation, which removes signals from other users once they have been decoded; and the enhanced SIC strategy, where the receiver attempts to decode for another user if decoding for a previous user fails. We present the average AoI for each of the three decoding schemes in closed form. Under the constraint of the stable region, we find the minimum AoI of each decoding scheme efficiently. The numerical results show that by optionally choosing the decoding scheme and transmission rate, the hybrid OFDMA-NOMA outperforms conventional OFDMA in terms of both system timeliness and stability.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Optimizing the Timeliness of Hybrid OFDMA-NOMA Sensor Networks with Stability Constraints

Wang,

Dong,

Pan

2024

Electronics

Self Cite

View full text Add to dashboard Cite

show abstract

“…It synchronizes the network, divides time into slots, and a communication transaction occurs within each timeslot. In contrast to asynchronous random access approaches such as pure ALOHA and carrier sense multiple access (CSMA) [1], time-slotted communication can easily coordinate communication or better allocate resources between devices given that there is a coordinator/master to manage the synchronization. Therefore, it can improve reliability and throughput by preventing collisions and interference due to uncoordinated transmissions, and also reduce energy waste attributed to redundant rendezvous attempts or idle listening.…”

Section: Introductionmentioning

confidence: 99%

“…As such, TSCH has shown remarkable performance in the literature [19]- [26]. However, time-slotted systems have one fundamental drawback: 'a slot' is predefined to be sufficiently long enough to accommodate one exchange of a maximum-sized packet and an acknowledgment (ACK) 1 . If most packets in the system are much shorter than the maximum, substantial amount of residue time within each slot are wasted, leading to corresponding amount of loss in effective data rate.…”

Section: Introductionmentioning

confidence: 99%

Slot-Size Adaptation and Utility-Based Packet Aggregation for IEEE 802.15.4e Time-Slotted Communication Networks

Kim,

Lee,

Shin

et al. 2024

IEEE Internet Things J.

View full text Add to dashboard Cite

Time-slotted communication is used in countless protocols and systems. IEEE 802.15.4e time-slotted channel hopping (TSCH) is one of those examples which has shown remarkable performances in the literature. However, time-slotted systems have one fundamental drawback: a slot is predefined to be sufficiently long enough to accommodate one exchange of a maximum-sized packet and an acknowledgment. If most packets in the system are far smaller than the maximum, a significant amount of residue time within each slot is wasted, leading to corresponding loss in effective data rate. To address this fundamental challenge, we propose utility-based adaptation of slot-size and aggregation of packets (ASAP) which reduces wasted time in slotted systems to improve throughput and latency. ASAP consists of two orthogonal approaches: slot-length adaptation (SLA) dynamically adapts timeslot length to actual packet size distribution, and utility-based packet aggregation (UPA) transmits aggregated packets in multiple consecutive slots to maximize slot utility. We case-study ASAP in the context of TSCH. We implement ASAP on real embedded devices, and evaluate on large-scale testbeds using state-of-the-art schedulers to demonstrate a 2.21x improvement in throughput as well as a 78.7% reduction in latency.

show abstract

Timeliness of wireless sensor networks with random multiple access

Cited by 2 publications

References 0 publications

Optimizing the Timeliness of Hybrid OFDMA-NOMA Sensor Networks with Stability Constraints

Optimizing the Timeliness of Hybrid OFDMA-NOMA Sensor Networks with Stability Constraints

Slot-Size Adaptation and Utility-Based Packet Aggregation for IEEE 802.15.4e Time-Slotted Communication Networks

Contact Info

Product

Resources

About