Destination Sequence Distance Vector

Top PDF Destination Sequence Distance Vector:

Analisis perbandingan kinerja protokol Destination Sequence Distance Vector (DSDV) dengan Ad Hoc On Demand Distance Vector (AODV) pada mobile ad hoc network.

Analisis perbandingan kinerja protokol Destination Sequence Distance Vector (DSDV) dengan Ad Hoc On Demand Distance Vector (AODV) pada mobile ad hoc network.

Adapun penelitian yang sudah dilakukan mengenai topik ini, antara lain Reinaldo Aditya Wiratama mahasiswa Teknik Elektro Unika Atma Jaya pada tahun 2007 [4]. Judul penelitiannya adalah Kinerja Protokol Routing Ad Hoc on Demand Distance Vector (AODV) pada MANET (Mobile Ad Hoc Network). Kesimpulan penelitian tersebut menunjukkan bahwa penambahan koneksi memiliki pengaruh yang lebih besar dibandingkan dengan penambahan jumlah node pada protokol AODV. Selain itu Januar Pratama mahasiswa Teknik Elektro Unika Atma Jaya pada tahun 2007 juga pernah melakukan penelitian dengan topik yang sama [2]. Judul penelitiannya adalah Kinerja Protokol Routing Destination Sequence Distance Vector (DSDV) pada MANET (Mobile Ad Hoc Network). Hasil penelitian tersebut menunjukan jumlah node maupun jumlah koneksi berpengaruh terhadap kinerja jaringan protokol DSDV. Oleh karena itu, penulis tertarik untuk membandingkan kinerja dari protokol DSDV dan AODV dengan menambahkan parameter berupa number of hop.
Baca lebih lanjut

110 Baca lebih lajut

Analisis perbandingan kinerja protokol Destination Sequence Distance Vector (DSDV) dengan Ad Hoc On Demand Distance Vector (AODV) pada mobile ad hoc network

Analisis perbandingan kinerja protokol Destination Sequence Distance Vector (DSDV) dengan Ad Hoc On Demand Distance Vector (AODV) pada mobile ad hoc network

Adapun penelitian yang sudah dilakukan mengenai topik ini, antara lain Reinaldo Aditya Wiratama mahasiswa Teknik Elektro Unika Atma Jaya pada tahun 2007 [4]. Judul penelitiannya adalah Kinerja Protokol Routing Ad Hoc on Demand Distance Vector (AODV) pada MANET (Mobile Ad Hoc Network). Kesimpulan penelitian tersebut menunjukkan bahwa penambahan koneksi memiliki pengaruh yang lebih besar dibandingkan dengan penambahan jumlah node pada protokol AODV. Selain itu Januar Pratama mahasiswa Teknik Elektro Unika Atma Jaya pada tahun 2007 juga pernah melakukan penelitian dengan topik yang sama [2]. Judul penelitiannya adalah Kinerja Protokol Routing Destination Sequence Distance Vector (DSDV) pada MANET (Mobile Ad Hoc Network). Hasil penelitian tersebut menunjukan jumlah node maupun jumlah koneksi berpengaruh terhadap kinerja jaringan protokol DSDV. Oleh karena itu, penulis tertarik untuk membandingkan kinerja dari protokol DSDV dan AODV dengan menambahkan parameter berupa number of hop.
Baca lebih lanjut

108 Baca lebih lajut

IMPLEMENTASI PICTURE STREAMING PADA JARINGAN MESH BERBASIS DESTINATION SEQUENCE DISTANCE VECTOR MENGGUNAKAN RASPBERRY PI UNTUK PEMANTAUAN JALAN RAYA

IMPLEMENTASI PICTURE STREAMING PADA JARINGAN MESH BERBASIS DESTINATION SEQUENCE DISTANCE VECTOR MENGGUNAKAN RASPBERRY PI UNTUK PEMANTAUAN JALAN RAYA

Destination-Sequenced Distance Vector Protokol atau disingkat menjadi DSDV Protokol adalah pengembangan dari Routing Information Protokol (RIP) yang termasuk ke dalam routing protokol berbasis distance-vector yang dikhususkan untuk jaringan ad hoc. Tapi, RIP masih mempunyai kelemahan yaitu ketika terjadi perubahan topologi, kemungkinan link failures cukup besar. Agar bisa mengoptimalkan convergence dari RIP, triggered updates, split horizon, poison reverse dan mekanisme path hold- down, banyak solusi yang bisa dilakukan. Tapi ketika solusi itu dilakukan muncul masalah-masalah lain. Dengan menambahkan penomoran urutan, node yang bergerak atau yang disebut mobile node bisa membedakan informasi rute lama dan mana yang baru untuk menghindari formasi rute berputar atau routing loops.
Baca lebih lanjut

100 Baca lebih lajut

Perbandingan konsumsi energi protokol destination sequenced distance vector dengan optimized link state routing pada mobile ad hoc network

Perbandingan konsumsi energi protokol destination sequenced distance vector dengan optimized link state routing pada mobile ad hoc network

Dalam suatu jaringan MANET, suatu aturan diperlukan untuk mengatur node agar dapat saling berkomunikasi. Aturan tersebut adalah routing protocol [1]. Fungsi dari jaringan MANET sangat tergantung pada routing protocol yang menentukan jalur atau rute di antara node. Pada jaringan MANET, ada beberapa macam routing protocol seperti Destination Sequence Distance Vector (DSDV), Temporally-Ordered Routing Algorithm (TORA), Dynamic Source Routing (DSR), Ad-hoc On Demand Distance Vector (AODV), dan Optimized Link State Routing (OLSR), dan lain-lain.
Baca lebih lanjut

83 Baca lebih lajut

Perbandingan konsumsi energi protokol destination sequenced distance vector dengan optimized link state routing pada mobile ad hoc network.

Perbandingan konsumsi energi protokol destination sequenced distance vector dengan optimized link state routing pada mobile ad hoc network.

Dalam suatu jaringan MANET, suatu aturan diperlukan untuk mengatur node agar dapat saling berkomunikasi. Aturan tersebut adalah routing protocol [1]. Fungsi dari jaringan MANET sangat tergantung pada routing protocol yang menentukan jalur atau rute di antara node. Pada jaringan MANET, ada beberapa macam routing protocol seperti Destination Sequence Distance Vector (DSDV), Temporally-Ordered Routing Algorithm (TORA), Dynamic Source Routing (DSR), Ad-hoc On Demand Distance Vector (AODV), dan Optimized Link State Routing (OLSR), dan lain-lain.
Baca lebih lanjut

85 Baca lebih lajut

Ad hoc On Demand Distance Vector AODV Ro

Ad hoc On Demand Distance Vector AODV Ro

0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type |J|R|G|D|U| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | RREQ ID (broadcast id) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Baca lebih lanjut

30 Baca lebih lajut

Ad hoc on demand distance vector routing

Ad hoc on demand distance vector routing

0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type |J|R|G|D|U| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | RREQ ID (broadcast id) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Baca lebih lanjut

29 Baca lebih lajut

The LLN On demand Ad hoc Distance vector

The LLN On demand Ad hoc Distance vector

• Only the destination is permitted to respond to a RREQ; intermediate routers are explicitly prohibited to respond to RREQs, even if they may have active routes to the destination. This eliminates the need for Desti- nation Sequence Numbers, while retaining loop freedom. This also elimi- nates Gratuitous RREPs. The rationale for this simplification is, that it simplifies protocol operation and reduces message size. Also, except for in cases where the network graph has articulation points, this does not reduce the control traffic overhead incurred.

34 Baca lebih lajut

The Bus Ad hoc On demand Distance Vector

The Bus Ad hoc On demand Distance Vector

The routing table has vital information, which is used to select a route from one vehicle to a specific destination. When an update occurs in several places such as in recvRequest, recvReply method and so on in AODV.cc simulation implementation, the update must be checked to ensure that it satisfies two important conditions. The first condition is the sequence number (which is allocated on request packet and routing table or routing table and route replay whereas a newer sequence number is better). The second condition is the hop count, where a lower hop count is better. We may argue that the second condition alone is not appropriate for many city environments (especially the downtown). This is because it ignores the effect of various types of vehicles such as passenger vehicles, buses and so on. Hence, considering the lower number of hops (which means number of vehicles) on the road solely for choosing a route can be insufficient and/or unsuitable. Thus, for better and more beneficial routing, the vehicle type also has to be determined to match the vehicle to a specific behavior type.
Baca lebih lanjut

6 Baca lebih lajut

Ad hoc on demand distance vector AODV ro

Ad hoc on demand distance vector AODV ro

0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type |J|R|G|D|U| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | RREQ ID (broadcast id) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Baca lebih lanjut

30 Baca lebih lajut

Ad hoc On Demand Distance Vector AODV Ro (1)

Ad hoc On Demand Distance Vector AODV Ro (1)

0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type |J|R|G|D|U| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | RREQ ID (broadcast id) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Baca lebih lanjut

30 Baca lebih lajut

Ad hoc On Demand Distance Vector Routing (2)

Ad hoc On Demand Distance Vector Routing (2)

In addition to the source and destination sequence numbers, other useful information is also stored in the route table entries, and is called the soft-state asso- ciated with the entry. Associated with reverse path routing entries is a timer, called the route request ex- piration timer . The purpose of this timer is to purge reverse path routing entries from those nodes that do not lie on the path from the source to the destination. The expiration time depends upon the size of the ad- hoc network. Another important parameter associated with routing entries is the route caching timeout , or the time after which the route is considered to be invalid. In each routing table entry, the address of active neighbors through which packets for the given desti- nation are received is also maintained. A neighbor is considered active (for that destination) if it origi- nates or relays at least one packet for that destination within the most recent active timeout period. This in- formation is maintained so that all active source nodes can be notied when a link along a path to the des- tination breaks. A route entry is considered active if it is in use by any active neighbors. The path from a source to a destination, which is followed by pack- ets along active route entries, is called an active path . Note that, as with DSDV, all routes in the route table are tagged with destination sequence numbers, which guarantee that no routing loops can form, even under extreme conditions of out-of-order packet delivery and high node mobility (see Appendix A).
Baca lebih lanjut

11 Baca lebih lajut

IMPROVING PERFORMANCE OF MOBILE AD HOC N (2)

IMPROVING PERFORMANCE OF MOBILE AD HOC N (2)

2.1.1. Destination sequenced distance vector (DSDV). The Destination Sequenced Dis- tance Vector (DSDV) routing algorithm is the modification of the classic Distributed Bellman-Ford (DBF) algorithm. In MANET any node can act as a router and so each node maintains a routing table that lists all the nodes in the network of which it is aware. Each entry in the table contains the destination and the next hop addresses as well as the cost (in terms of hops) to get to the destination. The reason DSDV is an improvement of the original wired network protocol is that, it avoids DBF’s tendency to create routing loops. Each entry in the routing table and protocol message update is marked with a se- quence number. This number is maintained by the destination node of a route entry and is increased whenever the node publishes its routing information. The sequence number value is used by all other nodes in the network to determine the “freshness” of the infor- mation contained in a route update for the destination. Since the value is sequentially incremented, a higher sequence number implies that the routing information is newer [12]. In order to maintain the routing information consistency in the network, each router shares its routing table with its neighbours by means of routing updates. These updates are performed in periodic and triggered form. Updated DSDV uses this method with the aim of alleviating the potentially large amount of network traffic that will be induced by the routing updates. In a periodic update that occurs at predetermined regular time intervals, a node broadcasts its entire routing table in a packet termed as a full dump [13]. Significant topological change is noticed by triggering incremental routing updated packets. The change could be either due to node mobility or link breakages to next hop neighbours. The incremental updated packets only contain those entries which have changed since the last periodic update. These triggered updates with smaller packet size results in reduced overhead incurred by the protocol. A route table update entry contains the destination address of a node, the cost to reach it and the highest known sequence number for the destination. When a node receives an entry for a particular destination with a higher sequence number its old entry is replaced with the newer route. In the case where a node has to choose between two entries with the same sequence number, it selects the path with the least cost. An intermediate node that detects a broken route to a destination assigns an infinity value to the route’s path cost, increments the entry destination sequence number and immediately broadcasts the information as an update. Using this technique critical network topology information such as link breakages is disseminated quickly across the network [14].
Baca lebih lanjut

15 Baca lebih lajut

Ad hoc on demand distance vector routing (1)

Ad hoc on demand distance vector routing (1)

0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type |J|R|G|D|U| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | RREQ ID (broadcast id) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Baca lebih lanjut

30 Baca lebih lajut

Ad hoc on demand distance vector routing (2)

Ad hoc on demand distance vector routing (2)

0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type |J|R|G|D|U| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | RREQ ID (broadcast id) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Baca lebih lanjut

30 Baca lebih lajut

Ad hoc on demand distance vector aodv ro (4)

Ad hoc on demand distance vector aodv ro (4)

0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type |J|R|G|D|U| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | RREQ ID (broadcast id) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Baca lebih lanjut

29 Baca lebih lajut

Ad hoc On Demand Distance Vector AODV Ro (2)

Ad hoc On Demand Distance Vector AODV Ro (2)

0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type |J|R|G|D|U| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | RREQ ID (broadcast id) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Baca lebih lanjut

29 Baca lebih lajut

Ad hoc on demand distance vector aodv ro (3)

Ad hoc on demand distance vector aodv ro (3)

0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type |J|R|G|D|U| Reserved | Hop Count | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | RREQ ID (broadcast id) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Destination Sequence Number | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator IP Address | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Baca lebih lanjut

29 Baca lebih lajut

Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence.

Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence.

This section starts with some modifications from the FUHS16 algorithm. In this section, the UHDS16 technique is introduced. This technique is developed to have unrestricted search. To achieve this, a simple and efficient fast block-matching algorithm based on hexagon- diamond search shape is proposed. UHDS16 is designed uniquely with a large hexagon shape and shrink diamond search step (SDSS). Large hexagon is more unique to identify the motion vector in the small region of large hexagon shape. Finally, the shrink diamond search step is to locate the best-matched motion vector in the large hexagon small region. Experimental results show that the proposed UHDS16 algorithm significantly produces smaller computation complexity.
Baca lebih lanjut

34 Baca lebih lajut

1  BAB I PENDAHULUAN 1.1 Latar Belakang Masalah

1  BAB I PENDAHULUAN 1.1 Latar Belakang Masalah

Turis mendapatkan informasi mengenai objek wisata apa saja yang ada pada negara destinasi yang sedang ia kunjungi melalui brosur, surat kabar, atau petugas informasi. Assaker (2011) menyatakan bahwa dari informasi yang di dapat, turis dapat mempunyai gambaran keseluruhan mengenai Destination image dari perjalanan wisatanya pada saat turis melakukan kunjungan pada objek wisata tersebut. Destination image merupakan inti dari suatu perjalanan wisata dimana para turis mempunyai persepsi yang berbeda- beda mengenai apa yang turis lihat dari sebuah destinasi yang dikunjungi. Turis dapat menilai Destination image dari sebuah negara dari wisata alam, tempat bersejarah, pantai, infrastruktur, cuaca, fasilitas perbelanjaan, hingga penilaian mengenai karakteristik penduduk lokal.
Baca lebih lanjut

17 Baca lebih lajut

Show all 3987 documents...