• 제목/요약/키워드: DSR : Dynamic Source Routing

검색결과 48건 처리시간 0.025초

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

  • 손혜정;권태욱
    • 한국군사과학기술학회지
    • /
    • 제12권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.

이동 애드혹 네트워크에서 신뢰성 향상을 위한 액티브 기반연구 (The Study Active-based for Improvement of Reliablity In Mobile Ad-hoc Network)

  • 박경배;강경인;유재휘;김진용
    • 한국컴퓨터정보학회논문지
    • /
    • 제7권4호
    • /
    • pp.188-198
    • /
    • 2002
  • 본 논문에서는 이동 애드혹 네트워크에서 신뢰성 향상을 위한 액티브 네트워크를 제안하였다. 제안된 알고리즘에서는 DSR을 기본 프로토콜로서 액티브네트워크를 구성하였고, 송수신 노드를 액티브 노드로서 이용하였다. 신뢰성 향상을 위해 송신노드는 최근 보낸 데이터를 저장할 임시 버퍼를 생성한 후 수신노드의 요구에 의해 데이터 재전송을 수행하며 수신노드 당 흐름관리를 할 수 있는 기능을 추가하여 송신 액티브노드로 기능을 변경하였다. 수신노드는 손실된 데이터에 대한 재 전송요구와 흐름제어 기능을 추가하는 수신 액티브노드로 기능을 변경하였다. 그 결과로서, 제안된 액티브 노드는 움직임이 적은 이동 애드혹 네트워크에서는 100[%]에 근접하는 신뢰성을 보였고, 움직임이 많은 이동 애드혹 네트워크에서 보다 평균 3.5737% 증가한 95%의 데이터 수신율을 보장하였다.

  • PDF

ARM: Anticipated Route Maintenance Scheme in Location-Aided Mobile Ad Hoc Networks

  • Park Seungjin;Yoo Seong-Moo;Al-Shurman Mohammad;VanVoorst Brian;Jo Chang-Hyun
    • Journal of Communications and Networks
    • /
    • 제7권3호
    • /
    • pp.325-336
    • /
    • 2005
  • Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

Wireless sensor network protocol comparison for bridge health assessment

  • Kilic, Gokhan
    • Structural Engineering and Mechanics
    • /
    • 제49권4호
    • /
    • pp.509-521
    • /
    • 2014
  • In this paper two protocols of Wireless Sensor Networks (WSN) are examined through both a simulation and a case study. The simulation was performed with the optimized network (OPNET) simulator while comparing the performance of the Ad-Hoc on demand Distance Vector (AODV) and the Dynamic Source Routing (DSR) protocols. This is compared and shown with real-world measurement of deflection from eight wireless sensor nodes. The wireless sensor response results were compared with accelerometer sensors for validation purposes. It was found that although the computer simulation suggests the AODV protocol is more accurate, in the case study no distinct difference was found. However, it was shown that AODV is still more beneficial in the field as it has a longer battery life enabling longer surveying times. This is a significant finding as a large factor in determining the use of wireless network sensors as a method of assessing structural response has been their short battery life. Thus if protocols which enhance battery life, such as the AODV protocol, are employed it may be possible in the future to couple wireless networks with solar power extending their monitoring periods.

무선 이동 AD-Hoc 네트워크에서 밀집된 트래픽에 적합한 라우팅 프로토콜 (Suitable Routing Protocol for Dense Traffic In Wireless Mobile Ad-Hoc Networks)

  • 오세인;장정규;박용진
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2005년도 가을 학술발표논문집 Vol.32 No.2 (1)
    • /
    • pp.349-351
    • /
    • 2005
  • 본 논문에서는 몇 개의 노드로 트래픽이 집중되는 좀더 현실적인 트래픽 환경에 적합한 라우팅 프로토콜을 제안한다. 밀집된 트래픽이 몇명의 Destination에게 집중될 때 이러한 노드들로의 경로를 신선하게 유지함으로써 데이터를 전송할 때 전송 지연을 줄이는 방법을 제시한다. 제안된 라우팅 프로토콜은 모든 On-Demand 라우팅 프로토콜 위에서 동작이 가능하며, 이 논문에서는 DSR(Dynamic Source Routing) 라우팅 프로토콜 위에서 동작하도록 모의실험을 진행하였다.

  • PDF

A Sinkhole Detection Method based on Incremental Learning in Wireless Ad Hoc Networks

  • Kim, Ki-Sung;Kim, Se-Hun
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2007년도 추계학술대회 및 정기총회
    • /
    • pp.377-382
    • /
    • 2007
  • Mobile ad hoc network(MANET) is a kind of wireless network which has no infrastructure. Each component node of MANET can move freely and communicate based on wireless peer to peer mode. Because of its vulnerable routing protocols, MANET is exposed to many kinds of attacks. A sinkhole attack is one of the representative attacks in MANET caused by attempts to draw all network traffic to a sinkhole node. This paper focuses on the sinkhole problem on Dynamic Source Routing(DSR) protocol in MANET. To detect the sinkhole node, we extract several useful sinkhole indicators through analyzing the sinkhole problem, then propose an efficient detection method based on an incremental learning algorithm. The simulation results show that the proposed method is effective and reliable for detecting sinkhole intrusion.

  • PDF

이동 애드혹 네트워크에서의 부하 균등화 및 공평성 지원 방법 (Load-Balancing and Fairness Support Mechanisms in Mobile Ad Hoc Networks)

  • 안상현;유영환;임유진
    • 정보처리학회논문지C
    • /
    • 제11C권7호
    • /
    • pp.889-894
    • /
    • 2004
  • AODV(Ad Hoc On-Demand Distance Vector)나 DSR(Dynamic Source Routing)과 같은 대부분의 에드혹 라우팅 프로토콜은 네트워크 토폴로지가 변하지 않는 한 새로운 경로 설정을 하지 않는다. 따라서 노드의 이동성이 적은 경우, 트래픽은 몇몇 노드에게 집중될 수 있으며 그 결과로 해당 노드들의 혼잡으로 인한 긴 종단간 지연이 발생할 수 있다. 게다가 몇몇 특정 노드들만 오랫동안 계속해서 사용됨에 따라 그들의 배터리가 빠르게 소모될 것이다. 노드의 배터리 방전은 노드 사이의 연결 단절뿐만 아니라 동시에 새로운 경로 설정을 위하여 많은 route re-quest 패킷(RREQ)을 생성시킨다. 본 논문에서는 각 노드가 자신의 트래픽 부하 상태를 기반으로 RREQ 패킷을 무시하거나 패킷 포워딩을 포기할 수 있게 함으로써 트래픽 집중화 문제를 해결할 수 있는 SLA(Simple Load-balancing Approach)를 제안한다. 그러나 어떤 이기적인 노드들은 자신의 에너지를 절약하기 위하여 고의적으로 패킷 포워딩을 거부할 수도 있다. 이러한 노드들을 패킷 포워딩에 참여시키기 위하여 본 논문에서는 PIFA(Protocol-Independent Fairness Algorithm) 보상 방식을 제안하였다. SLA 성능의 우수함을 증명하기 위하여 SLA를 채택한 AODV 방식과 SLA를 채택하지 않은 AODV 방식을 비교 실험하였고, 이를 통하여 SLA를 채택한 방식이 트래픽 부하 분산에 효율적이며 이로 인하여 전체 에드혹 네트워크 성능 또한 향상시킴을 확인하였다.

지능형 멀티 에이전트 로봇시스템을 위한 통신시스템의 설계 (Design of Communication System for Intelligent Multi Agent Robot System)

  • 김준엽;박승민;고광은;장인훈;심귀보
    • 제어로봇시스템학회논문지
    • /
    • 제18권8호
    • /
    • pp.758-767
    • /
    • 2012
  • In the ad-hoc wireless network environment, that the fixed sensor nodes and the sensor nodes to move are mixed, as the number of the sensor nodes with mobility are getting more, the costs to recover and maintain the whole network will increase more and more. This paper proposed the CDSR (Cost based Dynamic Source Routing) algorithm being motivated from the typical DSR algorithm, that is one of the reactive routing protocol. The cost function is defined through measuring the cost which any sensor node pays to participate in the whole network for communication. It is also showed in this paper that the proposed routing algorithm will increase the efficiency and life of whole sensor network through a series of experiments.