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.
End-to-end delay is an important QoS metric in sensor networks as well as any application that involves transferring of small-sized files. In this paper, we address how to minimize the end-to-end delay in a multihop wireless network. End-to-end delay is defined as the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the routing...
We consider the problem of energy-efficient transmission in multi-flow multihop cooperative wireless networks. Although the performance gains of cooperative approaches are well known, the combinatorial nature of these schemes makes it difficult to design efficient polynomial-time algorithms for joint routing, scheduling and power control. This becomes more so when there is more than one flow in the...
Compressive sensing (CS) provides a new paradigm for efficient data gathering in wireless sensor networks (WSNs). The theory of CS allows to reconstruct all sensor data of the network, while only collecting a small number of measurements at a sink. In this paper, we consider a scenario where a sink collects spatially correlated sensor data from sensor nodes randomly deployed in a region. We investigate...
Delivery of high-quality streaming services over multi-hop wireless mesh networks (WMNs) is a challenging research problem because of quality fluctuation and interference of wireless links in WMNs, as well as strict throughput, delay, and reliability requirements of streaming applications. In this paper, we propose a Network Assisted Peer-to-Peer (NAP2P) system for file-based media streaming services...
In the paper, we consider the end-to-end routing and link scheduling problem for multi-hop wireless sensor networks. The efficient link scheduler under our consideration is intended to assign time slots to different users so as to minimize channel usage subject to constraints on data rate, delay bound, and delay bound violation probability. We also present a coupled robust multi-path routing structure...
Mobile Wireless Mesh Networks (MWMNs) not only can provide high-bandwidth services for a large number of users, but also offers a good solution to the last-mile problems. However, the abundant net flow resulted from the great number of users may lead to the network traffic jam. To solve this problem, we proposed an Adaptive Situation-Aware (ASA) routing metric. We also designed a load balance scheme...
Cognitive radio ad hoc networks (CRAHNs) solve the problem of spectrum utilization when the licensed or primary user (PU) activity changes over time. This affects not only the spectrum availability, but also the network topology, making the analysis of scaling laws very challenging. Currently, the effect of PU activity on the network scaling laws has not been theoretically analyzed, to the best of...
We consider anycast routing to improve the quality of communications in multi-gateway wireless mesh networks. A centralized gateway and route selection scheme is proposed that tries to maximize the end-to-end probability of success and minimize the end-to-end delay of all active traffic flows in the network. The proposed scheme employs a novel route quality metric that is based on the effects of interference...
This paper addresses the problem of discovering least interfering paths in the context of multipath routing in multihop wireless networks using the SINR based interference model. Whereas traditionally interference has been quantified using the protocol model, we propose a disjoint multipath interference aware routing algorithm, known as DMPR:SINR, using a weighted SINR conflict graph to quantify interference...
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach called backpressure routing, in which routing and forwarding decisions are made on a per-packet basis. Although there is a considerable theoretical literature on backpressure routing, it has not been implemented on practical systems...
WCDL (Weapon Cooperation Data Link) adopts hierarchical methodology generally, as the nodes joining are numerous and moving rapidly. In the battlefield, the interference often occurs, and it will affect the delay seriously, which is an important parameter of the WCDL network. Moreover, the common approaches that care of the delay of next hop only can't always achieve the minim end-to-end delay. In...
Network flow models serve as a popular mathematical framework for the analysis and optimization of multi-hop wireless networks. They also serve to provide the understanding necessary to derive effective distributed protocols. However, the high computational complexity of realistic models restrict the translation of theoretical insights into distributed protocols. In this paper, we consider an NP-hard,...
In this paper, we address the problem of packet routing for interference avoidance in infrastructure mesh networks. We propose AMIRA, an interference-aware routing protocol designed to improve load balancing by avoiding inter and intra flow interference in a typical mesh backbone network. AMIRA is based on the framework of ant colony optimization (ACO) which is a meta-heuristic approach for stochastically...
This paper studies how to select a path with the minimum cost in terms of expected end-to-end delay (EED) in a multi-radio wireless mesh network. Different from the previous efforts, the new EED metric takes the queuing delay into account, since the end-to-end delay consists of not only the transmission delay over the wireless links but also the queuing delay in the buffer. In addition to minimizing...
The routing problem in wireless mesh networks is concerned with finding "good" source-destination paths. It generally faces multiple objectives to be optimized, such as i) path capacity, which accounts for the bits per second that can be sent along the path connecting the source to the destination node, and ii) end-to-end delay. This paper presents the mesh routing algorithm (MRA), a dynamic...
The combination of multi-radio nodes in conjunction with a suitably structured mesh architecture has the potential to solve some of the key limitations of present day mesh networks. We propose and evaluate two practical and self-stabilizing channel assignment algorithms for multi-channel dual-radio mesh backhauls. The objective is to find a channel assignment that maximizes network capacity through...
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.