Please use this identifier to cite or link to this item:
|Title:||Breadth fixed gossip: a route discovery mechanism in ad hoc network|
Mauridhi Hery Purnomo
|Keywords:||Route Discovery;Breadth First Search;Gossip;Fixed Radius;Wireless;Ad Hoc Network|
|Publisher:||Praise Worthy Prize|
|Abstract:||The lack of information from a root node to neighbors becomes a particular constraint in a message delivery. While the transmission range of node needs to be considered also for ensuring a delivered packet message to them. Therefore, a route discovery mechanism is a good start to make a reliable path in an unknown environment. The objective of this study is to explore the implementation of Breadth First Search, fixed radius model, and gossip algorithms (Breadth Fixed Gossip) on the ad hoc network. Simulations were conducted to obtain the value of three metrics i.e. saved re-transmission, transmission failure, and hop counts. These results were compared with Depth First Search and Gossip performance. It indicates that saved re-transmission metric Breadth Fixed Gossip has a 58 times better performance, reduces transmission failure by 20%, and requires 50% more hops at transmission range below 15 than Depth First Search and Gossip.|
|Appears in Collections:||Publisher Version|
Items in UINJKT-IR are protected by copyright, with all rights reserved, unless otherwise indicated.