Le et al., 2017 - Google Patents

A relay selection strategy based on power-law and exponentially distributed contacts in DTNs

Le et al., 2017

Document ID: 5771809398834754486
Author: Le T; Du P; Gerla M
Publication year: 2017
Publication venue: 2017 IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)

External Links

Cited by

Snippet

Delay Tolerant Networks (DTNs) are sparse mobile ad-hoc networks in which there is typically no complete path between the source and destination. Although many routing algorithms for DTNs have been proposed, prior works generally focus on utilizing the …

Continue reading at www.researchgate.net (PDF) (other versions)

238000009826 distribution 0 abstract description 21

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
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
- 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/12—Shortest path evaluation
- H04L45/121—Minimizing delay
- 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
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
- 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/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
- H04L41/145—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning involving simulating, designing, planning or modelling of a network
- 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/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
- H04L41/142—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning using statistical or mathematical methods
- 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
- H04L43/00—Arrangements for monitoring or testing packet switching networks
- H04L43/08—Monitoring based on specific metrics
- 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
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- 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
- 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
- H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/08—Mobility data transfer
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W28/00—Network traffic or resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control

Similar Documents

Publication	Publication Date	Title
Krifa et al.	2008	Optimal buffer management policies for delay tolerant networks
Zhu et al.	2011	Exploiting temporal dependency for opportunistic forwarding in urban vehicular networks
Musolesi et al.	2008	CAR: Context-aware adaptive routing for delay-tolerant mobile networks
Xiao et al.	2014	An optimization of the object function for routing protocol of low-power and lossy networks
Park	1999	Anycast routing for mobile services
Guo et al.	2017	A location aided controlled spraying routing algorithm for Delay Tolerant Networks
Zhao et al.	2018	Optimal data caching and forwarding in industrial IoT with diverse connectivity
Le et al.	2017	Contact duration-aware routing in delay tolerant networks
Almeida et al.	2012	Performance evaluation of manet and dtn routing protocols
Socievole et al.	2013	Face-to-face with Facebook friends: using online friendlists for routing in opportunistic networks
Zhu et al.	2014	Rethinking routing information in mobile social networks: location-based or social-based?
Le et al.	2017	A relay selection strategy based on power-law and exponentially distributed contacts in DTNs
Bulut et al.	2010	Efficient routing in delay tolerant networks with correlated node mobility
Wei et al.	2014	A multi-attribute decision making approach to congestion control in delay tolerant networks
Chen et al.	2011	On using contact expectation for routing in delay tolerant networks
Chuan et al.	2020	Optimizing content placement and delivery in wireless distributed cache systems through belief propagation
Le et al.	2017	An anycast routing strategy with time constraint in delay tolerant networks
Islam et al.	2008	Reality-check for dtn routing algorithms
Batabyal et al.	2013	Estimators for global information in mobile opportunistic network
Jain et al.	2021	A comprehensive survey of social based routing for delay tolerant networks
Li et al.	2013	Opportunistic routing using prefix ordering and self-reported social groups
Le et al.	2015	A novel social contact graph based routing strategy for delay tolerant networks
Zhou et al.	2009	Diverse routing: Exploiting social behavior for routing in delay-tolerant networks
Zhang et al.	2017	Social-aware backbone-based multicast routing in mobile opportunistic networks
Zhang et al.	2015	Prediction-based routing methods in opportunistic networks