• Title/Summary/Keyword: Mobile Based Ad hoc Network Systems

Search Result 77, Processing Time 0.024 seconds

Leader Decision Protocol for Dynamic Changing Topology in Mobile Ad hoc Networks (모바일 ad hoc 네트워크에서 동적인 토폴로지 변화에 따른 리더 결정)

  • Kim, Young-Lan;Han, Hyun-Goo;Park, Sung-Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.11
    • /
    • pp.4543-4552
    • /
    • 2010
  • A leader is a special process who roles as the coordinator within multiple processes of a group. In a distributed system, leader election is the procedure of electing a coordinator. This is a very important issue for building fault-tolerant distributed systems. When two normal mobile ad hoc networks are merged, there are two leaders. This violates the safety property, so a mechanism to detect and handle are required. In mobile ad hoc distributed computing system, we propose a leader competition protocol and to prove the temporal logic to it. This solution is based on the group membership detection algorithm.

Content Distribution Mechanism in an All-Sender-All-Receiver Ad Hoc Network (모든 Peer가 송수신자인 Ad Hoc 네트워크에서의 자료 분배 방법에 대한 고찰)

  • Kang Seung-Seok
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.161-164
    • /
    • 2005
  • Mobile device users are sensitive to pay telecommunication charge for downloading Internet data, because the cost is proportional to the amount of data received. If there are device users who want to download the same content, they may cooperate each other to form an ad hoc network and share the partially downloaded content in order to reduce the amount of data downloaded. Each mobile device, called a peer, downloads a specific portion of the whole content using fee-based telecommunication channel, and exchanges the portion with other peers with free ad hoc channel in order that all participating peers are able to reconstruct the whole content in this situation, al1 participating peers become senders and receivers at the same time. In order to distribute the partial content to other peers, the ad hoc network requires a control led distribution mechanism. This paper introduces the per-peer-based distribution method in which one designated peer can transmit partial data to its neighbors at a time. Simulation results show that 90$\%$ of the telecommunication cost is saved with as few as 10 peers .

  • PDF

An Efficiently Cluster Management using Secondary Leader in CBRP

  • Hur Tai Sung;Kim Jong Ki;Min Hong Ki
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.552-557
    • /
    • 2004
  • Mobile Ad Hoc Network (MANET) is a network architecture, which has no backbone network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, previously developed routing algorithms in wired networks cannot be used. And many new algorithms have been undergone. This study proposes the secondary leader approach to the cluster based routing protocol(CBRP). In case, the primary leader becomes abnormal status so that the primary leader cannot participate the communications between network entities, the secondary leader immediately replaces the primary header without selecting process of the new primary leader. The performances of proposed algorithm ACBRP(Advanced Cluster. Based Routing Protocol;CBRP using secondary leader) are compared with CBRP and results are presented in order to show the effectiveness of the algorithm.

  • PDF

ARCA-An Adaptive Routing Protocol for Converged Ad-Hoc and Cellular Networks

  • Wu, Yumin;Yang, Kun;Chen, Hsiao-Hwa
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.422-431
    • /
    • 2006
  • This paper proposes an adaptive routing protocol called ARCA for converged ad-hoc and cellular network (CACN). Due to the limitation of both bandwidth and transmission range in a cell, a mobile host (MH) may not be able to make a call during busy time. CACN offers a flexible traffic diversion mechanism that allows a MH to use the bandwidth in another cell to ease the congestion problem and increase the throughput in a cellular network. Based on the presentation of CACN's physical characteristics, the paper details the design issues and operation of the adaptive routing protocol for CACN (ARCA). Detailed numerical analysis is presented in terms of both route request rejection rate and routing overhead, which, along with the simulation results, have indicated the effectiveness and efficiency of the ARCA protocol.

Aero-Sim: An NS-2 Based simulator for Aeronautical Ad Hoc Networks

  • Luo, Qin;Wang, Junfeng;Wang, Xiaoqing;Wu, Ke
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2548-2567
    • /
    • 2015
  • Recently, there has been a clear trend towards the application of ad hoc networking technology in civil aviation communication systems, giving birth to a new research field, namely, aeronautical ad hoc networks (AANETs). An AANET is a special type of ad hoc wireless network with a significantly larger scale and distinct characteristics of its mobile nodes. Thus, there is an urgent need to develop a simulator to facilitate the research in these networks. In this paper, we present a network simulator, Aero-Sim, for AANETs. Aero-Sim, which is based on the freely distributed NS-2 simulator, enables detailed packet-level simulations of protocols at the MAC, link, network, transport, and application layers by composing simulations with existing modules and protocols in NS-2. Moreover, Aero-Sim supports three-dimensional network deployment. Through several case studies using realistic China domestic air traffic, we show that the proposed simulator can be used to simulate AANETs and can reproduce the real world with high fidelity.

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.

Performance Analysis of an Address Auto-configuration Method Applying to Mobile Ad hoc Network Using NS-2 (NS-2를 이용한 MANET의 주소 자동설정 기법의 성능분석 연구)

  • Kim, Sun-Hwa;Go, Bin;Lee, Kyou-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.3
    • /
    • pp.1-6
    • /
    • 2010
  • Simulation analysis may be the essential means to either evaluate performance of systems or optimize system parameters for new design. Including many variations for design and implementation, MANET (Mobile Ad-hoc NETwork) is one target area of such an analysis. Since every node, however, included in the network has mobility, one MANET could be overlapped or merged with another one which use a different transport protocol. In order to communicate among nodes in this case, the new merged network should configure paths and addresses in advance. Configuring paths and addresses generates much overheads which ultimately cause delay in communicating data. Performance analysis is required to improve the data transport performance by minimizing overheads. This paper proposes a sound address auto-configuration method which is based on an on-demand manner and then presents modeling and performance analysis of the method. NS-2 simulation results verify that the proposed method can not only alleviate overheads, which are inevitably generated for address auto-configuration processes, and but also decentralize them in time.

An Entropy-based Stability Algorithm for Regulating the Movement of MANET Nodes

  • Kim, Sang-Chul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.5
    • /
    • pp.999-1012
    • /
    • 2011
  • This paper proposes an algorithm that enables mobile nodes to implement self-regulated movements in mobile ad-hoc networks (MANETs). It is important for mobile nodes to maintain a certain level of network-based stability by harmonizing these nodes' movements autonomously due to their limited transmission range and dynamic topology. Entropy methods based on relative position are suggested, as a means for mobile nodes to regulate their local movements. Simulations show that an early warning mechanism is suitable to maintain movement-based stability. Isolation can be reduced by 99%, with an increased network cost of 12% higher power consumption, using the proposed algorithm.

Weighted Voting Game and Stochastic Learning Based Certificate Revocation for the Mobile Ad-hoc Network (이동 애드 혹 네트워크 환경에서 가중투표게임과 확률러닝을 이용한 악의적인 노드의 인증서 폐지 기법)

  • Kim, Min Jung;Kim, Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.7
    • /
    • pp.315-320
    • /
    • 2017
  • In this paper, I design a new scheme that is immune to malicious attack based on the weighted voting game. By using stochastic learning, the proposed scheme can revoke the certification of malicious node. Through the revocation process, the proposed scheme can effectively adapt the dynamic Mobile Ad hoc network situation. Simulation results clearly indicate that the developed scheme has better performance than other existing schemes under widely diverse network environments.

Energy-aware Source Routing Protocol for Lifetime Maximization in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 생존시간 최대화를 위한 에너지 인지 소스 라우팅 프로토콜)

  • Choi, Hyun-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.3
    • /
    • pp.31-39
    • /
    • 2012
  • In this paper, we propose an energy-aware source routing protocol for maximizing a network lifetime in mobile ad hoc network environments. The proposed routing protocol is based on the source routing and chooses a path that maximize the path lifetime, by considering both transmit/receive power consumption and residual battery power in the mobile nodes from the perspective of source-destination end-to-end. This paper proposes a new routing cost and designs a new routing protocol for minimizing the control packet overhead occurred during the route discovery. Simulation results show that the proposed scheme has similar performances to the conventional routing schemes in terms of the number of transmission hops, transmission rate and total energy consumption, but achieves the performance improvement of 20 percent with respect to the lifetime.