• Title/Summary/Keyword: mobile ad-hoc networks

Search Result 702, Processing Time 0.028 seconds

A Study on Hierarchical Overlay Multicast Architecture in Mobile Ad Hoc Networks (Mobile Ad Hoc 네트워크를 위한 계층적 오버레이 멀티캐스트 구조 연구)

  • Kim, Kap-Dong;Park, Jun-Hee;Lee, Kwang-Il;Kim, Hag-Young;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.627-634
    • /
    • 2006
  • Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.

Implementation of an UWB Terminal for Tactical Ad Hoc Networks (UWB 병사통신 단말기의 구현)

  • Choi, Hanseung;Lee, Hyunseok;Koo, Myunghyun;Shin, Jeongho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.5
    • /
    • pp.50-58
    • /
    • 2013
  • In this paper, we present the implementation result of an UWB terminal for mobile tactical networks. Considering the major characteristics of the terminals of tactical networks, i) targeting voice service, ii) pedestrian users, and iii) demanding high network fidelity, we designed all protocol layers from physical layer to applications layer. The designed terminal is implemented in forms of software and hardware with RF ASIC, FPGA, DSP, and GPP. The functionality of the implemented terminal is validated by successfully performing 1 to 1 and multi-hop voice communication test.

Design of VoIP System over MANET (MANET 기반 VoIP 시스템 설계)

  • Li, Ming;Kim, Young-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.719-721
    • /
    • 2010
  • VoIP over MANET is an important IP phone technique used in mobile ad-hoc networks. VoIP system over wired networks is based on SIP, SIP UA and SIP server which process the users invite, register and so on. Since no base stations in MANETs to perform as SIP servers, VoIP service on MANETs is being done with tiny SIP server which is done on each node. In this paper, VoIP system is implemented with pseudo SIP server which can process 1 call based on modification of standard SIP server which is used on communication environment such as wired networks. The propesed system is performed well and compatible with SIP and SIP UA.

  • PDF

Improvement of Peer Search Time and Control Messages with Rendezvous Peer in P2P Virtual Network

  • Jeong, Wang-Boo;Sohn, Young-Ho;Suh, Hyun-Gon;Kim, Ki-Hyung
    • International Journal of Contents
    • /
    • v.5 no.1
    • /
    • pp.21-26
    • /
    • 2009
  • Peer to Peer (P2P) utilizes the resources of an offered service without the need for a central server or preexistent server-client, making it a desirable network environment for data exchange based on direct connection between peers. Proposed by Sun Microsystems. JXTA(Juxtapose) is a typical P2P system and distributed computing model that does not require central service resources and is flexible to deal with various network configuration changes. Meanwhile. Mobile Ad-hoc NETwork(MANET) is a typical wireless network configured with mobile nodes and without an infrastructure. where a network is established by direct connection or through other peers in the propagation area. Thus, MANET maintains the latest path information by establishing paths and changing path information for communication between peers in a highly mobile wireless network. Accordingly. this article proposes the JXTAMANET method for wireless networks to enable JXTA to be applied to MANET. NS2 is used to evaluate the performance and the proposed architecture is shown to produce better results than a conventional flooding method.

An Energy Efficient Clustering Algorithm in Mobile Adhoc Network Using Ticket Id Based Clustering Manager

  • Venkatasubramanian, S.;Suhasini, A.;Vennila, C.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.341-349
    • /
    • 2021
  • Many emerging mobile ad-hoc network application communications are group-oriented. Multicast supports group-oriented applications efficiently, particularly in a mobile environment that has a limited bandwidth and limited power. Energy effectiveness along with safety are 2 key problem in MANET design. Within this paper, MANET is presented with a stable, energy-efficient clustering technique. In this proposed work advanced clustering in the networks with ticket ID cluster manager (TID-CMGR) has formed in MANET. The proposed routing scheme makes secure networking the shortest route possible. In this article, we propose a Cluster manager approach based on TICKET-ID to address energy consumption issues and reduce CH workload. TID-CMGR includes two mechanism including ticket ID controller, ticketing pool, route planning and other components. The CA (cluster agent) shall control and supervise the functions of nodes and inform to TID-CMGR. The CH conducts and transfers packets to the network nodes. As the CH energy level is depleted, CA elects the corresponding node with elevated energy values, and all new and old operations are simultaneously stored by CA at this time. A simulation trial for 20 to 100 nodes was performed to show the proposed scheme performance. The suggested approach is used to do experimental work using the NS- simulator. TIDCMGR is compared with TID BRM and PSO to calculate the utility of the work proposed. The assessment shows that the proposed TICKET-ID scheme achieves 90 percent more than other current systems.

Self-Adaptive Checking Location Mechanism Based Georouting Algorithm in Mobile Ad Hoc Networks (이동 에드혹 네트워크에서 셀프 채킹 방법을 이용한 위치 기반 라우팅 알고리즘)

  • Youn, Joo-Sang;Park, Sangheon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.1178-1181
    • /
    • 2009
  • Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

An Improved CBRP using Secondary Header in Ad-Hoc network (Ad-Hoc 네트워크에서 보조헤더를 이용한 개선된 클러스터 기반의 라우팅 프로토콜)

  • Hur, Tai-Sung
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.31-38
    • /
    • 2008
  • Ad-Hoc network 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, many new algorithms have been studied recently. This study proposes the secondary header approach to the cluster based routing protocol (CBRP). The primary header becomes abnormal status so that the primary header can not participate in the communications between network entities, the secondary header immediately replaces the primary header without selecting process of the new primary header. This improves the routing interruption problem that occurs when a header is moving out from a cluster or in the abnormal status. The performances of proposed algorithm ACBRP(Advanced Cluster Based Routing Protocol) are compared with CBRP. The cost of the primary header reelection of ACBRP is simulated. And results are presented in order to show the effectiveness of the algorithm.

  • PDF

A Mechanism for Improving Network Scalability of Location-based Overlay Multicast in Mobile Ad hoc Networks (위치기반 오버레이 애드 혹 멀티캐스트에서의 네트워크 확장성 개선 방안)

  • kim Bongsoo;Jung Kwansoo;Cho Hochoong;Choi Younghwan;Kim Sang-Ha
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.319-321
    • /
    • 2005
  • 이동 애드 혹 네트워크은 빈번한 위상 변화가 일어난다. 이에 대처하기 위해 비상태 멀티캐스팅이나 위상 변화에 강한 특성을 지니는 오버레이 멀티캐스트 프로토콜들이 제안되고 있다. 하지만 이들의 대부분은 소규모 그룹에 대한 멀티캐스트만을 지원한다. 그러나 이동 애드 혹 네트워크의 대표적인 응용들은 대규모 그룹 통신을 사용하므로 확장성 문제는 해결되어야 한다. 따라서 본 논문에서는 이를 개선하기 위해 단일 홉 클러스터링과 프록시 노드 사용을 제안한다. 단일 홉 클러스터링은 구조적인 관리가 필요한 노드 수를 줄일 수 있으며 프록시 노드는 단일 홉 클러스터링으로 줄어든 노드들에게 계층화된 포워딩을 제공한다.

  • PDF

Energy-Efficient Coordinator Selection Algorithm for Mobile Ad-Hoc Networks (이동 애드혹 네트워크 환경에서의 에너지 효율적인 코디네이터 선정 알고리즘)

  • Yu Ji-Won;Oh Se-In;Kim Hyo-Eun;Park Yong-Jin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.328-330
    • /
    • 2005
  • 이동 애드혹 네트워크 환경에서는 다수의 노드들이 계속적인 전원의 공급 없이 배터리로 작동을 하게 된다. 이러한 상황에서 이동 애드혹 네트워크에 참여하고 있는 각각의 노드들의 에너지 소모를 최소화 하기 위한 방법으로써 네트워크에 참여하고 있는 노드들 중에서 코디네이터를 선정하여 에너지를 절약하는 방법이 고안되어 왔다. 본 논문에서는 노드 개개의 수명은 물론 전체 네트워크의 수명을 보다 증가 시키기 위하여 코디네이터를 선정하는 알고리즘을 보다 효율적으로 개선하는 방법을 제안한다.

  • PDF

A Dual-Channel AODV Routing Protocol for Mobile Ad Hoc Networks (모바일 애드 혹 네트워크를 위한 이중 채널 AODV 라우팅 프로토콜)

  • Yoo, Dae-Hun;Jo, Won-Geun;Choi, Woong-Chul;Rhee, Seung-Hyong;Chung, Kwang-Sue
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.427-429
    • /
    • 2005
  • 모바일 애드 흑 네트워크에서 않은 라우팅 프로토콜들이 연구되어지고 있다. 연구된 프로토콜 가운데 널리 쓰이고 있는 AODV는 On-Demand 방식으로써, 필요에 따라 라우팅 정보를 얻기 위한 메카니즘을 사용한다. 여기서 라우팅 정보를 얻은 이루에 링크 상태를 점검하기 위해서, Table-Driven 방식과 비슷하게 주기적으로 메시지를 전송함으로써 링크가 끊어질 경우의 상황을 인지 할 수 있도록 한다. 비록 On-Demand라 할지라도 주변에 노드들이 않으면, 라우팅의 유지를 위해 주기적으로 전송하는 패킷과 요구에 따른 라우팅 패킷으로 데이터를 전송하기 위한 대역폭에 영향물 줄 수 있다. 그래서 본 논문에서는 데이터를 전송하기 위한 채널과 제어/라우팅 정보를 교환하는 채널로 나누고 데이터를 전송하는데 있어서 신뢰성 있고 일정한 대역폭의 사용량을 줄 수 있는 방법을 제안한다.

  • PDF