Flat Routing Protocols Research Articles

Energy-Efficient Heterogeneous Optimization Routing Protocol for Wireless Sensor Network

A wide range of applications include in Wireless Sensor Networks (WSNs), and it is being used extensively in data collection specifically to process the mission-critical tasks. The implementation of routing protocols of energy-efficient (EE) is one of the significant challenging jobs of Sensor Networks (MC-SSN) and Mission Critical Sensors. In hierarchical routing protocols, higher EE can reach when compared to the flat routing protocols. The network’s scheduling process doesn’t support enhanced balanced Energy-efficient network-integrated super-heterogeneous (E-BEENISH), which discusses earlier. An Energy. Energy efficient Time scheduling based particle swarm optimization unequal fault tolerance clustering protocol (EE-TDMA-PSO-UFC) is proposed in this paper. Based on the distance parameter, an efficient cluster head (CH) is selected in this protocol. Owing to the unexpected failure of MCH (Master Cluster Head), an additional “CH” is chosen that is termed as Surrogate cluster head (SCH) for the restoration of network’s connectivity in the protocol of PSO-UFC. Based on TDMA (Time Division Multiple Access) protocols, the consumption of Energy. Energy is reduced with the allocation of timeslots during transmission of data. Using the technique of EE-TDMA-PSOUFC, the network’s lifespan improves than CEEC and E-BEENISH protocols according to the assessment of simulation results.

Comparison between Flat and Hierarchical Routing Protocols in Wireless Sensor Network

Wireless Sensor Network (WSN) has delivered the accessibility of small, tiny and low cost sensor nodes which are capable to sense various kinds of physical and environmental conditions, data processing, wireless communication and data gathering. In wireless sensor network routing protocols can be divided into two categories first is flat routing protocol and another is hierarchical routing protocol. In this paper flat and hierarchical routing protocols are evaluated and compared based on various performance parameters. In the last decade we have seen expanded enthusiasm for the potential utilization of remote wireless sensor systems (WSNs) in an extensive change of uses and it has turned into a unique research zone. So finally, in this research paper we are focusing on two different classes of routing protocols in WSN: flat routing and hierarchical or clustering routing.

Energy-Efficient Multilevel Heterogeneous Routing Protocol for Wireless Sensor Networks

Wireless sensor networks (WSNs) are being applied widely for data collection, especially to carry out the mission-critical tasks. Therefore, one of the most challenging tasks of mission-critical sensors and sensor networks is the development of energy efficient (EE) routing protocols. Comparing with flat routing protocols, more EE can be achieved in hierarchical routing protocols. In this paper, we propose an enhanced balanced energy efficient network-integrated super-heterogeneous (E-BEENISH) routing protocol, by analyzing communication energy consumption of the clusters and a large range of energy levels in heterogeneous WSNs. E-BEENISH is based on weighted election probabilities of each node to become a cluster head according to the remaining energy and the distance from the sink to the node. Moreover, we also study the impact of the heterogeneity of nodes in terms of energy. Studying the sensitivity of our stable election protocol, we conclude heterogeneity parameters capturing energy imbalance in the network and find that the E-BEENISH yields the longer stability region for the suitable weight of energy and distance. Our results show by simulation that the E-BEENISH can improve system lifetime by an order of magnitude compared to obtained using current clustering protocols, which is crucial for many applications.

Analysis on Energy Efficiency Flat Routing Protocols for Wireless Sensor Communication Network

Analysis on Energy Efficiency Flat Routing Protocols for Wireless Sensor Communication Network

Routing Protocols used in Wireless Sensor Network

Objectives: Distinctive routing protocols are designed where energy awareness is considered as essential design issue.The main objective of routing is to enhance the lifetime of the network by selecting appropriate route. Methods:Therouting protocols are classified into different categories which are location based routing protocols, hierarchical network routing and flat based routing protocols, Area based routing protocols are GAF, GEAR and SPAN. Hierarchical routing protocols are LEACH, PEGASIS, TEEN and APTEEN. Flat routing protocols are SPIN, Directed Diffusion and Rumor Routing. All these protocols have different working and perform different types of operations in order to increase the lifetime of the network. Findings: In Wireless Sensor Network, sensor nodes consist of limited storage capacity, transmission range as well as limited energy resources. Also the sensor nodes can process limited amount of data. So in this case we need to have some conventions which can help to reduce the energy consumption of nodes. We found that all routing protocols are performing different operations in order to minimize the energy consumption of the network. Different approaches are used to enhance the lifetime of the network. Some protocols are using hierarchical conventions, some are using flat routing conventions and some are using area based routing conventions.Every one of these conventions is serving the lifetime of system in their own specific manner. Applications:The routing protocols are used in all types of Wireless Sensor Networks in order to enhance the lifetime of the network. Routing protocols are mainly used in time-driven, event-driven and querydriven applications. Keywords: Base Station, Data Dissemination, Data Transmission,Energy Efficiency, Routing Protocols, Wireless Sensor Network

XOR-Based Routing Protocols in Vehicular Ad Hoc Networks: How Well Do They Perform?

This paper presents a performance analysis of exclusive-or logical operator (XOR)-based flat routing protocols in high mobility conditions, considering a vehicular ad hoc network (VANET) formed in a highway scenario. The main advantage of XOR-based routing is related to their logarithmic requirement of information per node in order to perform traffic forwarding, providing the basis to achieve better scalability levels for the routing mechanism convergence. First, this paper describes a protocol that incorporates several adaptations of the existing XOR-based routing algorithms for wired networks, in order to cope with the network mobility. Then it is proposed an improved version of it, XORi, which modifies the protocol’s information gathering process to accommodate the specific dynamic nature of VANETs topology in highways. Finally, the performance of XOR-based protocols is compared with other topology-based and position-based routing protocols. Simulation results allow us to characterize the performance of this class of protocols through the comparison of the path availability, end-to-end path delay, average path length and path duration. When a moderate density of nodes is considered, simulations show that XOR-based algorithms achieve almost the same path availability rate as link state algorithms, such as OLSR, and for high density of nodes, XOR-based algorithms scale better in terms of delay when compared to source routing algorithms, such as DSR.

Comparative Performance Analysis of Flat and Hierarchical Routing in Wireless Sensor Network

Wireless sensor network is composed of a set of sensors in a wireless network of self-organized. Research on topological structure of wireless sensor network is focused in two directions, namely plane topology structure and hierarchical topology structure. This paper gives a detailed analysis of wireless sensor networks in the flat routing protocols and hierarchical routing protocols, and compares the advantages and disadvantages of the performance of two kinds of protocol by simulation experiment.

A Review on Hierarchical Routing Protocols for Wireless Sensor Networks

The routing protocol for Wireless Sensor Networks (WSNs) is defined as the manner of data dissemination from the network field (source) to the base station (destination). Based on the network topology, there are two types of routing protocols in WSNs, they are namely flat routing protocols and hierarchical routing protocols. Hierarchical routing protocols (HRPs) are more energy efficient and scalable compared to flat routing protocols. This paper discusses how topology management and network application influence the performance of cluster-based and chain-based hierarchical networks. It reviews the basic features of sensor connectivity issues such as power control in topology set-up, sleep/idle pairing and data transmission control that are used in five common HRPs, and it also examines their impact on the protocol performance. A good picture of their respective performances give an indication how network applications, i.e whether reactive or proactive, and topology management i.e. whether centralized or distributed would determine the network performance. Finally, from the ensuring discussion, it is shown that the chain-based HRPs guarantee a longer network lifetime compared to cluster-based HRPs by three to five times.

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.

Distance aware intelligent clustering protocol for wireless sensor networks

Energy conservation is one of the most important issues for evaluating the performance of wireless sensor network (WSN) applications. Generally speaking, hierarchical clustering protocols such as LEACH, LEACH-C, EEEAC, and BCDCP are more efficient in energy conservation than flat routing protocols. However, these typical protocols still have drawbacks of unequal and high energy depletion in cluster heads (CHs) due to the different transmission distance from each CH to the base station (BS). In order to minimize the energy consumption and increase the network lifetime, we propose a new hierarchical routing protocol, distance aware intelligent clustering protocol (DAIC), with the key concept of dividing the network into tiers and selecting the high energy CHs at the nearest distance from the BS. We have observed that a considerable amount of energy can be conserved by selecting CHs at the nearest distance from the BS. Also, the number of CHs is computed dynamically to avoid the selection of unnecessarily large number of CHs in the network. Our simulation results showed that the proposed DAIC outperforms LEACH and LEACH-C by 63.28% and 36.27% in energy conservation respectively. The distance aware CH selection method adopted in the proposed DAIC protocol can also be adapted to other hierarchical clustering protocols for the higher energy efficiency.

Routing with off-network control: a novel paradigm for scalable design in very large sensor networks

This paper presents a novel architectural solution to address the problem of scalable routing in very large sensor networks. The control complexities of the existing sensor routing protocols, both flat and with traditional hierarchy, do not scale very well for large networks with potentially hundreds of thousands of embedded sensor devices. This paper develops a novel routing solution Off-Network Control Processing (ONCP) that achieves control scalability in large sensor networks by shifting certain amount of routing functions "off-network". This routing approach, consisting of "coarse grain" global routing, and distributed "fine grain" local routing is proposed for achieving scalability by avoiding network-wide control message dissemination. We present the ONCP architectural concepts and analytically characterize its performance in relation to both flat and traditional hierarchical sensor routing architectures. We also present ns2-based experimental results which indicate that for very large networks, the packet drop, latency and energy performance of ONCP can be significantly better than those for flat sensor routing protocols such as Directed Diffusion and cluster-based traditional hierarchical protocols such as CBRP.

An Energy-Aware Clustering Approach for Wireless Sensor Networks

Energy conservation is an essential and critical requirement for a wireless sensor network with battery oper-ated nodes intended for long term operations. Prior work has described different approaches to routing protocol designs that achieve energy efficiency in a wireless sensor network. Several of these works involve variations of mote-to-mote routing (flat routing) while some make use of leader nodes in clusters to perform routing (hierarchical routing). A key question then arises as to how the performance of an energy-aware, flat routing protocol compare with that of one based on hierarchical routing. This paper demonstrates a hierarchical routing protocol design that can conserve significant energy in its setup phase as well as during its steady state data dissemination phase. This paper describes the design of this protocol and evaluates its performance against existing energy-aware flat routing protocols. Simulation results show that it exhibits competitive performance against the flat routing protocols.

Performance Evaluation of Video Streaming Over Ad Hoc Networks Using Flat and Hierarchical Routing Protocols

A performance evaluation of real time services (such as video streaming) over mobile ad-hoc networks using both hierarchical and flat routing protocols is shown in this paper. A variety of workload...

An adaptive clustering routing transition protocol in ad hoc networks

To solve the expansibility problem of traditional flat routing protocols in ad hoc networks, an adaptive clustering routing transition protocol (ACRT) was proposed in this paper, by using the idea of adaptive clustering, routing transition and profits by the merits of passive clustering and gradual clustering. ACRT creates clusters adaptively by real-time apperceiving network scale which can solve the conflict between the expansibility of flat routing protocols and clustering overhead of clustering routing protocols. This mechanism takes the compatibility among different routing mechanisms into account to obtain high routing efficiency. ACRT can eliminate hangovers of flat routing protocol to reduce the occupancy of resources and storage cost by strict transition strategy. Simulation results show that ACRT has good expansibility and adaptive control action. ACRT is a correct and efficient routing mechanism.

센서 네트워크에서 에너지 효율성을 고려한 two-tier 라우팅 프로토콜

Since sensor node has a limited energy supply in a wireless sensor network, it is very important to maximize the network lifetime through energy-efficient routing. Thus, many routing protocols have been developed for wireless sensor networks and can be classified into flat and hierarchical routing protocols. Recent researches focus on hierarchical routing scheme and LEACH is a representative hierarchical routing protocol. In this paper, we investigated the problems of the LEACH and proposed a novel energy efficient routing scheme, called ENTER(ENergy efficient Two-tiEr Routing protocol), to resolve the problem. ENTER reduces an energy consumption and increases a network lifetime by organizing clusters by the same distributed algerian as in the LEACH and establishing paths among cluster-heads to transmit the aggregated data to the sink node. We compared the performance of the ENTER with the LEACH through simulation and showed that the ENTER could enhance the network lifetime by utilizing the resources more efficiently.

Scalable routing protocols for mobile ad hoc networks

The growing interest in mobile ad hoc network techniques has resulted in many routing protocol proposals. Scalability issues in ad hoc networks are attracting increasing attention these days. We survey the routing protocols that address scalability. The routing protocols included in the survey fall into three categories: flat routing protocols; hierarchical routing approaches; GPS augmented geographical routing schemes. The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs.