Showing papers on "Link-state routing protocol published in 2017"

Hijacking Bitcoin: Routing Attacks on Cryptocurrencies

Abstract: As the most successful cryptocurrency to date, Bitcoin constitutes a target of choice for attackers. While many attack vectors have already been uncovered, one important vector has been left out though: attacking the currency via the Internet routing infrastructure itself. Indeed, by manipulating routing advertisements (BGP hijacks) or by naturally intercepting traffic, Autonomous Systems (ASes) can intercept and manipulate a large fraction of Bitcoin traffic.This paper presents the first taxonomy of routing attacks and their impact on Bitcoin, considering both small-scale attacks, targeting individual nodes, and large-scale attacks, targeting the network as a whole. While challenging, we show that two key properties make routing attacks practical: (i) the efficiency of routing manipulation; and (ii) the significant centralization of Bitcoin in terms of mining and routing. Specifically, we find that any network attacker can hijack few (<100) BGP prefixes to isolate ∼50% of the mining power—even when considering that mining pools are heavily multi-homed. We also show that on-path network attackers can considerably slow down block propagation by interfering with few key Bitcoin messages.We demonstrate the feasibility of each attack against the deployed Bitcoin software. We also quantify their effectiveness on the current Bitcoin topology using data collected from a Bitcoin supernode combined with BGP routing data. The potential damage to Bitcoin is worrying. By isolating parts of the network or delaying block propagation, attackers can cause a significant amount of mining power to be wasted, leading to revenue losses and enabling a wide range of exploits such as double spending. To prevent such effects in practice, we provide both short and long-term countermeasures, some of which can be deployed immediately.

A Survey on Successors of LEACH Protocol

Abstract: Even after 16 years of existence, low energy adaptive clustering hierarchy (LEACH) protocol is still gaining the attention of the research community working in the area of wireless sensor network (WSN). This itself shows the importance of this protocol. Researchers have come up with various and diverse modifications of the LEACH protocol. Successors of LEACH protocol are now available from single hop to multi-hop scenarios. Extensive work has already been done related to LEACH and it is a good idea for a new research in the field of WSN to go through LEACH and its variants over the years. This paper surveys the variants of LEACH routing protocols proposed so far and discusses the enhancement and working of them. This survey classifies all the protocols in two sections, namely, single hop communication and multi-hop communication based on data transmission from the cluster head to the base station. A comparitive analysis using nine different parameters, such as energy efficiency, overhead, scalability complexity, and so on, has been provided in a chronological fashion. The article also discusses the strong and the weak points of each and every variants of LEACH. Finally the paper concludes with suggestions on future research domains in the area of WSN.

A Survey on Multipath Routing Protocols for QoS Assurances in Real-Time Wireless Multimedia Sensor Networks

Abstract: The vision of wireless multimedia sensor networks (WMSNs) is to provide real-time multimedia applications using wireless sensors deployed for long-term usage. Quality of service assurances for both best effort data and real-time multimedia applications introduced new challenges in prioritizing multipath routing protocols in WMSNs. Multipath routing approaches with multiple constraints have received considerable research interest. In this paper, a comprehensive survey of both best effort data and real-time multipath routing protocols for WMSNs is presented. Results of a preliminary investigation into design issues affecting the development of strategic multipath routing protocols that support multimedia data in WMSNs are also presented and discussed from the network application perspective.

MoZo: A Moving Zone Based Routing Protocol Using Pure V2V Communication in VANETs

Abstract: Vehicular Ad-hoc Networks (VANETs) are an emerging field, whereby vehicle-to-vehicle communications can enable many new applications such as safety and entertainment services. Most VANET applications are enabled by different routing protocols. The design of such routing protocols, however, is quite challenging due to the dynamic nature of nodes (vehicles) in VANETs. To exploit the unique characteristics of VANET nodes, we design a moving-zone based architecture in which vehicles collaborate with one another to form dynamic moving zones so as to facilitate information dissemination. We propose a novel approach that introduces moving object modeling and indexing techniques from the theory of large moving object databases into the design of VANET routing protocols. The results of extensive simulation studies carried out on real road maps demonstrate the superiority of our approach compared with both clustering and non-clustering based routing protocols.

An Efficient Centroid-Based Routing Protocol for Energy Management in WSN-Assisted IoT

Abstract: Wireless sensor networks (WSNs) distribute hundreds to thousands of inexpensive micro-sensor nodes in their regions, and these nodes are important parts of Internet of Things (IoT). In WSN-assisted IoT, the nodes are resource constrained in many ways, such as storage resources, computing resources, energy resources, and so on. Robust routing protocols are required to maintain a long network lifetime and achieve higher energy utilization. In this paper, we propose a new energy-efficient centroid-based routing protocol (EECRP) for WSN-assisted IoT to improve the performance of the network. The proposed EECRP includes three key parts: a new distributed cluster formation technique that enables the self-organization of local nodes, a new series of algorithms for adapting clusters and rotating the cluster head based on the centroid position to evenly distribute the energy load among all sensor nodes, and a new mechanism to reduce the energy consumption for long-distance communications. In particular, the residual energy of nodes is considered in EECRP for calculating the centroid′s position. Our simulation results indicate that EECRP performs better than LEACH, LEACH-C, and GEEC. In addition, EECRP is suitable for networks that require a long lifetime and whose base station (BS) is located in the network.

Time-dependent vehicle routing problem with path flexibility

Abstract: Conventionally, vehicle routing problems are defined on a network in which the customer locations and arcs are given. Typically, these arcs somehow represent the distances or expected travel time derived from the underlying road network. When executed, the quality of the solutions obtained from the vehicle routing problem depends largely on the quality of the road network representation. This paper explicitly considers path selection in the road network as an integrated decision in the time-dependent vehicle routing problem, denoted as path flexibility (PF). This means that any arc between two customer nodes has multiple corresponding paths in the road network (geographical graph). Hence, the decisions to make are involving not only the routing decision but also the path selection decision depending upon the departure time at the customers and the congestion levels in the relevant road network. The corresponding routing problem is a time-dependent vehicle routing problem with path flexibility (TDVRP–PF). We formulate the TDVRP–PF models under deterministic and stochastic traffic conditions. We derive important insights, relationships, and solution structures. Based on a representative testbed of instances (inspired on the road network of Beijing), significant savings are obtained in terms of cost and fuel consumption, by explicitly considering path flexibility. Having both path flexibility and time-dependent travel time seems to be a good representation of a wide range of stochasticity and dynamics in the travel time, and path flexibility serves as a natural recourse under stochastic conditions. Exploiting this observation, we employ a Route-Path approximation method generating near-optimal solutions for the TDVRP–PF under stochastic traffic conditions.

An Improved Routing Algorithm Based on Ant Colony Optimization in Wireless Sensor Networks

Abstract: How to make efficient data routing in energy constrained wireless sensor networks (WSNs) is one of the key points. In order to find the optimal path of data transmission in the WSNs, a new routing algorithm based on ant colony algorithm is proposed. Using the improved heuristic function and considering the node communication transmission distance, transmission direction, and residual energy, an optimal path from the source node to the destination node can be found. Thus, the network energy consumption is reduced and the network lifetime is prolonged. Simulation results show that new ant algorithm can effectively save the energy of nodes and prolong the network lifetime.

Adaptive Quality-of-Service-Based Routing for Vehicular Ad Hoc Networks With Ant Colony Optimization

Abstract: Developing highly efficient routing protocols for vehicular ad hoc networks (VANETs) is a challenging task, mainly due to the special characters of such networks: large-scale sizes, frequent link disconnections, and rapid topology changes. In this paper, we propose an adaptive quality-of-service (QoS)-based routing for VANETs called AQRV. This new routing protocol adaptively chooses the intersections through which data packets pass to reach the destination, and the selected route should satisfy the QoS constraints and fulfil the best QoS in terms of three metrics, namely connectivity probability, packet delivery ratio (PDR), and delay. To achieve the given objectives, we mathematically formulate the routing selection issue as a constrained optimization problem and propose an ant colony optimization (ACO)-based algorithm to solve this problem. In addition, a terminal intersection (TI) concept is presented to decrease routing exploration time and alleviate network congestion. Moreover, to decrease network overhead, we propose local QoS models (LQMs) to estimate real time and complete QoS of urban road segments. Simulation results validate our derived LQM models and show the effectiveness of AQRV.

Energy Efficient Multipath Routing Protocol for Mobile Ad-Hoc Network Using the Fitness Function

Abstract: Mobile ad hoc network (MANET) is a collection of wireless mobile nodes that dynamically form a temporary network without the reliance of any infrastructure or central administration Energy consumption is considered as one of the major limitations in MANET, as the mobile nodes do not possess permanent power supply and have to rely on batteries, thus reducing network lifetime as batteries get exhausted very quickly as nodes move and change their positions rapidly across MANET This paper highlights the energy consumption in MANET by applying the fitness function technique to optimize the energy consumption in ad hoc on demand multipath distance vector (AOMDV) routing protocol The proposed protocol is called AOMDV with the fitness function (FF-AOMDV) The fitness function is used to find the optimal path from source node to destination node to reduce the energy consumption in multipath routing The performance of the proposed FF-AOMDV protocol has been evaluated by using network simulator version 2, where the performance was compared with AOMDV and ad hoc on demand multipath routing with life maximization (AOMR-LM) protocols, the two most popular protocols proposed in this area The comparison was evaluated based on energy consumption, throughput, packet delivery ratio, end-to-end delay, network lifetime and routing overhead ratio performance metrics, varying the node speed, packet size, and simulation time The results clearly demonstrate that the proposed FF-AOMDV outperformed AOMDV and AOMR-LM under majority of the network performance metrics and parameters

Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learning

Abstract: Multi-task learning (MTL) with neural networks leverages commonalities in tasks to improve performance, but often suffers from task interference which reduces the benefits of transfer. To address this issue we introduce the routing network paradigm, a novel neural network and training algorithm. A routing network is a kind of self-organizing neural network consisting of two components: a router and a set of one or more function blocks. A function block may be any neural network - for example a fully-connected or a convolutional layer. Given an input the router makes a routing decision, choosing a function block to apply and passing the output back to the router recursively, terminating when a fixed recursion depth is reached. In this way the routing network dynamically composes different function blocks for each input. We employ a collaborative multi-agent reinforcement learning (MARL) approach to jointly train the router and function blocks. We evaluate our model against cross-stitch networks and shared-layer baselines on multi-task settings of the MNIST, mini-imagenet, and CIFAR-100 datasets. Our experiments demonstrate a significant improvement in accuracy, with sharper convergence. In addition, routing networks have nearly constant per-task training cost while cross-stitch networks scale linearly with the number of tasks. On CIFAR-100 (20 tasks) we obtain cross-stitch performance levels with an 85% reduction in training time.

Information-centric mobile ad hoc networks and content routing

Abstract: As the future Internet architecture, information centric networking(ICN) can also offer superior architectural support for mobile ad hoc networking. Therefore, information-centric mobile ad hoc networks (ICMANET), a new cross-cutting research area, is gradually forming. In the paper, we firstly introduce the current advances in ICN and analyze its development trends, and then interpret the formation of ICMANET and sketch an overview of it. Subsequently, we define a concept model for content routing and categorize the content routing into proactive, reactive and opportunistic types, and then detail the representative schemes. Finally, the existing issues are summarized. The goal of the work is to provide the references and guidelines for readers approaching study on the new area.

Customizable Route Planning in Road Networks

Abstract: We propose the first routing engine for computing driving directions in large-scale road networks that satisfies all requirements of a real-world production system. It supports arbitrary metrics (cost functions) and turn costs, enables real-time queries, and can incorporate a new metric in less than a second, which is fast enough to support real-time traffic updates and personalized cost functions. The amount of metric-specific data is a small fraction of the graph itself, which allows us to maintain several metrics in memory simultaneously. The algorithm is the core of the routing engine currently in use by Bing Maps.

A Deep-Reinforcement Learning Approach for Software-Defined Networking Routing Optimization

Abstract: In this paper we design and evaluate a Deep-Reinforcement Learning agent that optimizes routing. Our agent adapts automatically to current traffic conditions and proposes tailored configurations that attempt to minimize the network delay. Experiments show very promising performance. Moreover, this approach provides important operational advantages with respect to traditional optimization algorithms.

A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

Abstract: Introducing mobility to Wireless Sensor Networks (WSNs) puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs). Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

Void-Handling Techniques for Routing Protocols in Underwater Sensor Networks: Survey and Challenges

Abstract: From the view of routing protocols in underwater sensor networks (UWSNs), the presence of communication void, where the packet cannot be forwarded further using the greedy mode, is perhaps the most challenging issue. In this paper, we review the state of the art of void-handling techniques proposed by underwater geographic greedy routing protocols. To this, we first review the void problem and its negative impact on the category of the geographic greedy routing protocols, which does not entail any void recovery technique. It is followed by a discussion about the constraints, challenges, and features associated with the design of void-handling techniques in UWSNs. Afterward, currently available void-handling techniques in UWSNs are classified and investigated. They can be classified into two main categories: 1) location-based and 2) depth-based techniques. The advantages and disadvantages of each technique along with the recent advances are then presented. Finally, we present a qualitative comparison of these techniques and also discuss some possible future directions.

Robust and Reliable Predictive Routing Strategy for Flying Ad-Hoc Networks

Abstract: Ever-increasing demands for portable and flexible communications have led to rapid growth in networking between unmanned aerial vehicles often referred to as flying ad-hoc networks (FANETs). Existing mobile ad hoc routing protocols are not suitable for FANETs due to high-speed mobility, environmental conditions, and terrain structures. In order to overcome such obstacles, we propose a combined omnidirectional and directional transmission scheme, together with dynamic angle adjustment. Our proposed scheme features hybrid use of unicasting and geocasting routing using location and trajectory information. The prediction of intermediate node location using 3-D estimation and directional transmission toward the predicted location, enabling a longer transmission range, allows keeping track of a changing topology, which ensures the robustness of our protocol. In addition, the reduction in path re-establishment and service disruption time to increase the path lifetime and successful packet transmissions ensures the reliability of our proposed strategy. Simulation results verify that our proposed scheme could significantly increase the performance of flying ad hoc networks.

On the Complexity of Optimal Request Routing and Content Caching in Heterogeneous Cache Networks

Abstract: In-network content caching has been deployed in both the Internet and cellular networks to reduce content-access delay. We investigate the problem of developing optimal joint routing and caching policies in a network supporting in-network caching with the goal of minimizing expected content-access delay. Here, needed content can either be accessed directly from a back-end server (where content resides permanently) or be obtained from one of multiple in-network caches. To access content, users must thus decide whether to route their requests to a cache or to the back-end server. In addition, caches must decide which content to cache. We investigate two variants of the problem, where the paths to the back-end server can be considered as either congestion-sensitive or congestion-insensitive, reflecting whether or not the delay experienced by a request sent to the back-end server depends on the request load, respectively. We show that the problem of optimal joint caching and routing is NP-complete in both cases. We prove that under the congestion-insensitive delay model, the problem can be solved optimally in polynomial time if each piece of content is requested by only one user, or when there are at most two caches in the network. We also identify the structural property of the user-cache graph that makes the problem NP-complete. For the congestion-sensitive delay model, we prove that the problem remains NP-complete even if there is only one cache in the network and each content is requested by only one user. We show that approximate solutions can be found for both cases within a $(1-1/e)$ factor from the optimal, and demonstrate a greedy solution that is numerically shown to be within 1% of optimal for small problem sizes. Through trace-driven simulations, we evaluate the performance of our greedy solutions to joint caching and routing, which show up to 50% reduction in average delay over the solution of optimized routing to least recently used caches.

Routing in Vehicular Ad-hoc Networks: A Survey on Single- and Cross-Layer Design Techniques, and Perspectives

Abstract: Vehicular ad-hoc networks (VANETs) play an important role in intelligent transportation systems for improving security and efficiency. However, due to dynamic characteristics of the vehicular environment, routing remains a significant challenge in the VANETs. While single-layer routing protocols based on the traditional layered open systems interconnection (OSI) model are readily available, they often do not make use of important parameters at the lower three layers of the OSI model when making routing decision. Hence, for making optimal routing decision to gain superior network performance, there is a need to design cross-layer routing that allows information exchange between layers. In this article, a survey of the existing single-layer and cross-layer routing techniques in VANETs is presented, emphasizing on cross-layer routing protocols that utilize information at the physical, medium access control and network layers as routing parameters. An overview and challenges of routing are given, followed by a brief discussion of single-layer routing with more focus on geographic routing. Cross-layer routing protocols are then discussed in detail. The article then elaborates on some advantages and disadvantages of the existing routing approaches, cross-layer routing parameter selection and cross-layer design issues. Finally, some open research challenges in developing efficient routing protocols in the VANETs are highlighted.

Performance Improvement of Cluster-Based Routing Protocol in VANET

Abstract: Vehicular ad-hoc NETworks (VANETs) have received considerable attention in recent years, due to its unique characteristics, which are different from mobile ad-hoc NETworks, such as rapid topology change, frequent link failure, and high vehicle mobility. The main drawback of VANETs network is the network instability, which yields to reduce the network efficiency. In this paper, we propose three algorithms: cluster-based life-time routing (CBLTR) protocol, Intersection dynamic VANET routing (IDVR) protocol, and control overhead reduction algorithm (CORA). The CBLTR protocol aims to increase the route stability and average throughput in a bidirectional segment scenario. The cluster heads (CHs) are selected based on maximum lifetime among all vehicles that are located within each cluster. The IDVR protocol aims to increase the route stability and average throughput, and to reduce end-to-end delay in a grid topology. The elected intersection CH receives a set of candidate shortest routes (SCSR) closed to the desired destination from the software defined network. The IDVR protocol selects the optimal route based on its current location, destination location, and the maximum of the minimum average throughput of SCSR. Finally, the CORA algorithm aims to reduce the control overhead messages in the clusters by developing a new mechanism to calculate the optimal numbers of the control overhead messages between the cluster members and the CH. We used SUMO traffic generator simulators and MATLAB to evaluate the performance of our proposed protocols. These protocols significantly outperform many protocols mentioned in the literature, in terms of many parameters.

EECOR: An Energy-Efficient Cooperative Opportunistic Routing Protocol for Underwater Acoustic Sensor Networks

Abstract: Underwater acoustic sensor networks (UW-ASNs) have recently been proposed for exploring the underwater resources and gathering the scientific data from the aquatic environments. UW-ASNs are faced with different challenges, such as high propagation delay, low bandwidth, and high energy consumption. However, the most notable challenge is perhaps how to efficiently forward the packets to the surface sink by considering the energy constrained sensor devices. The opportunistic routing concept may provide an effective solution for the UW-ASNs by the cooperation of the relay nodes to forward the packets to the surface sink. In this paper, the energy consumption problem is addressed and an energy-efficient cooperative opportunistic routing (EECOR) protocol is proposed to forward the packets toward the surface sink. In the EECOR protocol, a forwarding relay set is firstly determined by the source node based on the local information of the forwarder and then, a fuzzy logic-based relay selection scheme is applied to select the best relay based on considering the energy consumption ratio and the packet delivery probability of the forwarder. In the UW-ASNs, most of the energy is wasted due to the collisions amongst sensor nodes during the packet transmission. To alleviate the packet collisions problem, we have designed a holding timer for each of the forwarder to schedule the packets transmission toward the surface sink. We have performed our extensive simulations of the EECOR protocol on the Aqua-sim platform and compared with existing routing protocols in terms of average packet delivery ratio, average end-to-end delay, average energy consumption, and average network lifetime.

ILP-based joint routing and scheduling for time-triggered networks

Abstract: Networks in the automotive and aerospace area as well as in production facilities have to support time-critical (i.e., hard real-time) communication. For such applications, time-triggered Ethernet-based networking solutions provide the required timeliness, i.e., reliable packet delivery with deterministic latencies and low jitter. However, the routing and scheduling of the time-triggered traffic is an NP-hard problem. Hence, existing solutions to this problem make certain abstractions to reduce complexity if necessary. Nonetheless, such abstractions exclude feasible routing and scheduling options from the design space. Specifically, it is a typical approach to model routing and scheduling as separate problems, which are solved successively or with heuristic coupling. Therefore, we present a novel ILP formulation that can be used to jointly solve the routing and scheduling problem for time-triggered Ethernet networks. Using this formulation, it is possible to solve various scheduling problems that are infeasible when using a fixed shortest path routing with separate scheduling. Compared to a fixed load balanced routing with separate scheduling, schedules computed with our formulation offer lower communication latencies.

A Wireless Sensor Network Border Monitoring System: Deployment Issues and Routing Protocols

Abstract: External border surveillance is critical to the security of every state and the challenges it poses are changing and likely to intensify. Wireless sensor networks (WSN) are a low cost technology that provide an intelligence-led solution to effective continuous monitoring of large, busy, and complex landscapes. The linear network topology resulting from the structure of the monitored area raises challenges that have not been adequately addressed in the literature to date. In this paper, we identify an appropriate metric to measure the quality of WSN border crossing detection. Furthermore, we propose a method to calculate the required number of sensor nodes to deploy in order to achieve a specified level of coverage according to the chosen metric in a given belt region, while maintaining radio connectivity within the network. Then, we contribute a novel cross layer routing protocol, called levels division graph (LDG), designed specifically to address the communication needs and link reliability for topologically linear WSN applications. The performance of the proposed protocol is extensively evaluated in simulations using realistic conditions and parameters. LDG simulation results show significant performance gains when compared with its best rival in the literature, dynamic source routing (DSR). Compared with DSR, LDG improves the average end-to-end delays by up to 95%, packet delivery ratio by up to 20%, and throughput by up to 60%, while maintaining comparable performance in terms of normalized routing load and energy consumption.

A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks

Abstract: A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path distance vector protocol is extended as the base routing protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.

Path Observation Based Physical Routing Protocol for Wireless Ad Hoc Networks

Abstract: Wireless ad hoc networks are going to be an emerged multi-hop communication exploit among mobiles to deliver data packets The special characteristics of Wireless network make the communication link between mobiles to be unreliable To handle high mobility and environmental obstacles, most of physical routing protocols do not consider stable links during packet transmission which lead to higher delay and packet dropping in network In this paper, we propose path observation based physical routing protocol named POPR for WANET The proposed routing protocol incorporates relative distance, direction and mid-range forwarder node with traffic density to forward the data toward destination in order to improve physical forwarding between and at the intersection Simulation results show that the proposed routing protocol performs better as compared to existing solutions

Energy efficient cross layer based adaptive threshold routing protocol for WSN

Abstract: Wireless Sensor Networks (WSNs) perform an important part in modern day communication as it can sense the various physical and environmental parameters by employing low cost sensor devices. The growth of the networks due to scientific advancements have altogether made it possible to create an energy efficient cross layer network that can improve its lifespan. In this paper, a routing protocol is proposed for the networks which are heterogeneous and are based on the adaptive threshold sensitive distributed energy efficient cross layer routing protocol. The concept of weighted probability is used to assign the CH (Cluster Head) of the network cluster. The proposed algorithm is simulated, tested and compared with previously established routing protocols and has shown enhanced results and prolonged network lifespan. In the proposed protocol, a combination of the proactive and reactive network is considered for effective data transmission.

A Graph Theory Based Energy Routing Algorithm in Energy Local Area Network

Abstract: The energy Internet concept has been considered as a new development stage of the smart grid, which aims to increase the energy transmission efficiency and optimize the energy dispatching in time and space. Energy router is a core device in the energy Internet and it connects all the devices together into a net structure and manages power flows among them. The research work presented in this paper described the energy router's structure and function expectations from the network perspective, and improved the existing energy router design. Open shortest path first (OSPF) protocol and virtual circuit switching mode are referenced from the Internet in the energy local area network (e-LAN) design. This paper proposed a design of an energy routing algorithm based on graph theory in an e-LAN. A lowest cost routing selection algorithm is designed according to the features of power transmission, and a source selection and routing design algorithm is proposed for very heavy load conditions. Both algorithms have been verified by case analyses.

Optimized cost effective and energy efficient routing protocol for wireless body area networks

Abstract: The increase in average lifespan and huge costs for health treatments have resulted in cost effective solutions for healthcare management. Wireless Body Area Network (WBAN) is a promising technology for delivering quality healthcare to its users. Low power devices attached to the body have limited battery life. It is desirable to have energy efficient routing protocols that maintain the required reliability value for sending the data from a given node to the sink. The current work proposes two protocols: Optimized Cost Effective and Energy Efficient Routing protocol (OCER) and Extended-OCER (E-OCER). In OCER, optimization using Genetic Algorithm (GA) is applied to the multi-objective cost function with residual energy, link reliability and path loss as its parameters for selecting the most optimal route from a given body coordinator to the sink. Distance between any two sensor nodes is reduced by applying multi-hop approach. E-OCER extends the work of OCER by considering inter-BAN communication. Performance of OCER is compared with other existing energy aware routing protocols by considering different parameters. A comparison of the performance of E-OCER with OCER is made to study the effect of on-body sensors communication on the energy consumption and throughput of the network. This paper also provides a comprehensive energy model to calculate the total energy consumption of the network. In addition to the radio transmission and receiving energy, other basic energy consumption sources viz. processing energy, sensor sensing, transient energy and transmission/reception on/off energy have also been taken into account. The results show an improved performance of the proposed protocols in terms of energy efficiency.