• Title/Summary/Keyword: Ad-hoc Method

Search Result 462, Processing Time 0.026 seconds

Autonomous Ad hoc Network Construction Method for Scalable Media Streaming Between Mobile Smart Devices (모바일 스마트 기기들 간의 확장성 있는 미디어 스트리밍을 위한 자율적인 Ad hoc 네트워크 형성 기법)

  • Kwon, Dongwoo;Je, Huigwang;Kim, Hyeonwoo;Ju, Hongtaek
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.3
    • /
    • pp.516-528
    • /
    • 2015
  • In this paper, we propose mobile ad hoc network configuration and its autonomous network construction method for efficiency and scalability of media streaming for mobile smart devices. To provide scalable network configuration for streaming traffic distribution, an IEEE 802.11 infrastructure network and ad hoc networks are hierarchically built. The proposed method autonomously configures a hierarchical streaming network by competition based on performance and states of devices and the wireless network, not depending on any specific nodes. Finally, we conduct performance measurement for the proposed configuration and analyze the experimental result.

Dissemination of Traffic-Jam Information in inter-vehicle ad-hoc networks (차량간 Ad hoc 네트워크에서 트래픽 잼 정보의 전달 방법)

  • Chang, Hyeong-Jun;Park, Gwi-Tae
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.293-295
    • /
    • 2009
  • In an Intelligent Transport System(ITS), data dissemination based on inter-vehicle communication is effective for acquiring real-time traffic-jam information. In this paper, we propose a novel method for traffic jam information dissemination in vehicular ad-hoc networks. In our proposed method, vehicles already trapped in a Traffic-Jam elect leaders according to their locations from upstream and downstream respectively. Then each leader generates traffic data which contains their position, velocity and leader counter respectively, and disseminate the information. {{br}}The implementation of our proposed method is evaluated by means of simulation, and we also present simulation result

  • PDF

Cluster Group Multicast by Weighted Clustering Algorithm in Mobile Ad-hoc Networks (이동 에드-혹 네트워크에서 조합 가중치 클러스터링 알고리즘에 의한 클러스터 그룹 멀티캐스트)

  • 박양재;이정현
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.3
    • /
    • pp.37-45
    • /
    • 2004
  • In this paper we propose Clustered Group Multicast by Clustering Algorithm in Wireless Mobile Ad-hoc Network. The proposed scheme applies to Weighted Cluster Algorithm Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network muting protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by seeped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

Coordinator Election Mechanism for Increasing System Lifetime in Wireless Ad-hoc Networks (무선 Ad-hoc 네트워크에서 시스템 활동시간 증가를 위한 Coordinator 선출 방법)

  • Park Sook-Young;Kim Young-nam;Lee Sang-Kyu;Lee Ju-Young
    • Journal of Internet Computing and Services
    • /
    • v.4 no.4
    • /
    • pp.15-25
    • /
    • 2003
  • Wireless ad-hoc networks are only composed with mobile devices. Unlike the traditional wired networks, those devices are mostly operated with battery power. Since the battery-operated power is limited, the efficient energy resource managements becomes an important issue in wireless ad-hoc networks and various studies that considered these characteristics are progressed. One of those studies is an energy efficient routing using coordinators. In this method. only devices elected as coordinator participate in data transmissions in ad-hoc networks, while other devices remain in sleep node. The overall energy consumption of a system can be reduced. In order to minimize energy consumption of a total network, previous results try to maximize the number of nodes in sleep mode. However, minimizing the number of coordinators does not ensure to increase the system lifetime. In this thesis, we propose an algorithm that can elect coordinators with considering the amount of necessary energy to transmit assigned data and a connectivity of nodes in the networks. The result of proposed coordinator election algorithm can increase the system lifetime of an Ad-hoc network from the results of existing coordinator election algorithms.

  • PDF

A Study on Secure Cooperative Caching Technique in Wireless Ad-hoc Network (Wireless Ad-hoc Network에서 보안 협력 캐싱 기법에 관한 연구)

  • Yang, Hwan Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.91-98
    • /
    • 2013
  • Node which plays the role of cache server does not exist in the wireless ad-hoc network consisting of only mobile nodes. Even if it exists, it is difficult to provide cache services due to the movement of nodes. Therefore, the cooperative cache technique is necessary in order to improve the efficiency of information access by reducing data access time and use of bandwidth in the wireless ad-hoc network. In this paper, the whole network is divided into zones which don't overlap and master node of each zone is elected. General node of each zone has ZICT and manages cache data to cooperative cache and gateway node use NZCT to manage cache information of neighbor zone. We proposed security structure which can accomplish send and receive in the only node issued id key in the elected master node in order to prepare for cache consistent attack which is vulnerability of distributed caching techniques. The performance of the proposed method in this paper could confirm the excellent performance through comparative experiments of GCC and GC techniques.

Ad hoc Network Multicasting Algorithm Based on An Ant System (개미 시스템을 기반으로 한 Ad hoc 네트워크 멀티캐스팅)

  • Kim Joong Hang;Chang Hyeong Soo;Lee Se-young
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.12
    • /
    • pp.1127-1136
    • /
    • 2004
  • This paper proposes a novel multicasting algorithm, called ANMAS (Ad hoc Network Multicasting with Ant System), for Mobile Ad hoc Network (MANET). The algorithm utilizes the indirect communication method of the ants via 'pheromone' to effectively obtain dynamical topology change information, generating safer multicasting paths, and adapts the well-known CBT (Core Based Tree) multicasting algorithm into the ANMAS framework with proper modificiations to make 'tolerable' multicasting group in the MANET environment. We show the efficiency and the effectiveness of ANMAS via simulation studies.

A Novel Adaptive Routing Scheme for the QoS-Based Multimedia Services in Mobile Ad-Hoc Networks

  • Lee, Chang-Bum;Kim, Young-Woong;Soh, Surng-Ryurl;Kim, Yung-Kwon
    • Journal of IKEEE
    • /
    • v.4 no.2 s.7
    • /
    • pp.281-287
    • /
    • 2000
  • A mobile ad-hoc network is composed of only mobile nodes, which are distributed dynamically, without any wired backbone or centralized entities. Since the existing works on ad-hoc routing protocol are mostly biased toward a military application, we need a new routing scheme for a support of multimedia services in mobile ad-hoc networks. Therefore, we propose a novel scheme that can support a variety of traffic attributes and can be applicable to high-speed and multimedia data services in mobile ad-hoc networks by using adaptive transmission power level. As a result of simulation, the proposed scheme has better performance than conventional method, which is performed with uniform transmission power level, in view of route query delay time.

  • PDF

Routing Protocol for Ad-hoc Networks with Unidirectional Links (단방향 링크 Ad-hoc 망을 위한 라우팅 프로토콜)

  • Park, Sang-Ho
    • Convergence Security Journal
    • /
    • v.7 no.3
    • /
    • pp.71-78
    • /
    • 2007
  • We proposed a simple and efficient routing protocol designed specifically for multi-hop ad-hoc networks. The proposed protocol is composed of the two routing tables which work together to allow nodes to send and receive packets. All aspects of the protocol can be operated on networks entirely consisting bidirectional links and networks with unidirectional links. Finding unidirectional link is embedded in the routing protocol since we considered not only bidirectional links but also unidirectional links when we developed a routing method.

  • PDF

A Study on Ad-Hoc Routing Protocol using Table-Driven DSR (테이블 구동 DSR을 이용한 에드혹 라우팅 프로토콜에 관한 연구)

  • 유기홍;하재승
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.9
    • /
    • pp.1209-1218
    • /
    • 2001
  • In this dissertation, we propose a dynamic source routing protocol supporting asymmetric path for mobile ad hoc networks. At present, the existing dynamic source routing protocol supports only symmetric path for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile termenals or current wireless environment. Thus, we implement a mobile ad hoc routing protocol supporting asymmetric routing path, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected.

  • PDF

A Effective Load Balancing Method in Ad-hoc Routing (Ad-hoc 라우팅에서의 효율적 부하균등 제어 기법)

  • 이지선;이병수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.100-102
    • /
    • 2002
  • 네트워크 기술의 급속한 발달로 인해 최근 무선 Ad-hoc 통신망에 관한 연구가 활발하게 진행되어 오고 있다. Ad-hoc망은 기존의 유선망에서와는 다르게 중앙 집중화된 관리를 필요로 하지 않고 지리적으로 분산된 각 노드들이 역동적으로 위치를 변경하며 라우터의 역할을 수행하여 단대단 정보전송 서비스를 제공한다. 그러나 제한된 통신 자원으로 인한 낮은 대역폭과 높은 전송 오류를 포함하고 있으며, 한정된 대역과 단말기능에 있어서의 제약으로 현재의 인터넷 라우팅 프로토콜들을 그대로 사용하기 어렵다. 현재 사용되고 있는Ad-hoc 네트워크에서의 라우팅 프로토콜은 네트워크 토폴로지가 변화해야만 새로운 경로를설정하도록 되어 있어 이동성이 낮은 환경에서의 트래픽 집중화 현상과 경로 설정을 위한 반복적 검색으로 서비스 효율이 떨어지는 문제점을 가지고 있다. 따라서 본 논문에서는 다중 이웃 노드 테이블을 별도 관리하고 혼잡 상황시 자노드 중계 차단을 수행하여 효율적으로 부하균등을 제어하는 라우팅 기법을 제시한다.

  • PDF