• Title/Summary/Keyword: hierarchical Routing Protocol

Search Result 118, Processing Time 0.03 seconds

Design Self-Organization Routing Protocol for supporting Data Security in Healthcare Sensor Network (헬스케어 센서 네트워크에서 데이터 보안을 지원한 자기구성 라우팅 프로토콜 설계)

  • Nam, Jin-Woo;Chung, Yeong-Jee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.517-520
    • /
    • 2008
  • Wireless sensor network supporting healthcare environment should provide customized service in accordance with context information such as continuous location change and status information for people or movable object. In addition, we should consider data transmission guarantees a person's bio information and privacy security provided through sensor network. In this paper analyzes LEACH protocol which guarantees the dynamic self-configuration, energy efficiency through configuration of inter-node hierarchical cluster between nodes and key distribution protocol used for security for data transmission between nodes. Based on this analysis result, we suggested self-configuration routing protocol supporting node mobility which is weakness of the existing LEACH protocol and data transmission method by applying key-pool pre-distribution method whose memory consumption is low, cluster unit public key method to sensor node.

  • PDF

Autonomous routing control protocol for mobile ad-hoc networks

  • Kim, Dong-Ok;Kang, Dong-Jin
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.17-20
    • /
    • 2008
  • A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, the following requirements must be satisfied. The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multihop clustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the ad hoc network, which satisfy the above requirements.

  • PDF

Implementation of the PNNI Routing Simulator for Analyze Topology Aggregation (Topology Aggregation 분석을 위한 PNNI 라우팅 시뮬레이터 구현)

  • 金辯坤;金觀雄;丁光日;申鉉順;鄭炅澤;田炳實
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.6
    • /
    • pp.1-1
    • /
    • 2002
  • In this paper, we focus on comparison and analysis of performance for existing Topology Aggregation algorithm. For these, we designed and implemented PNNI routing simulator which contain various TA schemes, and evaluate performance of TA schemes by this simulator. The PNNI 1.0 specification of the ATM Forum is recommended that hierarchical routing protocol and topology information is aggregated in the network constructed hierarchically Aggregating topology information is known as TA(Topology Aggregation) and TA is very important for scalability and security in network. Therefore, the performance of PNNI network would vary with TA schemes and routing algorithm. PNNI routing simulator can be applied to develope Routing algorithm and TA algorithm and can be develope these algorithms in short period.

A Modified E-LEACH Routing Protocol for Improving the Lifetime of a Wireless Sensor Network

  • Abdurohman, Maman;Supriadi, Yadi;Fahmi, Fitra Zul
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.845-858
    • /
    • 2020
  • This paper proposes a modified end-to-end secure low energy adaptive clustering hierarchy (ME-LEACH) algorithm for enhancing the lifetime of a wireless sensor network (WSN). Energy limitations are a major constraint in WSNs, hence every activity in a WSN must efficiently utilize energy. Several protocols have been introduced to modulate the way a WSN sends and receives information. The end-to-end secure low energy adaptive clustering hierarchy (E-LEACH) protocol is a hierarchical routing protocol algorithm proposed to solve high-energy dissipation problems. Other methods that explore the presence of the most powerful nodes on each cluster as cluster heads (CHs) are the sparsity-aware energy efficient clustering (SEEC) protocol and an energy efficient clustering-based routing protocol that uses an enhanced cluster formation technique accompanied by the fuzzy logic (EERRCUF) method. However, each CH in the E-LEACH method sends data directly to the base station causing high energy consumption. SEEC uses a lot of energy to identify the most powerful sensor nodes, while EERRCUF spends high amounts of energy to determine the super cluster head (SCH). In the proposed method, a CH will search for the nearest CH and use it as the next hop. The formation of CH chains serves as a path to the base station. Experiments were conducted to determine the performance of the ME-LEACH algorithm. The results show that ME-LEACH has a more stable and higher throughput than SEEC and EERRCUF and has a 35.2% better network lifetime than the E-LEACH algorithm.

HPR: Hierarchical Prefix Routing for Nested Mobile Networks (HPR: 중첩된 이동 망에 대한 계층적 프리픽스 라우팅)

  • Rho, Kyung-Taeg
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.165-173
    • /
    • 2006
  • Network Mobility Basic Support protocol enables mobile network to change their point of attachment to the Internet, but causes some problems such as suboptimal muting and multiple encapsulations. The proposed scheme, combining Prefix Delegation protocol with HMIPv6 concept can provide more effective route optimization and reduce the amount of packet losses and the burden of location registration for handoff. It also uses hierarchical mobile network prefix (HMNP) assignment and provides tree-based routing mechanism to allocate the location address of mobile network nodes (MNNs) and support micro-mobility. In this scheme, Mobility Management Router (MMR) not only maintains the binding informations for all MNNs in nested mobile networks, but also supports binding procedures to reduce the volume of handoff signals oyer the mobile network. The performance is evaluated using NS-2.

  • PDF

A QoS-based Multicast Protocol in Hierarchical Encoding Environment (계층화된 인코딩 환경에서 서비스 품질 보장을 지원하는 멀티캐스트 프로토콜)

  • Im, Yu-Jin;Choe, Jong-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.9
    • /
    • pp.1112-1125
    • /
    • 1999
  • 최근 들어 멀티미디어를 지원하는 응용들의 서비스 품질 보장과 멀티캐스트 지원에 대한 요구가 증가되고 있으나 기존의 멀티캐스트 프로토콜로는 이러한 요구를 수용할 수 없는 문제가 발생하고 있다. 현재 인터넷에서 사용되고 있는 라우팅 메커니즘은 네트워크 자원 정보나 세션의 QoS 요구사항을 고려하지 않고 단순히 종단간의 연결에만 초점을 맞추고 있기 때문이다. 따라서 본 논문에서는 멀티캐스트 환경에서 서비스 품질보장을 지원하기 위한 새로운 프로토콜, LayeredQoS을 제안한다. 다중의 CP (Central Point)를 채택하고 각각의 CP에 적절한 QoS 레벨을 부여하여 사용함으로써 대역폭의 공유정도를 높일 뿐만 아니라 전체 트리 비용을 감소시켜 궁극적으로 네트워크 처리량이 증가되도록 하였다. 또한 시뮬레이션 방법을 통하여 다른 프로토콜보다 나은 성능을 가지는 것으로 평가하였다.Abstract Many emerging multimedia applications often require a guaranteed quality of service and multicast connection. But the traditional multicast protocol can't meet the needs since the routing mechanisms deployed in today's Internet are focused on connectivity, not on resource availability in the network or QoS requirements of flows. In this paper, we present LayeredQoS, a new QoS-based multicast routing algorithm. We adopt the multiple CPs(Central Points) and allocate QoS-levels for each CP in order to improve the degree of resource sharing and decrease the total tree cost, and then network throughput is increased. The proposed protocol is verified by simulations and it is shown that the performance of LayeredQoS is much better than the existing protocols.

A Sensor Network Security Protocol for Monitoring the State of Bridge (교량감시를 위한 센서 네트워크 보안프로토콜)

  • Lim, Hwa-Jung;Jeon, Jin-Soon;Lee, Heon-Guil
    • Journal of Industrial Technology
    • /
    • v.25 no.B
    • /
    • pp.211-220
    • /
    • 2005
  • The wireless sensor network consists of a number of sensor nodes which have physical constraints. Each sensor node senses surrounding environments and sends the sensed information to Sink. The inherent vulnerability in security of the sensor nodes has promoted the needs for the lightweight security protocol. In this paper, we propose a non-hierarchical sensor network and a security protocol that is suitable for monitoring the man-made objects such as bridges. Furthermore, we present the efficient way of setting the routing path by storing IDs, MAC(message authentication code) and the location information of the nodes, and taking advantage of the two node states, Sleep and Awake. This also will result in the reduced energy consuming rate.

  • PDF

An Efficient Data Dissemination Protocol for Cluster-based Wireless Sensor Networks (클러스터 기반의 무선 센서네트워크에서 통신량을 줄인 데이터 보급방법)

  • Cho, Ji-Eun;Choe, Jong-Won
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.3
    • /
    • pp.222-230
    • /
    • 2009
  • A sensor network is an important element of the ubiquitous and it consists of sensor fields that contain sensor nodes and sink nodes that collect data from sensor nodes. Since each sensor node has limited resources, one of the important issues covered in the past sensor network studies has been maximizing the usage of limited energy to extend network lifetime. However, most studies have only considered fixed sink nodes, which created various problems for cases with multiple mobile sink nodes. Accordingly, while maintaining routes to mobile sink nodes, this study aims to deploy the hybrid communication mode that combines single and multi-hop modes for intra-cluster and inter-cluster transmission to resolve the problem of failed data transmission to mobile sink nodes caused by disconnected routes. Furthermore, a 2-level hierarchical routing protocol was used to reduce the number of sensor nodes participating in data transmission, and cross-shape trajectory forwarding was employed in packet transmission to provide an efficient data dissemination method.

Modified LEACH Protocol improving the Time of Topology Reconfiguration in Container Environment (컨테이너 환경에서 토플로지 재구성 시간을 개선한 변형 LEACH 프로토콜)

  • Lee, Yang-Min;Yi, Ki-One;Kwark, Gwang-Hoon;Lee, Jae-Kee
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.311-320
    • /
    • 2008
  • In general, routing algorithms that were applied to ad-hoc networks are not suitable for the environment with many nodes over several thousands. To solve this problem, hierarchical management to these nodes and clustering-based protocols for the stable maintenance of topology are used. In this paper, we propose the clustering-based modified LEACH protocol that can applied to an environment which moves around metal containers within communication nodes. In proposed protocol, we implemented a module for detecting the movement of nodes on the clustering-based LEACH protocol and improved the defect of LEACH in an environment with movable nodes. And we showed the possibility of the effective communication by adjusting the configuration method of multi-hop. We also compared the proposed protocol with LEACH in four points of view, which are a gradual network composition time, a reconfiguration time of a topology, a success ratio of communication on an containers environment, and routing overheads. And to conclude, we verified that the proposed protocol is better than original LEACH protocol in the metal containers environment within communication of nodes.

Performance Evaluation of Distributed Clustering Protocol under Distance Estimation Error

  • Nguyen, Quoc Kien;Jeon, Taehyun
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.11-15
    • /
    • 2018
  • The application of Wireless Sensor Networks requires a wise utilization of limited energy resources. Therefore, a wide range of routing protocols with a motivation to prolong the lifetime of a network has been proposed in recent years. Hierarchical clustering based protocols have become an object of a large number of studies that aim to efficiently utilize the limited energy of network components. In this paper, the effect of mismatch in parameter estimation is discussed to evaluate the robustness of a distanced based algorithm called distributed clustering protocol in homogeneous and heterogeneous environment. For quantitative analysis, performance simulations for this protocol are carried out in terms of the network lifetime which is the main criteria of efficiency for the energy limited system.