The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we study the link scheduling problem in wireless networks under M-hop interference model. In wireless networks, a scheduling algorithm is required to choose a subset of links at each time slot such that the packets do not corrupt due to interference. To deal with the interference in such a radio network different models have been introduced in the literature. In M-hop interference model...
With K-hop interference model, especially when K ≥ 2, the throughput-optimal centralized scheduler needs to solve a NP-Hard problem. It leads to the desire of a distributed, low-complexity but throughput-optimal scheduling algorithm. We generalize a randomized scheduling framework for a K-hop interference model and develop two randomized distributed scheduling algorithms which can be integrated into...
We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient and distributed algorithm to determine the n2 dimensional unicast capacity region of such a wireless network. Equivalently, given a vector of end-to-end rates between various source-destination pairs, we seek to determine if...
In this paper, we study the interference-aware broadcast scheduling problem, where all nodes in the Euclidean plane have a transmission range and an interference range equal to r and alphar for alphages1, respectively. Minimizing latency is known to be NP-hard even when alpha=1. The network radius D, the maximum graph distance from the source to any node, is also known to be a lower bound. We formulate...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.