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 the network with two kinds of traffic: inelastic and elastic traffic. The inelastic traffic requires fixed throughput, high priority while the elastic traffic has controllable rate and low priority. Giving the fixed rate of inelastic traffic, how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The Lagrangian Duality...
In order to improve transmission throughput of a multi-hop wireless network, many efforts have been made in recent years to reduce traffic and hence transmission collisions by constructing backbone networks with minimum size. However, many other important issues need to be considered. Instead of simply minimizing the number of backbone nodes or supporting some isolated network features, in this work,...
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g.\ in metro areas. Nodes in these networks frequently employ directional antennas to improve spatial throughput. In such networks, given a source and destination, it is of interest to compute an optimal path and channel assignment on every link in the path such that the path bandwidth is the same as that...
A new approach to joint scheduling, flow control and routing in wireless networks, based on formulation as a convex optimization problem is presented. This approach is novel in that it integrates optimal scheduling and flow control with a modified version of minimum delay routing, resulting in significant performance advantage over alternative approaches. We come up with a distributed algorithm for...
In this paper, we propose the distributed algorithm for joint optimal cross-layer design in multi-radio multi-channel multi-hop networks. The main objective of this work is to joint optimize injected rate and resource allocation in MRMC networks. In this regard, we formulate the optimal design problem as a mathematic programming where the channel load and input traffic are jointly optimized under...
We focus on designing a distributed algorithm for joint optimal congestion control and channel assignment in multi-radio multi-channel Cyber-Physical networks. The design problem is formulated as a network utility maximization subject to some constraints, which is a mixed-integer non-linear programming (MINLP). We propose a near-optimal distributed algorithm to solve this MINLP by the Lagrange dual...
In wireless multi-hop networks, the allocation of resources is influenced by mechanisms for medium access control (MAC), routing, congestion control, and flow control. Designing these mechanisms jointly can increase the capacity of wireless networks. We attempt to introduce routing into an existing framework for the joint design of flow control and MAC on random access multi-hop wireless networks...
This paper extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks in to a dynamic framework where link capacities vary over time. The overall problem is formulated as a long term network utility maximization (NUM) problem (instead of the existing static NUM problem) that accounts for link capacity variation...
A joint routing and scheduling algorithm for multi- hop wireless networks, based on a unified convex optimization framework, is proposed. Our approach is novel in that it integrates optimal scheduling with a modified version of distributed minimum delay routing. Accordingly, the algorithm performs packet routing based on a complete multi-hop view of the network and its traffic conditions. This stands...
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...
Wireless Mesh Networks (WMNs) provide a cost-effective way of deploying a network and providing broadband Internet access. In WMNs a subset of nodes called gateways provide connectivity to the wired infrastructure (typically the Internet). Because traffic volume of WMNs is expected to be high, and due to limited wireless link capacity, gateways are likely to become a potential bottleneck. In this...
Recently, opportunistic routing (OR) has been widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Previous works either provide heuristic solutions without optimality analysis, or assume that unlimited retransmission is available for delivering a data packet. In this paper, we apply OR to a utility-based routing where the successful delivery of a data packet...
Delay tolerant networks (DTN) are wireless networks where disconnections may occur frequently. In order to achieve data delivery in DTNs, researchers have proposed the use of store-carry-and-forward protocols: there, a node may store a message in its buffer and carry it along for long periods of time, until an appropriate forwarding opportunity arises. Multiple message replicas are often propagated...
Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorithms for networks with primary- or secondary-interference constraints have been developed. Due to their distributed operation, these algorithms can achieve only a guaranteed fraction of the maximum possible throughput. It was also recently...
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.