• Title/Summary/Keyword: hierarchical Routing Protocol

Search Result 118, Processing Time 0.441 seconds

A study on Ad hoc network path of optimized by using context awareness (속성정보를 이용한 최적의 자율망 경로탐색 기법에 관한 연구)

  • Chi, Sam-Hyun;Lee, Kang-Whan
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.765-766
    • /
    • 2008
  • In this paper, It has been emphasized of important path access during transmit of node when each node transmit broadcast service which one's of new MANET (Mobile Ad hoc Networks) of autonomy and mobility network structures. It has proposed analysis methods are hierarchical path structure of transmit which experience context aware through confidence to network connectivity alone as issue which can be reduce duplicate of beam forming on networks and maintenance one's of method got to optimized of transmission network that status information of context awareness using ad hoc ODDMRP(Ontology Doppler effect Dynamic Multicast Routing Protocol) path method.

  • PDF

Efficient Cluster Radius and Transmission Ranges in Corona-based Wireless Sensor Networks

  • Lai, Wei Kuang;Fan, Chung-Shuo;Shieh, Chin-Shiuh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1237-1255
    • /
    • 2014
  • In wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.

A Study of Hierarchical and Hybrid Ad Hoc Distance Vector Routing Protocol for a Stable Unidirectional Links Environment (안정적인 단방향 링크 환경을 위한 $H^2$DVRP Ad Hoc 라우팅 프로토콜 연구)

  • Park, Jun-Hee;Yoo, Whan-Suk;Kim, Sang-Ha
    • Annual Conference of KIPS
    • /
    • 2002.11b
    • /
    • pp.1367-1370
    • /
    • 2002
  • 본 논문에서는 안정적인 단방향 링크 환경을 갖는 Ad Hoc 네트워크에 적용할 수 있는 라우팅 프로토콜을 제안한다. 이동 Ad Hoc 네트워크에서 자주 발생하는 단방향 링크는 그 불안정성 때문에 프로토콜의 복잡성을 증가시키고, 성능을 저하시키는 원인이 될 수 있기 때문에 대부분의 현재 제안되고 있는 라우팅 프로토콜에서 고려되지 않고 있다. 그러나, 단방향 링크는 항상 양방향 링크보다 짧은 경로를 제공하여, 효율적 활용되면 오히려 망의 성능을 향상시킬 수 있는 중요한 망 자원이다. 본 논문에서는 반영구적으로 고정된 노드들을 망 하부구조로 갖으며 단방향 링크를 활용한 Ad Hoc 네트워크 구조(HANIC)를 소개하고, HANIC구조에 활용할 Ad Hoc 라우팅 프로토콜인 $H^2$DVRP를 제안한다. $H^2$DVRP는 AODV 라우팅 프로토콜에 단방향 링크 환경 지원을 위한 기능을 추가하여 구성된 라우팅 프로토콜이다.

  • PDF

Automatic Node Configuration Protocol for Small Sized Mobile Ad-Hoc Networks (소규모 이동 애드혹 네트워크에서의 자동 노드 설정 프로토콜)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.100-109
    • /
    • 2005
  • A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.

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.

Clustered Tributaries-Deltas Architecture for Energy Efficient and Secure Wireless Sensor Network (무선 센서 네트워크에서 에너지 효율성과 보안성을 제공하기 위한 클러스터 기반의 Tributaries-Deltas)

  • Kim, Eun-Kyung;Seo, Jae-Won;Chae, Ki-Joon;Choi, Doo-Ho;Oh, Kyung-Hee
    • The KIPS Transactions:PartC
    • /
    • v.15C no.5
    • /
    • pp.329-342
    • /
    • 2008
  • The Sensor Networks have limitations in utilizing energies, developing energy-efficient routing protocol and secure routing protocol are important issues in Sensor Network. In the field of data management, Tributaries and Deltas(TD) which incorporates tree topology and multi-path topology effectively have been suggested to provide efficiency and robustness in data aggregation. And our research rendered hierarchical property to TD and proposed Clustering-based Tributaries-Deltas. Through this new structure, we integrated efficiency and robustness of TD structure and advantages of hierarchical Sensor Network. Clustering-based Tributaries-Deltas was proven to perform better than TD in two situations through our research. The first is when a Base Station (BS) notices received information as wrong and requests the network's sensing data retransmission and aggregation. And the second is when the BS is mobile agent with mobility. In addition, we proposed key establishment mechanism proper for the newly proposed structure which resulted in new Sensor Network structure with improved security and energy efficiency as well. We demonstrated that the new mechanism is more energy-efficient than previous one by analyzing consumed amount of energy, and realized the mechanism on TmoteSKY sensor board using TinyOS 2.0. Through this we proved that the new mechanism could be actually utilized in network design.

Design of the new parallel processing architecture for commercial applications (상용 응용을 위한 병렬처리 구조 설계)

  • 한우종;윤석한;임기욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.5
    • /
    • pp.41-51
    • /
    • 1996
  • In this paper, anew parallel processing system based on a cluster architecture which provides scalability of a parallel processing system while maintains shared memory multiprocessor characteristics is proposed. In recent days low cost, high performnce microprocessors have led to construction of large scale parallel processing systems. Such parallel processing systems provides large scalability but are mainly used for scientific applications which have large data parallelism. A shared memory multiprocessor system like TICOM is currently used as aserver for the commercial application, however, the shared memory multiprocessor system is known to have very limited scalability. The proposed architecture can support scalability and performance of the parallel processing system while it provides adaptability for the commerical application, hence it can overcome the limitation of the shared memory multiprocessor. The architecture and characteristics of the proposed system shall be described. A proprietary hierarchical crsossbar network is designed for this system, of which the protocol, routing and switching technique and the signal transfer technique are optimized for the proposed architecture. The design trade-offs for the network are described in this paper and with simulation usihng the SES/workbench, it is explored that the network fits to the proposed architecture.

  • PDF

A Study on Caching Management Technique in Mobile Ad-hoc Network (Mobile Ad-hoc Network에서 캐싱 관리 기법에 관한 연구)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.12 no.4
    • /
    • pp.91-96
    • /
    • 2012
  • MANET is developed technique fairly among many field of wireless network. Nodes which consist of MANET transmit data using multi-hop wireless connection. Caching scheme is technique which can improve data access capacity and availability of nodes. Previous studies were achieved about dynamic routing protocol to improve multi-hop connection of moving nodes. But management and maintenance of effective cache information because of movement of nodes is not easy. In this study, we proposed cluster-based caching scheme to manage connection by decreasing overhead and moving of nodes as moving node discovers cache of wish information. And HLP was used to maintain effective cache table in each cluster head. Efficiency of proposed technique in this study was confirmed by experiment.

Clustering Scheme using Memory Restriction for Wireless Sensor Network (무선센서네트워크에서 메모리 속성을 이용한 클러스터링 기법)

  • Choi, Hae-Won;Yoo, Kee-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.10-15
    • /
    • 2009
  • Recently, there are tendency that wireless sensor network is one of the important techniques for the future IT industry and thereby application areas in it are getting growing. Researches based on the hierarchical network topology are evaluated in good at energy efficiency in related protocols for wireless sensor network. LEACH is the best well known routing protocol for the hierarchical topology. However, there are problems in the range of message broadcasting, which should be expand into the overall network coverage, in LEACH related protocols. Thereby, this paper proposes a new clustering scheme to solve the co-shared problems in them. The basic idea of our scheme is using the inherent memory restrictions in sensor nodes. The results show that the proposed scheme could support the load balancing by distributing the clusters with a reasonable number of member nodes and thereby the network life time would be extended in about 1.8 times longer than LEACH.

A Multicast-based Mobility Support Scheme in IPv6 Networks (IPv6 네트워크에서 멀티캐스트 기반 이동성 제공 방안)

  • Woo Mi ae;Jun Hong sun;Park Ho hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.210-217
    • /
    • 2005
  • With rapid advance in wireless communication technologies, many researches are conducted for providing Internet data services while users are roaming around. Efficient management of mobility of mobile nodes is essential as the use of real-time application program grows. In this paper, we propose a multicast-based localized mobility support scheme in IPv6 networks. The proposed scheme utilizes a class of multicast routing protocol for the localized mobility support. Features of the proposed scheme are use of join to a multicast group and leave from that group to localize binding update information and provision of an extended multicast group management mechanism to reduce leave latency. The results of simulation show that the proposed scheme out-performs Mobile IPv6 and Hierarchical Mobile IPv6 in UDP and TCP traffic performance and in wasted bandwidth.