PERBANDINGAN KINERJA ROUTING MAXPROP DAN ROUTING SPRAY AND WAIT DENGAN MANAJEMEN BUFFER PADA DELAY TOLERANT NETWORK (DTN)
| Main Author: | Sudarmanto, Muhamad Arif |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2019
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/44454/1/PENDAHULUAN.pdf http://eprints.umm.ac.id/44454/2/BAB%20I.pdf http://eprints.umm.ac.id/44454/3/BAB%20II.pdf http://eprints.umm.ac.id/44454/4/BAB%20III.pdf http://eprints.umm.ac.id/44454/5/BAB%20IV.pdf http://eprints.umm.ac.id/44454/6/BAB%20V.pdf http://eprints.umm.ac.id/44454/7/LAMPIRAN.pdf http://eprints.umm.ac.id/44454/ |
Daftar Isi:
- Delay Tolerant Network (DTN) was architechture network concepts that’s friendly with delayed, error, and connection. DTN present with communication architecture which is able formed by network unstable, it caused node abilities always moving. Data technology transmition which is used of DTN that was store and forward technology system, where the message could moved from the storage of the node to the other node storage up to that message will be sent on the direction node. However the storage limitation or the buffer and the mechanism of message schedule get less attention. So it needed a rule which could manage the buffer for optimize message shipping. On this final study, was conducted the ratio of performaance between MaxProp routing algorithm with Spray and Wait routing algorithm with adding of buffer management rules based on hop-count and TTL message. The experiment conducted with using 2 scenario. First scenario with variations addition the number of nodes and the second scenario with variations addition the size of message. The parameters of testing which is used there are three that were delivery probability, overhead ratio and latency average. The result MaxProp routing algorithms of buffer management has delivery value of probability and latency average is better than Spray and Wait routing algorithm of buffer management, while Spray and Wait routing algorithm of buffer management has overhead ratio was better than MaxProp routing algorithms of buffer management.