• Title/Summary/Keyword: aodv

Search Result 311, Processing Time 0.029 seconds

Performance Analysis of Ad hoc Networks on Real world Test-bed for High Speed Video Streaming (고속 영상 데이터 전송을 위한 애드혹 네트워크의 테스트베드 기반 성능 분석)

  • Ahmed, Md Shohel;Yoon, Seokhoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.3
    • /
    • pp.141-150
    • /
    • 2013
  • Simulation is an important technique to test and verify routing protocol correctness. However, simulation does not guarantee that the protocol works expectedly on a real world environment because it needs to rely on assumptions and simplified properties such as radio characteristics and effects of geographical constraints that may not reflect the real world networking environments. Therefore, a real world experiments are necessary to gain a practical insight into the actual performance of ad hoc networks. In this paper, we build a test-bed to evaluate multi-hop ad hoc networks for high speed video streaming inside a building using AODV-UU routing protocol. Our observation indicates that the considered ad hoc network can provide a sufficient performance for a low rate streaming data in terms of throughput, PDR (Packet delivery ratio) and the average delay.

PUF-based Secure FANET Routing Protocol for Multi-Drone

  • Park, Yoon-Gil;Lee, Soo-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.9
    • /
    • pp.81-90
    • /
    • 2020
  • In order to operate multi drone efficiently, existing control methods must be improved, and drones must be able to construct communication networks autonomously. FANET(Flying Ad-Hoc Network), which is being considered as an alternative to solving these problems, is based on ad hoc network technology and can be exposed to a variety of security vulnerabilities. However, due to the limited computational power and memory of FANET nodes, and rapid and frequent changes in network topology, it is not easy to apply the existing security measures to FANET without modification. Thus, this paper proposes lightweight security measures applicable to FANET, which have distinct characteristics from existing ad hoc networks by utilizing PUF technology. The proposed security measures utilize unique values generated by non-replicable PUFs to increase the safety of AODV, FANET's reactive routing protocol, and are resistant to various attacks.

Reliable Transmission of Bio-Data for IEEE 11073 PHD Standards at 6LoWPAN Multi-Hop Wireless Sensor Networks (6LoWPAN 멀티-홉 무선 센서 네트워크에서의 IEEE 11073 PHD 표준을 위한 신뢰성 있는 생체 정보 전송)

  • Woo, Yeon Kyung;Park, Jong Tae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.10
    • /
    • pp.116-123
    • /
    • 2013
  • In mobile healthcare applications, the reliable transmission of the bio-data is very important. In this article, we present a reliable bio-data transmission technique for mobile healthcare monitoring service at 6LoWPAN multi-hop wireless networks. In particular, we expand IEEE 11073-20601 protocol, and propose the reliable path construction for 6LoWPAN aimed to reliably provide mobile healthcare service over wireless sensor network, using IPv6 network. 6LoWPAN is recognized possibility because it is agree with sensor network by raising Adaptation layer on the MAC layer to transmit IPv6 packets. In this article proposed minimize the algorithm complexity and reliability routing protocol because the 6LoWPAN devices are suitable for low cost, small size and battery that can be used to health care system environment. And detailed procedures and algorithms are presented. We the proposed method to prove the superiority of using NS-3 for compareing with AODV protocol.

An Energy Efficient Routing Protocol for Unicast in Wireless Sensor Networks (무선 센서 네트워크에서 유니캐스트를 위한 에너지 효율적인 라우팅 프로토콜)

  • Han, Uk-Pyo;Lee, Hee-Choon;Chung, Young-Jun
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.4
    • /
    • pp.262-268
    • /
    • 2007
  • The efficient node-energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing total energy consumption of the overall network. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. In this paper, we submit an efficient energy aware routing protocol based on AODV ad hoc routing protocol for wireless sensor networks to increase its lifetime without degrading network performance. The proposed protocol is designed to avoid traffic congestion on minor specific nodes at data transfer and to make the node power consumption be widely distributed to increase the lifetime of the network. The performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of network lifetime and end-to-end delay.

Routing Table Protection From an Attack to Falsify Hop Count in Mobile Ad-hoc Networks (모바일 애드 혹 네트워크(Mobile Ad-hoc Networks)에서 홉 카운트 변조 공격으로부터의 라우팅 테이블 보안)

  • Kim, Jin-Hee;Lee, Jae-Hyun;Kwon, Kyung-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.7
    • /
    • pp.43-52
    • /
    • 2008
  • The AODV routing algorithm in a mobile ad-hoc networks broadcasts RREQ packet to find a route from a source to a destination. An attacker node may intercept a RREQ packet and attack by falsifying a field in that packet. In this paper, we propose a simply modified method which can protect a routing table from an attack to falsify the hop count field in the RREQ packet. When establishing a connection between a source and a destination, we update routing table of each node on the connection based on minimum delay instead of minimum hop count. By doing this, we can protect routing table from an attack to falsify a hop count Our simulation is implemented in Network Simulator(NS-2). We analyze how an attacker affects the mobile ad-hoc networks. The result of the simulation shows that the proposed mechanism transfers a data securely.

Secure Routing with Time-Space Cryptography for Mobile Ad-Hoc Networks (이동 애드혹 망을 위한 시공간 방식의 보안 라우팅 프로토콜)

  • Joe, In-Whee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.11-16
    • /
    • 2007
  • This paper describes the design and performance of a secure routing protocol with time-space cryptography for mobile ad-hoc networks. The proposed time-space scheme works in the time domain for key distribution between source and destination as well as in the space domain for intrusion detection along the route between them. For data authentication, it relies on the symmetric key cryptography due to high efficiency and a secret key is distributed using a time difference from the source to the destination. Also, a one-way hash chain is formed on a hop-by-hop basis to prevent a compromised node or an intruder from manipulating the routing information. In order to evaluate the performance of our routing protocol, we compare it with the existing AODV protocol by simulation under the same conditions. The proposed protocol has been validated using the ns-2 network simulator with wireless and mobility extensions.

Design and Performance Analysis of Multi-hop Routing Protocol for WiMedia (WiMedia를 위한 멀티홉 라우팅 프로토콜 개발 및 성능분석)

  • Jung, Jin-Uk;Lee, Seung-Jin;Jin, Kyo-Hong;Hwang, Min-Tae;Jeon, Young-Ae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1406-1415
    • /
    • 2012
  • Though WiMedia supports the higher data rates than other WPAN technologies, a WiMedia device cannot reach other devices which are apart from it more than 10 meter; the limited transmission range of the WiMedia protocol. In this paper, we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that is located out of transmission range. The proposed routing protocol is a hybrid routing protocol, which is the mixed protocol of table-driven and on-demand routing algorithm. In the proposed protocol, a route for a device within 2-hop is established by using the table-driven routing algorithm and a route for the device beyond 2-hop is established by using the on-demand routing algorithm. We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV. The simulation results show that the proposed protocol's performance is better than AODV and DSDV in terms of the throughput and delay.

A Study on Security Routing using MD5 in MANET Environments (MANET 환경에서 MD5를 이용한 보안 라우팅에 관한 연구)

  • Lee, Cheol-Seung;Jung, Sung-Ok;Lee, Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.728-731
    • /
    • 2008
  • Recently demands in construction of the stand-alone networks and interconnection between convergence devices have led an increase in research on IETF MANET working group, Bluetooth, and HomeRF working group and much attention has been paid to the application of MANET as a Ubiquitous network which is growing fast. With performance both as hosts and routers, easy network configuration, and fast response, mobile nodes participating in MANET are suitable for Embedded computing, but have vulnerable points, such as lack of network scalability and dynamic network topology due to mobility, passive attacks, active attacks, which make continuous security service impossible. For perfect MANET setting, routing is required which can guarantee security and efficiency through secure routing. In routing in this study, hashed AODV is used to protect from counterfeiting messages by malicious nodes in the course of path 'finding and setting, and disguising misrouted messages as different mobile nodes and inputting them into the network.

  • PDF

Ad-hoc Security Authentication Technique based on Verifier (검증자 기반 Ad-hoc 보안 인증기법)

  • Lee, Cheol-Seung;Hong, Seong-Pyo;Lee, Ho-Young;Lee, Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.713-716
    • /
    • 2007
  • This paper suggests One-time Password key exchange authentication technique for a strong authentication based on Ad-hoc Networks and through identify wireless environment security vulnerabilities, analyzes current authentication techniques. The suggested authentication technique consists of 3 steps: Routing, Registration, and Running. The Routing step sets a safe route using AODV protocol. The Registration and Running step apply the One-time password S/key and the DH-EKE based on the password, for source node authentication. In setting the Session key for safe packet transmission and data encryption, the suggested authentication technique encrypts message as H(pwd) verifiers, performs key exchange and utilizes One time password for the password possession verification and the efficiency enhancement. EKE sets end to end session key using the DH-EKE in which it expounds the identifier to hash function with the modula exponent. A safe session key exchange is possible through encryption of the H(pwd) verifier.

  • PDF

The establishment of Proactive Routing Selection and Maintenance Algorithms for Mobile Ad Hoc Networks (이동 Ad Hoc 네트워크에서 사전 활성화 라우팅 선택과 관리유지 알고리즘의 구축)

  • Cho, Young-Joo;Lee, Yeo-Jin;Chung, Il-Yong
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.73-80
    • /
    • 2007
  • In conventional on-demand mobile ad hoc routing algorithms, an alternate path is sought only after an active path is broken. It incurs a significant cost in terms of money and time in detecting the disconnection and establishing a new route. In this thesis, we propose proactive route selection and maintenance to conventional mobile ad hoc on-demand routing algorithms. The key idea for this research is to only consider a path break to be likely when the signal power of a received packet drops below an optimal threshold value and to generate a forewarning packet. In other words, if a path is lost with high probability, the neighboring node that may easily be cut off notifies the source node by sending a forewarning packet. Then the source node can initiate route discovery early and switched to a reliable path potentially avoiding the disconnection altogether. For the simulational study, network simulator(NS2) is used. The result of simulation shows that the algorithm significantly improves the performance of networks comparing to conventional on-demand routing protocols based on DSR and AODV in terms of packet delivery ratio, packet latency and routing overhead.