34 research outputs found
RECOMAC: a cross-layer cooperative network protocol for wireless ad hoc networks
A novel decentralized cross-layer multi-hop cooperative protocol, namely, Routing Enabled Cooperative Medium Access Control (RECOMAC) is proposed for wireless ad hoc networks. The protocol architecture makes use of cooperative
forwarding methods, in which coded packets are forwarded via opportunistically formed cooperative sets within a region, as RECOMAC spans the physical, medium access control (MAC) and routing layers. Randomized coding is exploited at the physical layer to realize cooperative transmissions, and cooperative forwarding is implemented for routing functionality, which is submerged into the MAC layer, while the overhead for MAC and route set up is minimized. RECOMAC is shown to provide dramatic performance improvements of eight times higher throughput and one tenth of end-to-end delay than that of the conventional architecture in practical wireless mesh networks
Filter-And-Forward Distributed Beamforming in Relay Networks with Frequency Selective Fading
A new approach to distributed cooperative beamforming in relay networks with
frequency selective fading is proposed. It is assumed that all the relay nodes
are equipped with finite impulse response (FIR) filters and use a
filter-and-forward (FF) strategy to compensate for the transmitter-to-relay and
relay-to-destination channels.
Three relevant half-duplex distributed beamforming problems are considered.
The first problem amounts to minimizing the total relay transmitted power
subject to the destination quality-of-service (QoS) constraint. In the second
and third problems, the destination QoS is maximized subject to the total and
individual relay transmitted power constraints, respectively. For the first and
second problems, closed-form solutions are obtained, whereas the third problem
is solved using convex optimization. The latter convex optimization technique
can be also directly extended to the case when the individual and total power
constraints should be jointly taken into account. Simulation results
demonstrate that in the frequency selective fading case, the proposed FF
approach provides substantial performance improvements as compared to the
commonly used amplify-and-forward (AF) relay beamforming strategy.Comment: Submitted to IEEE Trans. on Signal Processing on 8 July 200
Smart Relay Selection Scheme Based on Fuzzy Logic with Optimal Power Allocation and Adaptive Data Rate Assignment
In this paper fuzzy logic-based algorithm with improved process of relay selection is presented which not only allocate optimal power for transmission but also help in choosing adaptive data rate. This algorithm utilizes channel gain, cooperative gain and signal to noise ratio with two cases considered in this paper: In case-I nodes do not have their geographical location information while in case-II nodes are having their geographical location information. From Monte Carlo simulations, it can be observed that both cases improve the selection process along with data rate assignment and power allocation, but case-II is the most reliable with almost zero probability of error at the cost of computational complexity which is 10 times more than case-I
Joint Bandwidth and Power Allocation with Admission Control in Wireless Multi-User Networks With and Without Relaying
Equal allocation of bandwidth and/or power may not be efficient for wireless
multi-user networks with limited bandwidth and power resources. Joint bandwidth
and power allocation strategies for wireless multi-user networks with and
without relaying are proposed in this paper for (i) the maximization of the sum
capacity of all users; (ii) the maximization of the worst user capacity; and
(iii) the minimization of the total power consumption of all users. It is shown
that the proposed allocation problems are convex and, therefore, can be solved
efficiently. Moreover, the admission control based joint bandwidth and power
allocation is considered. A suboptimal greedy search algorithm is developed to
solve the admission control problem efficiently. The conditions under which the
greedy search is optimal are derived and shown to be mild. The performance
improvements offered by the proposed joint bandwidth and power allocation are
demonstrated by simulations. The advantages of the suboptimal greedy search
algorithm for admission control are also shown.Comment: 30 pages, 5 figures, submitted to IEEE Trans. Signal Processing in
June 201