Katsaros et al., 2010 - Google Patents

Social network analysis concepts in the design of wireless ad hoc network protocols

Katsaros et al., 2010

Document ID: 14165709627898768356
Author: Katsaros D; Dimokas N; Tassiulas L
Publication year: 2010
Publication venue: IEEE network

External Links

Cited by

Snippet

This article presents a survey of ad hoc networking protocols that have used concepts such as centrality metrics and community formation from the area of social network analysis, which is seen as a network measurement task that deals with structural properties of the …

Continue reading at faculty.e-ce.uth.gr (PDF) (other versions)

238000003012 network analysis 0 title abstract description 8

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
- 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
- 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
- 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
- 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/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- 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
- 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/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/12—Shortest path evaluation
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/08—Configuration management of network or network elements
- H04L41/0803—Configuration setting of network or network elements
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details

Similar Documents

Publication	Publication Date	Title
Katsaros et al.	2010	Social network analysis concepts in the design of wireless ad hoc network protocols
Wei et al.	2013	A survey of social-aware routing protocols in delay tolerant networks: Applications, taxonomy and design-related issues
Jazebi et al.	2020	RISA: routing scheme for Internet of Things using shuffled frog leaping optimization algorithm
Xiao et al.	2013	Community-aware opportunistic routing in mobile social networks
Yoneki et al.	2007	A socio-aware overlay for publish/subscribe communication in delay tolerant networks
Biskupski et al.	2007	Properties and mechanisms of self-organizing MANET and P2P systems
Wu et al.	2020	Community recombination and duplication node traverse algorithm in opportunistic social networks
Wei et al.	2013	On social delay-tolerant networking: Aggregation, tie detection, and routing
Maglaras et al.	2012	New measures for characterizing the significance of nodes in wireless ad hoc networks via localized path-based neighborhood analysis
Rango et al.	2015	Exploiting online and offline activity-based metrics for opportunistic forwarding
Starks et al.	2017	Mobile distributed complex event processing—Ubi Sumus? Quo vadimus?
Gavalas et al.	2010	An approach for near-optimal distributed data fusion in wireless sensor networks
Pantazopoulos et al.	2010	Efficient social-aware content placement in opportunistic networks
Al-Adrousy et al.	2015	A recommender system for team formation in MANET
Asemani et al.	2015	Learning automata based energy efficient data aggregation in wireless sensor networks
Chakraborty et al.	2018	Sensor selection and data fusion approach for IoT applications
Saravanan et al.	2013	An effective model for QoS assessment in data caching in MANET environments
Vitoropoulou et al.	2019	Sensing and monitoring of information diffusion in complex online social networks
Sun et al.	2014	Primate-inspired adaptive routing in intermittently connected mobile communication systems
Zhou et al.	2017	Maximum data delivery probability-oriented routing protocol in opportunistic mobile networks
AboElFotoh et al.	2007	A flow-based reliability measure for wireless sensor networks
Rekik et al.	2015	Geographic greedy routing with aco recovery strategy graco
Koupaee et al.	2017	Scalable structure-free data fusion on wireless sensor networks
Chatzimilioudis et al.	2009	Operator placement for snapshot multi-predicate queries in wireless sensor networks
Merzoug et al.	2018	Efficient information gathering from large wireless sensor networks