• Title/Summary/Keyword: 모바일 애드-혹 네트워크

Search Result 148, Processing Time 0.021 seconds

A DEVS-based Modeling & Simulation Methodology of Enabling Node Mobility for Ad Hoc Network (노드 이동성을 고려한 애드 혹 네트워크의 이산 사건 시스템 기반 모델링 및 시뮬레이션 방법론)

  • Song, Sang-Bok;Lee, Kyou-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.4
    • /
    • pp.127-136
    • /
    • 2009
  • Modeling and Simulation, especially in mobile ad hoc network(MANET), are the most effective way to analyze performance or optimize system parameters without establishing real network environment. Focusing mainly on overall network behaviors in MANET concerns dynamics of network transport operations, which can efficiently be characterized with event based system states rather than execution details of protocols. We thus consider the network as a discrete event system to analyze dynamics of network transport performance. Zeigler's set-theoretic DEVS(Discrete Event Systems Specification) formalism can support specification of a discrete event system in hierarchical, modular manner. The DEVSim++ simulation environment can not only provide a rigorous modeling methodology based on the DEVS formalism but also support modelers to develop discrete event models using the hierarchical composition methodology in object-orientation. This environment however hardly supports to specify connection paths of network nodes, which are continuously altered due to mobility of nodes. This paper proposes a DEVS-based modeling and simulation methodology of enabling node mobility, and develops DEVS models for the mobile ad hoc network. We also simulate developed models with the DEVSim++ engine to verify the proposal.

A Study on TCP using AODV in Mobile Ad-hoc Networks (이동 애드혹 네트워크에서 AODV를 적용한 TCP에 관한 연구)

  • Lee, Hye-Rim;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.3
    • /
    • pp.233-238
    • /
    • 2008
  • Recently, network component become to follow wireless and mobile network from wired network proposed that many TCP algorithm optimized in variety environment. When TCP was created, however as it was design based on wired link, wireless link made more transmission error than wired link. Transmission errors are more frequent and may be incorrectly regarded as indications of network congestion. In this paper, it conduct how effect congestion control algorithm in Mobile ad-hoc network and compare traffic of TCP-Tahoe, TCP-Reno, TCP-New-Reno and TCP-Vegas in Mobile ad-hoc environment.

  • PDF

Distributed Hash Table based Service Discovery in Mobile Ad Hoc Network (모바일 애드 혹 네트워크에서 분산 해쉬 테이블 기반의 서비스 탐색 기법)

  • Jung, Jae-Hoon;Lee, Seung-Hak;Kim, Nam-Gi;Yoon, Hyn-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.91-97
    • /
    • 2008
  • In order to get a desired service in such environments, we need a service discovery method for discovering a device providing that service. In this paper, we propose a service discovery protocol which is based on DHTs (Distributed Hash Tables) to solve these problems. Our protocol is scalable since it does not require a central lookup server and does not rely on multicast or flooding. Simulation results show that our protocol is scalable and outperforms existing service discovery protocols.

Experiment and Analysis of Session-key Authentication Mechanism based on MANET (MANET 기반 세션키 인증기법의 실험 및 분석)

  • Lee, Cheol-Seung;Jung, Sung-Ok
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.12
    • /
    • pp.1355-1360
    • /
    • 2015
  • Recently MANET application is diversified studies on the MANET routing security and the reliable authentication mechanism is actively in progress. Stand-alone network structure of a MANET is an important field of ubiquitous computing environment of interest, Authentication techniques are already provided safety when applied to MANET reliability and efficiency in a secure authentication mechanism using the session key. However, most of the MANET environment, the model has been based on the assumption that the safety is guaranteed, When applied to an actual network situation, we can not rule out a variety of threats. This study is the testing and analysis to add the malicious node extracted at random to demonstrate the safety and efficacy of the session key certification techniques of the MANET environment.

A Study on Secure Routing for a Maritime Network Based on Mobile Multi-hop Wireless Networks (이동 다중 홉 무선망 모델에 기반한 해양통신망을 위한 경로배정 보안 연구)

  • Mun, Seong-Mi;Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.33 no.1
    • /
    • pp.120-130
    • /
    • 2009
  • In recent years, many mobile wireless communication devices and applications have been deployed on the planet. The mobile multi-hop wireless network models appeared to provide means to access to networks where few infrastructure exists. However, the mobile multi-hop wireless networks have weaker points in attacks and intrusions than the wired and one-hop wireless networks. In this paper, the secure routing issues in most mobile multi-hop wireless network models are surveyed in depth. The state-of-the-art technologies and research activities are explained. Finally, the issues and technologies for the secure routing specific to a maritime network model are sufficiently discussed as conclusions.

A Hybrid Course-Based Routing Protocol of A MANET for Long-Distance Cruise Vessels (원양항해선박을 위한 MANET의 복합 항로기반 라우팅 프로토콜)

  • Son, Joo-Young;Mun, Seong-Mi
    • Proceedings of the Korean Society of Marine Engineers Conference
    • /
    • 2005.11a
    • /
    • pp.206-207
    • /
    • 2005
  • 해상에서 인터넷을 사용하는 데 많은 기술적, 경제적 제약이 따른다. 육상의 인터넷 서비스를 바다 위에서 실현하기 위해서는 기지국과 같은 중앙 통제 시스템이 없는 MANET을 기반으로 하는 해상통신망이 새롭게 구축되어야 한다. 본 논문에서는 해상환경과 선박 내 단말장치의 특성을 최대한 고려한 해상 MANET 모델을 새롭게 설계하였다. 원양에서 선박들이 주로 주어진 항로를 기준으로 항해하는 특성을 고려하여, 개별적 이동노드(선박)를 대상으로 경로를 찾는 것이 아니라 정적 정보인 항로와 동적 정보인 선박을 복합적으로 활용하여 최단경로를 찾아내는 복합적 항로기반 라우팅(HCBR) 프로토콜을 제안하였다. 지리 정보를 이용하는 LAR 프로토콜과 성능 비교에서 경로 발견 시 제어패킷을 전혀 쓰지 않으면서 최단 경로를 훨씬 더 잘 찾아내는 특성을 실험적으로 파악하였다.

  • PDF

Max-Win based Routing(MWR) Protocol for Maritime Communication Networks with Multiple Wireless Media (다중무선매체 해상통신망을 위한 최대승수기반 경로배정 프로토콜)

  • Son, Joo-Young;Mun, Seong-Mi
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.34 no.8
    • /
    • pp.1159-1164
    • /
    • 2010
  • The current maritime data communications mainly depend on radio and satellite which have restrictions on data rate and cost. That leads to needs of novel relatively-high-speed data communication systems at sea just like on land. This paper proposes a routing protocol (MWR) for newly designed model of ship-to-ship communication networks at sea. The MWR protocol finds out an optimal route by selecting an optimal network for each specific application from overlapped networks of available wireless media at sea.

An Augmented WiMAX MMR Protocol for Establishing Secure Broadband Maritime Data Networks (안전한 광대역 해상정보통신망 구축을 위한 WiMAX MMR 확장 프로토콜)

  • Lee, Su-Hwan;Son, Joo-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.34 no.8
    • /
    • pp.1145-1152
    • /
    • 2010
  • Currently economical communication technologies are needed for high speed data exchange at sea. Wireless environments at sea require some special communication security solutions as well. In this paper, an augmented WiMAX MMR protocol is proposed as a solution of the broadband data communications and security at sea environments fundamentally with no base station.

Packet Forward Group based routing algorithm in Mobile Adhoc Network (모바일 애드혹 네트워크에서의 Packet Forward Group 기반 라우팅 알고리즘)

  • Yoo Jaeyong;Her Junho;Mohamed Adnan;Ramakrishna R.S.
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.283-285
    • /
    • 2005
  • 본 논문에서는 Multicast Forward Group 기반 라우팅 알고리즘인 PFGR(Packet forward group based routing)의 프레임워크를 제시한다. 단일경로를 지향하는 On-demand라우팅 프로토콜인 AODV흑은 DSR에서 링크 단절이 발생시 이루어지는 path repair에 의한 오버헤드는 심각하게 증가할 가능성이 생긴다. PFGR은 단일 경로가 아닌 그룹화된 경로를 형성하여 링크 지속시간을 늘임으로써 결국 path repair 오버헤드를 줄일수 있는 라우팅 알고리즘이다. 기존 On-Demand 라우팅에서의 링크 지속시간을 비교 분석한 시뮬레이션 결과 본 논문에서 제안한 PFGR 알고리즘의 경로지속시간이 비약적으로 상승하였다. 보다 상세한 라우팅프로토콜의 설계 및 분석은 앞으로 해결해 나가야 할 과제이다.

  • PDF