• Title/Summary/Keyword: hierarchical Routing Protocol

Search Result 118, Processing Time 0.028 seconds

Short-cut Routing Algorithm Using Neighbor Node List in Hierarchical Routing for 6LoWPAN (6LoWPAN의 계층적 라우팅 기법에서 이웃 노드 리스트를 이용한 Short-cut 라우팅 알고리즘)

  • Kang, Moon-Kyoung;Jin, Kyo-Hong
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.3
    • /
    • pp.296-305
    • /
    • 2007
  • The HiLow, a hierarchical routing protocol for 6LoWPAN, needs smaller memory allocation and energy than other routing protocols. However, the HiLow has a weak point that does not provide the optimized routing path. In this paper, we propose the algorithm that can find the optimum next hop using neighboring nodes around the source node as well as hierarchical routing path information. We evaluate the performance of proposed algorithm using the computer simulation, and we can acquire results that decreases a number of hop count and transmitted message.

  • PDF

Using The Fixed ZRP Based MANET (MANET 기반의 Fixed ZRP를 이용한 효율적인 경로 탐색 기법)

  • Kim, Nack Hyun;Lee, Hoon Jae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.463-466
    • /
    • 2009
  • MANET(Mobile Ad-Hoc Network) mean network that configured to mobile device without the help of Fixed infra. Node in MANET constraints have such as liquidity and battery. Node concentrated areas or the size of the network becomes large that causes some issues. It's the problem of routing overhead when path set, path navigation and reset path. In this paper ZRP(Zone Routing Protocol) and ZHLS(Zone-Based Hierarchical Link State) are analyzed. As a result, offers the Fixed ZRP.

  • PDF

A Secure, Hierarchical and Clustered Multipath Routing Protocol for Homogenous Wireless Sensor Networks: Based on the Numerical Taxonomy Technique

  • Hossein Jadidoleslamy
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.8
    • /
    • pp.121-136
    • /
    • 2023
  • Wireless Sensor Networks (WSNs) have many potential applications and unique challenges. Some problems of WSNs are: severe resources' constraints, low reliability and fault tolerant, low throughput, low scalability, low Quality of Service (QoS) and insecure operational environments. One significant solution against mentioned problems is hierarchical and clustering-based multipath routing. But, existent algorithms have many weaknesses such as: high overhead, security vulnerabilities, address-centric, low-scalability, permanent usage of optimal paths and severe resources' consumption. As a result, this paper is proposed an energy-aware, congestion-aware, location-based, data-centric, scalable, hierarchical and clustering-based multipath routing algorithm based on Numerical Taxonomy technique for homogenous WSNs. Finally, performance of the proposed algorithm has been compared with performance of LEACH routing algorithm; results of simulations and statistical-mathematical analysis are showing the proposed algorithm has been improved in terms of parameters like balanced resources' consumption such as energy and bandwidth, throughput, reliability and fault tolerant, accuracy, QoS such as average rate of packet delivery and WSNs' lifetime.

Advanced HEED protocol using distance weight in USN (USN 환경에서 거리 가중치를 사용한 개선된 HEED 프로토콜)

  • Jeoung, Su-Hyung;Yoo, Hae-Young
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.2
    • /
    • pp.370-376
    • /
    • 2009
  • Recently, Study for routing protocol is gone vigorously in the Ubiquitous Sensor Network. A hierarchical routing protocol is being practical and received interest among them. Therefore we analyze a weak point of HEED. And I suggest the new protocol that solved a weak point of HEED. The new protocol that we propose puts weight in the energy remainder amount than HEED and elect CH. And elected CH is designed to change by new node when quantity of energy leftover becomes less than 50%. Therefore all nodes come to use energy fairly. The protocol that we proposed can prove the cluster survival rate about 30%. And CH is more effective because when elect CH replace, response time selects small node.

Performance Comparison between Hierarchical Routing Protocols applying New Performance Evaluation Items (성능 비교 항목들을 적용한 계층형 라우팅 프로토콜간의 성능비교)

  • Lee, Jong-Yong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.4
    • /
    • pp.51-57
    • /
    • 2020
  • WSN is a wirelessly configured network of sensor nodes with limited power such as batteries. If the sensor node's battery is exhausted, the node is no longer available. Therefore, if the network is to be used for a long time, energy consumption should be minimized. There are many Wireless Sensor Network Protocols to improve energy efficiency, including Cluster-based and chain-based Protocols. This paper seeks to examine the performance evaluation of routing protocols studied separately for the improvement of performance in wireless sensor network. The criteria for comparison were selected as the LEACH protocol, a representative hierarchical routing protocol, and the comparison targets considered CHEF and FLCFP and LEACH-DFL routing protocols with Fuzzy Logic. Various criteria for performance comparison were presented in this paper, and the performance was compared through simulation of each protocol. The purpose is to present a reference point for comparing the performance of other protocols through the performance comparison of CHEF, FLCFP, and LEACH-DFL, protocols with LEACH and Fuzzy Logic, and to provide additional design methods for improving the performance of protocols.

Energy Efficient Routing Protocol Based on PEGASIS in WSN Environment (WSN 환경에서 PEGASIS 기반 에너지 효율적 라우팅 프로토콜)

  • Byoung-Choul Baek;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.4
    • /
    • pp.579-586
    • /
    • 2023
  • A wireless sensor network (WSN) has limited battery power because it is used wirelessly using low-cost small sensors. Since the battery cannot be replaced, the lifespan of the sensor node is directly related to the lifespan of the battery, so power must be used efficiently to maximize the lifespan of the network. In this study, based on PEGASIS, a representative energy-efficient routing protocol, we propose a protocol that classifies layers according to the distance from the sink node and configures multiple chains rather than one chain. The proposed protocol can increase network lifespan by reducing the transmission distance between nodes to prevent unnecessary energy consumption.

An Energy Effective Protocol for Clustering Ad Hoc Network

  • Lee, Kang-Whan;Chen, Yun
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.117-121
    • /
    • 2008
  • In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

A MANET Routing Protocol using Address Autoconfiguration in Zone-based MANETs (존 기반 MANET에서의 주소 자동 설정 기술을 이용한 라우팅 프로토콜)

  • Park, Ik-Kyun;Kang, Nam-Hi;Kim, Young-Han
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.897-904
    • /
    • 2006
  • In large-scale MANETs, the performance of MANET routing protocols is degraded significantly. To avoid this, zone-based hierarchical architecture is proposed. In this architecture, single large-scale MANET is divided into multiple small-scale MANETs. In this paper, we propose autoconfiguration-coupled MANET routing protocol to reduce routing overhead of mim user nodes. If MANET routing protocol utilizes the autoconfigured information of each user node, its overhead or procedure can be reduced. Proposed method shows the degradation of routing overhead of user nodes via simulation.

Performance Analysis of Hierarchical Routing Protocols for Sensor Network (센서 네트워크를 위한 계층적 라우팅 프로토콜의 성능 분석)

  • Seo, Byung-Suk;Yoon, Sang-Hyun;Kim, Jong-Hyun
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.4
    • /
    • pp.47-56
    • /
    • 2012
  • In this study, we use a parallel simulator PASENS(Parallel SEnsor Network Simulator) to predict power consumption and data reception rate of the hierarchical routing protocols for sensor network - LEACH (Low-Energy Adaptive Clustering Hierarchy), TL-LEACH (Two Level Low-Energy Adaptive Clustering Hierarchy), M-LEACH (Multi hop Low-Energy Adaptive Clustering Hierarchy) and LEACH-C (LEACH-Centralized). According to simulation results, M-LEACH routing protocol shows the highest data reception rate for the wider area, since more sensor nodes are involved in the data transmission. And LEACH-C routing protocol, where the sink node considers the entire node's residual energy and location to determine the cluster head, results in the most efficient energy consumption and in the narrow area needed long life of sensor network.

Efficient Dual-layered Hierarchical Routing Scheme for Wireless Sensor Networks

  • Yoon, Mahn-Suk;Kim, Hyun-Sung;Lee, Sung-Woon
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2008.10b
    • /
    • pp.507-511
    • /
    • 2008
  • Supporting energy efficiency and load balancing in wireless sensor network is the most important issue in devising the hierarchical routing protocols. Recently, the dual layered clustering scheme with GPS was proposed for the supporting of load balancing for cluster heads but there would be many collided messages in the overlapped area between two layers. Thereby, the purpose of this paper is to reduce the collision rate in the overlapped layer by concisely distinguish them with the same number of nodes in them. For the layer partition, this paper uses an equation $x^2+ y^2{\le}(\frac{R}{\sqrt{2\pi}})^2$ to distinguish layers. By using it, the scheme could efficiently distinguish two layers and gets the balanced number of elements in them. Therefore, the proposed routing scheme could prolong the overall network life cycle about 10% compared to the previous two layered clustering scheme.

  • PDF