Search results for "INTERNET"

showing 10 items of 2589 documents

Low-Power Wide-Area Networks for Sustainable IoT

2019

Low-power wide-area (LPWA) networks are attracting extensive attention because of their abilities to offer low-cost and massive connectivity to Internet of Things (IoT) devices distributed over wide geographical areas. This article provides a brief overview on the existing LPWA technologies and useful insights to aid the large-scale deployment of LPWA networks. Particularly, we first review the currently competing candidates of LPWA networks, such as narrowband IoT (NB-IoT) and long range (LoRa), in terms of technical fundamentals and large-scale deployment potential. Then we present two implementation examples on LPWA networks. By analyzing the field-test results, we identify several chall…

FOS: Computer and information sciencesComputer scienceComputer Science - Information Theory0805 Distributed Computing02 engineering and technologylaw.inventionComputer Science - Networking and Internet ArchitectureBluetoothGSMlaw1005 Communications Technologies0202 electrical engineering electronic engineering information engineeringBandwidth (computing)Resource managementElectrical and Electronic EngineeringNetworking and Internet Architecture (cs.NI)business.industryInformation Theory (cs.IT)020206 networking & telecommunicationsComputer Science ApplicationsPower (physics)0906 Electrical and Electronic EngineeringWide areaSoftware deploymentNetworking & TelecommunicationsTelecommunicationsbusinessInternet of Things
researchProduct

Capture Aware Sequential Waterfilling for LoraWAN Adaptive Data Rate

2020

LoRaWAN (Long Range Wide Area Network) is emerging as an attractive network infrastructure for ultra low power Internet of Things devices. Even if the technology itself is quite mature and specified, the currently deployed wireless resource allocation strategies are still coarse and based on rough heuristics. This paper proposes an innovative "sequential waterfilling" strategy for assigning Spreading Factors (SF) to End-Devices (ED). Our design relies on three complementary approaches: i) equalize the Time-on-Air of the packets transmitted by the system's EDs in each spreading factor's group; ii) balance the spreading factors across multiple access gateways, and iii) keep into account the c…

FOS: Computer and information sciencesComputer scienceDistributed computingInternet of ThingsWireless communicationresource allocationServers02 engineering and technologyNetwork topologyspreading factorsinter-SF interferenceComputer Science - Networking and Internet Architecturechannel captureBandwidthServerLPWAN0202 electrical engineering electronic engineering information engineeringWirelessComputer architectureElectrical and Electronic Engineeringinternet of t6hingsNetworking and Internet Architecture (cs.NI)Network packetbusiness.industryApplied MathematicsResource managementinternet of t6hings; LoRaWAN; spreading factors; resource allocation; adaptive data rate; channel capture; inter-SF interference020206 networking & telecommunicationsComputer Science ApplicationsLoRaWANadaptive data rateWide area networkScalabilityHeuristicsbusinessInterferenceUplinkCommunication channel
researchProduct

Impact of LTE’s Periodic Interference on Heterogeneous Wi-Fi Transmissions

2018

The problem of Wi-Fi and LTE coexistence has been significantly debated in the last years, with the emergence of LTE extensions enabling the utilization of unlicensed spectrum for carrier aggregation. Rather than focusing on the problem of resource sharing between the two technologies, in this paper, we study the effects of LTE's structured transmissions on the Wi-Fi random access protocol. We show how the scheduling of periodic LTE transmissions modifies the behavior of 802.11's distributed coordination function (DCF), leading to a degradation of Wi-Fi performance, both in terms of channel utilization efficiency and in terms of channel access fairness. We also discuss the applicability and…

FOS: Computer and information sciencesComputer scienceThroughput02 engineering and technologyDistributed coordination functionSpectrum managementAnalytical modelScheduling (computing)Computer Science - Networking and Internet ArchitectureC.2.0C.2.50202 electrical engineering electronic engineering information engineeringLong Term EvolutionWireless fidelityElectrical and Electronic EngineeringProbabilitySensorNetworking and Internet Architecture (cs.NI)business.industrySettore ING-INF/03 - TelecomunicazioniComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunicationsComputer Science Applications1707 Computer Vision and Pattern RecognitionThroughput91A06 91A10 91A80Computer Science ApplicationsShared resourceModeling and SimulationbusinessC.2.0; C.2.5InterferenceRandom accessComputer networkCommunication channel
researchProduct

A Comprehensive Utility Function for Resource Allocation in Mobile Edge Computing

2020

In mobile edge computing (MEC), one of the important challenges is how much resources of which mobile edge server (MES) should be allocated to which user equipment (UE). The existing resource allocation schemes only consider CPU as the requested resource and assume utility for MESs as either a random variable or dependent on the requested CPU only. This paper presents a novel comprehensive utility function for resource allocation in MEC. The utility function considers the heterogeneous nature of applications that a UE offloads to MES. The proposed utility function considers all important parameters, including CPU, RAM, hard disk space, required time, and distance, to calculate a more realis…

FOS: Computer and information sciencesComputer sciencemedia_common.quotation_subjectG.3Cloud computingComputer Science - Networking and Internet ArchitectureC.2.3BiomaterialsC.2.1Resource (project management)Electrical and Electronic EngineeringFunction (engineering)media_commonNetworking and Internet Architecture (cs.NI)Mobile edge computingbusiness.industryEnergy consumptionComputer Science ApplicationsTask (computing)User equipmentMechanics of MaterialsModeling and SimulationResource allocationG.3; C.2.3; C.2.1business46FxxComputer networkComputers, Materials & Continua
researchProduct

An exploratory study of COVID-19 misinformation on Twitter.

2020

During the COVID-19 pandemic, social media has become a home ground for misinformation. To tackle this infodemic, scientific oversight, as well as a better understanding by practitioners in crisis management, is needed. We have conducted an exploratory study into the propagation, authors and content of misinformation on Twitter around the topic of COVID-19 in order to gain early insights. We have collected all tweets mentioned in the verdicts of fact-checked claims related to COVID-19 by over 92 professional fact-checking organisations between January and mid-July 2020 and share this corpus with the community. This resulted in 1 500 tweets relating to 1 274 false and 276 partially false cla…

FOS: Computer and information sciencesCoronavirus disease 2019 (COVID-19)Computer Networks and CommunicationsDiffusion of informationInternet privacyTwitterExploratory research02 engineering and technologyCrisis managementFalse accusationArticleSocial mediaComputer Science - Computers and SocietyOrder (exchange)Computers and Society (cs.CY)0202 electrical engineering electronic engineering information engineeringSocial mediaMisinformationSocial and Information Networks (cs.SI)business.industryCommunicationCOVID-19Computer Science - Social and Information Networks020206 networking & telecommunicationsExploratory analysisVDP::Samfunnsvitenskap: 200::Sosiologi: 220CoronavirusInformatikFake newsMisinformation020201 artificial intelligence & image processingPsychologybusinessInformation SystemsOnline social networks and media
researchProduct

IncentMe: Effective Mechanism Design to Stimulate Crowdsensing Participants with Uncertain Mobility

2018

Mobile crowdsensing harnesses the sensing power of modern smartphones to collect and analyze data beyond the scale of what was previously possible with traditional sensor networks. Given the participatory nature of mobile crowdsensing, it is imperative to incentivize mobile users to provide sensing services in a timely and reliable manner. Most importantly, given sensed information is often valid for a limited period of time, the capability of smartphone users to execute sensing tasks largely depends on their mobility pattern, which is often uncertain. For this reason, in this paper, we propose IncentMe, a framework that solves this core issue by leveraging game-theoretical reverse auction …

FOS: Computer and information sciencesOptimizationMonitoringComputer Networks and CommunicationsComputer scienceDistributed computingMobile computingCrowdsensing02 engineering and technologyComputer Science - Networking and Internet ArchitectureReverse auctionSmart phoneCrowdsensingGame Theory0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringSensorNetworking and Internet Architecture (cs.NI)Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniMechanism designMobile computing020206 networking & telecommunicationsAuctionNavigationCore (game theory)RoadComputer Networks and CommunicationSensingTask analysisTask analysiParticipatoryState (computer science)MechanismSmartphoneWireless sensor networkIncentiveSoftware
researchProduct

Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees

2017

International audience; The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by dening (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one tree. We illustrate how (i, j)-disjoint spanning trees provide some nuances between the existence of disjoint connected dominating sets and completely independent spanning trees. We prove that determining if there exist two (i, j)-disjoint spanning trees in a graph G is NP-comple…

FOS: Computer and information sciences[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Discrete Mathematics (cs.DM)Spanning trees[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]0102 computer and information sciences02 engineering and technologyMinimum spanning tree[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesConnected dominating setCombinatorics[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsGridMathematicsMinimum degree spanning treeDiscrete mathematics020203 distributed computingTrémaux treeSpanning treeApplied MathematicsShortest-path treeWeight-balanced tree[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Disjoint connected dominating setsIndependent spanning trees[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]010201 computation theory & mathematicsReverse-delete algorithmCompletely independent spanning treesComputer Science - Discrete MathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Rate-Splitting Random Access Mechanism for Massive Machine Type Communications in 5G Cellular Internet-of-Things

2021

The cellular Internet-of-Things has resulted in the deployment of millions of machine-type communication (MTC) devices. These massive number of devices must communicate with a single gNodeB (gNB) via the random access channel (RACH) mechanism. However, existing RACH mechanisms are inefficient when dealing with such large number of devices. To address this issue, we propose the rate-splitting random access (RSRA) mechanism, which uses rate splitting and decoding in rate-splitting multiple access (RSMA) to improve RACH success rates. The proposed mechanism divides the message into common and private messages and enhances the decoding performance. We demonstrate, using extensive simulations, t…

FOS: Computer and information sciencesbusiness.industryMechanism (biology)Computer scienceComputer Science - Information TheoryInformation Theory (cs.IT)Type (model theory)Random-access channelSoftware deploymentInternet of Thingsbusiness5GRandom accessDecoding methodsComputer network2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)
researchProduct

MAC Design for WiFi Infrastructure Networks: A Game-Theoretic Approach

2011

In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios because of non-standard configurations of the nodes. Due to the proliferation of open source drivers and programmable cards, enabling an easy customization of the channel access policies, we propose a game-theoretic analysis of random access schemes. Assuming that each node is rational and implements a best response strategy, we show that…

FOS: Computer and information sciencesgame theorycheating nodeaccess protocolsmobile nodesComputer sciencegame-theoretic approachMAC designDistributed coordination functionUpload[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]MAC protocolschannel access policyComputer Science - Computer Science and Game TheoryFOS: MathematicsElectrical and Electronic EngineeringMathematics - Optimization and Controlwireless LANdistributed coordination functionMechanism designcheating nodesWiFi infrastructure networksbusiness.industryApplied MathematicsNode (networking)WiFiComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSWiFi; cheating nodes; game theory; MAC protocolsComputer Science ApplicationsShared resourceprogrammable cardsOptimization and Control (math.OC)game-theoretic analysisBest responserandom access schemebusinessrandom access protocolRandom accessCommunication channelComputer networkComputer Science and Game Theory (cs.GT)
researchProduct

Routing quantum information in spin chains

2013

Two different models for performing efficiently routing of a quantum state are presented. Both cases involve an XX spin chain working as data bus and additional spins that play the role of sender and receivers, one of which is selected to be the target of the quantum state transmission protocol via a coherent quantum coupling mechanism making use of local/global magnetic fields. Quantum routing is achieved, in the first of the models considered, by weakly coupling the sender and the receiver to the data bus. In the second model, strong magnetic fields acting on additional spins located between the sender/receiver and the data bus allow us to perform high fidelity routing.

FOS: Physical sciencesNetworkQuantum capacityTopology01 natural sciencesAtomic mott insulatorSettore FIS/03 - Fisica Della Materia010305 fluids & plasmasQuantum stateAtomic and Molecular Physics0103 physical sciencesComputer Science::Networking and Internet ArchitectureQuantum couplingQuantum information010306 general physicsQuantum information scienceSystem busSpin-½PhysicsQuantum PhysicsHardware_MEMORYSTRUCTURESState transferAtomic and Molecular Physics and OpticsQuantum information quantum comunicationPhaseRouting (electronic design automation)and OpticsQuantum Physics (quant-ph)
researchProduct