• Title/Summary/Keyword: DSR : Dynamic Source Routing

Search Result 48, Processing Time 0.026 seconds

A Simulation Modeling for the Effect of Resource Consumption Attack over Mobile Ad Hoc Network

  • Raed Alsaqour;Maha Abdelhaq;Njoud Alghamdi;Maram Alneami;Tahani Alrsheedi;Salma Aldghbasi;Rahaf Almalki;Sarah Alqahtani
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.9
    • /
    • pp.111-119
    • /
    • 2023
  • Mobile Ad-hoc Network (MANET) is an infrastructure-less network that can configure itself without any centralized management. The topology of MANET changes dynamically which makes it open for new nodes to join it easily. The openness area of MANET makes it very vulnerable to different types of attacks. One of the most dangerous attacks is the Resource Consumption Attack (RCA). In this type of attack, the attacker consumes the normal node energy by flooding it with bogus packets. Routing in MANET is susceptible to RCA and this is a crucial issue that deserves to be studied and solved. Therefore, the main objective of this paper is to study the impact of RCA on two routing protocols namely, Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR); as a try to find the most resistant routing protocol to such attack. The contribution of this paper is a new RCA model (RCAM) which applies RCA on the two chosen routing protocols using the NS-2 simulator.

A Study on Routing Protocol using C-NODE for Mobile Ad-Hoc Networking (Mobile Ad-hoc Networking에서의 C-NODE를 이용한 Routing Protocol에 관한 연구)

  • Choi, Bong-Han
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.195-201
    • /
    • 2006
  • This thesis proposes hybrid routing protocol that mix proactive routing protocol and reactive routing protocol used in Ad hoc network. Proposed method is that establish special node offering network service of nods which construct Ad hoc network and do routing different from existing hybrid routing protocol, ZRP. Special node doing these parts is called C-node. Routing using C-node can accompany efficient routing by decreasing path institution time and flooding time than existing routing protocol.

  • PDF

Optimal Routing Path Selection Algorithm in Ad-hoc Wireless Sensor Network (Ad-hoc 센서네트워크를 위한 최적 라우팅 경로 설정 알고리즘)

  • Jang In-Hun;Sim Kwee-Bo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.403-408
    • /
    • 2005
  • 다단계 호핑(multi-hop) 무선 센서네트워크의 라우팅 경로를 설정하는데 있어서 데이터 전송의 요구가 있는 경우에만 경로를 만드는 Demand-Driven 방식의 대표적인 방법이 DSR(Dynamic Source Routing)인데 라우트 레코드를 패킷에 실어 보내기 때문에 이 또한 센서노드들의 수가 많아질수록 패킷이 무거워질 수밖에 없다. 본 논문에서는 DSR 프로토콜을 기반 하면서도 라우팅 테이블을 적절히 이용하여 노드 수 증가에 대해 고정된 패킷크기를 가지도록 하였으며 라우팅 비용함수를 적용하여 각 센서노드들의 전원 소모량, 이동성(Mobility), 네트워크 내에서의 Traffic, 거리(Hop) 등을 복합적으로 고려한 안정적이고 신뢰성 있는 최적의 라우팅 설정 알고리즘을 제안한다.

  • PDF

On Optimizing Route Discovery of Topology-based On-demand Routing Protocols for Ad Hoc Networks

  • Seet, Boon-Chong;Lee, Bu-Sung;Lau, Chiew-Tong
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.266-274
    • /
    • 2003
  • One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

Effective Power Saving Algorithm under Dynamic Source Routing (동적 소스 라우팅에서의 효율적인 파워 세이빙 알고리즘)

  • 정다운;노원종;한규호;임경수;안순신
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.745-747
    • /
    • 2004
  • 배터리 파워는 모바일 애드 혹 네트워크(Mobile Ad hoc Network)에서 중요한 리소스이다. 기존의 라우팅 알고리즘에서는 노드의 파워를 on-off 시키는 방법으로 파워를 관리해왔다. 본 논문에서는 DSR (dynamic source routing)에서 route discovery, route maintenance를 할 때 각 노드의 배터리 파워 레벨을 고려하여 파워 레벨이 낮은 노드들은 RREP packet을 보내지 않음으로써 소스에서 데스티네이션까지의 경로를 오래 유지시킬 수 있고, 또한 파워 레벨이 높은 하나의 노드에 트래픽이 집중되지 않도록 하기 위해 큐(queue)에 담겨있는 트랜스미션패킷과 리시브 패킷의 수까지 고려하여 경로를 설정한다. 이 알고리즘을 이용함으로써 각 노드의 파워를 효율적으로 관리함은 물론, 전체 네트워크의 load 균형을 맞춤으로 네트워크의 수명을 길게 할 수 있다.

  • PDF

Simplified ANonymous Dynamic Source Routing Scheme for Ad-hoc Networks (SANDSR) (애드혹 네트워크에서의 간소화된 익명성 DSR 기법)

  • Kong, Chun-Um;Choo, Hyun-Seung
    • Annual Conference of KIPS
    • /
    • 2007.05a
    • /
    • pp.1102-1103
    • /
    • 2007
  • 적대적이고 급변하는 애드혹 네트워크에서 각 노드들은 항상 적대적인 공격자들로부터 위조나 변조의 공격을 받을 수 있어서 통신 내용과 경로의 보안성이 필요하다. AnonDSR 기법은 보안성을 유지하면서 익명성을 효율적으로 보장하는 것으로 알려져 있지만 기존 기법에 비해 암호키를 설립하는 추가적인 절차를 수행하므로 통신 수행시간이 길어지는 문제가 발생한다. 제안 기법에서는 암호키 설립 단계와 통신경로를 설정하는 단계를 동시 수행하고 데이터 전송시에는 공유키로 암호화를 추가적으로 수행해서 보안 강도를 높인다. 결과적으로 제안기법은 AnonDSR 에 비해 매번 통신 수행시간이 최대 31% 향상되고 보안성도 강화된다.

Improved Ad Hoc On-demand Distance Vector Routing(AODV) Protocol Based on Blockchain Node Detection in Ad Hoc Networks

  • Yan, Shuailing;Chung, Yeongjee
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.46-55
    • /
    • 2020
  • Ad Hoc network is a special wireless network, mainly because the nodes are no control center, the topology is flexible, and the networking could be established quickly, which results the transmission stability is lower than other types of networks. In order to guarantee the transmission of data packets in the network effectively, an improved Queue Ad Hoc On-demand Distance Vector Routing protocol (Q-AODV) for node detection by using blockchain technology is proposed. In the route search process. Firstly, according to the node's daily communication record the cluster is formed by the source node using the smart contract and gradually extends to the path detection. Then the best optional path nodes are chained in the form of Merkle tree. Finally, the best path is chosen on the blockchain. Simulation experiments show that the stability of Q-AODV protocol is higher than the AODV protocol or the Dynamic Source Routing (DSR) protocol.

Study on Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (이동 Ad Hoc 망에 대한 동적 소스 라우팅 프로토콜에 관한 연구)

  • 하재승
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.9
    • /
    • pp.1219-1224
    • /
    • 2001
  • There can exist unidirectional links due to asymmetric property of mobile terminals or current wireless environments on practical mobile ad hoc networks. However, at present, the existing mobile ad hoc routing protocols are implemented to support only bidirectional links. Thus, in this paper, we extend the existing dynamic source routing protocol in order to implement a new routing protocol, which is fit to mobile ad hoc networks containing unidirectional links. For performance evaluation, we use combinations of mobility scenario files and connection pattern files from Carnegimelon Univ. We consider received data rate and average route discovery time as evaluation items, which are compared and evaluated for three suggested route discovery methods.

  • PDF

Route Selection Protocol based on Energy Drain Rates in Mobile Ad Hoc Networks (무선 Ad Hoc 통신망에서 에너지 소모율(Energy Drain Rate)에 기반한 경로선택 프로토콜)

  • Kim, Dong-Kyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.451-466
    • /
    • 2003
  • Untethered nodes in mobile ad-hoc networks strongly depend on the efficient use of their batteries. In this paper, we propose a new metric, the drain rate, to forecast the lifetime of nodes according to current traffic conditions. This metric is combined with the value of the remaining battery capacity to determine which nodes can be part of an active route. We describe new route selection mechanisms for MANET routing protocols, which we call the Minimum Drain Rate (MDR) and the Conditional Minimum Drain Rate (CMDR). MDR extends nodal battery life and the duration of paths, while CMDR also minimizes the total transmission power consumed per packet. Using the ns-2 simulator and the dynamic source routing (DSR) protocol, we compare MDR and CMDR against prior proposals for power-aware routing and show that using the drain rate for power-aware route selection offers superior performance results.

Evaluation of MANET Protocol Scheme for TICN System (TICN체계하 MANET 프로토콜 분석)

  • Son, Hye-Joung;Kwon, Tae-Wook
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.12 no.4
    • /
    • pp.469-475
    • /
    • 2009
  • TMMR(Tactical Multiband Multirole Radio) is one of the important equipments for TICN which is our next military tactical communication system and it supplies to the distribution of traffic of C2(Command & Control) and SA(Situation Awareness) for unit of Brigade and below. In this paper, we define the tactical needs of military communication, and evaluate MANET(Mobile Ad-hoc Network) protocol for the future digital battle-field through performance comparison with a network simulator.