Untitled

Nasipuri, Asis; Castaneda, R.; Das, Samir R.

doi:10.1023/a:1011426611520

Cited by 349 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Setelah itu node asal mengirim paket Route Request (RREQ) ke semua node tetangga miliknya untuk mencari rute. Node tetangga yang juga disebut node intermediate akan melakukan cara yang sama lalu meneruskan paket RREQ ke node tetangganya juga sampai paket RREQ tiba di node tujuan [2]. Node tujuan yang menerima RREQ akan membalas dengan menggunakan paket Route Reply (RREP) melalui node intermediate hingga ke node asal.…”

Section: Pendahuluanunclassified

Meningkatkan Kinerja Protokol Routing Aomdv Dalam Memilih Node Tetangga Berdasarkan Bandwidth, Round Trip Time, Dan Packet Loss Ratio Untuk Menemukan Rute Terbaik

Parwata¹,

Jatmika

Zubaidi

2022

J-Cosine

View full text Add to dashboard Cite

Mobile ad hoc network or in short MANET is a group of node that exchange the information from source node to destination node on wireless network. The main problem in MANET is on the network structure that change continously that is cause by node mobility that made route disconnected. If route disconnect there will be another route discovery processes that will take much time. AOMDV (Ad hoc On-demand Multipath Distance Vector) routing protocol works by doing broadcast Route Request Packet (RREQ) from source node to neighbor node (intermediate node) and then it will continously until it arrives to destination node. AOMDV didnt choose the best neighbor node while broadcast RREQ packet so the route constructed have high possibility to disconnected and must re-broadcast until it find stable route and it will be a long time and not effective. To solve this problem it proposed to add a modification with AOMDV routing protocol with calculation of bandwidth, round trip time, and packet loss ratio to choose neighbor node to find the best route. Routing protocol performance will tested using test parameter throughput, delay, and packet delivery ratio to choose the best neighbor node. Based on test result, the proposed modification can improve the preformance of AOMDV routing protocol. After modification, average throughput has improved 43.26 %, Packet Delivery Ratio (PDR) improved 3.15 % and average end-to-end delay reduce 31.26%.

show abstract

Section: Pendahuluanunclassified

Meningkatkan Kinerja Protokol Routing Aomdv Dalam Memilih Node Tetangga Berdasarkan Bandwidth, Round Trip Time, Dan Packet Loss Ratio Untuk Menemukan Rute Terbaik

Parwata¹,

Jatmika

Zubaidi

2022

J-Cosine

View full text Add to dashboard Cite

show abstract

“…Some routing protocols achieve fault tolerance by providing multiple path [24–29]. Multipath can improve communication reliability, realize load-balancing, and relieve congestion.…”

Section: Related Workmentioning

confidence: 99%

Reliable Graph Routing in Industrial Wireless Sensor Networks

Zhao

Qin

Yang

et al. 2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Research studies on smart cities have been conducted, which will enable a better management of the available resources. Industrial wireless sensor networks (IWSNs) are important part of smart city. IWSNs are used for process measurement and control applications in harsh and noisy industrial environments. As substitutes for traditional wired industrial networks, IWSNs are more flexible, scalable, and efficient. However, resource limitation of the sensor nodes and unreliability of low-power wireless links, in combination with stringent quality of the service (QoS) requirements of industrial applications, imposes many challenges in designing efficient routing for IWSNs. Existing standards propose a simple and reliable routing mechanism named graph routing. In this paper, we propose novel routing algorithms to discover reliable paths and construct reliable routing graphs. In our approaches, the centralized manager selects parent nodes for each node in the network to satisfy reliability requirements of the intended application. We try to maximize the number of reliable nodes and change the parent nodes selection strategy along with the link quality and the link correlation. Our design is evaluated using simulation where we show that our algorithm could achieve a balance between routing reliability and overhead.

show abstract

“…Based on this information, each node finds the locations of some affected regions caused by wormholes and stop forwarding packets which came from those regions to isolate the wormhole (Nasipuri et al, 2001;Pirzada and McDonald, 2004). The distribution wormhole detection algorithm can be further classified into two approaches, namely, non-routing neighboring monitoring based approach (Huang and Lee, 2003) where each node monitors the topology structure of its neighbors (Wang et al, 2010;Maheshwari et al, 2007), or the inputs and outputs data flows (Khalil et al, 2005;2008) and routing receiver monitoring based approach where a data packet is monitored by the nodes in its routine.…”

Section: Jcsmentioning

confidence: 99%

Performance Evaluation of Wormhole Security Approaches for Ad-Hoc Networks

Hababeh

Khalil²,

Khreishah

et al. 2013

Journal of Computer Science

View full text Add to dashboard Cite

Ad-hoc networks are talented but are exposed to the risk of wormhole attacks. However, a wormhole attack can be mounted easily and forms stern menaces in networks, particularly against various ad-hoc wireless networks. The Wormhole attack distorts the network topology and decrease the network systems performance. Therefore, identifying the possibility of wormhole attacks and recognizing techniques to defend them are central to the security of wireless networks as a whole. In this study, we will summarize state of the art wormhole defense approaches, categories most of the existing typical approaches and discuss both the advantages and disadvantages of these methods. We will also point out some unfulfilled areas in the wormhole problem and provide some directions for future exploring.

show abstract

Untitled

Cited by 349 publications

References 12 publications

Meningkatkan Kinerja Protokol Routing Aomdv Dalam Memilih Node Tetangga Berdasarkan Bandwidth, Round Trip Time, Dan Packet Loss Ratio Untuk Menemukan Rute Terbaik

Meningkatkan Kinerja Protokol Routing Aomdv Dalam Memilih Node Tetangga Berdasarkan Bandwidth, Round Trip Time, Dan Packet Loss Ratio Untuk Menemukan Rute Terbaik

Reliable Graph Routing in Industrial Wireless Sensor Networks

Performance Evaluation of Wormhole Security Approaches for Ad-Hoc Networks

Contact Info

Product

Resources

About