In an unreliable single-hop broadcast network setting, we investigate the throughput and
decoding-delay performance of random linear network coding as a function of the coding …

Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest
Queue First (LQF), has been studied extensively for wireless networks. However, GMS can …

Mission-driven sensor networks usually have special lifetime requirements. However, the
density of the sensors may not be large enough to satisfy the coverage requirement while …

Wireless communication is now a cornerstone of modern society, propelled by the
widespread adoption of IoT devices and sophisticated wireless technologies. As wireless …

This paper presents a distributed cross-layer optimization algorithm for a multihop cognitive
radio network, with the objective of maximizing data rates for a set of user communication …

In recent years, there has been a significant amount of work done in developing low-
complexity scheduling schemes to achieve high performance in multihop wireless networks …

We study throughput-optimum localized link scheduling in wireless networks. The majority of
results on link scheduling assume binary interference models that simplify interference …

One of the major challenges in wireless networking is how to optimize the link scheduling
decisions under interference constraints. Recently, a few algorithms have been introduced …

This paper considers the channel-assignment and scheduling in wireless mesh networks
that employ multiple radios and multiple channels. In contrast to the various algorithms …

In this paper, we study a wireless multi-hop network where multiple flows co-exist and share
the network resource collectively. Each flow is associated with a user which has specific …