Wang et al., 2009 - Google Patents
Adaptive randomized epidemic routing for disruption tolerant networksWang et al., 2009
- Document ID
- 2779729070685753463
- Author
- Wang X
- Shu Y
- Jin Z
- Pan Q
- Lee B
- Publication year
- Publication venue
- 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
External Links
Snippet
In disruption tolerant networks, aggressive packet forwarding scheme like flooding has a major drawback in terms of network congestion. In this paper, we proposed a new routing algorithm, called adaptive randomized epidemic routing (ARER). ARER dynamically adjusts …
- 230000003044 adaptive 0 title abstract description 14
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
- H04L12/1886—Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast with traffic restrictions for efficiency improvement, e.g. involving subnets or subdomains
-
- 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
- H04L12/56—Packet switching systems
-
- 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/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- 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
- 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/48—Routing tree calculation
-
- 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
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/26—Monitoring arrangements; Testing arrangements
- H04L12/2602—Monitoring arrangements
-
- 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
- H04L47/26—Explicit feedback to the source, e.g. choke packet
- H04L47/263—Source rate modification after feedback
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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/16—Multipoint routing
-
- 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
- H04W28/00—Network traffic or resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
-
- 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/30—Special provisions for routing multiclass traffic
- H04L45/302—Route determination based on requested QoS
-
- 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
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
-
- 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
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Qasim et al. | Mobile Ad Hoc Networking Protocols' Evaluation through Simulation for Quality of Service. | |
Gulati et al. | Performance comparison of mobile Ad Hoc network routing protocols | |
Wang et al. | Adaptive randomized epidemic routing for disruption tolerant networks | |
Bhatia | Performance analysis of AODV based congestion control protocols in MANET | |
Geng et al. | A load‐balancing and coding‐aware multicast protocol for mobile ad hoc networks | |
Shams Shafigh et al. | Developing a fuzzy logic based on demand multicast routing protocol | |
Mazumdar et al. | TOAR: transmission-aware opportunistic ad hoc routing protocol | |
Radha et al. | Implementation of node transition probability based routing algorithm for MANET and performance analysis using different mobility models | |
Jin et al. | Adaptive priority routing with ACK_Mechanism for DTN networks | |
Manikandan et al. | Performance Analysis of Mobile Ad-Hoc Network Routing Protocols using Network Simulator–2 | |
Le et al. | Fragmented data routing based on exponentially distributed contacts in delay tolerant networks | |
Yasmin et al. | A multi-attribute routing protocol for opportunistic network environments | |
Thakur et al. | Delay Tolerant Networks: An Analysis of Routing Protocols with ONE Simulator | |
Wang et al. | Directional forward routing for disruption tolerant networks | |
Wang et al. | Weighted Epidemic Routing for disruption tolerant networks | |
Pandey et al. | Efficient PROPHET with buffer management for multicasting in DTN | |
shams Shafigh et al. | Improving performance of on demand multicast routing protocol by fuzzy logic | |
Mallapur et al. | Multi-constrained reliable multicast routing protocol for MANETs | |
Mamoun | Efficient DTN routing protocol | |
Kapoor et al. | To improve the QoS in MANETs through analysis between reactive and proactive routing protocols | |
Singh et al. | Analysis of epidemic, PROPHET and spray and wait routing protocols in the mobile opportunistic networks | |
Dembla et al. | Performance modeling of efficient and dynamic broadcasting algorithm in MANETs routing protocols | |
Kishore et al. | Multipath Dynamic Source Routing Protocol for Mobile Ad hoc Networks | |
Wang et al. | EQ-RPL: An Energy-Efficient and Quality-Aware Routing Protocol for IoT-Based Low-Power and Lossy Networks | |
Srivastava et al. | Evaluation of the Performance Comparison of DSR and AODV Routing Protocols in Mobile Ad Hoc Networks |