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

showing 10 items of 137 documents

Performance analysis of underlay two-way relay cooperation in cognitive radio networks with energy harvesting

2018

Abstract Cognitive radio and energy harvesting are two important approaches to solve the problem of spectrum scarcity and energy constraint in wireless communications. In this work, we study a two-way relay cooperation scheme in underlay cognitive radio networks (CRNs) with energy harvesting in which two secondary users exchange information via an energy harvesting relay node. Since the relay node collects energy from the received signals and utilizes it to forward the information, the secondary transmission power can be markedly reduced. Therefore the interference of the secondary network to the primary network can be substantially reduced. We derive the outage probability of the secondary…

Computer Networks and CommunicationsComputer sciencebusiness.industryNode (networking)ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS05 social sciences050801 communication & media studies020206 networking & telecommunicationsThroughput02 engineering and technologySpectrum managementlaw.invention0508 media and communicationsCognitive radioRelaylawComputer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineeringWirelessUnderlaybusinessEnergy harvestingComputer Science::Information TheoryComputer networkComputer Networks
researchProduct

On the first- and second-order statistics of the capacity of N*Nakagami-m channels for applications in cooperative networks

2012

This article deals with the derivation and analysis of the statistical properties of the instantaneous channel capacitya of N*Nakagami-m channels, which has been recently introduced as a suitable stochastic model for multihop fading channels. We have derived exact analytical expressions for the probability density function (PDF), cumulative distribution function (CDF), level-crossing rate (LCR), and average duration of fades (ADF) of the instantaneous channel capacity of N*Nakagami-m channels. For large number of hops, we have studied the first-order statistics of the instantaneous channel capacity by assuming that the fading amplitude of the channel can approximately be modeled as a lognor…

Computer Networks and CommunicationsStochastic modellingComputer scienceCumulative distribution functionNakagami distributionComputer Science ApplicationsComputer Science::PerformanceChannel capacitySignal ProcessingLog-normal distributionStatisticsComputer Science::Networking and Internet ArchitectureFadingStatistical physicsComputer Science::Information TheoryCommunication channelEURASIP Journal on Wireless Communications and Networking
researchProduct

Performance of frame transmissions and event-triggered sleeping in duty-cycled WSNs with error-prone wireless links

2018

Abstract Two types of packet transmission schemes are prevalent in duty-cycled wireless sensor networks, i.e., single packet transmission and aggregated packet transmission which integrates multiple packets in one frame. While most existing models are developed based on an error-free channel assumption, this paper evaluates the performance of both transmission schemes under error-prone channel conditions. We develop a four-dimensional discrete-time Markov chain model to investigate the impact of channel impairments on the performance of frame transmissions. Together with tracking the number of packets in the queue, number of retransmissions and number of active nodes, the fourth dimension o…

Computer Networks and Communicationsbusiness.industryNetwork packetComputer scienceComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS010401 analytical chemistryFrame (networking)020206 networking & telecommunicationsThroughput02 engineering and technologyEnergy consumption01 natural sciences0104 chemical sciencesTransmission (telecommunications)Packet lossComputer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineeringWirelessNetwork performancebusinessQueueWireless sensor networkComputer networkEfficient energy useCommunication channelComputer Networks
researchProduct

Non-convex Optimization for Resource Allocation in Wireless Device-to-Device Communications

2020

Device-to-device (D2D) communication is considered one of the key frameworks to provide suitable solutions for the exponentially increasing data tra c in mobile telecommunications. In this PhD Thesis, we focus on the resource allocation for underlay D2D communications which often results in a non-convex optimization problem that is computationally demanding. We have also reviewed many of the works on D2D underlay communications and identi ed some of the limitations that were not handled previously, which has motivated our works in this Thesis. Our rst works focus on the joint power allocation and channel assignment problem in the D2D underlay communication scenario for a unicast single-inpu…

Computer Science::Computer Science and Game TheoryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSComputer Science::MultimediaComputer Science::Networking and Internet ArchitectureVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550Computer Science::Information Theory
researchProduct

Domain-Knowledge Optimized Simulated Annealing for Network-on-Chip Application Mapping

2013

Network-on-Chip architectures are scalable on-chip interconnection networks. They replace the inefficient shared buses and are suitable for multicore and manycore systems. This paper presents an Optimized Simulated Annealing (OSA) algorithm for the Network-on-Chip application mapping problem. With OSA, the cores are implicitly and dynamically clustered using knowledge about communication demands. We show that OSA is a more feasible Simulated Annealing approach to NoC application mapping by comparing it with a general Simulated Annealing algorithm and a Branch and Bound algorithm, too. Using real applications we show that OSA is significantly faster than a general Simulated Annealing, withou…

Computer Science::Hardware ArchitectureInterconnectionMulti-core processorNetwork on a chipBranch and boundComputer scienceScalabilitySimulated annealingComputer Science::Networking and Internet ArchitectureParallel computingAdaptive simulated annealingCluster analysis
researchProduct

Application of information fusion to unreliable wireless sensor networks

2012

Masteroppgave i informasjons- og kommunikasjonsteknologi IKT590 2012 – Universitetet i Agder, Grimstad Thesis is appropriated analyze to performance metric evaluation for decentralized distributed detection sensor network strategy. Performance metric investigated a typical wireless sensor network with respect to IEEE 802.15.4 standard. Distributed detection is considered with present of the fusion node as long as clustering and non-clustering sensor network. The clusters are organized uniform and non-uniform topology sensor networks with tree-based topologies and hierarchical multi-level fusion centers. Fusion centers are acting as head of cluster for decision making based on majority-like …

Computer Science::Networking and Internet Architecture
researchProduct

Automatic construction of test sets: Theoretical approach

2005

We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…

Computer Science::PerformanceComputer scienceProperty (programming)Simple (abstract algebra)Completeness (order theory)Test setComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSComputer Science::Networking and Internet ArchitectureComputer Science::Programming LanguagesInternal variableArithmeticHardware_LOGICDESIGNTest (assessment)
researchProduct

Spectrogram Analysis of Multipath Fading Channels under Variations of the Mobile Speed

2016

When modelling, analysing, and simulating mobile radio channels, it is generally assumed that the speed of the mobile station (MS) is constant. In practice, however, the mobile speed varies with time. Mobile speed variations result in nonwide- sense stationary multipath fading channels, which can be modelled by a sum-of-chirps (SOCh) processes. In this paper, we analyse the local Doppler power spectral density (PSD) of SOCh processes by using the concept of the spectrogram. The spectrogram provides an estimate of the local Doppler PSD and gives insight into how the Doppler PSD changes over time if the MS increases or decreases its speed. A closed-form solution is presented for the spectrogr…

Computer science010401 analytical chemistrySpectral density020206 networking & telecommunications02 engineering and technology01 natural sciences0104 chemical sciencesTime–frequency analysissymbols.namesakeMobile stationComputer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineeringsymbolsElectronic engineeringSpectrogramDoppler effectRandom variableMultipath propagationCommunication channel2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)
researchProduct

Geometrical Modeling of Non-Stationary Polarimetric Vehicular Radio Channels

2019

This paper presents a geometry-based statistical model (GBSM) of polarimetric wideband multipath radio channels for vehicle-to-vehicle (V2V) communications. The proposed model captures the effects of depolarization caused by multipath propagation, and it also accounts for the non-stationary characteristics of wideband V2V channels. This is a novel feature, because the existing polarimetric channel models are built on the assumption that the channel is a wide-sense stationary random process. In the modeling framework described in this paper, the channel depolarization function is given by a linear transformation in the form of a simple rotation matrix. This linear transformation is transpare…

Computer scienceComputationPolarimetryStatistical modelComputingMilieux_LEGALASPECTSOFCOMPUTINGRotation matrixTopologyLinear mapComputer Science::Networking and Internet ArchitectureWidebandVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550Multipath propagationComputer Science::Information TheoryCommunication channel
researchProduct

Outage Probability Analysis of User-Centric SBS-Based HCNets Under Hybrid Rician/Rayleigh Fading

2020

To model dense user equipment (UE) distribution in heterogeneous cellular networks (HCNets), the Poisson cluster process (PCP) has emerged as a promising tool. In user-centric HCNets where UEs are distributed according to a PCP around a small base station (SBS), the network performance has been commonly studied in literature under a Rayleigh fading environment assumption. However, such an assumption may not hold in user-centric HCNets given the possible existence of a strong line-of-sight (LOS) link between UEs and BSs due to a relatively short transmission distance. This letter analyzes the performance of user-centric SBS based HCNets by considering that the desired LOS link experiences Ri…

Computer scienceComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsData_CODINGANDINFORMATIONTHEORY02 engineering and technologyComputer Science ApplicationsBase stationTransmission (telecommunications)Modeling and SimulationRician fadingComputer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineeringCellular networkNetwork performanceElectrical and Electronic EngineeringAlgorithmComputer Science::Information TheoryRayleigh fadingIEEE Communications Letters
researchProduct