• Title/Summary/Keyword: mobile ad hoc network (MANET)

Search Result 367, Processing Time 0.026 seconds

A Secure Authentication Mechanism using PKI in Ad Hoc Networks (Ad hoc 네트워크에서 공개키 기반구조를 이용한 신뢰적인 인증 메커니즘)

  • 봉진숙;윤미연;신용태
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.436-438
    • /
    • 2004
  • 이동 ad-hoc 네트워크(mobile ad-hoc network : MANET)는 유선 기반 망 흑은 액세스 포인트 없이 이동 단말기들로 구성된 망이다. 기존의 기반망을 사용하지 않으므로 유선 기반망이 구축되어 있지 않은 곳이나 유선 기반망이 파괴된 지역에 사용한다. 그러나 HANET에서는 노출된 매체와 동적인 토폴로지, 중앙의 감시와 관리 결여, 자원의 제약성 등과 같은 이유로 인해 유선망보다 더욱 않은 보안 문제가 발생한다. 본 논문에서는 이동 ad hoc 네트워크에서 노드의 신분 보장을 제공하기 위하여 기밀성에 중점을 둔 공개키 기반 구조에서의 노드 간 인증 기법을 제안한다.

  • PDF

An Address Autoconfiguration Algorithm of Mobile IPv6 through Internet Gateway in Ad-Hoc Networks (Mobile IPv6기반 Ad-Hoc 네트워크에서의 Internet Gateway를 통한 IP주소 자동 할당 방법)

  • Choi Jung-Woo;Park Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.150-155
    • /
    • 2006
  • A hybrid Ad-hoc network connected to the Internet needs an IP address configuration to communicate with the Internet. Most of proposed address autoconfiguration algorithms are node based. The node based address autoconfiguration algorithms waste bandwidth and consume much battery in mobile ad-hoc networks. In this paper, we propose the address allocation algorithm in hybrid Mobile ad-hoc network (MANET). The proposed algorithm reduces network traffic by transferring address configuration packet to the internet gateway by unicast method. Moreover, our IP address configuration algorithm also reduces battery consumption and address configuration time by decreasing number of configuration packets on internet gateway.

GPS-Based Shortest-Path Routing Scheme in Mobile Ad Hoc Network

  • Park, Hae-Woong;Won, Soo-Seob;Kim, So-Jung;Song, Joo-Seok
    • Annual Conference of KIPS
    • /
    • 2004.05a
    • /
    • pp.1529-1532
    • /
    • 2004
  • A Mobile Ad Hoc NETwork (MANET) is a collection of wireless mobile nodes that forms a temporary network without the need for any existing network infrastructure or centralized administration. Therefore, such a network is designed to operate in a highly dynamic environment due to node mobility. In mobile ad hoc network, frequent topological changes cause routing a challenging problem and without the complete view of the network topology, establishing the shortest path from the source node to the destination node is difficult. In this paper, we suggest a routing approach which utilizes location information to setup the shortest possible path between the source node and the destination node. Location information is obtained through Global Positioning System (GPS) and this geographical coordinate information of the destination node is used by the source node and intermediate nodes receiving route request messages to determine the shortest path to the destination from current node.

  • PDF

Distance Ratio based Probabilistic Broadcasting Mechanism in Mobile Ad Hoc Network (모바일 애드 혹 네트워크에서이격 비율에 근거한 확률적 브로드캐스팅 기법)

  • Kim, Jeong-Hong;Kim, Jae-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.12
    • /
    • pp.75-84
    • /
    • 2010
  • As broadcasting in Mobile Ad hoc NETwork (MANET) is the process that a node sends a packet to all other nodes in the network. it is used for routing protocols such as Ad hoc On demand Distance Vector (AODV) to disseminate control information for establishing the routes. In this paper, we propose Probabilistic Broadcasting mechanism based on Distance Ratio between sender and receive node in MANETs. The proposed approach is based on the combination of probability and distance based approach. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio from sender. The distance ratio of a node is calculated by the distance from sender and the length of radio field strength. As a node with high distance ratio is located far away from sender, rebroadcast probability is set to high value. On contrary, the low rebroadcast probability is set for a node with low distance ratio which is close to sender. So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

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

  • Kim, Ki-Sung;Kim, Se-Hun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2007.11a
    • /
    • 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

Transmission Performance of VoIP Traffic over MANETs (MANET에서 VoIP 트래픽의 전송성능)

  • Kim, Young-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.5
    • /
    • pp.1109-1116
    • /
    • 2010
  • In this paper, some performance characteristics of VoIP(Voice over Internet Protocol) for MANET(Mobile Ad-hoc Networks) with simulation is studied and appropriate condition for implementation of VoIP service is suggested. VoIP simulator is implemented with NS(Network Simulator)-2. VoIP traffic for simulation is generated with some codecs of G.711, G.723.1, G.726-32, G.729A, GSM.AMR and iLBC. As simulation results for traffic transmission under $670{\times}670m$ 50node MANET environment, performance data for MOS(Mean Opinion Score), network delay, packet loss rate and transmission bandwidth are measured. Normalized analysis about measured results shows that maximum VoIP connection satisfying VoIP service quality condition is 15.

Transmission Performance of Video Traffic on Underwater MANET (수중 MANET에서 비디오 트래픽의 전송성능)

  • Kim, Young-Dong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.1
    • /
    • pp.49-54
    • /
    • 2019
  • Since the underwater communication environment, which is used mainly in acoustic channel, is different from terestrial communication, it needs to analyze the appropriate transmission performance in underwater environment to implement the communication services. Appropriate traffic process method for a communication service is required through transmission performance of object traffic for the communication service. In this paper, transmission performance of video traffic on underwater MANET(Mobile Ad-hoc Network) is analyzed and video traffic configuration scheme on underwater MANET with results of performance analysis is suggested, This study is done with computer simulation based on NS(Network Simulator)-3. throughput, transmission delay, packet loss rate is used for transmission performance.

Dynamic Adaptation Query Flooding Considering Neighbor Topology in Ad Hoc Networks (Ad Hoc Network에서 Neighbor Topology을 고려한 Dynamic Adaptation Query Flooding)

  • 이학후;안순신
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.691-693
    • /
    • 2004
  • Mobile Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 multi-hop wireless links network 형태를 구성하여 통신이 이루어지게 하는 network이다. 따라서 효율적인 라우팅 프로토콜의 개발이 중요한 issue인데 최근에는 routing overhead가 적은 on-demand 프로토콜이 주목을 받고 있다. On-demand 프로토콜은 새로운 route을 구성하기 위해서 query packet을 broadcasting하게 되는데, 특히 노드들의 mobility가 많은 mobile ad hoc network(MANET)의 경우에는 더욱더 자주 발생하게 되는데, blind broadcasting은 neighbor 노드들 간의 radio transmission region overlap에 의해 redundancy, contention, collision 같은 broadcast storm 문제를 발생시키게 된다. 본 논문은 on-demand 프로토콜의 broadcast storm 문제를 해결하기 위해 Neighbor Topology을 고려 한 Dynamic Adaptation Query flooding scheme을 제시한다. 또한 Dynamic Adaptive Query flooding scheme은 broadcast storm 문제 해결뿐만 아니라 network의 congestion을 감소시켜 data packet의 성능 향상에도 기여 할 것이다.

  • PDF

A Study on Performance Evaluation of Efficient Vehicular Ad-Hoc Network in Road Traffic (도로 사정에 따른 효율적인 자동차 애드 혹망의 성능평가에 관한 연구)

  • Cho, Ok-Lae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.3
    • /
    • pp.593-600
    • /
    • 2007
  • In this paper, we composed several road network and evaluated the network for the performance of the network with protocols. The protocols we applied were the MANET routing protocols such as AODV(Ad-hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) protocols. Generally, the AODV performs better than the DSR. However, in my ad-hoc vehicular network, the performance of the DSR is the better than the AODV when there are more vehicles in the road environment than there are the less vehicles. For the simulation, we composed 4-lane road with vehicles and simulated in the OPNET.

  • PDF

Impact of Mobility on the Ad Hoc Network Performance (이동성이 Ad Hoc 망의 성능에 미치는 영향)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.201-208
    • /
    • 2010
  • Mobile Ad Hoc Network(MANET) has highly dynamic topology, hence presents a great challenge on the network performance evaluation and network protocol design. We proposed total path break up time, $\sum_{i}T_i$, as a metric to measure the performance of the total system as well as an individual connection. In this paper, we evaluate and analyze the performance of three mobility models(Random Waypoint, Manhattan, Blocked Manhattan) by applying the total path break up metric, investigate why network parameters such as packet delivery ratio, end-to-end delay, etc. vary by mobility models. We also present analysis result how much AODV Buffer improve packet delivery ratio and increase the end-to-end delay in spite of the path break up.