[go: up one dir, main page]

Liu et al., 2014 - Google Patents

Efficient data query in intermittently-connected mobile ad hoc social networks

Liu et al., 2014

View PDF
Document ID
15753014172009900896
Author
Liu Y
Han Y
Yang Z
Wu H
Publication year
Publication venue
IEEE Transactions on Parallel and Distributed Systems

External Links

Snippet

This work addresses the problem of how to enable efficient data query in a Mobile Ad-hoc SOcial Network (MASON), formed by mobile users who share similar interests and connect with one another by exploiting Bluetooth and/or WiFi connections. The data query in …
Continue reading at scholar.archive.org (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations contains provisionally no documents
    • H04L12/18—Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
    • H04W4/06—Selective distribution or broadcast application services; Mobile application services to user groups; One-way selective calling services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
    • H04W4/02—Mobile application Services making use of the location of users or terminals, e.g. OMA SUPL, OMA MLP or 3GPP LCS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
    • H04L63/065—Network architectures or network communication protocols for network security for supporting key management in a packet data network for group communications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W8/00—Network data management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use

Similar Documents

Publication Publication Date Title
Liu et al. Efficient data query in intermittently-connected mobile ad hoc social networks
Kahraman et al. Age of information in internet of things: A survey
Liu et al. Optimal online data dissemination for resource constrained mobile opportunistic networks
Mota et al. Protocols, mobility models and tools in opportunistic networks: A survey
Li et al. SEDUM: Exploiting Social Networks in Utility--Based Distributed Routing for DTNs
Fan et al. Delque: A socially aware delegation query scheme in delay-tolerant networks
Li et al. Reliable topology design in time-evolving delay-tolerant networks with unreliable links
Shah Energy efficient and robust allocation of interdependent tasks on mobile ad hoc computational grid
Liu et al. Efficient quality-of-service (QoS) support in mobile opportunistic networks
Wang et al. Multiple mobile sink‐based routing algorithm for data dissemination in wireless sensor networks
Panta et al. Phoenix: Storage using an autonomous mobile infrastructure
Wang et al. A survey on analytic studies of Delay‐Tolerant Mobile Sensor Networks
Redhu et al. Optimal relay node selection for robust data forwarding over time-varying IoT networks
Akyurek et al. Optimal packet aggregation scheduling in wireless networks
Han et al. A new data transmission strategy in mobile d2d networks—deterministic, greedy, or planned opportunistic routing?
Li et al. Energy efficient social routing framework for mobile social sensing networks
Duong et al. TSIRP: a temporal social interactions-based routing protocol in opportunistic mobile social networks
Peruani et al. Modeling broadcasting using omnidirectional and directional antenna in delay tolerant networks as an epidemic dynamics
Carneiro Viana et al. Supple: a flexible probabilistic data dissemination protocol for wireless sensor networks
Small et al. Quality of service and capacity in constrained intermittent-connectivity networks
Tanase et al. Quality of service in large scale mobile distributed systems based on opportunistic networks
Han et al. Delay-constrained single-copy multi-path data transmission in mobile opportunistic networks
Mitra et al. Opportunistic routing in mobile ad hoc networks
Tsai et al. WaterChat: A group chat application based on opportunistic mobile social networks.
Pal Evaluating the impact of network loads and message size on mobile opportunistic networks in challenged environments