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.
Guarding against channel errors in wireless networks has been a challenging research problem, specially when transmitting time-constrained contents, like streaming video or image. Source diversity in the form of Multiple Description Coding (MDC) has been studied for guarding against wireless channel errors. In MDC, an image is broken into several equally important descriptions which can be sent over...
Opportunistic Routing (OR) has recently been proposed to improve the efficiency of unicast in multi-hop wireless networks. OR exploits the broadcast nature of wireless transmission medium and opportunistically selects a relay path to deliver a packet to its receiver. To adopt OR in wireless multicast, the main challenge is to efficiently share opportunistic relay paths between multiple receivers....
In multihop wireless networks, end-to-end throughput is often hard to predict and is even harder to optimize due to the effect of interference. To date there is no precise result other than asymptotic bounds for this question: if there is no routing information given, what is the maximum throughput of a network using uncoordinated transmission such as IEEE 802.11 MAC? This paper attempts to address...
An analytical model is introduced for the study of the interplay between medium access control (MAC) and packet forwarding disciplines used in multi-hop wireless networks. The model incorporates the likelihood with which nodes access the channel, which is determined by the MAC protocol, and the creation of active portions of the topology, which is given by the packet forwarding discipline. The model...
Wireless internet has become popular in recent years due to the tremendous growth in the number of mobile computing devices and high demand for continuous network connectivity regardless of physical locations. In this paper, we investigate the effects of routing protocols on the performance of Transmission Control Protocol (TCP) variants in multi-hop wireless networks. Through simulations we study...
This paper develops an upper bound on the end-to-end transmission capacity of multi-hop wireless networks, in which all nodes are randomly distributed. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form bound on the outage probability is derived in terms of the number of potential paths. This in turn gives an upper bound on...
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...
The trend of adopting more and more wireless mobile computers and smartphones has changed our way of living. Those devices heavily rely on the underlying wireless network systems to provide adequate communication support. As streaming audio and video becomes norm, the requests for stringent maximum end-to-end latency and minimum bandwidth make the networking process more difficult. Quality of Service...
Most of the existing routing schemes for opportunistic forwarding either rely on a priori known topology information, or provide explicit protocol information in the data packet header. In this paper, we present a routing protocol for opportunistic forwarding that dynamically create candidate priority forwarding lists without the need for any explicit control information in data packet headers, and...
Network coding is known as a promising approach to improve wireless network throughput. However, it is only applicable when different flows are routed through a certain coding structure. One of the fundamental issues is to accurately identify the coding structures and optimally utilize the coding nodes. In this paper, we formally establish general coding conditions to identify multiple coding nodes...
Fairness and system throughput, influenced by wireless interference, are major objectives of resource allocation in wireless networks. Whereas traditionally max-min fairness protocols have been developed for wired networks (where interference is not a factor for network performance), in this paper we investigate the problem of flow routing and fair bandwidth allocation under the constraints of the...
Unlike traditional unicast routing where a transmitting node needs to specify its single next-hop forwarder in a multi-hop wireless networks in an a priori manner, Opportunistic Routing allows multiple potential next-hop forwarders to be selected. Any selected node may forwards the packet towards the destination if it can decode the packet correctly. Existing opportunistic routing protocols tend to...
A key issue impacting wireless network performance is network information. In wireless networks, a significant amount of bandwidth and power resource is consumed to disseminate and maintain routing information. Previous work has presented different methods to broadcast and store such routing information so as to reduce the overhead. However, the amount of information required for a routing algorithm...
In this paper we describe a statistical analysis of a typical routing metric, Expected Transmission Time (ETT), used for path evaluation in multi-hop wireless networks. The need of statistics description is linked with the presence of network parameters uncertainty due to both a fading channel and ambiguity of nodes position. This analysis led us to define a statistical estimator, which allows controlling...
Recently, opportunistic routing has been proposed to take good advantage of broadcast nature and spatial diversity to achieve high throughput, despite highly unpredictable and lossy wireless links in multi-hop wireless networks. Most previous works provide heuristic solutions to select as many candidates, and don't take inter-candidate delivery probability into account, which might suffer acknowledgement...
We investigate the risk associated with multihop wireless communications due to eavesdropping. When the same message traverses cross a multihop wireless network, potential security leaks may occur because of intelligent and collaborative eavesdroppers even if all individual links from source to destination have signal leakage below a security threshold. We termed this phenomenon ??cumulative security...
This paper focuses on routing over multi-hop and multi-technology wireless networks, referred to here as heterogeneous routing. We consider a set of mobile users interested in communicating with several access points (APs). Multi-hop routing, possibly across different transmission technologies, is exploited to extend the coverage for those users that are not within the transmission range of any of...
Existing power efficient geographic routing algorithms have been shown to be able to reduce power consumption and hence prolong the lifetime of multi-hop wireless networks. However, in practical deployment scenarios where location errors inevitably exist, these algorithms are vulnerable to a substantial performance degradation in terms of energy consumption. Since location errors always exist no matter...
This paper presents the fundaments of a new source-based path selection strategy for multi-hop wireless networks (MHWNs) applying a Multiple Attribute Decision Making (MADM) algorithm. The purpose of this on-going work is to investigate new methods for improving the overall performance of such networks by exploiting paths traditionally disregarded by routing protocols. The main idea is to avoid unnecessary...
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...
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.