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

showing 10 items of 137 documents

Wireless sensor network coverage problem using modified fireworks algorithm

2016

Wireless sensor networks are emerging technology with increasing number of applications, and consequently an active research area. One of the problems pertinent to wireless sensor networks is the coverage problem with number of definitions, depending on the assumed conditions. In this paper we consider hard optimization area coverage problem with the goal of finding optimal sensor nodes positions that maximize probabilistic coverage of the area of interest. For such type of optimization problem swarm intelligence stochastic metaheuristics have been successfully used. In this paper we propose a modified enhanced fireworks algorithm for wireless sensor network coverage problem and compare it …

Mathematical optimizationOptimization problemComputer scienceDistributed computingParticle swarm optimization020206 networking & telecommunications02 engineering and technologySwarm intelligenceKey distribution in wireless sensor networksComputer Science::Networking and Internet Architecture0202 electrical engineering electronic engineering information engineeringMobile wireless sensor network020201 artificial intelligence & image processingMulti-swarm optimizationMetaheuristicWireless sensor network2016 International Wireless Communications and Mobile Computing Conference (IWCMC)
researchProduct

Bayesian prediction inM/M/1 queues

1994

Simple queues with Poisson input and exponential service times are considered to illustrate how well-suited Bayesian methods are used to handle the common inferential aims that appear when dealing with queue problems. The emphasis will mainly be placed on prediction; in particular, we study the predictive distribution of usual measures of effectiveness in anM/M/1 queue system, such as the number of customers in the queue and in the system, the waiting time in the queue and in the system, the length of an idle period and the length of a busy period.

Mathematical optimizationQueue management systemM/G/k queueM/D/1 queueM/M/1 queueM/D/c queueG/G/1 queueManagement Science and Operations ResearchComputer Science ApplicationsComputer Science::PerformanceComputational Theory and MathematicsStatisticsComputer Science::Networking and Internet ArchitectureM/G/1 queueM/M/c queueMathematicsQueueing Systems
researchProduct

Optimal Paths on Urban Networks Using Travelling Times Prevision

2012

We deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to initial car densities on roads and traffic coefficients at junctions, forecasts the future traffic evolution, giving dynamical weights to a constrained 𝐾 shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure.

Mathematical optimizationTraffic congestion reconstruction with Kerner's three-phase theoryArticle SubjectComputer scienceFluid dynamic model; K shortest path algorithm; Travelling times previsionGeneral EngineeringTraffic simulationK shortest path algorithmMeasure (mathematics)lcsh:QA75.5-76.95Computer Science ApplicationsTraffic congestionFluid dynamic modelModeling and SimulationShortest path problemComputer Science::Networking and Internet Architecturelcsh:Electronic computers. Computer scienceTravelling times previsionDijkstra's algorithmConstrained Shortest Path FirstSimulationTraffic waveModelling and Simulation in Engineering
researchProduct

Joint LMMSE equalizer for HSDPA in full-rate space time transmit diversity schemes

2005

This contribution presents a joint linear minimum mean square error (LMMSE) equalizer for full-rate space-time transmit diversity multi-code schemes based on W-CDMA, featuring two and four transmit antennas. Specifically, high-rate, high load systems are targeted, in order to analyze the high speed downlink packet access (HSDPA) of 3GPP Release 6. We derive an equivalent transmission scheme to equalize the received sufficient statistic in a single stage. To reduce the effects of multipath and multiuser interference, and to provide spatial and frequency diversity at the receiver, an LMMSE equalizer is employed. Computer simulations confirm that the proposed schemes achieve robust performance…

Minimum mean square errorComputer scienceSettore ING-INF/03 - Telecomunicazionileast mean squares methodsComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSEqualizerAdaptive equalizerData_CODINGANDINFORMATIONTHEORYFull RateTransmit diversityTransmission (telecommunications)3G mobile communicationantenna arrayfading channelTelecommunications linkdiversity receptionComputer Science::Networking and Internet ArchitectureElectronic engineeringequaliserFadingMultipath propagationComputer Science::Information TheoryCommunication channelDiversity scheme
researchProduct

Level-Crossing Rate and Average Duration of Fades of the Envelope of Mobile-to-Mobile Fading Channels in Cooperative Networks Under Line-of-Sight Con…

2008

This paper studies the fading behavior of mobile- to-mobile (M2M) fading channels in relay-based cooperative networks under line-of-sight (LOS) conditions. Here, we assume that LOS components exist in both the direct link between the source mobile station (SMS) and the destination mobile station (DMS) as well as in the link via the mobile relay (MR). In such a propagation environment, the fading channel is referred to as the multiple-LOS second-order scattering (MLSS) channel. The fading behavior of MLSS channels is studied by analyzing the level-crossing rate (LCR) and the average duration of fades (ADF) of the received envelope. We have derived analytical expressions for the LCR, ADF, and…

Mobile radioWireless networkbusiness.industryComputer scienceTopologylaw.inventionRelaylawMobile stationComputer Science::Networking and Internet ArchitectureFadingTelecommunicationsbusinessComputer Science::Information TheoryCommunication channelIEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
researchProduct

Mobile radio channel models for present and future wireless communication systems

2008

From the beginnings of mobile communication, there is a high demand for realistic models for mobile fading channels. The reason for the demand is that channel models are essential for the performance evaluation, parameter optimisation, and test of mobile communication systems. Design methods for mobile fading channels are therefore of great importance for system engineers who are involved in the development of present and future mobile communication systems. In this presentation, an overview will be given about several design methodologies commonly used for the design of mobile radio channel models in present and future wireless communication systems. All presented channel models have in co…

Mobile radiobusiness.industryComputer scienceMIMOData_CODINGANDINFORMATIONTHEORYlaw.inventionData modelingChannel state informationRelaylawComputer Science::Networking and Internet ArchitectureElectronic engineeringWirelessFadingMobile telephonybusinessComputer Science::Information TheoryComputer network2008 International Conference on Advanced Technologies for Communications
researchProduct

Information Exchange in Mobile Encounter Network

2007

In this paper we analyze an information exchange method based on information diffusion in mobile encounter networks, a form of mobile peer-to-peer networks. We utilize dual mobility model which provides support for more realistic simulations compared to mobility models based only one method of movement. The distribution of the mobile device encounter intervals are discussed and analyzed via simulation runs. The logistic model is suggested to provide reasonably accurate estimates of the information diffusion process.

Mobility modelDiffusion processComputer scienceDistributed computingComputer Science::Networking and Internet ArchitectureMobile databaseMobile computingMobile searchDiffusion (business)Mobile deviceInformation exchangeInternational Conference on Networking and Services (ICNS '07)
researchProduct

Improving the Performance Metric of Wireless Sensor Networks with Clustering Markov Chain Model and Multilevel Fusion

2013

Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/783543 Open access The paper proposes a performance metric evaluation for a distributed detection wireless sensor network with respect to IEEE 802.15.4 standard. A distributed detection scheme is considered with presence of the fusion node and organized sensors into the clustering and non-clustering networks. Sensors are distributed in clusters uniformly and nonuniformly and network has multilevel fusion centers. Fusion centers act as heads of clusters for decision making based on majority-like received signal strength (RSS) with comparis…

Network architectureArticle SubjectMarkov chainComputer scienceNetwork packetlcsh:MathematicsGeneral MathematicsNode (networking)ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSReal-time computingGeneral EngineeringThroughputlcsh:QA1-939VDP::Mathematics and natural science: 400::Information and communication science: 420::Knowledge based systems: 425lcsh:TA1-2040Channel state informationVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552Computer Science::Networking and Internet Architecturelcsh:Engineering (General). Civil engineering (General)Cluster analysisPerformance metricWireless sensor networkComputer Science::Information TheoryRayleigh fadingMathematical Problems in Engineering
researchProduct

Cooperative communication design with distributed code allocation in a clustered network

2011

A major challenge for cooperative communication in distributed networks is to coordinate relay transmissions without introducing too much overhead. Targeting a clustered network, we propose a novel cooperative communication scheme including channel quality based relay selection and distributed space-time code allocation in this paper. Both analysis and simulations are carried out to investigate the performance of the proposed cooperative scheme, in terms of packet delivery rate, throughput and energy efficiency, under different channel conditions and network density.

Network packetComputer sciencebusiness.industryThroughputEnergy consumptionlaw.inventionCooperative diversityRelaylawComputer Science::Networking and Internet ArchitectureOverhead (computing)FadingbusinessWireless sensor networkRelay channelComputer Science::Information TheoryEfficient energy useCommunication channelComputer network2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications
researchProduct

MUSIC-based modal channel estimation for wideband OFDM-OQAM

2008

Orthogonal frequency division multiplexing based on offset quadrature amplitude modulation (OFDM-OQAM) over wideband frequency selective multipath channels suffers from inter-symbol interference (ISI) and inter-carrier interference (ICI) that degrade its performance. Channel estimation and equalization are needed to combat these interferences. In this paper a novel channel estimator for passband OFDM-OQAM signaling over wideband multipath channels, which is based on multiple signal classification (MUSIC) with the Spatial Smoothing technique is presented. Numerical simulation results are presented in the low number of subcarriers, i.e. wideband, scenario.

OFDM-OQAMSettore ING-INF/03 - TelecomunicazioniOrthogonal frequency-division multiplexingComputer sciencebusiness.industryChannel estimationMUSICComputer Science::OtherIntersymbol interferenceInterference (communication)Computer Science::Networking and Internet ArchitectureElectronic engineeringWidebandTelecommunicationsbusinessPassbandQuadrature amplitude modulationSmoothingComputer Science::Information TheoryCommunication channel2008 1st IFIP Wireless Days
researchProduct