Search results for "mobile"

showing 10 items of 1399 documents

A survey on pseudonym changing strategies for Vehicular Ad-Hoc Networks

2017

International audience; The initial phase of the deployment of vehicular ad-hoc networks (VANETs) has begun and many research challenges still need to be addressed. Location privacy continues to be in the top of these challenges. Indeed, both academia and industry agreed to apply the pseudonym changing approach as a solution to protect the location privacy of VANETs' users. However, due to the pseudonyms linking attack, a simple changing of pseudonym shown to be inefficient to provide the required protection. For this reason, many pseudonym changing strategies have been suggested to provide an effective pseudonym changing. Unfortunately, the development of an effective pseudonym changing st…

FOS: Computer and information sciencesComputer Science - Cryptography and SecurityComputer scienceWireless ad hoc networklocation privacy02 engineering and technologysecurityPseudonymComputer securitycomputer.software_genre[SPI]Engineering Sciences [physics]0203 mechanical engineeringpseudonym changing0202 electrical engineering electronic engineering information engineeringVANETsElectrical and Electronic EngineeringAuthenticationVehicular ad hoc networksAuthenticationComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunications020302 automobile design & engineeringRoadsSoftware deploymentPrivacyInitial phaseComputingMilieux_COMPUTERSANDSOCIETYSafetycomputerCryptography and Security (cs.CR)
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

Classical automata on promise problems

2015

Promise problems were mainly studied in quantum automata theory. Here we focus on state complexity of classical automata for promise problems. First, it was known that there is a family of unary promise problems solvable by quantum automata by using a single qubit, but the number of states required by corresponding one-way deterministic automata cannot be bounded by a constant. For this family, we show that even two-way nondeterminism does not help to save a single state. By comparing this with the corresponding state complexity of alternating machines, we then get a tight exponential gap between two-way nondeterministic and one-way alternating automata solving unary promise problems. Secon…

FOS: Computer and information sciencesNested wordTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESUnary operationGeneral Computer ScienceFormal Languages and Automata Theory (cs.FL)nondeterministic automataComputer Science - Formal Languages and Automata Theoryω-automatonComputational Complexity (cs.CC)Theoretical Computer ScienceContinuous spatial automatonQuantum finite automataDiscrete Mathematics and Combinatoricsalternating automatapromise problemsMathematicsprobabilistic automataNonlinear Sciences::Cellular Automata and Lattice GasesMobile automatonNondeterministic algorithmAlgebra[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Computer Science - Computational ComplexityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESAutomata theorydescriptional complexityComputer Science::Formal Languages and Automata Theory
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

Statistically validated mobile communication networks: the evolution of motifs in European and Chinese data

2014

Big data open up unprecedented opportunities to investigate complex systems including the society. In particular, communication data serve as major sources for computational social sciences but they have to be cleaned and filtered as they may contain spurious information due to recording errors as well as interactions, like commercial and marketing activities, not directly related to the social network. The network constructed from communication data can only be considered as a proxy for the network of social relationships. Here we apply a systematic method, based on multiple hypothesis testing, to statistically validate the links and then construct the corresponding Bonferroni network, gen…

FOS: Computer and information sciencesPhysics - Physics and SocietyBig dataFOS: Physical sciencesGeneral Physics and AstronomyPhysics and Society (physics.soc-ph)computer.software_genre01 natural sciences010305 fluids & plasmassymbols.namesake0103 physical sciences010306 general physicsProxy (statistics)Social and Information Networks (cs.SI)PhysicsSocial networkbusiness.industryComputer Science - Social and Information NetworksComplex networkcomplex networks social systems statistically validated networks mobile call records 3-motifsSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Bonferroni correctionMobile phonesymbolsMobile telephonyData miningRaw databusinesscomputer
researchProduct

A comparative analysis of the statistical properties of large mobile phone calling networks.

2014

Mobile phone calling is one of the most widely used communication methods in modern society. The records of calls among mobile phone users provide us a valuable proxy for the understanding of human communication patterns embedded in social networks. Mobile phone users call each other forming a directed calling network. If only reciprocal calls are considered, we obtain an undirected mutual calling network. The preferential communication behavior between two connected users can be statistically tested and it results in two Bonferroni networks with statistically validated edges. We perform a comparative analysis of the statistical properties of these four networks, which are constructed from …

FOS: Computer and information sciencesPhysics - Physics and SocietyChinaComputer scienceFOS: Physical sciencesInformation Storage and RetrievalPhysics and Society (physics.soc-ph)ArticleSocial NetworkingComputer Communication NetworksSocio-technical systemsComputer SimulationProxy (statistics)Human communicationStatisticSocial and Information Networks (cs.SI)MultidisciplinaryModels StatisticalSocial networkbusiness.industryStatistical physicComputer Science - Social and Information NetworksNonlinear phenomenaComplex networkSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Mobile phonebusinessTelecommunicationsCell PhoneScientific reports
researchProduct

Random Walk in a N-cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations

2017

Designing a pseudorandom number generator (PRNG) is a difficult and complex task. Many recent works have considered chaotic functions as the basis of built PRNGs: the quality of the output would indeed be an obvious consequence of some chaos properties. However, there is no direct reasoning that goes from chaotic functions to uniform distribution of the output. Moreover, embedding such kind of functions into a PRNG does not necessarily allow to get a chaotic output, which could be required for simulating some chaotic behaviors. In a previous work, some of the authors have proposed the idea of walking into a $\mathsf{N}$-cube where a balanced Hamiltonian cycle has been removed as the basis o…

FOS: Computer and information sciencesUniform distribution (continuous)Computer Science - Cryptography and SecurityComputer scienceHamiltonian CycleChaoticPseudorandom Numbers GeneratorFOS: Physical sciences02 engineering and technology[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]01 natural sciencesUpper and lower bounds[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computingsymbols.namesake[INFO.INFO-MC]Computer Science [cs]/Mobile Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]0202 electrical engineering electronic engineering information engineeringApplied mathematics[INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]0101 mathematicsEngineering (miscellaneous)Pseudorandom number generatorChaotic IterationsBasis (linear algebra)Applied Mathematics020208 electrical & electronic engineering010102 general mathematicsRandom walkNonlinear Sciences - Chaotic DynamicsHamiltonian path[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationNonlinear Sciences::Chaotic Dynamics[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Modeling and SimulationRandom Walk[NLIN.NLIN-CD]Nonlinear Sciences [physics]/Chaotic Dynamics [nlin.CD]symbolsPseudo random number generator[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Chaotic Dynamics (nlin.CD)[INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Cryptography and Security (cs.CR)
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

A Mobile-Assisted Working Model for Supporting Daily Family Life

2015

Despite rapid technological development, very few new technology-assisted tools have been developed specifically for use in family services. This article describes a new, mobile-assisted working model designed to enhance the quality of daily family life. The model has its origins in the existing research on daily family life and on the diary method, which has been widely used in data collection in family research. The model provides support for the daily life of client families in the intervals between meetings with family counselors via the use of text messages. The pilot study explored family members’ and family counselors’ experiences of using the model. Data on 26 parents and four chil…

Family therapyMedical educationService (systems architecture)Data collectionSocial Psychologyfamily counselingbusiness.industrymedia_common.quotation_subjectdiary methoddaily family lifeResearch findingsFamily lifemobile technologyNursingparentingta5141Medicineta516Mobile technologyQuality (business)businessta512Social Sciences (miscellaneous)media_commonThe Family Journal
researchProduct

A Survey on Proxy Mobile IPv6 Handover

2016

[EN] As wireless technologies have been improving in recent years, a mobility management mechanism is required to provide seamless and ubiquitous mobility for end users who are roaming among points of attachment in wireless networks. Thus, Mobile IPv6 was developed by the Internet Engineering Task Force (IETF) to support the mobility service. However, Mobile IPv6 is unable to fulfill the requirements of real-time applications, such as video streaming service and voice over IP service, due to its high handover (HO) latency. To address this problem, Proxy Mobile IPv6 (PMIPv6) has been introduced by the IETF. In PMIPv6, which is a network-based approach, the serving network controls mobility m…

Fast localized Proxy Mobile IPv6 (PMIPv6) handover (HO) procedureEngineeringMobility modelComputer Networks and CommunicationsReactive mode0211 other engineering and technologiesMobile computing02 engineering and technologyPMIPv6 with partial bicastingPMIPv60202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringProxy Mobile IPv6Mobility management021103 operations researchbusiness.industryWireless networkComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSPredictive modeHO in PMIPv6020206 networking & telecommunicationsINGENIERIA TELEMATICAComputer Science ApplicationsHandoverControl and Systems EngineeringMobile IPRoamingbusinessTelecommunicationsInformation SystemsComputer networkIEEE Systems Journal
researchProduct