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.
Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of source-destination pairs), optimization of throughput entails design of ??efficient?? routes between the given source-destination pairs, in conjunction with (1) assignment of channels to interfaces and communication links and...
We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all traffic, i.e., to obtain schedules of minimum length. We consider time-varying wireless networks with imperfect side information at the sources. We model the minimum-length scheduling problem through partially observable stochastic...
Built upon a shared wireless medium, wireless network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of service degradation is a crucial aspect in the design of a wireless network. To address this issue, this paper investigates the network restoration solutions via the joint design of traffic rerouting, channel re-assignment, and...
The capacity of wireless channels has been studied extensively by the information theory community over the years. There have been several efforts to extend this theory to multi-hop wireless networks. One approach to estimating the capacity of multihop wireless networks is to determine asymptotically how the capacity scales as the number of nodes in the network increases. In these models, the traffic...
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (time division multiple access) based wireless network. As we deal with multi-hop networks, these selected links represent a routing solution (paths) providing enough capacity to achieve the routers requirements of bandwidth. We present a cross-layer formulation...
The capacity of a wireless network depends on the interference encountered by flows in the network as they traverse their routes from source to destination. Link-transmissions along a route must be scheduled so as to avoid interference with other links, while the interference-pattern that scheduling has to accommodate itself depends on the routes selected for traffic flow. Therefore, for efficient...
In this paper we study the problem of jointly controlling routing and transmission scheduling in spatial TDMA (STDMA)-based multihop wireless networks, with the goal of determining the minimum-length schedule that satisfies a given end-to-end traffic demand. We present a cross-layer formulation of the problem that incorporates multi-path routing at the network layer, while concurrently generating...
In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the determination of minimum-length schedules are based on a collision channel model, in which neighboring transmissions cause destructive interference if and only if they are within the "interference region" of the receiving...
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.