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.
The need for communication is highest in disaster scenarios when the infrastructure is also adversely affected. A recent protocol for ad hoc communication, the BATMAN protocol, is dependent on minimal infrastructure, in the form of mesh nodes that are used as access points, or nodes acting as an intermediary in a multi-hop connection. While BATMAN works well in a scenario in which there is a multihop...
In this paper, we investigate the cost-constrained incremental network planning problem in multi-hop wireless networks. Given an existing wireless network, we study the problem of how to add new wireless links to improve the network performance under the deployment cost constraint. After formulating the problem as COst-constrained Incremental Network ($COIN$) problem, we introduce a performance metric,...
The problem of joint routing and power allocation optimization is addressed for decode-and-forward (DF) and amplify-and-forward (AF) multihop TDMA wireless networks. A distributed solution is proposed for power-optimized routing with desired end-to-end capacity constraint based on the local instantaneous channel state information measurement at the nodes of the network. The proposed distributed routing...
In this paper, we develop a cross-layer algorithm to minimize energy consumption in multi-hop wireless networks with finite buffers. Our algorithm guarantees a flow-based minimum data rate and a deterministic buffer size upper-bound for individual flows at network nodes. The algorithm jointly integrates congestion control, power allocation, routing and link rate scheduling. In addition, the algorithm...
Service-oriented vehicular networks face challenge to deliver delay-sensitive data such as video packets. Most research on video streaming consider network-centric quality of service (QoS) metrics rather than the user perceived quality. In this paper, we propose an application-centric routing framework for real-time video transmission over urban multi-hop vehicular ad-hoc network (VANET) scenarios...
This paper investigates the optimal power routing problem in relay-based cooperative networks, where the relays are arbitrarily positioned. We generalize the standard shortest path routing algorithm (GSPRA) to find an minimum-power distributed MIMO multi-hop route from a source to a destination while satisfying a given e2e outage probability demand. The task of the proposed approach includes how to...
In this paper, we introduce a distributed dynamic routing algorithm for secondary users (SUs) to minimize their interference with the primary users (PUs) in multi-hop cognitive radio (CR) networks. We use the medial axis with a relaxation factor as a reference path which is contingent on the states of the PUs. Along the axis, we construct a hierarchical structure for multiple sources to reach cognitive...
Employing channel state information at the network layer, an effective routing metric is obtained that minimizes the end-to-end outage probability in amplify-and-forward multihop wireless networks. A disadvantage of the routing metric obtained is that it cannot be optimized in distributed manner, i.e., it does not converge onto optimal routes. The disadvantage cannot be remedied by exhaustive search...
We propose a new cross-layer approach to mitigate interference in multihop networks. Precisely, we cancel all adjacent node interference in a multihop path by MIMO two-way relay scheme and jointly optimize the routing and power allocation to mitigate the interference from far nodes. We model and efficiently solve this optimization problem using a geometric programming framework. Our simulation results...
IEEE 802.15.4 multi-hop wireless networks are an important communication infrastructure for many applications, including industrial control, home automation, and smart grids. Existing analysis of the IEEE 802.15.4 medium access control (MAC) protocol are often based on assumptions of homogeneous traffic and ideal carrier sensing, which are far from the reality when predicting performance for multi-hop...
We consider the energy-efficient network resource allocation that minimizes a cost function of average user powers for multi-hop wireless networks. A class of fair cost functions is derived to balance the tradeoff between efficiency and fairness in energy-efficient designs. Based on such cost functions, optimal routing, scheduling and power control schemes are developed. Relying on stochastic optimization...
Due to the limited energy supplies of nodes, in many applications like wireless sensor networks, energy-efficiency is crucial for extending the networks lifetime. We study the routing problem for multihop wireless ad hoc networks based on cooperative transmission. The source node wants to transmit messages to a single destination. Other nodes in the network may operate as relay nodes. In this paper,...
Efficient routing is a fundamental issue in multi-hop wireless ad hoc networks. In this paper, we study the limitation of traditional routing structure in multi-hop wireless ad hoc networks due to (a) the layered structure of a wireless protocol stack and (b) the lack of coordination between medium access control (MAC) and routing protocols. These limitations result in long processing delays in a...
Efficient routing protocols for equal power and optimal power allocation in a multi-hop decode-and-forward network in fading are proposed. The end-to-end outage probability from source to destination is used as the optimization criterion. The problem of finding the optimal route is investigated when either the mean channel state information (CSI) or the instantaneous CSI for all the links of the network...
In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by proactively performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing twohop lookahead. However, the recent study might cause heavy message exchange overhead and...
It has been shown that cooperative communications (CC) have the potential to significantly increase the capacity of wireless networks. However, most of the existing results are limited to single-hop wireless networks. To illustrate the benefits of CC in multi-hop wireless networks, we solve a joint optimization problem of relay node assignment and flow routing for concurrent sessions. We study this...
Two major factors that limit the throughput in multi-hop wireless networks are the unreliability of wireless transmissions and co-channel interference. One promising technique that combats lossy wireless transmissions is opportunistic routing (OR). OR involves multiple forwarding candidates to relay packets by taking advantage of the broadcast nature and spacial diversity of the wireless medium. Furthermore,...
This paper considers the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links with stochastic reliability while ensuring bounded expected delay. Each packet transmission can be overheard by a random subset of receiver nodes among which the next relay is selected opportunistically. The main challenge in the design of minimum-delay routing...
Spontaneous multi-hop wireless networks provide a new environment for sharing content among communities of end users. Nodes interested in some content can share it on a multi-hop basis by relying on the collaboration of intermediate nodes. Organizing the communication overlay in such an environment is then a challenging task especially given the mobility of the nodes, the interference, and the scarcity...
In this paper, a greedy sub-channel redistribution routing scheme (GSRRS) is proposed for multi-hop wireless OFDMA networks. In GSRRS, between any two neighboring nodes, different sub-channels are routed over different paths including the direct one-hop path and the two-hop path with one intermediate node. Compared to the traditional routing scheme where all the sub-channels route over the same path,...
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.