English
Related papers

Related papers: A Greedy link scheduler for Wireless Networks havi…

200 papers

Physical-layer network coding (PNC) is a promising approach for wireless networks. It allows nodes to transmit simultaneously. Due to the difficulties of scheduling simultaneous transmissions, existing works on PNC are based on simplified…

Networking and Internet Architecture · Computer Science 2013-05-15 Shiqiang Wang , Qingyang Song , Xingwei Wang , Abbas Jamalipour

We consider a multicast scenario involving an ad hoc network of co-channel MIMO nodes in which a source node attempts to share a streaming message with all nodes in the network via some pre-defined multi-hop routing tree. The message is…

Information Theory · Computer Science 2012-01-04 Feng Jiang , Jianqi Wang , A. Lee Swindlehurst

We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link scheduling algorithm based on a line graph representation of the…

Networking and Internet Architecture · Computer Science 2007-12-12 N. Praneeth Kumar , Ashutosh Deepak Gore , Abhay Karandikar

We consider unreliable multi-hop networks serving multiple flows in which packets not delivered to their destination nodes by their deadlines are dropped. We address the design of policies for routing and scheduling packets that optimize…

Networking and Internet Architecture · Computer Science 2021-04-27 Rahul Singh , P. R. Kumar

In single channel wireless networks, concurrent transmission at different links may interfere with each other. To improve system throughput, a scheduling algorithm is necessary to choose a subset of links at each time slot for data…

Combinatorics · Mathematics 2012-10-30 Ali Ghiasian , Behnaz Omoomi , Hossein Saidi

Traditional random access schemes are designed based on the aggregate process of user activation, which is created on the basis of independent activations of the users. However, in Machine-Type Communications (MTC), some users are likely to…

Information Theory · Computer Science 2018-03-12 Anders Ellersgaard Kalør , Osama A. Hanna , Petar Popovski

We study the problem of efficiently broadcasting packets in multi-hop wireless networks. At each time slot the network controller activates a set of non-interfering links and forwards selected copies of packets on each activated link. A…

Information Theory · Computer Science 2015-07-21 Abhishek Sinha , Georgios Paschos , Chih-ping Li , Eytan Modiano

We consider multiuser scheduling in wireless networks with channel variations and flow-level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is throughput-optimal in networks with a fixed number users, fails to…

Networking and Internet Architecture · Computer Science 2010-08-17 Shihuan Liu , Lei Ying , R. Srikant

We consider optimal/efficient power allocation policies in a single/multihop wireless network in the presence of hard end-to-end deadline delay constraints on the transmitted packets. Such constraints can be useful for real time voice and…

Networking and Internet Architecture · Computer Science 2017-02-17 Satya V Kumar , Vinod Sharma

We study real time periodic query scheduling for data collection in multihop Wireless Sensor Networks (WSNs). Given a set of heterogenous data collection queries in WSNs, each query requires the data from the source sensor nodes to be…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-08-05 Xiaohua Xu , Xiang-Yang Li , Min Song

Wideband wireless channel is a time dispersive channel and becomes strongly frequency-selective. However, in most cases, the channel is composed of a few dominant taps and a large part of taps is approximately zero or zero. To exploit the…

Information Theory · Computer Science 2010-05-14 Guan Gui , Qun Wan , Wei Peng , Fumiyuki Adachi

This paper develops a distributed algorithm for rate allocation in wireless networks that achieves the same throughput region as optimal centralized algorithms. This cross-layer algorithm jointly performs medium access control (MAC) and…

Information Theory · Computer Science 2015-03-13 Jubin Jose , Sriram Vishwanath

We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees, defined by instantaneous throughput and hard packet deadlines. Using a network slicing model to decouple the queueing dynamics between flows,…

Networking and Internet Architecture · Computer Science 2026-04-21 Nicholas Jones , Eytan Modiano

In a wireless sensor network, nodes communicate time-stamped packets in order to synchronize their clocks, i.e., estimate each other's time display. We introduce and analyze a parametrized stochastic model for clocks and use it to…

Networking and Internet Architecture · Computer Science 2013-11-28 Nikolaos Freris , Vivek Borkar , P. R. Kumar

In a wireless network, the efficiency of scheduling algorithms over time-varying channels depends heavily on the accuracy of the Channel State Information (CSI), which is usually quite ``costly'' in terms of consuming network resources.…

Networking and Internet Architecture · Computer Science 2014-04-01 Wenzhuo Ouyang , Atilla Eryilmaz , Ness B. Shroff

In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when such scheduling problems can be represented by claw-free conflict graphs. It is possible to formulate a…

Information Theory · Computer Science 2017-11-07 Alper Kose , Muriel Medard

We address the optimization of the sum rate performance in multicell interference-limited singlehop networks where access points are allowed to cooperate in terms of joint resource allocation. The resource allocation policies considered…

Information Theory · Computer Science 2007-09-19 David Gesbert , Marios Kountouris

Several novel industrial applications involve human control of vehicles, cranes, or mobile robots through various high-throughput feedback systems, such as Virtual Reality (VR) and tactile/haptic signals. The near real-time interaction…

Networking and Internet Architecture · Computer Science 2022-08-26 Andrea Bedin , Federico Chiariotti , Andrea Zanella

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

Information Theory · Computer Science 2011-12-05 Qiao Li , Rohit Negi

A node equipped with a multi-beam antenna can achieve a throughput of up to m times as compared to a single-beam antenna, by simultaneously communicating on its m non-interfering beams. However, the existing multi-beam medium access control…

Networking and Internet Architecture · Computer Science 2022-10-12 Shivam Garg , Nandini Venkatraman , Elizabeth Serena Bentley , Sunil Kumar