Hierarchical Routing Protocol Research Articles

A management Ad Hoc networks model for rescue and emergency scenarios

This present research shows the creation of a model for the management of Ad Hoc mobile networks called HAMAN (High Availability Management Ad Hoc Networks). The HAMAN model has been structured in layers in which each of the components and interfaces has been formally defined. HAMAN uses a hierarchical routing strategy through subsets of nodes or clusters. In order to improve the hierarchical routing and the convergence of the clusters and of the network it is proposed to use a backup cluster head. The use of a event discrete simulator is used for the implementation of a hierarchical routing protocol called the Backup Cluster Head Protocol (BCHP). Finally it is shown that the BCHP protocol, part of the proposed management model, improves the convergence and availability of the network through a comparative analysis with the Ad Hoc On Demand Distance Vector (AODV) (Perkins, Belding-Royer, & Das, 2003) routing protocol and Cluster Based Routing Protocol (CBRP) (Jiang, Li, & Tay, 1999).

Performance evaluation of network lifetime spatial-temporal distribution for WSN routing protocols

Despite the disparity in the objectives of sensor applications, the main task of sensor networks is to sense and collect data from a target domain, process the collected data, and transmit the information back to the base station. Achieving this task efficiently requires the development of an energy-efficient routing protocol to set up paths between sensor nodes and the base station. The path selection must be such that the lifetime of the network is maximized. The definition of this metric is determined by the type of the provided service. Using several definitions of lifetime and a common evaluation framework, the lifetime of some representative flat and hierarchical sensor network routing protocols has been analyzed, namely: DIRECT, FLOODING, GOSSIPING, LEACH, and HEED. Extensive simulations have been carried out yielding a detailed analysis of the spatial-temporal distribution of lifetimes. Through this study, a new technique aimed at providing a good spatial-temporal distribution of lifetime is proposed. The resulting EHEED protocol is compared to others. Experimental results show that EHEED can extend remarkably the network lifetime and can be very effective for long-lived sensor network.

An Improved LEACH Routing Protocol for Energy-Efficiency of Wireless Sensor Networks

A wireless sensor network (WSN) is a wireless network consisting of a base station (BS) and multiple micro-sensor nodes. The micro-sensor nodes run on batteries that are not recharged during the network’s lifetime. Therefore, prolonging WSN lifetime is a significant problem. There are some energy-efficient hierarchical routing protocols designed especially for WSNs, such as sensor protocols for information negotiation (SPIN), low-energy adaptive clustering hierarchy (LEACH) and LEACH-centralized (LEACH-C). In this article, we propose an improvement on the LEACH routing protocol to decrease energy consumption and prolong network lifetime. LEACHDistance Energy (LEACH-DE) selects a cluster head node not only by considering residual energy of the node greater than the average residual energy level of nodes in network, but also by examining the geometric distance between the candidate node to the BS as a key parameter. The results of simulation show our proposed algorithm outperforms LEACH and LEACH-C in terms of conserving energy and prolonging WSN lifetime.

Research on hierarchical routing protocol based on optimal clustering head for wireless sensor networks

Developing an energy-efficient clustering protocol is one of the major issues in wireless sensor networks. In order to reduce overall energy consumption of wireless sensor networks, prolong network lifetime, the shortcomings of LEACH algorithm are studied. The clustering algorithm is composed of two phases, the cluster building phase and stable data communication phase. In this paper, the cluster head selection of the algorithm is improved. According to the residual energy of sensor nodes, communication energy consumption of neighbour nodes and the distance between the nodes and the sink nodes, a hierarchical routing protocol based on optimal clustering head for wireless sensor networks is proposed. On condition that the residual energy of the node exceeds a certain threshold, the probability of being clustering head is affected by the nodes’ network parameters. Simulation results show that the proposed algorithm can balance the energy consumption and prolong the network lifetime.

A Hierarchical Intrusion Detection Architecture for Wireless Sensor Networks

Networks protection against different types of attacks is one of most important posed issue into the network and information security application domains. This problem on Wireless Sensor Networks (WSNs), in attention to their special properties, has more importance. Now, there are some of proposed architectures and guide lines to protect Wireless Sensor Networks (WSNs) against different types of intrusions; but any one of them do not has a comprehensive view to this problem and they are usually designed and implemented in single-purpose; but, the proposed design in this paper tries to has been a comprehensive view to this issue by presenting a complete and comprehensive Intrusion Detection Architecture (IDA). The main contribution of this architecture is its hierarchical structure; i.e., it is designed and applicable, in one or two levels, consistent to the application domain and its required security level. Focus of this paper is on the clustering WSNs, designing and deploying Cluster-based Intrusion Detection System (CIDS) on cluster-heads and Wireless Sensor Network wide level Intrusion Detection System (WSNIDS) on the central server. Suppositions of the WSN and Intrusion Detection Architecture (IDA) are: static and heterogeneous network, hierarchical and clustering structure, clusters' overlapping and using hierarchical routing protocol such as LEACH, but along with minor changes. Finally, the proposed idea has been verified by designing a questionnaire, representing it to some (about 50 people) experts and then, analyzing and evaluating its acquired results.

무선 센서 네트워크의 자기 조직화된 클러스터의 에너지 최적화 구성에 관한 연구

Efficient energy consumption is a critical factor for deployment and operation of wireless sensor networks (WSNs). To achieve energy efficiency there have been several hierarchical routing protocols that organize sensors into clusters where one sensor is a cluster-head to forward messages received from its cluster-member sensors to the base station of the WSN. In this paper, we propose a self-organized clustering method for cluster-head selection and cluster based routing for a WSN. To select cluster-heads and organize clustermembers for each cluster, every sensor uses only local information and simple decision mechanisms which are aimed at configuring a self-organized system. By these self-organized interactions among sensors and selforganized selection of cluster-heads, the suggested method can form clusters for a WSN and decide routing paths energy efficiently. We compare our clustering method with a clustering method that is a well known routing protocol for the WSNs. In our computational experiments, we show that the energy consumptions and the lifetimes of our method are better than those of the compared method. The experiments also shows that the suggested method demonstrate properly some self-organized properties such as robustness and adaptability against uncertainty for WSN's.

CBHRP: A Cluster Based Routing Protocol for Wireless Sensor Network

A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to collect information from target field. On rotation basis, a head-set member receives data from the neighbor nodes and transmits the aggregated results to the distance base station. This protocol reduces energy consumption quite significantly and prolongs the life time of sensor network. It is found that CBHRP performs better than other well accepted hierarchical routing protocols like LEACH in term of energy consumption and time requirement.

A Novel Addressing Scheme for PMIPv6 Based Global IP-WSNs

IP based Wireless Sensor Networks (IP-WSNs) are being used in healthcare, home automation, industrial control and agricultural monitoring. In most of these applications global addressing of individual IP-WSN nodes and layer-three routing for mobility enabled IP-WSN with special attention to reliability, energy efficiency and end to end delay minimization are a few of the major issues to be addressed. Most of the routing protocols in WSN are based on layer-two approaches. For reliability and end to end communication enhancement the necessity of layer-three routing for IP-WSNs is generating significant attention among the research community, but due to the hurdle of maintaining routing state and other communication overhead, it was not possible to introduce a layer-three routing protocol for IP-WSNs. To address this issue we propose in this paper a global addressing scheme and layer-three based hierarchical routing protocol. The proposed addressing and routing approach focuses on all the above mentioned issues. Simulation results show that the proposed addressing and routing approach significantly enhances the reliability, energy efficiency and end to end delay minimization. We also present architecture, message formats and different routing scenarios in this paper.

Statistical Analysis for Large-Scale Hierarchical Networks Using Network Coding

To mitigate the overhead of routing protocols in any large-scale network, the hierarchical protocol was proposed in the early 1980s. However, the message relay would entail huge throughput reduction in such a hierarchical network. Thanks to the recently developed network coding techniques, a high-throughput low-complexity hierarchical protocol can be facilitated due to the multiple-source relay-based data transmissions built on the network coding schemes, particularly for the data communications between adjacent network levels. In this paper, we apply random geometry theory to evaluate the network performance of the proposed hierarchical routing method in the statistical average sense. Two essential measures, namely, routing complexity and average network throughput, are formulated and derived thereby. The numerical results demonstrate that significant improvements in terms of these three network performance measures can be achieved by the proposed hierarchical routing protocol using network coding according to our new statistical analysis.

Energy and Throughput Analysis of Hierarchical Routing Protocol 'LEACH' for Wireless Sensor Network

ABSTRACT Wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. The efficient utilization of energy source in a sensor node is very important criteria to prolong the life time of wireless sensor network. Wireless sensor networks have explored to many new protocols specifically designed for sensor networks where energy consideration is very crucial. Most of importance, given to hierarchical routing protocols based on clustering has better scalability. As sensor nodes are generally battery-powered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifetime can be extended to reasonable times. There are several energy efficient hierarchical routing protocols among this LEACH is famous protocol, we have simulated LEACH in NS2 and analyzed performance of LEACH in terms of energy, throughput and lifetime. Keywords : LEACH, Hierarchical Routing Algorithms, clustering, wireless sensor networks.

클러스터헤더 후보노드를 이용한 에너지 효율적인 클러스터링 방법

센서 네트워크에서 에너지 소비를 최소화하는 것은 가장 중요한 이슈 중 하나이다. 클러스터링 방법 중 LEACH 프로토콜은 에너지를 효율적으로 관리하기 위해 다수의 클러스터 영역을 분할하는 계층적 방법으로 동작된다. 그러나 LEACH 프로토콜은 매 라운드마다 새로운 클러스터를 구성하기 때문에 클러스터를 구성 할 때마다 소비되는 에너지는 전체 네트워크 수명을 단축시키는 요인으로 작용한다. 따라서 이 논문에서는 센서네트워크 환경에서 초기 라운드에 클러스터를 형성하고 클러스터헤더 후보노드를 선정하여 에너지 낭비를 해결하였다. 제안 모델은 초기 라운드에는 기존 LEACH보다 26% 에너지 소모가 증가한다. 그러나 라운드가 지속될수록 제안 방법은 최대 35%까지 전체 에너지소비가 감소됨을 네트워크 시뮬레이션 툴(NS-2)를 이용해 증명하였다. One of the major challenges of minimum energy consumption for wireless sensor networks(WSN) environment. LEACH protocol is hierarchical routing protocol that obtains energy efficiency by using clustering. However, LEACH protocol in each round, because the new cluster configuration, cluster configuration, whenever the energy consumed shorten the life of the network. Therefore in this paper, the cluster is formed in WSN environment in early stage and the problems with energy waste have been solved by selecting C-node. In the initial round of proposed model uses 26 percent more than traditional LEACH energy consumption. However, as the round is ongoing, it has been proved by the network simulation tool that the waste of energy could be diminished up to 35%.

무선 다중 홉 네트워크에서의 지역 기반의 계층적 멀티캐스트 라우팅 프로토콜

멀티캐스트 라우팅은 무선 다중 홉 네트워크에서 일대다 통신을 위하여 많은 영역에서 이용되며 멀티캐스트 그룹 멤버에게 효율적이고 공평한 통신 환경을 마련한다. 하지만 그룹 멤버의 통신 관리, 각 전송 경로간의 신호간섭 등 요인은 멀티캐스트 소스 노드에게 비교적 큰 부하를 발생시키고 전체 멀티캐스팅의 효율을 저하시킨다. 본 논문에서는 기반의 계층적 멀티캐스트 라우팅 기법이라고 하는 새로운 라우팅 기법을 제안하였다. 이 라우팅 기법은 지역 기반 라우팅 프로토콜의 속성을 기반으로 프로액티브 라우팅 기법을 지역 내부 노드 레벌의 멀티캐스팅에서, 리액티브 라우팅 기법을 지역 레벌의 경로 설정에 적용하여 설계하였다. 계층적이고 독립적인 멀티캐스팅이 서로 분리된 지역에서 작동함으로서 멀티캐스트 소스 노드의 부하를 분산시켰고 다중 경로사이의 신호 간섭을 최대한 회피하여 이상적인 멀티캐스트 전송률을 실현할 수 있었다.

A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks

With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner and other metrics. Finally some open issues in routing protocol design in large-scale wireless sensor networks and conclusions are proposed.

VCHR: Virtual Cluster-Based Hybrid Routing Protocol

There are a couple of inherent shortcomings which are hard to be overcome in single topology network; thus we propose a novel routing protocol—VCHR, i.e., Virtual Cluster-based Hybrid Routing, which employs hybrid topology, bears the stamp of flat and hierarchical routing protocol. At stage of hierarchical routing, VCHR draws on the idea of the virtual cluster; base station controls clustering process based on network coverage control criteria in centralized model, and ensuring the reliability of virtual clusters by making use of the three-way handshake mechanism. Flat routing employs shortest path routing protocol to get the optimized routing path to base station. In context of low algorithm complexity, the protocol could realize full network coverage control, effectively balance energy load among sensor nodes and quickly respond to network dynamic changes.

Novel hierarchical routing protocol in wireless sensor network

Abstract Sensor networks consist of wireless enabled sensor nodes with limited energy. One of the most important problems in wireless sensor network is to develop an energy efficient routing protocol. Reducing energy consumption and prolonging network lifetime is an important issue in wireless sensor network. In this paper we propose a novel Hierarchical Routing Protocol (HRP) for prolonging sensor network lifetimes. HRP first cluster the network by the new factors second, construct routing tree on cluster heads for sending aggregated data to the base station. Also in this paper we present new intra-cluster coverage that can save more energy in sensors. Simulation results show that HRP can remarkably extend the network lifetime and amount of data gathered.

Comparison Study to Hierarchical Routing Protocols in Wireless Sensor Networks

Abstract Routing protocol of wireless sensor network research is the key problem, according to network topology, routing protocols can be divided into flat and hierarchical routing protocol. From the basic ideas, the advantages and disadvantages and applications the article introduces several typical hierarchical routing protocols in detail, which are analyzed and compared based on performance parameters, and finally summarizes the problems of routing protocols and possible research direction in future combined with the current research status.

Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks

The infrastructure less and dynamic nature of mobile ad hoc networks (MANET) needs efficient clustering algorithms to improve network management and to design hierarchical routing protocols. Clustering algorithms in mobile ad hoc networks builds a virtual backbone for network nodes. Dominating sets and Spanning tree are widely used in clustering networks. Dominating sets and Spanning Tree based MANET clustering algorithms were suitable in a medium size network with respect to time and message complexities. This paper presents different clustering algorithms for mobile ad hoc networks based on dominating sets and spanning tree.

Tree Routing Protocol with Location-based Uniformly Clustering Strategy in WSNs

In WSNs, energy efficiency and low latency are considered as two key issues in designing routing protocol. This paper introduces a two layer hierarchical tree routing protocol with location-based uniformly clustering strategy in WSNs (TRPLUCS), which can gives a good compromise between energy consumption and delay. First, TRPLUCS makes balanced clustering based on geographic regions. That is to say, all the clusters are uniformly distributed in WSNs with approximately equal number of nodes in each cluster. Second, TRPLUCS computes a spanning tree inside the cluster. Each node in cluster transmits data to its cluster-head along the spanning tree. Third, TRPLUCS constructs an optimal tree among all the cluster-heads. The data packets are then routed to the sink along the optimal tree. Simulation results show that TRPLUCS performs better than PEGASIS and LEACH in terms of energy*delay cost metric.

Energy efficient and perceived QoS aware video routing over Wireless Multimedia Sensor Networks

Wireless Sensor Networks (WSNs) have an ever increasing variety of multimedia based applications. Ιn these types of applications, network nodes should ideally maximize QoS and minimize energy expenditures in video communication. This article presents PEMuR, a novel dual scheme for efficient video communication, which aims at both energy saving and high QoS attainment. To achieve its objectives, PEMuR proposes the combined use of an energy aware hierarchical routing protocol with an intelligent video packet scheduling algorithm. The adopted routing protocol enables the selection of the most energy efficient routing paths, manages the network load according to the energy residues of the nodes and prevents useless data transmissions through the proposed use of an energy threshold. In this way, an outstanding level of energy efficiency is achieved. Additionally, the proposed packet scheduling algorithm enables the reduction of the video transmission rate with the minimum possible increase of distortion. In order to do so, it makes use of an analytical distortion prediction model that can accurately predict the resulted video distortion due to any error pattern. Thus, the algorithm may cope with limited available channel bandwidth by selectively dropping less significant packets prior to their transmission. Simulation results demonstrate the effectiveness of the proposed scheme.

Parameterized Affect of Transmission-Range on Lost of Network Connectivity (LNC) of Wireless Sensor Networks

Wireless Sensor Networks, referred to as WSNs, are made up of various types of sensor nodes. Recent developments in micro electro-mechanical technology have given rise to new integrated circuitry, microprocessor hardware and nano technology, wireless technology, and advanced networking routing protocols. Hospitals and health service facilities, the armed forces, and even residential customers represent a potential huge market for these devices. The problem is that existing sensor network nodes are incapable of providing the support needed to maximize usage of wireless technology. For this reason, there are many novel routing protocols for the wireless sensor networks proposed recently. One is Hierarchical or cluster-based routing. In this paper, we analyze three different types of hierarchical routing protocols: Low Energy Adaptive Clustering Hierarchy (LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), and Virtual Grid Architecture (VGA). We tried to analyze the performance of these protocols, including the power consumption and overall network performance. We also compared the routing protocol together. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks. The simulation results, using same limited sensing range value, show that PEGASIS outperforms all other protocols while LEACH has better performance than VGA. Furthermore, the paper investigates the power consumption for all protocols. On the average, VGA has the worst power consumption when the sensing range is limited, while VGA is the best when the sensing range is increased. Using homogeneous nodes can greatly prolong sensor network’s life time. Also, The network lifetime increases as the number of clusters decreases