[go: up one dir, main page]

Dinh et al., 2009 - Google Patents

Towards social-aware routing in dynamic communication networks

Dinh et al., 2009

View HTML
Document ID
634524715675057300
Author
Dinh T
Xuan Y
Thai M
Publication year
Publication venue
2009 IEEE 28th International Performance Computing and Communications Conference

External Links

Snippet

Many communication networks such as Mobile Ad Hoc Networks (MANETs) involve in human interactions and exhibit properties of social networks. Hence, it is interesting to see how knowledge from social networks can be used to enhance the communication …
Continue reading at www.academia.edu (HTML) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • 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/48—Routing tree calculation
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • 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/74—Address processing for routing
    • H04L45/745—Address table lookup or address filtering
    • 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/54—Organization of routing tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
    • 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

Similar Documents

Publication Publication Date Title
Dinh et al. Towards social-aware routing in dynamic communication networks
Said et al. CC-GA: A clustering coefficient based genetic algorithm for detecting communities in social networks
McGregor Graph stream algorithms: a survey
Nguyen et al. Adaptive algorithms for detecting community structure in dynamic social networks
Mertzios et al. Temporal network optimization subject to connectivity constraints
Alvari et al. Community detection in dynamic social networks: A game-theoretic approach
CN105812254B (en) A kind of opportunity network data transmission method
Sun et al. Scaling of the average receiving time on a family of weighted hierarchical networks
Dinh et al. Community detection in scale-free networks: Approximation algorithms for maximizing modularity
Zhang et al. A social community detection algorithm based on parallel grey label propagation
Chong et al. An incremental batch technique for community detection
CN104484365A (en) Method and system for predicting social relation in multi-source heterogeneous networks
Li et al. A community-driven hierarchical message transmission scheme in opportunistic networks
Janidarmian et al. Application-specific networks-on-chips design
Keley et al. Efficient mapping algorithm on mesh-based NoCs in terms of cellular learning automata.
Souravlas et al. Efficient community-based data distribution over multicast trees
Singh et al. Community detection in large-scale real-world networks
Herbiet et al. SHARC: community-based partitioning for mobile ad hoc networks using neighborhood similarity
CN115118650A (en) Complex network key node identification method based on information propagation probability
Atsan et al. Applicability of eigenvector centrality principle to data replication in MANETs
Hou et al. A localized algorithm for finding disjoint paths in wireless sensor networks
Gilbert et al. How fast can you update your MST?(Dynamic algorithms for cluster computing)
Khanday et al. Community detection algorithms: A critical review
Dinh et al. A general approach for modules identification in evolving networks
Suzuki et al. On Inferring Communication Delays Using Semi-Supervised Learning