Showing papers on "Routing protocol published in 2014"

Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey

Abstract: This paper represents energy efficient routing protocols in WSN. It is a collection of sensor nodes with a set of limited Processor and limited memory unit embedded in it. Reliable routing of packets from the sensor node to its base station is the most important task for the networks. The routing protocols applied for the other networks cannot be used here due to its battery powered nodes This paper gives an overview of the different routing strategies used in wireless sensor networks and gives a brief working model of energy efficient routing protocols in WSN. It also shows the comparison of these different routing protocols based on metrics such as mobility support, stability, issues and latency.

EBK-Means: A Clustering Technique based on Elbow Method and K-Means in WSN

Abstract: consist of hundreds of thousands of small and cost effective sensor nodes. Sensor nodes are used to sense the environmental or physiological parameters like temperature, pressure, etc. For the connectivity of the sensor nodes, they use wireless transceiver to send and receive the inter-node signals. Sensor nodes, because connect their selves wirelessly, use routing process to route the packet to make them reach from source to destination. These sensor nodes run on batteries and they carry a limited battery life. Clustering is the process of creating virtual sub-groups of the sensor nodes, which helps the sensor nodes to lower routing computations and to lower the size routing data. There is a wide space available for the research on energy efficient clustering algorithms for the WSNs. LEACH, PEGASIS and HEED are the popular energy efficient clustering protocols for WSNs. In this research, we are working on the development of a hybrid model using LEACH based energy efficient and K-means based quick clustering algorithms to produce a new cluster scheme for WSNs with dynamic selection of the number of the clusters automatically. In the proposed method, finding an optimum "k" value is performed by Elbow method and clustering is done by k-means algorithm, hence routing protocol LEACH which is a traditional energy efficient protocol takes the work ahead of sending data from the cluster heads to the base station. The results of simulation show that at the end of some certain part of running the proposed algorithm, at some point the marginal gain will drop dramatically and gives an angle in the graph. The correct "k" i.e. number of clusters is chosen at this point, hence the "elbow criterion".

An Energy-Balanced Routing Method Based on Forward-Aware Factor for Wireless Sensor Networks

Abstract: As an important part of industrial application (IA), the wireless sensor network (WSN) has been an active research area over the past few years. Due to the limited energy and communication ability of sensor nodes, it seems especially important to design a routing protocol for WSNs so that sensing data can be transmitted to the receiver effectively. An energy-balanced routing method based on forward-aware factor (FAF-EBRM) is proposed in this paper. In FAF-EBRM, the next-hop node is selected according to the awareness of link weight and forward energy density. Furthermore, a spontaneous reconstruction mechanism for local topology is designed additionally. In the experiments, FAF-EBRM is compared with LEACH and EEUC, experimental results show that FAF-EBRM outperforms LEACH and EEUC, which balances the energy consumption, prolongs the function lifetime and guarantees high QoS of WSN.

Towards software-defined VANET: Architecture and services

Abstract: Vehicular Ad Hoc Networks (VANETs) have in recent years been viewed as one of the enabling technologies to provide a wide variety of services, such as vehicle road safety, enhanced traffic and travel efficiency, and convenience and comfort for passengers and drivers. However, current VANET architectures lack in flexibility and make the deployment of services/protocols in large-scale a hard task. In this paper, we demonstrate how Software-Defined Networking (SDN), an emerging network paradigm, can be used to provide the flexibility and programmability to networks and introduces new services and features to today's VANETs. We take the concept of SDN, which has mainly been designed for wired infrastructures, especially in the data center space, and propose SDN-based VANET architecture and its operational mode to adapt SDN to VANET environments. We also discuss benefits of a Software-Defined VANET and the services that can be provided. We demonstrate in simulation the feasibility of a Software-Defined VANET by comparing SDN-based routing with traditional MANET/VANET routing protocols. We also show in simulation fallback mechanisms that must be provided to apply the SDN concept into mobile wireless scenarios, and demonstrate one of the possible services that can be provided by a Software-Defined VANET.

Distributed Mobile Sink Routing for Wireless Sensor Networks: A Survey

Abstract: The concentration of data traffic towards the sink in a wireless sensor network causes the nearby nodes to deplete their batteries quicker than other nodes, which leaves the sink stranded and disrupts the sensor data reporting. To mitigate this problem the usage of mobile sinks is proposed. Mobile sinks implicitly provide load-balancing and help achieving uniform energy-consumption across the network. However, the mechanisms to support the sink mobility (e.g., advertising the location of the mobile sink to the network) introduce an overhead in terms of energy consumption and packet delays. With these properties mobile sink routing constitutes an interesting research field with unique requirements. In this paper, we present a survey of the existing distributed mobile sink routing protocols. In order to provide an insight to the rationale and the concerns of a mobile sink routing protocol, design requirements and challenges associated with the problem of mobile sink routing are determined and explained. A definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.

The Segment Routing Architecture

Abstract: Network operators anticipate the offering of an increasing variety of cloud-based services with stringent Service Level Agreements. Technologies currently supporting IP networks however lack the flexibility and scalability properties to realize such evolution. In this article, we present Segment Routing (SR), a new network architecture aimed at filling this gap, driven by use-cases defined by network operators. SR implements the source routing and tunneling paradigms, letting nodes steer packets over paths using a sequence of instructions (segments) placed in the packet header. As such, SR allows the implementation of routing policies without per-flow entries at intermediate routers. This paper introduces the SR architecture, describes its related ongoing standardization efforts, and reviews the main use-cases envisioned by network operators.

Name-based content routing in information centric networks using distance information

Abstract: The Distance-based Content Routing (DCR) protocol is introduced, which enables routers to maintain multiple loop-free routes to the nearest instances of a named data object or name prefix in an information centric network (ICN), and establish content delivery trees over which all or some instances of the same named data object or name prefix can be contacted. In contrast to all prior routing solutions for ICNs, DCR operates without requiring routers to establish overlays, knowing the network topology, using complete paths to content replicas, or knowing about all the sites storing replicas of named content. It is shown that DCR is correct and that is orders of magnitude more scalable than recent name-based routing approaches for ICNs, in terms of the time and signaling overhead needed to obtain correct routing to named content.

Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing

Abstract: Delay tolerant networks (DTNs) are characterized by high end-to-end latency, frequent disconnection, and opportunistic communication over unreliable wireless links. In this paper, we design and validate a dynamic trust management protocol for secure routing optimization in DTN environments in the presence of well-behaved, selfish and malicious nodes. We develop a novel model-based methodology for the analysis of our trust protocol and validate it via extensive simulation. Moreover, we address dynamic trust management, i.e., determining and applying the best operational settings at runtime in response to dynamically changing network conditions to minimize trust bias and to maximize the routing application performance. We perform a comparative analysis of our proposed routing protocol against Bayesian trust-based and non-trust based (PROPHET and epidemic) routing protocols. The results demonstrate that our protocol is able to deal with selfish behaviors and is resilient against trust-related attacks. Furthermore, our trust-based routing protocol can effectively trade off message overhead and message delay for a significant gain in delivery ratio. Our trust-based routing protocol operating under identified best settings outperforms Bayesian trust-based routing and PROPHET, and approaches the ideal performance of epidemic routing in delivery ratio and message delay without incurring high message or protocol maintenance overhead.

Real-Time Implementation of a Harmony Search Algorithm-Based Clustering Protocol for Energy-Efficient Wireless Sensor Networks

Abstract: In real-life applications of wireless sensor networks (WSNs), optimization of the network operation is required to extend its lifetime. A framework is proposed that enables practical development of centralized cluster-based protocols supported by optimization methods for the WSNs. Based on this framework, a protocol using harmony search algorithm (HSA), a music-based meta-heuristic optimization method, is designed and implemented in real time for the WSNs. It is expected to minimize the intra-cluster distances between the cluster members and their cluster heads (CHs) and optimize the energy distribution of the WSNs. The study of HSA cluster-based protocol is carried out in a real case where the WSNs equipped with the proposed protocol are deployed in an indoor environment to monitor the ambient temperature for fire detection. A comparison is made with the well-known cluster-based protocols developed for WSNs such as low-energy adaptive clustering hierarchy-centralized (LEACH-C) and a cluster-based protocol using Fuzzy C-Means (FCM) clustering algorithm. Experimental results demonstrate that the proposed protocol using HSA can be realized in centralized cluster-based WSNs for safety and surveillance applications in building environments. From the obtained experimental test results, it can be seen that the WSNs lifetime has been extended using the proposed HSA protocol in comparison with that of LEACH-C and FCM protocols.

A Survey on Multicast Routing Protocols for Mobile Ad Hoc Networks

Abstract: There are many benefits of multicasting using with network. The communication cost reduced by multicasting for applications that sends the same data to many recipients instead of sending via multiple unicast. This paper gives a general survey of multicast routing protocols in Mobile adhoc Networks (MANETs). The multicast routing protocols are divided into two categories- multicast routing based on application independence and multicast routing based on application dependence. Multicast routing protocols plays an important role in MANETs to provide group communication. Multicasting is one of the major communication technologies primarily designed for bandwidth conservation and an efficient way of transferring data to a group of receivers in wireless mesh networks.

iAMCTD: improved adaptive mobility of courier nodes in threshold-optimized DBR protocol for underwater wireless sensor networks

Abstract: We propose forwarding-function (FF) based routing protocol for underwater sensor networks (UWSNs): improved adaptive mobility of courier nodes in threshold-optimized depth-based-routing (iAMCTD). Unlike existing depth-based acoustic protocols, the proposed protocol exploits network density for time-critical applications. In order to tackle flooding, path loss, and propagation latency, we calculate optimal holding time (HT) and use routing metrics: localization-free signal-to-noise ratio (LSNR), signal quality index (SQI), energy cost function (ECF), and depth-dependent function (DDF). Our proposal provides on-demand routing by formulating hard threshold (Hth), soft threshold (Sth), and prime energy limit (Rprime). Simulation results verify effectiveness and efficiency of the proposed iAMCTD.

A Probabilistic Misbehavior Detection Scheme toward Efficient Trust Establishment in Delay-Tolerant Networks

Abstract: Malicious and selfish behaviors represent a serious threat against routing in delay/disruption tolerant networks (DTNs) Due to the unique network characteristics, designing a misbehavior detection scheme in DTN is regarded as a great challenge In this paper, we propose iTrust, a probabilistic misbehavior detection scheme, for secure DTN routing toward efficient trust establishment The basic idea of iTrust is introducing a periodically available Trusted Authority (TA) to judge the node's behavior based on the collected routing evidences and probabilistically checking We model iTrust as the inspection game and use game theoretical analysis to demonstrate that, by setting an appropriate investigation probability, TA could ensure the security of DTN routing at a reduced cost To further improve the efficiency of the proposed scheme, we correlate detection probability with a node's reputation, which allows a dynamic detection probability determined by the trust of the users The extensive analysis and simulation results demonstrate the effectiveness and efficiency of the proposed scheme

Reliable Multicast with Pipelined Network Coding Using Opportunistic Feeding and Routing

Abstract: Multicast is an important mechanism in modern wireless networks and has attracted significant efforts to improve its performance with different metrics including throughput, delay, energy efficiency, etc. Traditionally, an ideal loss-free channel model is widely used to facilitate routing protocol design. However, the quality of wireless links is affected or even jeopardized resulting in transmission failures by many factors like collisions, fading or the noise of environment. In this paper, we propose a reliable multicast protocol, called CodePipe, with energy-efficiency, high throughput and fairness in lossy wireless networks. Building upon opportunistic routing and random linear network coding, CodePipe can not only eliminate coordination between nodes, but also improve the multicast throughput significantly by exploiting both intra-batch and inter-batch coding opportunities. In particular, four key techniques, namely, LP-based opportunistic routing structure, opportunistic feeding, fast batch moving and inter-batch coding, are proposed to offer significant improvement in throughput, energy-efficiency and fairness. Moreover, we design an efficient online extension of CodePipe such that it can work in a dynamic network where nodes join and leave the network as time progresses. We evaluate CodePipe on ns2 simulator by comparing with other two state-of-art multicast protocols, MORE and Pacifier. Simulation results show that CodePipe significantly outperforms both of them.

WCMP: weighted cost multipathing for improved fairness in data centers

Abstract: Data Center topologies employ multiple paths among servers to deliver scalable, cost-effective network capacity. The simplest and the most widely deployed approach for load balancing among these paths, Equal Cost Multipath (ECMP), hashes flows among the shortest paths toward a destination. ECMP leverages uniform hashing of balanced flow sizes to achieve fairness and good load balancing in data centers. However, we show that ECMP further assumes a balanced, regular, and fault-free topology, which are invalid assumptions in practice that can lead to substantial performance degradation and, worse, variation in flow bandwidths even for same size flows.We present a set of simple algorithms that achieve Weighted Cost Multipath (WCMP) to balance traffic in the data center based on the changing network topology. The state required for WCMP is already disseminated as part of standard routing protocols and it can be readily implemented in the current switch silicon without any hardware modifications. We show how to deploy WCMP in a production OpenFlow network environment and present experimental and simulation results to show that variation in flow bandwidths can be reduced by as much as 25X by employing WCMP relative to ECMP.

A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues

Abstract: In the past few years, more and more researchers have paid close attention to the emerging field of delay tolerant networks (DTNs), in which network often partitions and end-to-end paths do not exist nearly all the time. To cope with these challenges, most routing protocols employ the "store-carry-forward" strategy to transmit messages. However, the difficulty of this strategy is how to choose the best relay node and determine the best time to forward messages. Fortunately, social relations among nodes can be used to address these problems. In this paper, we present a comprehensive survey of recent social-aware routing protocols, which offer an insight into how to utilize social relationships to design efficient and applicable routing algorithms in DTNs. First, we review the major practical applications of DTNs. Then, we focus on understanding social ties between nodes and investigating some design-related issues of social-based routing approaches, e.g., the ways to obtain social relations among nodes, the metrics and approaches to identify the characteristics of social ties, the strategies to optimize social-aware routing protocols, and the suitable mobility traces to evaluate these protocols. We also create a taxonomy for social-aware routing protocols according to the sources of social relations. Finally, we outline several open issues and research challenges.

A Network Lifetime Enhancement Method for Sink Relocation and Its Analysis in Wireless Sensor Networks

Abstract: Recent advances in micromanufacturing technology have enabled the development of low-cost, low-power, multifunctional sensor nodes for wireless communication. Diverse sensing applications have also become a reality as a result. These include environmental monitoring, intrusion detection, battlefield surveillance, and so on. In a wireless sensor network (WSN), how to conserve the limited power resources of sensors to extend the network lifetime of the WSN as long as possible while performing the sensing and sensed data reporting tasks, is the most critical issue in the network design. In a WSN, sensor nodes deliver sensed data back to the sink via multihopping. The sensor nodes near the sink will generally consume more battery power than others; consequently, these nodes will quickly drain out their battery energy and shorten the network lifetime of the WSN. Sink relocation is an efficient network lifetime extension method, which avoids consuming too much battery energy for a specific group of sensor nodes. In this paper, we propose a moving strategy called energy-aware sink relocation (EASR) for mobile sinks in WSNs. The proposed mechanism uses information related to the residual battery energy of sensor nodes to adaptively adjust the transmission range of sensor nodes and the relocating scheme for the sink. Some theoretical and numerical analyze are given to show that the EASR method can extend the network lifetime of the WSN significantly.

A Survey of Routing Protocols in Wireless Body Sensor Networks

Abstract: Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses.

Traffic Engineering in SDN/OSPF Hybrid Network

Abstract: Traffic engineering under OSPF routes along the shortest paths, which may cause network congestion. Software Defined Networking (SDN) is an emerging network architecture which exerts a separation between the control plane and the data plane. The SDN controller can centrally control the network state through modifying the flow tables maintained by routers. Network operators can flexibly split arbitrary flows to outgoing links through the deployment of the SDN. However, SDN has its own challenges of full deployment, which makes the full deployment of SDN difficult in the short term. In this paper, we explore the traffic engineering in a SDN/OSPF hybrid network. In our scenario, the OSPF weights and flow splitting ratio of the SDN nodes can both be changed. The controller can arbitrarily split the flows coming into the SDN nodes. The regular nodes still run OSPF. Our contribution is that we propose a novel algorithm called SOTE that can obtain a lower maximum link utilization. We reap a greater benefit compared with the results of the OSPF network and the SDN/OSPF hybrid network with fixed weight setting. We also find that when only 30% of the SDN nodes are deployed, we can obtain a near optimal performance.

GEDAR: Geographic and opportunistic routing protocol with Depth Adjustment for mobile underwater sensor networks

Abstract: Efficient protocols for data packet delivery in mobile underwater sensor networks (UWSNs) are crucial to the effective use of this new powerful technology for monitoring lakes, rivers, seas, and oceans. However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. In this work, we present a feasible solution for improving the data packet delivery ratio in mobile UWSN. The GEographic and opportunistic routing with Depth Adjustment-based topology control for communication Recovery (GEDAR) over void regions uses the greedy opportunistic forwarding to route packets and to move void nodes to new depths to adjust the topology. Simulation results shown that GEDAR outperforms the baseline solutions in terms of packet delivery ratio, latency and energy per message.

A spatial correlation aware algorithm to perform efficient data collection in wireless sensor networks

Abstract: Large scale dense wireless sensor networks (WSNs) will be increasingly deployed in different classes of applications for accurate monitoring. Due to this high density of nodes, it is very likely that both spatially correlated information and redundant data can be detected by several nearby nodes, which can be exploited to save energy. In this work we consider the problem of constructing a spatial correlation aware dynamic and scalable routing structure for data collection and aggregation in WSNs. Although there are some solutions for data aggregation in WSNs, most of them build their structures based on the order of event occurrence. This can lead to both low quality routing trees and a lack of load balancing support, since the same tree is used throughout the network lifetime. To tackle these challenges we propose a novel algorithm called dYnamic and scalablE tree Aware of Spatial correlaTion (YEAST). Results show that the routing tree built by YEAST provides the best aggregation quality compared with other evaluated algorithms. With YEAST an event can be sensed with 97% accuracy, and 75% of the nodes' residual energy can be saved within the phenomena area when compared with the classical approach for data collection.

Routing protocols for wireless sensor networks with mobile sinks: a survey

Abstract: Wireless sensor networks with mobile sinks, mWSNs, have attracted a lot of attention recently. This is because sink mobility can greatly alleviate the hotspot issue in WSNs and further prolong the network lifetime. However, sink mobility also causes unexpected changes in network topology and data routing paths, which can largely affect the routing performance in such networks. Design of efficient routing protocols for mWSNs has been a critical issue, and much work has been carried out in this aspect. In this article, we first classify existing protocols based on different design criteria and then present a survey of the state-of-the-art routing protocols in this area. We illustrate how each of the protocols works, and discuss their advantages and disadvantages. Finally, we point out some future directions for efficient routing in mWSNs.

Co-RPL: RPL Routing for Mobile Low Power Wireless Sensor Networks using Corona Mechanism

Abstract: Mobility support for wireless sensor networks has always been a challenging research topic. This paper addresses the issue of mobility support in the Routing Protocol for Low power and lossy networks (RPL), the recently adopted IETF routing protocol standard for low power wireless sensor networks. RPL was originally designed for static networks, with no support for mobility. In this work, we address this gap and propose Co-RPL as an extension to RPL based on the Corona mechanism to support mobility. To demonstrate the effectiveness of Co-RPL, we conducted an extensive simulation study using the Contiki/Cooja simulator and compared the performance against standard RPL. We study the impact of node speed, packet transmission rate and number of Directed Acyclic Graphs (DAG) roots on network performance. The simulation results show that Co-RPL decreases packet loss ratio by 45%, average energy consumption by 50% and end-to-end delay by 2.5 seconds, in comparison with the standard RPL.

VANET routing protocols: Issues and challenges

Abstract: In recent years, rapid growth in the number of vehicles on the road has increased demands for communication on the move. A new kind of Ad hoc network with an immense improvement in technological innovations is emerging these days known as VANET (Vehicular ad hoc network). It is an assortment of vehicular nodes that act as mobile hosts establish a transient network without the assistance of any centralized administration or any established infrastructure. Therefore, it is called autonomous & self configured network. In VANET, two kinds of communication can be done to provide a list of applications like emergency vehicle warning, safety etc. These are between various vehicles known as vehicle to vehicle and between vehicles and roadside units known as vehicle to roadside communication. Performance of such kind of communication between vehicles depends on various routing protocols. We have a tendency to survey a number of the recent analysis leads to routing space. In the following sections we present various existing routing protocols with their merits and demerits.

Routing in mobile wireless sensor network: a survey

Abstract: The Mobile Wireless Sensor Network (MWSN) is an emerging technology with significant applications. The MWSN allows the sensor nodes to move freely and they are able to communicate with each other without the need for a fixed infrastructure. These networks are capable of out-performing static wireless sensor networks as they tend to increase the network lifetime, reduce the power consumption, provide more channel capacity and perform better targeting. Usually routing process in a mobile network is very complex and it becomes even more complicated in MWSN as the sensor nodes are low power, cost effective mobile devices with minimum resources. Recent research works have led to the design of many efficient routing protocols for MWSN but still there are many unresolved problems like retaining the network connectivity, reducing the energy cost, maintaining adequate sensing coverage etc. This paper addresses the various issues in routing and presents the state of the art routing protocols in MWSN. The routing protocols are categorized based on their network structure, state of information, energy efficiency and mobility. The classification presented here summarizes the main features of many published proposals in the literature for efficient routing in MWSN and also gives an insight into the enhancements that can be done to improve the existing routing protocols.

IBLEACH: intra-balanced LEACH protocol for wireless sensor networks

Abstract: Wireless sensor networks (WSNs) are composed of many low cost, low power devices with sensing, local processing and wireless communication capabilities. Recent advances in wireless networks have led to many new protocols specifically designed for WSNs where energy awareness is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of routing protocols for WSNs. In this paper, the low-energy adaptive clustering hierarchy (LEACH) routing protocol is considered and improved. We propose a clustering routing protocol named intra-balanced LEACH (IBLEACH), which extends LEACH protocol by balancing the energy consumption in the network. The simulation results show that IBLEACH outperforms LEACH and the existing improvements of LEACH in terms of network lifetime and energy consumption minimization.