A geometric routing protocol in disruption tolerant network
نویسندگان
چکیده
منابع مشابه
Routing Using History Information in Disruption Tolerant Network
There is no fully connected path present in the network because of the device failure, limitations of radio range and power then not able to communicate properly. To provide communication in Disruption Tolerant Network (DTN), use prediction based routing to select intermediate node using mobility history information. The Time-Homogeneous Semi-Markov process model (TH-SMP) is used to determine t...
متن کاملA Connection Information Aided Routing Protocol in Delay Tolerant Network
Due to its characteristics such as long communication delay, high dynamic topology, sparse distribution of nodes and frequent link break, routing are the key research issues of delay tolerant networks. Prophet algorithm forwards the packets to the node with maximum probability of successful delivery by recording history information of nodes encounter. Prophet reduces the invalid copy of message...
متن کاملA Fuzzy based Routing Protocol for Delay Tolerant Network
Delay Tolerant Network (DTN) is a wireless ad hoc network that intends to provide communication between pair of nodes in spite of having intermittent connectivity and long delays. The nodes are buffer and energy constrained. To provide communication in such scenario, a sturdy routing mechanism is needed. In this paper we propose a new routing technique based on fuzzy logic for intermittently co...
متن کاملAn Improved PRoPHET Routing Protocol in Delay Tolerant Network
In delay tolerant network (DTN), an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destina...
متن کاملExplaining Routing Performance in Disruption Tolerant Networks
Many routing algorithms for both traditional and ad hoc networks require a complete and contemporaneous path of peers from source to destination. Disruption Tolerant Networks (DTNs) attempt to deliver messages despite a frequently disconnected link layer (e.g., due to peer mobility, limited communication range, and power management limitations). While several algorithms have been proposed for r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel, Emergent and Distributed Systems
سال: 2010
ISSN: 1744-5760,1744-5779
DOI: 10.1080/17445760903548325