Scheduling packets to be forwarded over a link is an important subtask of the routing process both in paxalhl computing and in communication networks. This paper investigates the simple class of greedy scheduling algorithms, namely, algorithms that always forward a packet if they can. It is first proved that for various "natural" classes of routes, the time required to complete the transmission...

We consider clustered wireless networks, where transceivers in a cluster use a time-slotted mechanism (TDMA) to access a wireless channel that is shared among several clusters. An approximate expression for the packet-loss probability is derived for networks with one or more mutually interfering clusters in Rayleigh fading environments, and the approximation is shown to be good for relevant sce...

In this paper, we consider a joint packet scheduling algorithm for wireless networks and investigate its characteristics. The joint scheduling algorithm is a combination of the Knopp and Humblet (KH) scheduling, which fully exploits multiuser diversity, and the probabilistic weighted round-robin (WRR) scheduling, which does not use multiuser diversity at all. Under the assumption that the wirel...

In video data transmission over Wireless Multimedia Sensor Networks (WMSNs), in which network congestion and link failures are main characteristics, providing Quality-of-Service (QoS) is challenging. In such situation, using multipath routing protocols along with efficient packet scheduling can improve the performance of video delivery over sensor networks. In this paper we propose a new packet...

Global navigation satellite systems (GNSSs) may transmit data to provide additional services. Since the resources reserved for these are typically fixed and message rate is low, we propose split long messages into shorter packets properly schedule their transmission from entire constellation of satellites. Considering an efficient (useful example search rescue messages), aim at scheduling on sa...