Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks
نویسندگان
چکیده
منابع مشابه
On Minimum-Time Scheduling Problem in a Class of Wireless Networks
We consider a set of transmitter-receiver pairs, or links, that share a wireless medium, and address the problem of emptying backlogged queues with given initial size at the transmitters in minimum time. The minimum-time scheduling problem (MTSP) amounts to determining activation subsets of links, and their time durations, to form a minimum-time schedule. This scheduling problem has been studie...
متن کاملThe Minimum Scheduling Time for Convergecast in Wireless Sensor Networks
We study the scheduling problem for data collection from sensor nodes to the sink node in wireless sensor networks, also referred to as the convergecast problem. The convergecast problem in general network topology has been proven to be NP-hard. In this paper, we propose our heuristic algorithm (finding the minimum scheduling time for convergecast (FMSTC)) for general network topology and evalu...
متن کاملA polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
A connected dominating set in a graph is a subset of vertices such that every vertex is either in the subset or adjacent to a vertex in the subset and the subgraph induced by the subset is connected. A minimum-connected dominating set is such a vertex subset with minimum cardinality. An application in ad hoc wireless networks requires the study of the minimum-connected dominating set in unit-di...
متن کاملPolynomial-complexity, Low-delay Scheduling for SCFDMA-based Wireless Uplink Networks (Technical Report)
Uplink scheduling/resource allocation under the single-carrier FDMA constraint is investigated, taking into account the queuing dynamics at the transmitters. Under the singlecarrier constraint, the problem of MaxWeight scheduling, as well as that of determining if a given number of packets can be served from all the users, are shown to be NP-complete. Finally, a matching-based scheduling algori...
متن کاملPolynomial time solution to minimum forwarding set problem in wireless networks under disk coverage model
In this paper, we consider a practical problem, called Minimum Forwarding Set Problem (MFSP), that emerges within the context of implementing (energy efficient) communication protocols for wireless ad hoc or sensor networks. For a given node v, MFSP asks for a minimum cardinality subset of 1-hop neighbors of v to cover v’s 2-hop neighbors. MFSP problem is also known as multi-point relay (MPR) p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2016
ISSN: 2325-5870
DOI: 10.1109/tcns.2015.2512678