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.
Wireless backhaul has been received much attention as an enabler of future broadband mobile communication systems because it can reduce deployment cost of pico-cells, an essential part of high capacity system. A high performance network in terms of high throughput, low average delay and low packet loss rate, is highly appreciated to sustain the increasing proliferation in multimedia transmissions...
We consider a communication network with a single source node, a single destination node, and N intermediate nodes. We propose efficient techniques to increase the spectral efficiency of cooperative multihop transmission. We analyze the minimum total transmit power needed to achieve a desired end-to-end outage probability for a given rate for several schemes. In the first scheme, incremental relaying,...
In this paper, we consider the problem of transmission delay in terms of finite coding length derived from the random coding bound for different cooperative protocols. Specifically, we first study the impact of cooperative transmission on the routing decision for wireless ad-hoc networks, where a routing optimization problem is formulated to minimize the end-to-end delay that ensures a satisfactory...
We explore radio resource allocation in wireless mesh networks, namely we study how to determine a space- and time-division pattern of transmissions, to deliver traffic to gateway nodes. We highlight link scheduling and routing issues, which we investigate in a cross-layer framework. To this end, an integer linear program is presented, where diverse constraints affect resource allocation; in particular,...
Initial entry during deployment requires tactical networks supporting voice, video, and data requirements to be established quickly given little existing telecommunication infrastructure. Wireless mesh networks using contention-based medium access control (MAC) appear to be an easy off-the-shelf solution, but their performance is lacking for support of such diverse high-bandwidth low-latency requirements...
We establish a tight max-flow min-cut theorem for multicommodity routing in random geometric graphs. We show that, as the number of nodes in the network n tends to infinity, the maximum concurrent flow (MCF) and the minimum cut-capacity scale as Theta(n2r3(n)/k) for a random choice of k ges Theta(n) source-destination pairs, where r(n) is the communication range in the network. We exploit the fact,...
Opportunistic routing (OR) schemes, such as ExOR, have been shown to provide significant throughput gains over traditional best-path routing schemes for wireless networks. Though the performance of OR schemes depend on the bit-rate, they currently use a fixed rate for transmitting packets. While several schemes have been proposed for selecting bit-rate for unicast transmission to a single receiver,...
Wireless mesh network (WMN) has become a popular access network architecture. But because of its multi-hop nature, co-channel interference and contention, the attainable capacity of a wireless node in a WMN is significantly less than the radio capacity. We propose a overlay architecture for a WMN, where a wireless-ring (WRing) is deployed over the regular mesh for carrying wireless mesh traffic only...
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.