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.
This paper proposes a hypergraph interference model for the scheduling problem in wireless ad hoc networks. The proposed hypergraph model can take the sum interference into account and, therefore, is more accurate as compared with the traditional binary graph model. Further, different from the global signal-to-interference-plus-noise ratio (SINR) model, the hypergraph model preserves a localized graph-theoretic...
This paper proposes a dynamic primal-dual type scheduling algorithm in wireless networks, which achieves optimal throughput even with uncertain parameters. In wireless networks, such uncertain parameters are generated by complicated stochastic dynamics, such as random packet arrivals, channel fading, and node mobilities. The algorithm is a generalization of the well-known max-weight scheduling algorithm...
In this paper, we propose a distributed throughput-optimal ad hoc wireless network scheduling algorithm, which is motivated by the celebrated simplex algorithm for solving linear programming (LP) problems. The scheduler stores a sparse set of basic schedules, and chooses the max-weight basic schedule for transmission in each time slot. At the same time, the scheduler tries to update the set of basic...
We consider a general scheduling problem in wireless networks under uncertain arrival and channel state statistics. The objective is to minimize a linear cost function, which can be used to model wireless communication constraints, such as power consumption. We assume that the arrival processes and the network states are random, and with unknown distributions. In each time slot, the schedule can only...
This paper considers the joint routing and scheduling problem in wireless networks with lossy channels. In order to combat channel loss, packets are assumed to be transmitted by nodes using broadcast, instead of traditional point-to-point communication. We first analyze the network capacity region, and then propose a back-pressure routing with max-weight scheduling algorithm to achieve it. The proposed...
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.