• Title/Summary/Keyword: 이동 애드혹 망

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

Design and Evaluation of Fuzzy-Logic based Quorum System considering the Gravity of Locality of Mobile in MANETs (애드-혹 망에서 모바일의 지역 중요도를 고려한 퍼지로직 기반 쿼럼의 설계 및 평가)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • 제8권2호
    • /
    • pp.9-14
    • /
    • 2008
  • Mobile Ad-Hoc network is the network of mobile nodes which has no fixed infrastructure, and mobile node in MANET can move freely and communicate with each other. The location management is an important issue because location information of a mobile node is frequently changed in MANET. In this paper, we propose new quorum system applying the gravity of locality of mobile nodes adaptively by using the fuzzy-logic for the mobility of mobile nodes in order to manage location information of mobile nodes in MANET efficiently. The performance of the proposed scheme is evaluated by an analytical model and compared with those of existing UQS and DQS schemes.

  • PDF

On-Time Internal Pedestrian Localization Algorithm Based on Ad-Hoc Networks (애드혹 네트워크 기반의 실내 보행자 위치 추적 알고리즘)

  • Han, Ji-Yong;Jang, Jae-Min;Han, Junghee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제39C권11호
    • /
    • pp.1000-1008
    • /
    • 2014
  • Situation awareness for vehicles and pedestrians is very critical to ensure safety. While on-board sensors or systems can easily detect line-of-sight pedestrians, it is difficult to locate the positions of out-of-sight pedestrians especially with no GPS service. This paper proposes a method for accurate and on-time localization of indoor pedestrians by nearby vehicles. The proposed method is based on mobile ad-hoc networks among vehicles and pedestrians, without relying on infrastructures such as GPS, WiFi AP, and Bluetooth-based systems. Also, this paper develops a genetic algorithm to accurately and promptly locate pedestrians. Finally, simulation results are presented to quantitatively evaluate the proposed method compared to other studies.

Reducing Flooding Latency in Power Save Mode of IEEE 802.11-based Mobile Ad hoc Networks (IEEE 802.11 기반 이동 애드혹 망의 전력 절감 모드에서 플러딩 지연의 개선)

  • 윤현주;서명환;마중수
    • Journal of KIISE:Information Networking
    • /
    • 제31권5호
    • /
    • pp.532-543
    • /
    • 2004
  • Mobile Ad hoc NETworks (MANET) consist of mobile nodes which are usually powered by battery Approaches for minimizing power consumption have been proposed for all network layers and devices. IEEE 802.11 DCF (Distributed Coordination Function), a well-known medium access control protocol for MANETS, also defines a power save mode operation. The nodes in power save mode periodically repeat the awake state and the doze state in synchronized fashion. When all nodes are in the awake state, the exchange the announcements for the subsequent message transmission with neighbors. The nodes that send or receive the announcements stay awake for data transmission, and others go into the dole state. The previous works for enhancing the power save mode operation have focused on shortening the duration of the awake state. We observed that the longer sleeping period results in seriously long delivery latency and the consequent unnecessary power consumption as well, because the packets can move forward only one hop for a fixed interval. In this paper, we propose an improved protocol for the power save mode of IEEE 802.11 DCF, which allows the flooding packets to be forwarded several hops in a transmission period. Our approach does not reduce the duration of compulsory awake period, but maximizes its utilization. Each node propagates the announcements for next flooding to nodes of several hops away, thus the packets can travel multiple hops during one interval. Simulation results of comparison between our scheme and the standard show a reduction in flooding delay maximum 80%, and the unicasting latency with accompanying flooding flows near 50%, with slight increase of energy consumption.

The Vehicle network using Ad-hoc (Ad-hoc을 이용한 자동차 네트워크)

  • Kim, Cheol-Woo;Jang, Ju-Wook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 한국정보처리학회 2004년도 춘계학술발표대회
    • /
    • pp.1437-1440
    • /
    • 2004
  • 자동차를 기반으로 한 애드혹 환경에서는 자동차의 움직임 패턴 특성을 고려하여 모빌리티 모델을 구축하여 시물레이션을 해야 한다. 일반적으로 사용되는 랜덤 웨이포인트 모빌리티 모델[7] 및 그룹 모빌리티 모델[2]은 자동차 특성의 움직임 패턴을 보여주지 못한다. 또한 Freeway 모빌리티 모델 및 맨하탄 모빌리티 모델[4]도 애드혹 망에 대한 전체적인 성능평가를 분석하기 용이하지만 자동차 그룹의 움직임 및 그룹내에서의 성능 평가를 분석하기에는 적합하지 않다. 본 논문에서는 Freeway 모빌리티 모델을 이용하여 그룹의 이동 시나리오를 제시하고 그룹내에서의 통신시 고려되어야할 점 즉, 컨트롤 오버헤드 및 라우팅 경로의 발견등에 관하여 옵넷 시물레이터를 이용하여 분석하였다.

  • PDF

FADA: A fuzzy anomaly detection algorithm for MANETs (모바일 애드-혹 망을 위한 퍼지 비정상 행위 탐지 알고리즘)

  • Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • 제21권6호
    • /
    • pp.1125-1136
    • /
    • 2010
  • Lately there exist increasing demands for online abnormality monitoring over trajectory stream, which are obtained from moving object tracking devices. This problem is challenging due to the requirement of high speed data processing within limited space cost. In this paper, we present a FADA (Fuzzy Anomaly Detection Algorithm) which constructs normal profile by computing mobility feature information from the GPS (Global Positioning System) logs of mobile devices in MANETs (Mobile Ad-hoc Networks), computes a fuzzy dissimilarity between the current mobility feature information of the mobile device and the mobility feature information in the normal profile, and detects effectively the anomaly behaviors of mobile devices on the basis of the computed fuzzy dissimilarity. The performance of proposed FADA is evaluated through simulation.

An Approach to Improve the End-to-end Performance for Mobile Ad hoc Networks (이동 애드 혹 망을 위한 종단간의 성능 개선 방안)

  • 이용석;최웅철
    • Journal of KIISE:Information Networking
    • /
    • 제31권3호
    • /
    • pp.327-334
    • /
    • 2004
  • In this paper, we make MAC protocol improvements for performance enhancement of multi-hop ad-hoc wireless networks. A node in ad-hoc wireless networks can transmit a packet only when the medium is available, and while a packet is being transmitted, no other nodes are allowed to transmit a packet if they are in carrier sensing range. Carrier sensing range can be divided into two disjoint areas of transmission range and carrier sensing zone(9), and we address the importance of the protocol behavior when a node is in carrier sensing zone. The characteristic of the carrier sensing zone is that a node can not know when the remaining time of the on-going transmission session expires or exactly when the media becomes available. Current MAC protocol does not behave in much different way between when a node is in transmission range and in carrier sensing zone. We have conducted a comprehensive simulation to study the performance improvements. The simulation results indicate that the performance is increased and the number of dropped packets due to collision is significantly reduced as much as a half.

Routing Mechanism for Data Transmission QoS in Mobile Ad-hoc Network (무선 애드 혹 네트워크에서의 데이터 전송 QoS를 위한 라우팅 기법)

  • Cha, Hyun-Jong;Yang, Ho-Kyung;Shin, Hyo-Young;Jo, Yong-Gun;Ryou, Hwang-Bin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제13권9호
    • /
    • pp.1829-1836
    • /
    • 2009
  • A wireless Ad-hoc network is willing to send and receive data and for other nodes, and it is a temporal network where the nodes with mobility are automatically constituted. This network has been studied to construct networks in the state where there is no infrastructure. The limited nodes and its frequent moving in a wireless Ad-hoc network have resulted in frequent network disconnection. Therefore, the data transmission rate should be secured in a wireless Ad-hoc network. This study proposes the method to improve QoS of data transmission considering the mobility of nodes that respond to path searching by means of AOMDV routing protocol. By applying the suggested method, it is possible to raise the transmission rate by improving the reliability of transmission path.

Improving TCP-Vegas Performance over Mobile Ad-hoc Networks (이동 애드혹 네트워크에서의 TCP-Vegas 성능향상 기법)

  • Bae Han-Seok;Song Jeom-Ki;Kim Dong-Kyun;Park Jung-Soo;Kim Hyoung-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제31권3A호
    • /
    • pp.221-231
    • /
    • 2006
  • TCP is needed as a transport protocol to provide reliable end-to-end message delivery for MANETs in order to achieve a smooth integration with the fixed Internet. Particularly, TCP has its variants, namely TCP-Reno and TCP-Vegas. However, there has been no research work on extensive performance comparison of TCP-Reno and TCP-Vegas over AODV and OLSR. This paper is the first trial to perform the research by using ns-2 simulator. Through the extensive simulations, we found that which to select among routing protocols is more important than which to select among TCP variants, because the performance difference between TCP-Reno and TCP-Vegas over uy selected routing protocol is not so much outstanding. Particularly, TCP-Vegas relies on an accurate BaseRTT estimation in order to decide the sending rate of a TCP Sender. However, it cannot be directly applied to MANET because a route change makes the Base an used over a Previous Path obsolete. Therefore, we propose a technique for improving the performance of TCP-Vegas by considering the route change, and show the performance improvement through simulation study.

A Scalable Dynamic Source Routing for Large Mobile Ad Hoc Networks (대규모 이동 애드 혹 망을 위한 스케일러블 동적 소스 라우팅)

  • 최명수;정재일
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (3)
    • /
    • pp.286-288
    • /
    • 2004
  • 소스 호스트와 목적지 호스트간 경유 경로를 패킷 헤더에 모두 포함하는 DSR(Dynamic Source Routing)은 경유 호스트 수 증가에 비례 칠서 패킷 헤더와 개별 호스트들이 유지하는 라우트 캐쉬의 크기가 커져야 한다. 따라서 경로 크기와 선형적 관계로 유발되는 확장성 문제로 DSR을 수천 개 이상의 호스트로 구성 되는 대규모 애드-혹 망에 적용하기 어렵다. IETF(Internet Engineering Task Force)는 이러한 단점의 회피 방법으로 Flow State 메카니즘을 제안 하고 있다. 그러나 이 방법은 Route Discovery를 위한 Route Request 와 Route Response 패킷에 전체 경로를 포함 해야 하는 것은 물론 Route Cache에도 전체 경로를 저장 해야 하기 때문에 DSR 확장성 문제를 해결 할 수 없다. 본 논문에서는 경로 크기에 비례해 증가하는 DSR의 오버헤드를 패킷 헤더는 6-hoP, 라우트 캐쉬는 12-hoP 크기로 한정 하는 경로 분할 라우팅 방법을 제안한다.

  • PDF

An Improvement of Routing Performance in Ad Hoc Networks (애드혹 네트워크에서의 라우팅 성능 개선)

  • Park, No-Yeul;Kim, Chang-Hwa;Kim, Sang-Kyung
    • Journal of the Korea Society for Simulation
    • /
    • 제15권3호
    • /
    • pp.79-86
    • /
    • 2006
  • This paper proposes a new protocol to enhance the routing performance and applies our proposal to AODV (Ad hoc On-demand Distance Vector routing) protocol, which is a typical on-demand routing protocol in MANET. In general, when a route repair procedure is performed due to the transfer or failure of a node, the source node re-initiate a route discovery procedure in most routing protocols of MANET. This causes to increase the control traffic overhead largely and degrade the routing performance. The main idea of our study is to provide a methodology that can minimize the control traffic overhead and enhance the performance by initiating a route repair procedure at destination node and utilizing the previous routing information maximumly. To evaluate the performance of the our mechanism, we have performed a series of simulations. The simulations include comparisons with AODV and AODV with local repair. The simulations have been executed under simulation environments taking into account mobility speed and network site. The simulation results show that our proposal overall outperforms the existing protocols.

  • PDF