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.
We consider a multihop wireless network with multiple users. The channels may experience fading. The power is consumed only during transmission and is a general monotonically increasing function of rate. We provide low complexity algorithms for joint routing, scheduling and power control which ensure stability of the queues, certain minimum rates and/or upper bound on the end-to-end, mean delays.
We consider the problem of joint routing, scheduling and power control in a multihop wireless network ensuring Quality of Service (QoS) to different users. The QoS to a user may be the stability of its queues in the network or a minimum rate guarantee. Transmission channels may experience fading. Power is consumed only for transmission of data. We consider the case when the power required is a linear...
We consider the problem of joint routing, scheduling and power control in a multihop wireless network when the nodes have multiple antennas. We focus on exploiting the multiple degrees-of-freedom available at each transmitter and receiver due to multiple antennas. Specifically we use multiple antennas at each node to form multiple access and broadcast links in the network rather than just point to...
We consider the problem of joint routing, scheduling and power control in a multihop wireless network when the nodes have multiple antennas. We present an iterative scheme to compute achievable rates in the interference environment of the network using SINR model. The solution methods have a high computational complexity. Thus we also provide an efficient low complexity sub-optimal solution. We show...
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.