Search results for "Computer Science::Networking and Internet Architecture"

showing 7 items of 137 documents

Cooperative Medium Access Control in Wireless Networks: The Two-Hop Case

2009

Cooperative communication has been recently proposed as a powerful means to improve network performance in wireless networks. However, most existing work focuses solely on one-hop source-destination cooperation. In this paper, we propose a novel cooperative MAC mechanism that is specially designed for two-hop cooperation communications where the source node and the destination node cannot hear each other directly. In this case, cooperative communication is operated in a two-hop manner and transmit-diversity is achieved by the reception of the same data packet forwarded through multiple relays towards a single destination. The proposed scheme employs an efficient relay selection algorithm to…

business.industryComputer scienceWireless networkNetwork packetDistributed computingComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSAccess controlCooperative diversitylaw.inventionTransmit diversityRelaylawComputer Science::Networking and Internet ArchitectureNetwork performancebusinessSelection algorithmComputer Science::Information TheoryComputer network2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
researchProduct

An optimal energy efficient cooperative retransmission MAC scheme in wireless networks

2011

While the benefits of cooperative diversity have been well studied in the literature, cooperative MAC protocol design has also attracted much attention recently. In the single-relay Cooperative Automatic Repeat reQuest (C-ARQ) protocol, the best relay node is selected in a distributed manner by relays using different backoff time before packet retransmission. However, this relay selection scheme does not work efficiently in a dense network scenario, due to possible high collision probability among different contending relays. In this paper, we propose an optimized relay selection scheme to maximize system energy efficiency by reducing collision probability. The energy efficiency performance…

business.industryComputer scienceWireless networkNetwork packetRetransmissionDistributed computingAutomatic repeat requestNode (networking)ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSData_CODINGANDINFORMATIONTHEORYlaw.inventionCooperative diversityRelaylawComputer Science::Networking and Internet ArchitecturebusinessRelay channelComputer Science::Information TheoryComputer network2011 2nd International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology (Wireless VITAE)
researchProduct

A study on the statistical properties of double hoyt fading channels

2009

This paper deals with a study on the statistical properties of narrowband amplify-and-forward relay fading channels for Hoyt multipath propagation environments. We consider the basic radio link topology, where only one fixed relay station is used for the amplification. In this case, the envelope of the signal received over the overall multipath channel is modeled by the so-called double Hoyt fading process. Considering this multipath propagation channel model, analytical expressions for the first and second order statistics are provided. Specifically, the mean value, variance, probability density function (PDF), level-crossing rate (LCR), and average duration of fades (ADF) of double Hoyt p…

business.industryComputer sciencelaw.inventionFading distributionNarrowbandRelaylawComputer Science::Networking and Internet ArchitectureSector modelFadingStatistical physicsbusinessMultipath propagationComputer Science::Information TheoryComputer networkRayleigh fadingCommunication channel2009 6th International Symposium on Wireless Communication Systems
researchProduct

Stochastic Graph Filtering Under Asymmetric Links in Wireless Sensor Networks

2018

Wireless sensor networks (WSN s) are often characterized by random and asymmetric packet losses due to the wireless medium, leading to network topologies that can be modeled as random, time-varying and directed graphs. Most of existing works related to graph filtering in the context of WSNs assume that the probability of delivering an information from one node to a neighbor node is the same as in the reverse direction. This assumption is not realistic due to the typical link asymmetry in WSNs caused by interferences and background noise. In this work, we analyze the problem of applying stochastic graph filtering over random time-varying asymmetric network topologies. We show that it is poss…

business.industryStochastic processComputer scienceNetwork packet020206 networking & telecommunications02 engineering and technologyDirected graphNetwork topologyTopologyBackground noiseComputer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)Wireless020201 artificial intelligence & image processingbusinessWireless sensor network2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
researchProduct

A Multi-Relay Cooperative Automatic Repeat Request Protocol in Wireless Networks

2010

This paper proposes a Multi-relay Cooperative Automatic Repeat ReQuest protocol (MC-ARQ) for IEEE 802.11 based wireless networks. The proposed distributed relay selection scheme not only selects the best relays but also solves the collision problem among multiple contending relays, by sorting the relays in the network according to their instantaneous channel quality with the destination node. No prior information or explicit signaling among relay nodes is required. Both analytical and simulation results show that significant benefits can be achieved with the MC-ARQ protocol, compared with both the recently proposed PRCSMA scheme and the original non-cooperative DCF scheme.

business.industrycomputer.internet_protocolComputer scienceWireless networkAutomatic repeat requestDistributed computingNode (networking)ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSThroughputData_CODINGANDINFORMATIONTHEORYlaw.inventionRelaylawWireless lanComputer Science::Networking and Internet ArchitectureWireless Application ProtocolbusinesscomputerComputer Science::Information TheoryComputer networkCommunication channel2010 IEEE International Conference on Communications
researchProduct

Performance of an asymmetric and asynchronous decode-and-forward FBMC relay system

2014

End-to-end link performance of an asymmetric and asynchronous dual-hop decode-and-forward (DF) relay system built up using a causal multirate filter bank multicarrier (FBMC) technique operated under Rayleigh fading is presented. Three main performance measures namely bit error rate (BER), outage probability and channel capacity are used for this evaluation and approximate closed-form expressions for them are also made available. FBMC setup is modeled in exact form without any approximations while customizing to one of the most efficient subcarrier filter. Simulations are carried out in quasi-static multipath fading channels under symmetric, asymmetric, synchronous and asynchronous condition…

ta213Computer sciencebusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSData_CODINGANDINFORMATIONTHEORYSubcarrierlaw.inventionChannel capacityAsynchronous communicationRelaylawComputer Science::Networking and Internet ArchitectureElectronic engineeringBit error ratebusinessRelay channelMultipath propagationComputer Science::Information TheoryCommunication channelRayleigh fadingComputer network
researchProduct

Sparsity-aware multiple relay selection in large multi-hop decode-and-forward relay networks

2016

In this paper, we propose and investigate two novel techniques to perform multiple relay selection in large multi-hop decode-and-forward relay networks. The two proposed techniques exploit sparse signal recovery theory to select multiple relays using the orthogonal matching pursuit algorithm and outperform state-of-the-art techniques in terms of outage probability and computation complexity. To reduce the amount of collected channel state information (CSI), we propose a limited-feedback scheme where only a limited number of relays feedback their CSI. Furthermore, a detailed performance-complexity tradeoff investigation is conducted for the different studied techniques and verified by Monte …

wireless networksTheoretical computer scienceComputer scienceMultiple relay selectionsComplex networks050801 communication & media studiesfeedback02 engineering and technologyData_CODINGANDINFORMATIONTHEORYchannelslaw.inventionHop (networking)diversityCommunication channels (information theory)[SPI]Engineering Sciences [physics]0508 media and communicationsMSERelaylaw0202 electrical engineering electronic engineering information engineeringComputer Science::Networking and Internet Architecture[ SPI ] Engineering Sciences [physics]Computer Science::Information TheoryLarge DF relay networksLink Access Procedure for Frame Relaycooperative networks05 social sciencesComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSRelay control systems020206 networking & telecommunicationsChannel state informationChannel state informationRelay selectionOutage probabilityAlgorithmRelay channel
researchProduct