• Title/Summary/Keyword: MANET(Mobile Ad hoc NETwork)

Search Result 367, Processing Time 0.036 seconds

A Performance Comparison of On-Demand Routing Protocols for Application Services in MANET (MANET에서 응용 서비스 데이터 유형에 따른 요구기반 라우팅 프로토콜의 성능비교)

  • Jang Jun-Young;Lee Kil-Sup;Lee Sung Jong
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.871-878
    • /
    • 2004
  • Recenty, there has been great interest in MANET from various areas. In this paper we focus on performance analysis of on demand routing protocols surf as DSR, AODV, and TORA in MANET. We have conducted several simulations concerned with application service data such as sensor, text. voice, and video data. And then, we have evaluated the performance of three protocols in a pre-designed ad hoc network, which is consisted of 20 nodes. As a result, we have obtained quantitative data for packet delivery fraction, average end to-end delay, routing load, channel utilization from upper layer and supportable routing protocol for application service data. The results can be used for designing specific-purposed ad-hoc networks.

Secure routing security algorithm S-ZRP used Zone Routing Protocol in MANET (MANET환경에서 Zone Routing Protocol을 이용한 안전한 경로설정 보안 알고리즘 S-ZRP)

  • Seo Dae-Youl;Kim Jin-Chul;Kim Kyoung-Mok;Oh Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.4 s.346
    • /
    • pp.13-21
    • /
    • 2006
  • An mobile ad hoc network(MANET) is a collection of wireless computers (nodes), communicating among themselves over multi-hop paths, without the help of any infrastructure such as base stations or access points. Prior research in MANET has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we design and evaluate the Secure Zone Routing Protocol(T-ZRP), a secure ad hoc network routing protocol is based on the design of the hash chain. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and don't use asymmetric cryptographic operations in the protocol. Proposed algorithm can safely send to data through authentication mechanism and integrity about routing establishment.

Adaptive Query Flooding using Neighbor Information for Routing Performance Enhancement in Ad Hoc Networks (Ad Hoc Network에서 라우팅 성능 향상을 위한 이웃 노드 정보를 이용한 적응성 경로 구성 전송 방식)

  • Lee Hakhu;Kang Sangwook;An Sunshin
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.6
    • /
    • pp.673-684
    • /
    • 2004
  • As the wireless mobile communication is being widespread, mobile technologies will have important roles in the communication with the explosive growth of demanding for wireless portable devices. Among the mobile technologies, a great deal of interest has been taken in mobile ad hoc network (MANET), which is a collection of wireless mobile nodes forming a temporary network without the aid of stationary infrastructure in recent. Furthermore, considering characteristic of ad hoc networks, the design of efficient routing protocols is an important issue. In recent years, on-demand protocols among routing protocols have noticed because of the low routing overhead. However, on-demand protocols suffer from production of the enormous query Packets by broadcasting in order to setup routes, that is, a flooding scheme. The flooding scheme is very costly and results in serious problem, which we refer as the broadcast storm problem. In this paper, we propose a Dynamic Adaptation Query flooding Using Neighbor Topology (NT-DAQ) scheme, in order to resolve the broadcast storm Problem. When a route discovery is in progress, each mobile node decides on the basis of neighbor topology information whether discovery process participates or not. Therefore, our proposed scheme enables to improve network performance in which minimize the number of query rackets. We evaluate the efficiency of our proposed scheme through simulation.

An Efficient Cluster Based Service Discovery Model for Mobile Ad hoc Network

  • Buvana, M.;Suganthi, M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.680-699
    • /
    • 2015
  • The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

Routing Attack Detection for Performance Enhancement of AODV Protocol In Mobile Ad Hoc Networks (모바일 Ad Hoc 네트워크에서 AODV 프로토콜의 성능 향상을 위한 라우팅 공격 탐지)

  • Lee, Jae-Young;Choi, Seung-Kwon;Lee, Byong-Rok;Kim, Sun-Chul;Sin, Byoung-Gon;Cho, Yong-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.632-641
    • /
    • 2007
  • Since the mobile node acts as the router, the Mobile Ad Hoc network requires the security methods that are different from that of network of the wire environment. Also, since the total network can't be included in the transmission area of the mobile node, when one node sends the message to the other node, we need the middle node. But if the middle node is the unreliable malicious node, we can't guarantee the secure message transmission. Also, because all nodes configuring the network are the mobile nodes, they use the restricted battery capacity and the restricted resources. Therefore, because we have trouble performing the encryption that many resources are required when we sending the message, it is vulnerable to the security than the network of the wire environment. Last, because the network topology continues to change by the mobility of nodes configuring the network, we need the security measure that matches the network characteristics. We suggest the routing attack detection for performance enhancement of AODV protocol in Mobile Ad Hoc networks.

Cross-layer Simulation and Analysis for Video Transmission Quality in MANET (MANET에서 비디오 전송 품질을 위한 Cross-layer 시뮬레이션과 분석)

  • Yoon, Hyoup-Sang
    • Journal of the Korea Society for Simulation
    • /
    • v.24 no.3
    • /
    • pp.61-68
    • /
    • 2015
  • Mobile ad hoc networks (MANETs) are self-organized dynamic networks populated by mobile nodes. This paper presents the improved cross-layer approach to complement the recent works for video transmission services on MANET. We use a statistical design of experiment and analysis in order to investigate interactions between major factors of each layer effectively with minimizing ns-3 simulation run time. The proposed cross-layer approach considers MANET protocol layers (i.e., physical, network and transmission layers) and an application layer (i.e., a video encoder) as factors simultaneously. In addition, the approach defines an objective video quality metric as a response variable. The result of this paper can be applicable as a preliminary research to design an optimized video transmission application which has ability to adjust controllable factors to dynamic uncontrollable factors.

An Energy-aware Dynamic Source Routing Algorithm for Mobile Ad-hoc Networks (이동 애드혹 네트워크에서 에너지를 고려한 동적 소스 라우팅 알고리즘)

  • Lee, Cheong-Yeop;Shin, Yong-Hyeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.165-173
    • /
    • 2011
  • In Mobile Ad-hoc Network(MANET), mobile nodes are operated by limited batteries. Therefore, it is very important to consume the battery power efficiently to prevent termination of the network. In this paper, we propose Energy-aware Dynamic Source Routing(EDSR) which is based on the Dynamic Source Routing(DSR) to increase the packet transmission and lifetime of the network. If the battery power of a node reaches threshold level, then the node gives up the function of relaying to save battery power except as a source and a destination node. While the conventional DSR doesn't consider the battery consumptions of the nodes, EDSR blocks the nodes from relaying whose battery powers are below the threshold level. Simulation results show the proposed EDSR is more efficient in packet transmission and network lifetime through the balanced battery consumption of the mobile nodes.

EZR: Expansive Search Zone Routing Protocol for Ship Ad Hoc Networks (선박 애드 혹 네트워크를 위한 확장탐색구역 경로배정 프로토콜)

  • Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.32 no.8
    • /
    • pp.1269-1277
    • /
    • 2008
  • Ships at sea cannot exchange data among them easily so far. Basically voice-oriented communication systems are the main methods, some of them utilize the HF radio systems at lower bit rates, and for higher bit rates, the Inmarsat or VSAT are adopted. None of them are used widely because of lower qualities and higher costs. There exist many technical and economical limits to have the Internet service just like on land such as the WWW service. In order to achieve the improved transmission rates of the maritime communication networks at farther sea, MANET(Mobile Ad Hoc Network) is one of the most practical models. In this paper, a new routing protocol named EZR (Expansive Search Zone Routing Protocol) is proposed, which is based on SANET (Ship Ad Hoc Network) model that has some different features from MANET and VANET (Vehicular Ad Hoc Network). The search zone for the shortest path is firstly found by EZR. If no path is searched in the zone, the zone is expanded according to the rule of EZR. The zone-expanding and path-searching procedures are repeated until the path is found out. The performance of EZR is evaluated and compared with LAR protocol which is one of the most typical routing protocols based on geographical information. The simulated results show that EZR is much better than LAR at sea environments in terms of routing success rate, route optimality, and a single index of performance combined the previous two metrics.

Improved AntHocNet with Bidirectional Path Setup and Loop Avoidance (양방향 경로 설정 및 루프 방지를 통한 개선된 AntHocNet)

  • Rahman, Shams ur;Nam, Jae-Choong;Khan, Ajmal;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.64-76
    • /
    • 2017
  • Routing in mobile ad hoc networks (MANETs) is highly challenging because of the dynamic nature of network topology. AntHocNet is a bio-inspired routing protocol for MANETs that mimics the foraging behavior of ants. However, unlike many other MANET routing protocols, the paths constructed in AntHocNet are unidirectional, which requires a separate path setup if a route in the reverse direction is also required. Because most communication sessions are bidirectional, this unidirectional path setup approach is often inefficient. Moreover, AntHocNet suffers from looping problems because of its property of multiple paths and stochastic data routing. In this paper, we propose a modified path setup procedure that constructs bidirectional paths. We also propose solutions to some of the looping problems in AntHocNet. Simulation results show that performance is significantly enhanced in terms of overhead, end-to-end delay, and delivery ratio when loops are prevented. Performance is further improved, in terms of overhead, when bidirectional paths setup is employed.

An Analysis of Optimum Transmission Range in MANETs under various Propagation Models (다양한 전파 환경 하에서 MANET 최적 통달거리 분석)

  • Choi, Hyungseok;Lee, JaeYong;Kim, ByungChul
    • Journal of Internet Computing and Services
    • /
    • v.15 no.2
    • /
    • pp.1-7
    • /
    • 2014
  • This paper presents an analytical method for finding the optimum transmission range in mobile ad hoc networks(MANETs). The results are particularly useful for the operation of military networks, as the transmission range affects the throughput, delay, and battery consumption. Plus, the proposed method allows the optimum transmission range to be determined in advance when deploying combatants with mobile terminals. And we analyze the battery life-time and the optimum transmission range under various propagation scenarios based on Hata propagation model. The proposed method obtains the optimum transmission range in a MANET based on the operational conditions.