Showing papers on "Hazy Sighted Link State Routing Protocol published in 2015"

A survey: Attacks on RPL and 6LoWPAN in IoT

Abstract: 6LoWPAN (IPv6 over Low-Power Wireless Personal Area Networks) standard allows heavily constrained devices to connect to IPv6 networks. 6LoWPAN is novel IPv6 header compression protocol, it may go easily under attack. Internet of Things consist of devices which are limited in resource like battery powered, memory and processing capability etc. for this a new network layer routing protocol is designed called RPL (Routing Protocol for low power Lossy network). RPL is light weight protocol and doesn't have the functionality like of traditional routing protocols. This rank based routing protocol may goes under attack. Providing security in Internet of Things is challenging as the devices are connected to the unsecured Internet, limited resources, the communication links are lossy and set of novel technologies used such as RPL, 6LoWPAN etc. This paper focus on possible attacks on RPL and 6LoWPAN network, counter measure against them and consequences on network parameters. Along with comparative analysis of methods to mitigate these attacks are done and finally the research opportunities in network layer security are discussed.

Ring Routing: An Energy-Efficient Routing Protocol for Wireless Sensor Networks with a Mobile Sink

Abstract: In a typical wireless sensor network, the batteries of the nodes near the sink deplete quicker than other nodes due to the data traffic concentrating towards the sink, leaving it stranded and disrupting the sensor data reporting. To mitigate this problem, mobile sinks are proposed. They implicitly provide load-balanced data delivery and achieve uniform-energy consumption across the network. On the other hand, advertising the position of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose Ring Routing, a novel, distributed, energy-efficient mobile sink routing protocol, suitable for time-sensitive applications, which aims to minimize this overhead while preserving the advantages of mobile sinks. Furthermore, we evaluate the performance of Ring Routing via extensive simulations.

Mobile Sink-Based Adaptive Immune Energy-Efficient Clustering Protocol for Improving the Lifetime and Stability Period of Wireless Sensor Networks

Abstract: Energy hole problem is a critical issue for data gathering in wireless sensor networks. Sensors near the static sink act as relays for far sensors and thus will deplete their energy very quickly, resulting energy holes in the sensor field. Exploiting the mobility of a sink has been widely accepted as an efficient way to alleviate this problem. However, determining an optimal moving trajectory for a mobile sink is a non-deterministic polynomial-time hard problem. Thus, this paper proposed a mobile sink-based adaptive immune energy-efficient clustering protocol (MSIEEP) to alleviate the energy holes. A MSIEEP uses the adaptive immune algorithm (AIA) to guide the mobile sink-based on minimizing the total dissipated energy in communication and overhead control packets. Moreover, AIA is used to find the optimum number of cluster heads (CHs) to improve the lifetime and stability period of the network. The performance of MSIEEP is compared with the previously published protocols; namely, low-energy adaptive clustering hierarchy (LEACH), genetic algorithm-based LEACH, amend LEACH, rendezvous, and mobile sink improved energy-efficient PEGASIS-based routing protocol using MATLAB. Simulation results show that MSIEEP is more reliable and energy efficient as compared with other protocols. Furthermore, it improves the lifetime, the stability, and the instability periods over the previous protocols, because it always selects CHs from high-energy nodes. Moreover, the mobile sink increases the ability of the proposed protocol to deliver packets to the destination.

Efficient intelligent energy routing protocol in wireless sensor networks

Abstract: In wireless sensor networks energy is a very important issue because these networks consist of lowpower sensor nodes. This paper proposes a new protocol to reach energy efficiency. The protocol has a different priority in energy efficiency as reducing energy consumption in nodes, prolonging lifetime of the whole network, increasing system reliability, increasing the load balance of the network, and reducing packet delays in the network. In the new protocol is proposed an intelligent routing protocol algorithm. It is based on reinforcement learning techniques. In the first step of the protocol, a new clustering method is applied to the network and the network is established using a connected graph. Then data is transmitted using the Q-value parameter of reinforcement learning technique. The simulation results show that our protocol has improvement in different parameters such as network lifetime, packet delivery, packet delay, and network balance.

Cluster Based Multipath Routing Protocol for Wireless Sensor Networks

Abstract: Wireless Sensor Network (WSN) consists of low power sensor nodes. Energy is the main constraint associated with the sensor nodes. In this paper, we propose a cluster based multipath routing protocol, which uses the clustering and multipath techniques to reduce energy consumption and increase the reliability. The basic idea is to reduce the load of the sensor node by giving more responsibility to the base station (sink). We have implemented and compared the protocol with existing protocols and found that it is more energy-efficient and reliable.

Secure and Reliable Routing Protocols for Heterogeneous Multihop Wireless Networks

Abstract: In this paper, we propose E-STAR for establishing stable and reliable routes in heterogeneous multihop wireless networks. E-STAR combines payment and trust systems with a trust-based and energy-aware routing protocol. The payment system rewards the nodes that relay others’ packets and charges those that send packets. The trust system evaluates the nodes’ competence and reliability in relaying packets in terms of multi-dimensional trust values. The trust values are attached to the nodes’ public-key certificates to be used in making routing decisions. We develop two routing protocols to direct traffic through those highly-trusted nodes having sufficient energy to minimize the probability of breaking the route. By this way, E-STAR can stimulate the nodes not only to relay packets, but also to maintain route stability and report correct battery energy capability. This is because any loss of trust will result in loss of future earnings. Moreover, for the efficient implementation of the trust system, the trust values are computed by processing the payment receipts. Analytical results demonstrate that E-STAR can secure the payment and trust calculation without false accusations. Simulation results demonstrate that our routing protocols can improve the packet delivery ratio and route stability.

MoMoRo: Providing Mobility Support for Low-Power Wireless Applications

Abstract: Recently, mobile devices have been introduced in various wireless sensor network (WSN) applications in order to solve complex tasks or to increase the data collection efficiency. However, the current generation of low-power WSN protocols is mainly designed to support data collection and address application-specific challenges without any particular considerations for mobility. In this paper, we introduce MoMoRo, a mobility support layer that can be easily applied to existing data collection protocols, thereby enabling mobility support in the network. MoMoRo robustly collects neighborhood information and uses a fuzzy estimator to make link quality estimations. This fuzzy estimator continuously reconfigures its thresholds for determining the fuzzy sets, allowing MoMoRo to easily adapt to changing channel environments. Furthermore, MoMoRo includes an active destination search scheme that allows disconnected mobile nodes with sparse traffic to quickly reconnect if there are packets in the network destined to this mobile node. We evaluate MoMoRo both indoor and outdoor and show that a continuously moving device in a MoMoRo-enabled RPL (i.e., IPv6 Routing Protocol for Low-Power and Lossy Networks) network can achieve a high packet reception ratio of up to 96% and stay connected in areas where RPL alone cannot and with less than half the packet overhead needed by the well-known Ad hoc On-Demand Distance Vector routing protocol.

On design and deployment of fuzzy-based metric for routing in low-power and lossy networks

Abstract: Minimizing the energy consumption and hence extending the network lifetime is a key requirement when designing an efficient sensor network protocol. QoS-aware routing in Wireless Sensor Network (WSN), aims to take into account other networks performance aspects as minimizing end-to-end delay (as well as jitter), reducing packet loss rate and minimizing the energy consumption of the network during data transmission. These objectives are sometimes conflicting therefore tradeoffs must be made between energy conservation and QoS considerations. The general problem can be reformulated as a Multi-Constrained Optimal Path problem (MCOP) which is known as NP-complete. The latter raises a real challenge as sensor nodes are very limited in resources capabilities. We propose to use fuzzy inference mechanism to seek a good tradeoff between all given metrics and constraints. This paper discusses the implementation of combining several routing metric using fuzzy logic to design a RPL objective function, the routing standard for the Internet of Things. The proposal is integrated on Contiki operating system, the deployment was performed on a real world indoor WSN. Obtained results show improvements compared to the common implementation of the RPL protocol and demonstrate relevance of our contribution.

CORPL: A Routing Protocol for Cognitive Radio Enabled AMI Networks

Abstract: It is expected that the use of cognitive radio for smart grid communication will be indispensable in near future. Recently, IETF has standardized RPL (routing protocol for low power and lossy networks), which is expected to be the standard routing protocol for majority of applications including advanced metering infrastructure (AMI) networks. Our objective in this paper is to enhance RPL for cognitive radio enabled AMI networks. Our enhanced protocol provides novel modifications to RPL in order to address the routing challenges in cognitive radio environments along with protecting the primary users as well as meeting the utility requirements of secondary network. System level performance evaluation shows the effectiveness of proposed protocol as a viable solution for practical cognitive AMI networks.

Divide and conquer: Partitioning OSPF networks with SDN

Abstract: Software Defined Networking (SDN) is an emerging network control paradigm focused on logical centralization and programmability. At the same time, distributed routing protocols, most notably OSPF and IS-IS, are still prevalent in IP networks, as they provide shortest path routing, fast topological convergence after network failures, and, perhaps most importantly, the confidence based on decades of reliable operation. Therefore, a hybrid SDN/OSPF operation remains a desirable proposition. In this paper, we propose a new method of hybrid SDN/OSPF operation. Our method is different from other hybrid approaches, as it uses SDN nodes to partition an OSPF domain into sub-domains thereby achieving the traffic engineering capabilities comparable to full SDN operation. We place SDN-enabled routers as subdomain border nodes, while the operation of the OSPF protocol continues unaffected. In this way, the SDN controller can tune routing protocol updates for traffic engineering purposes before they are flooded into sub-domains. While local routing inside sub-domains remains stable at all times, inter-sub-domain routes can be optimized by determining the routes in each traversed sub-domain. As the majority of traffic in non-trivial topologies has to traverse multiple subdomains, our simulation results confirm that a few SDN nodes allow traffic engineering up to a degree that renders full SDN deployment unnecessary.

Bluetooth low energy automation mesh network

Abstract: A system for facilitating communications in a mesh network is provided. One or more devices of the mesh network may participate as routing nodes to provide range extension for any other devices in the mesh network that would otherwise be out of range from one another. In one or more implementations, Bluetooth Low Energy (BLE) may be used as the physical transport of the mesh network.

Bee-Sensor-C: an energy-efficient and scalable multipath routing protocol for wireless sensor networks

Abstract: A wireless sensor network (WSN) is composed of a large collection of sensor nodes with limited resources in terms of battery supplied energy, processing capability, and storage. Therefore, the design of an energy-efficient and scalable routing protocol is a crucial concern for WSN applications. In this paper, we propose Bee-Sensor-C, an energy-aware and scalable multipath routing protocol based on dynamic cluster and foraging behavior of a bee swarm. Bee-Sensor-C is an evolution from BeeSensor which is a bee-inspired routing protocol for WSNs. First of all, through introducing a dynamic clustering scheme, Bee-Sensor-C offers parallel data transmissions close to the event area. This evolution reduces routing overhead and improves the scalability. Moreover, Bee-Sensor-C adopts an enhanced multipath construction method in order to achieve the balance of the network energy consumption. Besides, Bee-Sensor-C can well support the multicluster scenario. Through simulations, the network performance is evaluated and the results demonstrate that Bee-Sensor-C outperforms the existing protocols in terms of energy efficiency, energy consumption balance, packet delivery rate, and scalability.

Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis

Abstract: Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol.

Toward Practical and Intelligent Routing in Vehicular Ad Hoc Networks

Abstract: Apart from vehicle mobility, data rate (bit rate) and multihop data transmission efficiency (including route length) have a significant impact on the performance of a routing protocol for vehicular ad hoc networks (VANETs). Existing routing protocols do not seriously address all these issues and are not evaluated for a real VANET environment. Therefore, it is difficult for these protocols to attain a high performance and to work properly under various scenarios. In this paper, we first discuss the challenges of routing in VANETs based on the data acquired from real-world experiments and then propose a routing protocol that is able to learn the best transmission parameters by interacting with the environment. The protocol takes into account multiple metrics, specifically data transmission rate, vehicle movement, and route length. We use both real-world experiments and computer simulations to evaluate the proposed protocol.

SACRP: A Spectrum Aggregation-Based Cooperative Routing Protocol for Cognitive Radio Ad-Hoc Networks

Abstract: Cooperative routing and spectrum aggregation are two promising techniques for Cognitive Radio Ad-Hoc Networks (CRAHNs). In this paper, we propose a spectrum aggregation-based cooperative routing protocol, termed as SACRP, for CRAHNs. To the best of our knowledge, this is the first contribution on spectrum aggregation-based cooperative routing for CRAHNs. The primary objective of SACRP is to provide higher energy efficiency, improve throughput, and reduce network delay for CRAHNs. In this regard, we design the MAC and Physical (PHY) layer, and proposed different spectrum aggregation algorithms for cognitive radio (CR) users. We propose two different classes of routing protocols; Class A for achieving higher energy efficiency and throughput, and Class B for reducing end-to-end latency. Based on stochastic geometry approach, we build a comprehensive analytical model for the proposed protocol. Besides, the proposed protocol is compared with the state of the art cooperative and non-cooperative routing algorithms with spectrum aggregation. Performance evaluation demonstrates the effectiveness of SACRP in terms of energy efficiency, throughput, and end-to-end delay.

Dominating Set and Network Coding-Based Routing in Wireless Mesh Networks

Abstract: Wireless mesh networks are widely applied in many fields such as industrial controlling, environmental monitoring, and military operations. Network coding is promising technology that can improve the performance of wireless mesh networks. In particular, network coding is suitable for wireless mesh networks as the fixed backbone of wireless mesh is usually unlimited energy. However, coding collision is a severe problem affecting network performance. To avoid this, routing should be effectively designed with an optimum combination of coding opportunity and coding validity. In this paper, we propose a Connected Dominating Set (CDS)-based and Flow-oriented Coding-aware Routing (CFCR) mechanism to actively increase potential coding opportunities. Our work provides two major contributions. First, it effectively deals with the coding collision problem of flows by introducing the information conformation process, which effectively decreases the failure rate of decoding. Secondly, our routing process considers the benefit of CDS and flow coding simultaneously. Through formalized analysis of the routing parameters, CFCR can choose optimized routing with reliable transmission and small cost. Our evaluation shows CFCR has a lower packet loss ratio and higher throughput than existing methods, such as Adaptive Control of Packet Overhead in XOR Network Coding (ACPO), or Distributed Coding-Aware Routing (DCAR).

Link-Correlation-Aware Opportunistic Routing in Wireless Networks

Abstract: Recent empirical studies have shown clear evidence that wireless links are not independent and that the packet receptions on adjacent wireless links are correlated. This finding contradicts the widely held link-independence assumption in the calculation of the core metric, i.e., the expected number of transmissions to the candidate forwarder set, in opportunistic routing (OR). The inappropriate assumption may cause serious estimation errors in the forwarder set selection, which further leads to underutilized diversity benefits or extra scheduling costs. We thus advocate that OR should be made aware of link correlation. In this paper, we propose a novel link-correlation-aware OR scheme, which significantly improves the performance by exploiting the diverse low correlated forwarding links. We evaluate the design in a real-world setting with 24 MICAz nodes. Testbed evaluation and extensive simulation show that higher link correlation leads to fewer diversity benefits and that, with our link-correlation-aware design, the number of transmissions is reduced by 38%.

On resilience of Wireless Mesh routing protocol against DoS attacks in IoT-based ambient assisted living applications

Abstract: The future of ambient assisted living (AAL) especially eHealthcare almost depends on the smart objects that are part of the Internet of things (IoT). In our AAL scenario, these objects collect and transfer real-time information about the patients to the hospital server with the help of Wireless Mesh Network (WMN). Due to the multi-hop nature of mesh networks, it is possible for an adversary to reroute the network traffic via many denial of service (DoS) attacks, and hence affect the correct functionality of the mesh routing protocol. In this paper, based on a comparative study, we choose the most suitable secure mesh routing protocol for IoT-based AAL applications. Then, we analyze the resilience of this protocol against DoS attacks. Focusing on the hello flooding attack, the protocol is simulated and analyzed in terms of data packet delivery ratio, delay, and throughput. Simulation results show that the chosen protocol is totally resilient against DoS attack and can be one of the best candidates for secure routing in IoT-based AAL applications.

PWDGR: Pair-Wise Directional Geographical Routing Based on Wireless Sensor Network

Abstract: Multipath routing in wireless multimedia sensor network makes it possible to transfer data simultaneously so as to reduce delay and congestion and it is worth researching. However, the current multipath routing strategy may cause problem that the node energy near sink becomes obviously higher than other nodes which makes the network invalid and dead. It also has serious impact on the performance of wireless multimedia sensor network (WMSN). In this paper, we propose a pair-wise directional geographical routing (PWDGR) strategy to solve the energy bottleneck problem. First, the source node can send the data to the pair-wise node around the sink node in accordance with certain algorithm and then it will send the data to the sink node. These pair-wise nodes are equally selected in 360° scope around sink according to a certain algorithm. Therefore, it can effectively relieve the serious energy burden around Sink and also make a balance between energy consumption and end-to-end delay. Theoretical analysis and a lot of simulation experiments on PWDGR have been done and the results indicate that PWDGR is superior to the proposed strategies of the similar strategies both in the view of the theory and the results of those simulation experiments. With respect to the strategies of the same kind, PWDGR is able to prolong 70% network life. The delay time is also measured and it is only increased by 8.1% compared with the similar strategies.

Geographic Routing in Clustered Wireless Sensor Networks Among Obstacles

Abstract: An important issue of research in wireless sensor networks (WSNs) is to dynamically organize the sensors into a wireless network and route the sensory data from sensors to a sink. Clustering in WSNs is an effective technique for prolonging the network lifetime. In most of the traditional routing in clustered WSNs assumes that there is no obstacle in a field of interest. Although it is not a realistic assumption, it eliminates the effects of obstacles in routing the sensory data. In this paper, we first propose a clustering technique in WSNs named energy-efficient homogeneous clustering that periodically selects the cluster heads according to a hybrid of their residual energy and a secondary parameter, such as the utility of the sensor to its neighbors. In this way, the selected cluster heads have equal number of neighbors and residual energy. We then present a route optimization technique in clustered WSNs among obstacles using Dijkstra's shortest path algorithm. We demonstrate that our work reduces the average hop count, packet delay, and energy-consumption of WSNs.

Delay-tolerant network protocol testing and evaluation

Abstract: Delay-tolerant networks, DTNs, are characterized by lacking end-to-end paths between communication sources and destinations. A variety of routing schemes have been proposed to provide communication services in DTNs, and credible and flexible protocol evaluation tools are in demand in order to test these DTN routing schemes. By examining the evolution of DTN protocol testing and evaluation, this article discusses the trend toward large-scale mobility trace supported emulation, and we propose TUNIE, a large-scale emulation testbed for DTN protocol evaluation based on network virtualization. Unlike the existing simulation tools and real-life testbeds, which either cannot provide a realistic DTN environment setup or are too costly and time-consuming, our proposed TUNIE architecture is capable of simulating reliable DTN environments and obtaining an accurate system performance evaluation. By system prototype and implementation, we demonstrate TUNIE as a flexible platform for evaluating DTN protocol performance.

Fuzzy approach to improving route stability of the AODV routing protocol

Abstract: A mobile ad hoc network (MANET) is a group of autonomous mobile nodes that wirelessly communicate with each other to form a wireless dynamic topology network. It works without requiring any centralized pre-existing administration units (infrastructure less network). There are many studies that focus on improving source-destination route stability and lifetime by modifying the existing MANET routing protocols. In this paper, a fuzzy-based approach is proposed to enhance the ad hoc on-demand distance vector (AODV) reactive routing protocol’s performance by selecting the most trusted nodes to construct the route between the source and destination nodes. In this scheme, the nodes’ parameters, such as residual energy, node mobility, and number of hop counts, are fed through a fuzzy inference system to compute the value of the node trust level, which can be used as a metric to construct an optimal path from source to destination. The results of the simulation show that the proposed approach performs better than the traditional AODV routing protocol and minimum battery cost routing protocol in terms of average control overhead, packet delivery ratio, network throughput, and average end-to-end delay

A mesh network for mobile devices using Bluetooth low energy

Abstract: An important issue of research in wireless networks is to dynamically organize the nodes into a wireless network and route the data from the source to the destination. In most of the existing routing techniques in wireless networks assumes that all nodes are static and do not change their positions till the end of the network. Although it is not a realistic assumption, it eliminates the effects of mobility of nodes in routing the data. In this paper, we present a mesh network for mobile devices using Bluetooth Low Energy (BLE). We propose a weight balancing technique to optimize the communication for routing the data using BLE mesh network. We develop a prototype of BLE mesh network using the Android operating system.

Analytical Evaluation of Directional-Location Aided Routing Protocol for VANETs

Abstract: Vehicular Ad-hoc Networks (VANETs) are now considered as a way to realize active safety, by providing the position information of each other or the possible danger warning by wireless vehicular communications. Multi-hop data delivery in VANETs is a challenging task, since it encounters rapid changes in network topology and frequent fragmentation in the network. Because of these characteristics, routing algorithms based on greedy forwarding are known to be very suitable for VANETs. The design and implementation of efficient and scalable routing protocols for VANETs is a challenging task due to high dynamics and mobility constraints. In this paper, we have worked on a routing protocol over VANETs to efficiently broadcast the information for the sake of active safety applications, such as the positions and the directions of the vehicles. Therefore, we have explained a position-based routing protocol called directional-location aided routing (D-LAR) with (1) location-aided routing utilizes location information using GPS to limit the area for discovering a new route to a smaller request zone and (2) directional routing having direction closest to the line drawn between source and destination. D-LAR protocol is a greedy based approach to forward packet to the node present in request zone part of sender's transmission range as a most suitable next-hop node. Further, we have justified the feasibility of D-LAR routing protocol for VANETs. Through analytical analysis we have also given the relationship among the average number of hop counts, link lifetime, and path throughput metrics for the protocol. Finally, simulation results show that the proposed formulation can be used to evaluate path throughput accurately in the network.

An energy efficient routing protocol for device-to-device based multihop smartphone networks

Abstract: Device-to-device (D2D) communication is the need of the hour in the domain of next generation wireless networking and in the rapidly evolving smartphone network world. D2D technology facilitates mobile users to communicate with each other directly, bypassing the cellular base stations. As a popular D2D technique, WiFi-Direct is also a budding new technology that has the ability to set up wireless communications between a group of smartphones. While single-hop D2D based networks have been promising and energy efficient, multi-hop D2D based networks, though demanded in some emerging applications, are not well studied. In this paper, we elaborate the concept of multihop smartphone networks based on WiFi-Direct and propose an energy efficient cluster-based routing protocol, QGRP, to address the energy issue of increasing importance due to high energy costs of smartphones. Simulations demonstrate that QGRP can save significant amounts of energy compared to the cases without QGRP.