3,208 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
A cross layer multi hop network architecture for wireless Ad Hoc networks
In this paper, a novel decentralized cross-layer multi-hop cooperative network architecture is presented. Our architecture involves the design of a simple yet efficient cooperative flooding scheme,two decentralized opportunistic cooperative forwarding mechanisms as well as the design of Routing
Enabled Cooperative Medium Access Control (RECOMAC) protocol that spans and incorporates the physical, medium access control (MAC) and routing layers for improving the performance of multihop communication. The proposed architecture exploits randomized coding at the physical layer to realize cooperative diversity. Randomized coding alleviates relay selection and actuation mechanisms,and therefore reduces the coordination among the relays. The coded packets are forwarded via opportunistically formed cooperative sets within a region, without communication among the relays and without establishing a prior route. In our architecture, routing layer functionality is submerged into the
MAC layer to provide seamless cooperative communication while the messaging overhead to set up routes, select and actuate relays is minimized. RECOMAC is shown to provide dramatic performance improvements, such as eight times higher throughput and ten times lower end-to-end delay as well as reduced overhead, as compared to networks based on well-known IEEE 802.11 and Ad hoc On Demand
Distance Vector (AODV) protocols
Beacon-Assisted Spectrum Access with Cooperative Cognitive Transmitter and Receiver
Spectrum access is an important function of cognitive radios for detecting
and utilizing spectrum holes without interfering with the legacy systems. In
this paper we propose novel cooperative communication models and show how
deploying such cooperations between a pair of secondary transmitter and
receiver assists them in identifying spectrum opportunities more reliably.
These cooperations are facilitated by dynamically and opportunistically
assigning one of the secondary users as a relay to assist the other one which
results in more efficient spectrum hole detection. Also, we investigate the
impact of erroneous detection of spectrum holes and thereof missing
communication opportunities on the capacity of the secondary channel. The
capacity of the secondary users with interference-avoiding spectrum access is
affected by 1) how effectively the availability of vacant spectrum is sensed by
the secondary transmitter-receiver pair, and 2) how correlated are the
perceptions of the secondary transmitter-receiver pair about network spectral
activity. We show that both factors are improved by using the proposed
cooperative protocols. One of the proposed protocols requires explicit
information exchange in the network. Such information exchange in practice is
prone to wireless channel errors (i.e., is imperfect) and costs bandwidth loss.
We analyze the effects of such imperfect information exchange on the capacity
as well as the effect of bandwidth cost on the achievable throughput. The
protocols are also extended to multiuser secondary networks.Comment: 36 pages, 6 figures, To appear in IEEE Transaction on Mobile
Computin
A Simple Cooperative Diversity Method Based on Network Path Selection
Cooperative diversity has been recently proposed as a way to form virtual
antenna arrays that provide dramatic gains in slow fading wireless
environments. However most of the proposed solutions require distributed
space-time coding algorithms, the careful design of which is left for future
investigation if there is more than one cooperative relay. We propose a novel
scheme, that alleviates these problems and provides diversity gains on the
order of the number of relays in the network. Our scheme first selects the best
relay from a set of M available relays and then uses this best relay for
cooperation between the source and the destination. We develop and analyze a
distributed method to select the best relay that requires no topology
information and is based on local measurements of the instantaneous channel
conditions. This method also requires no explicit communication among the
relays. The success (or failure) to select the best available path depends on
the statistics of the wireless channel, and a methodology to evaluate
performance for any kind of wireless channel statistics, is provided.
Information theoretic analysis of outage probability shows that our scheme
achieves the same diversity-multiplexing tradeoff as achieved by more complex
protocols, where coordination and distributed space-time coding for M nodes is
required, such as those proposed in [7]. The simplicity of the technique,
allows for immediate implementation in existing radio hardware and its adoption
could provide for improved flexibility, reliability and efficiency in future 4G
wireless systems.Comment: To appear, IEEE JSAC, special issue on 4
Outage rates and outage durations of opportunistic relaying systems
Opportunistic relaying is a simple yet efficient cooperation scheme that
achieves full diversity and preserves the spectral efficiency among the
spatially distributed stations. However, the stations' mobility causes temporal
correlation of the system's capacity outage events, which gives rise to its
important second-order outage statistical parameters, such as the average
outage rate (AOR) and the average outage duration (AOD). This letter presents
exact analytical expressions for the AOR and the AOD of an opportunistic
relaying system, which employs a mobile source and a mobile destination
(without a direct path), and an arbitrary number of (fixed-gain
amplify-and-forward or decode-and-forward) mobile relays in Rayleigh fading
environment
Recommended from our members
Cooperative smartphone relay selection based on fair power utilization for network coverage extension
This paper presents a relay selection algorithm based on fair battery power utilization for extending mobile network coverage and capacity by using a cooperative communication strategy where mobile devices can be utilized as relays. Cooperation improves the network performance for mobile terminals, either by providing access to out-of-range devices or by facilitating multi-path network access to connected devices. In this work, we assume that all mobile devices can benefit from using other mobile devices as relays and investigate the fairness of relay selection algorithms. We point out that signal strength based relay selection inevitably leads to unfair relay selection and devise a new algorithm that is based on fair utilization of power resources on mobile devices. We call this algorithm Credit based Fair Relay Selection (CF-RS) and in this paper show through simulation that the algorithm results in fair battery power utilization, while providing similar data rates compared with traditional approaches. We then extend the solution to demonstrate that adding incentives for relay operation adds clear value for mobile devices in the case they require relay service. Typically, mobile devices represent self-interested users who are reluctant to cooperate with other network users, mainly due to the cost in terms of power and network capacity. In this paper, we present an incentive based solution which provides clear mutual benefit for mobile devices and demonstrate this benefit in the simulation of symmetric and asymmetric network topologies. The CF-RS algorithm achieves the same performance in terms of achievable data rate, Jain's fairness index and utility of end devices in both symmetric and asymmetric network configurations
A survey of self organisation in future cellular networks
This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks
- …