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

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.

TSRF: A Trust-Aware Secure Routing Framework in Wireless Sensor Networks

Abstract: In recent years, trust-aware routing protocol plays a vital role in security of wireless sensor networks (WSNs), which is one of the most popular network technologies for smart city. However, several key issues in conventional trust-aware routing protocols still remain to be solved, such as the compatibility of trust metric with QoS metrics and the control of overhead produced by trust evaluation procedure. This paper proposes a trust-aware secure routing framework (TSRF) with the characteristics of lightweight and high ability to resist various attacks. To meet the security requirements of routing protocols in WSNs, we first analyze features of common attacks on trust-aware routing schemes. Then, specific trust computation and trust derivation schemes are proposed based on analysis results. Finally, our design uses the combination of trust metric and QoS metrics as routing metrics to present an optimized routing algorithm. We show with the help of simulations that TSRF can achieve both intended security and high efficiency suitable for WSN-based networks.

A Spectrum-Aware Clustering for Efficient Multimedia Routing in Cognitive Radio Sensor Networks

Abstract: Multimedia applications are characterized as delay-sensitive and high-bandwidth stipulating traffic sources. Supporting such demanding applications on cognitive radio sensor networks (CRSNs) with energy and spectrum constraints is a highly daunting task. In this paper, we propose a spectrum-aware cluster-based energy-efficient multimedia (SCEEM) routing protocol for CRSNs that jointly overcomes the formidable limitations of energy and spectrum. Clustering is exploited to support the quality of service (QoS) and energy-efficient routing by limiting the participating nodes in route establishment. In SCEEM routing, the number of clusters is optimally determined to minimize the distortion in multimedia quality that occurs due to packet losses and latency. Moreover, the cluster-head selection is based on the energy and relative spectrum awareness such that noncontiguous available spectrum bands are clustered and scheduled to provide continuous transmission opportunity. Routing employs clustering with hybrid medium access by combining carrier-sense multiple access (CSMA) and time-division multiple access (TDMA). TDMA operates for intracluster transmission, whereas CSMA is used for intercluster routing. Thus, a cross-layer design of routing, i.e., of medium access control (MAC) and physical layers, provides efficient multimedia routing in CRSNs, which is revealed through simulation experiments.

RE-ATTEMPT: A New Energy-Efficient Routing Protocol for Wireless Body Area Sensor Networks

Abstract: Modern health care system is one of the most popular Wireless Body Area Sensor Network (WBASN) applications and a hot area of research subject to present work. In this paper, we present Reliability Enhanced-Adaptive Threshold based Thermal-unaware Energy-efficient Multi-hop ProTocol (RE-ATTEMPT) for WBASNs. The proposed routing protocol uses fixed deployment of wireless sensors (nodes) such that these are placed according to energy levels. Moreover, we use direct communication for the delivery of emergency data and multihop communication for the delivery of normal data. RE-ATTEMPT selects route with minimum hop count to deliver data which downplays the delay factor. Furthermore, we conduct a comprehensive analysis supported by MATLAB simulations to provide an estimation of path loss, and problem formulation with its solution via linear programming model for network lifetime maximization is also provided. In simulations, we analyze our protocol in terms of network lifetime, packet drops, and throughput. Results show better performance for the proposed protocol as compared to the existing one.

Reliable Data Delivery With the IETF Routing Protocol for Low-Power and Lossy Networks

Abstract: The IPv6 routing protocol for low-power and lossy networks (RPL) has been recently standardized by the Internet Engineering Task Force (IETF) routing protocol for low-power and lossy networks (ROLL) working group to support IPv6 routing for resource-constrained devices in industrial, home, and urban environments. However, several studies have shown that RPL may experience (very) low delivery rates, particularly in large-scale deployments. In this paper, we provide an in-depth analysis of the protocol attributes and design choices that generate such unreliability issues. Then, we describe and evaluate a new implementation of the RPL standard for the Contiki operating system (OS) to improve data delivery reliability. The salient feature of our RPL implementation is to adopt a flexible cross-layering design that provides simple routing optimizations, enhanced link estimation capabilities, and efficient management of neighbor tables. In order to verify the effectiveness of our RPL implementation, we use an advanced metering infrastructure (AMI) as a case study. Results obtained using Cooja emulator in two sets of experiments, differentiated by the presence or lack of duty cycling, indicate that our RPL implementation outperforms the one provided in Contiki in terms of average packet delivery rates by up to 200% in networks with 100 nodes.

PSR: A Lightweight Proactive Source Routing Protocol For Mobile Ad Hoc Networks

Abstract: Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networking, with most research conducted for stationary wireless networks. One of the reasons why opportunistic data forwarding has not been widely utilized in mobile ad hoc networks (MANETs) is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. In this paper, we propose a lightweight proactive source routing (PSR) protocol. PSR can maintain more network topology information than distance vector (DV) routing to facilitate source routing, although it has much smaller overhead than traditional DV-based protocols [e.g., destination-sequenced DV (DSDV)], link state (LS)-based routing [e.g., optimized link state routing (OLSR)], and reactive source routing [e.g., dynamic source routing (DSR)]. Our tests using computer simulation in Network Simulator 2 (ns-2) indicate that the overhead in PSR is only a fraction of the overhead of these baseline protocols, and PSR yields similar or better data transportation performance than these baseline protocols.

Co-existence of a distributed routing protocol and centralized path computation for deterministic wireless networks

Abstract: In one embodiment, a device both communicates with a network operating a distributed proactive routing protocol, and participates in a centralized path computation protocol. The device communicates routing characteristics of the distributed proactive routing protocol for the network from the network to the centralized path computation protocol, and also communicates one or more computed paths from the centralized path computation protocol to the network, where the computed paths from the centralized path computation protocol are based on the routing characteristics of the distributed proactive routing protocol for the network.

Green Communication in Energy Renewable Wireless Mesh Networks: Routing, Rate Control, and Power Allocation

Abstract: The increasing demand for wireless services has led to a severe energy consumption problem with the rising of greenhouse gas emission. While the renewable energy can somehow alleviate this problem, the routing, flow rate, and power still have to be well investigated with the objective of minimizing energy consumption in multi-hop energy renewable wireless mesh networks (ER-WMNs). This paper formulates the problem of network-wide energy consumption minimization under the network throughput constraint as a mixed-integer nonlinear programming problem by jointly optimizing routing, rate control, and power allocation. Moreover, the min-max fairness model is applied to address the fairness issue because the uneven routing problem may incur the sharp reduction of network performance in multi-hop ER-WMNs. Due to the high computational complexity of the formulated mathematical programming problem, an energy-aware multi-path routing algorithm (EARA) is also proposed to deal with the joint control of routing, flow rate, and power allocation in practical multi-hop WMNs. To search the optimal routing, it applies a weighted Dijkstra's shortest path algorithm, where the weight is defined as a function of the power consumption and residual energy of a node. Extensive simulation results are presented to show the performance of the proposed schemes and the effects of energy replenishment rate and network throughput on the network lifetime.

Throughput-Aware Routing for Industrial Sensor Networks: Application to ISA100.11a

Abstract: This paper proposes a routing algorithm that enhances throughput and decreases end-to-end delay in industrial cognitive radio sensor networks (ICRSNs) based on ISA100.11a. In ICRSNs, the throughput is downgraded by interference from primary networks. The proposed routing algorithm is targeted at large-scale networks where data are forwarded through different clusters on their way to the sink. By estimating the maximum throughput for each path, the data can be forwarded through the most optimal path. Simulation results show that our scheme can enhance throughput and decrease end-to-end delay.

Energy efficient routing in wireless sensor networks based on fuzzy ant colony optimization

Abstract: A wireless sensor network (WSN) is a collection of sensor nodes that dynamically self-organize themselves into a wireless network without the utilization of any preexisting infrastructure. One of the major problems in WSNs is the energy consumption, whereby the network lifetime is dependent on this factor. In this paper, we propose an optimal routing protocol for WSN inspired by the foraging behavior of ants. The ants try to find existing paths between the source and base station. Furthermore, we have combined this behavior of ants with fuzzy logic in order for the ants to make the best decision. In other words, the fuzzy logic is applied to make the use of these paths optimal. Our algorithm uses the principles of the fuzzy ant colony optimization routing (FACOR) to develop a suitable problem solution. The performance of our routing algorithm is evaluated by Network Simulator 2 (NS2). The simulation results show that our algorithm optimizes the energy consumption amount, decreases the number of routing request packets, and increases the network lifetime in comparison with the original AODV.

A secure multi-hop routing for IoT communication

Abstract: This paper introduces a multi-hop routing protocol that enables secured IoT devices' communication. The routing protocol enables the IoT devices to authenticate before forming a new network or joining an existing network. The authentication uses multi-layer parameters to enhance the security of the communication. The proposed routing protocol embeds the multi-layer parameters into the routing algorithm, thus combining the authentication and routing processes without incurring significant overheads. The multi-layer parameters include a unique User-Controllable Identification, users' pre-agreed application(s), and a list of permitted devices, thus saving resources by maintaining smaller routing information. Experimental and field tests were conducted with results showing that our secure multi-hop routing is suitable to be deployed for IoT communication.

Energy efficient routing protocol for wireless sensor network

Abstract: Nowadays Wireless Sensor Networks WSNs are playing a vital role in several application areas ranging health to battlefield Wireless sensor networks are easy to deploy due to its unique characteristics of size and self-organizing networks. Wireless sensor nodes contain small unchangeable and not chargeable batteries. It is a resource constraint type network Routing in WSN is most expensive task as it utilizes more power resources. This paper is intended to introduce energy efficient routing protocol known as Position Responsive Routing Protocol (PRRP) to enhance energy efficiency of WSN. Position responsive routing protocol differs in several ways than other existing routing techniques. Position response routing protocol approach allows fair distribution of gateway\cluster head selection, maximum possible distance minimization among nodes and gateways\cluster heads to utilize less energy. Position responsive routing protocol shows significant improvement of 45% in energy efficiency of wireless sensor network life time as a whole by increasing battery life of individual nodes. Furthermore PRRP shows drastic increases for data throughput and provide better solution to routing energy hole due to it fair distributed approach of gateway selection.

An efficient routing algorithm to preserve $$k$$k-coverage in wireless sensor networks

Abstract: One of the major challenges in the area of wireless sensor networks is simultaneously reducing energy consumption and increasing network lifetime. Efficient routing algorithms have received considerable attention in previous studies for achieving the required efficiency, but these methods do not pay close attention to coverage, which is one of the most important Quality of Service parameters in wireless sensor networks. Suitable route selection for transferring information received from the environment to the sink plays crucial role in the network lifetime. The proposed method tries to select an efficient route for transferring the information. This paper reviews efficient routing algorithms for preserving k-coverage in a sensor network and then proposes an effective technique for preserving k-coverage and the reliability of data with logical fault tolerance. It is assumed that the network nodes are aware of their residual energy and that of their neighbors. Sensors are first categorized into two groups, coverage and communicative nodes, and some are then re-categorized as clustering and dynamic nodes. Simulation results show that the proposed method provides greater efficiency energy consumption.

LSGO: Link State aware Geographic Opportunistic routing protocol for VANETs

Abstract: Robust and efficient data delivery in vehicular ad hoc networks (VANETs) with high mobility is a challenging issue due to dynamic topology changes and unstable wireless links. The opportunistic routing protocols can improve the reliability of routing by making full use of the broadcast characteristics and assist in data transmission through additional backup links. In this paper, we propose a Link State aware Geographic Opportunistic routing protocol (LSGO) which exploits a combination of geographic location and the link state information as the routing metric. The LSGO aims to improve the reliability of data transmission in a highly dynamic environment, which selects the forwarders and prioritizes them based on the vehicle’s geographic location and the link’s quality. We compare the performance of LSGO with GpsrJ + which removes the unnecessary stop at a junction and greedy traffic aware routing protocol (GyTAR) using network simulator ns-2. The simulation results show that it opens more nodes to participate in the opportunistic data forwarding and increases a connection’s throughput while using no more network capacity than traditional routing. In the simulation, compared with other two protocols, when the number of vehicles and the average vehicle velocity increase, LSGO’s packet dropping rate is reduced and the network throughput is improved.

Wireless network capacity versus Ollivier-Ricci curvature under Heat-Diffusion (HD) protocol

Abstract: Negative curvature in the relatively new Ollivier-Ricci sense of a wireless network graph is shown to be the culprit behind large queue occupancy, large routing energy, and restricted capacity region under any throughput optimal protocol. This is the wireless counterpart of the congestion phenomenon occurring in a Gromov negatively curved wired network under least cost path routing. Significantly different protocols call for significantly different curvature concepts to explain the “congestion” phenomenon. The rationale for the Ollivier-Ricci curvature is that it is defined in terms of a transportation cost-formalized by the Wasserstein distance-under a diffusion process. The Heat-Diffusion protocol used in this paper is driven by the queue differential, so that interpreting packets as calories, it lends itself to a genuine heat diffusion, yet retaining the 3-stage process of weighting-scheduling-forwarding of well-known Back-Pressure protocol. The main result is that the transportation definition of the Ollivier-Ricci curvature allows for the direct connection-without resorting to the Laplacian operator of heat calculus-between curvature and queue occupancy, routing energy, and capacity region.

Cross-Layer Aided Energy-Efficient Opportunistic Routing in Ad Hoc Networks

Abstract: Most of the nodes in ad hoc networks rely on batteries, which requires energy saving. Hence, numerous energy-efficient routing algorithms have been proposed for solving this problem. In this paper, we exploit the benefits of cross-layer information exchange, such as the knowledge of the Frame Error Rate (FER) in the physical layer, the maximum number of retransmissions in the Medium Access Control (MAC) layer and the number of relays in the network layer. Energy-consumption-based Objective Functions (OF) are invoked for calculating the end-to-end energy consumption of each potentially available route for both Traditional Routing (TR) and for our novel Opportunistic Routing (OR), respectively. We also improve the TR and the OR with the aid of efficient Power Allocation (PA) for further reducing the energy consumption. For the TR, we take into account the dependencies amongst the links of a multi-hop route, which facilitates a more accurate performance evaluation than upon assuming the links that are independent. Moreover, two energy-efficient routing algorithms are designed based on Dijkstra's algorithm. The algorithms based on the energy OF provide the theoretical bounds, which are shown to be close to the bound found from exhaustive search, despite the significantly reduced complexity of the former. Finally, the end-to-end throughput and the end-to-end delay of this system are analyzed theoretically and a new technique of characterizing the delay distribution of OR is proposed. The simulation results show that our energy-efficient OR outperforms the TR and that their theoretical analysis accurately matches the simulation results.

Scalable Dynamic Routing Protocol for Cognitive Radio Sensor Networks

Abstract: Wireless sensor networks (WSNs) have been increasingly considered an attractive solution for a plethora of applications. The low cost of sensor nodes provides a mean to deploy large sensor arrays in a variety of applications, such as civilian and environmental monitoring. Most of the WSNs operate in unlicensed spectrum bands, which have become overcrowded. As the number of the nodes that join the network increases, the need for energy-efficient, resource-constrained, and spectrum-efficient protocol also increases. Incorporating cognitive radio capability in sensor networks yields a promising networking paradigm, also known as cognitive radio sensor networks. In this paper, a cognitive networking with opportunistic routing protocol for WSNs is introduced. The objective of the proposed protocol is to improve the network performance after increasing network scalability. The performance of the proposed protocol is evaluated through simulations. An accurate channel model is built to evaluate the signal strength in different areas of a complex indoor environment. Then, a discrete event simulator is applied to examine the performance of the proposed protocol in comparison with two other routing protocols. Simulation results show that when comparing with other common routing protocols, the proposed protocol performs better with respect to throughput, packet delay, and total energy consumption.

Congestion Aware Routing in Nonlinear Elastic Optical Networks

Abstract: In elastic optical networks, digital coherent transceivers modify their symbol rate, modulation format, and forward error correction to best serve the network demands. In a nonlinear elastic optical network, these parameters are inherently coupled with the routing algorithm. We propose to use congestion aware routing in a nonlinear elastic optical network and demonstrate its efficacy for the NSFNET reference network (14 nodes, 22 links). The network is sequentially loaded with 100 GbE demands until a demand becomes blocked, this procedure being repeated 10000 times to estimate the network blocking probability (NBP). Three routing algorithms are considered: 1) shortest path routing; 2) simple congestion aware algorithm; and 3) weighted congestion aware routing algorithm with 50, 25, 12.5, and 6.25 GHz resolution flexgrids. For NBP = 1% using a 50 GHz grid, congestion aware routing doubles the network capacity compared with the shortest path routing. When congestion aware routing is combined with a 6.25 GHz resolution flexgrid, a fivefold increase in network capacity is afforded.

Joint Routing and Resource Allocation for Delay Minimization in Cognitive Radio Based Mesh Networks

Abstract: This paper studies the joint design of routing and resource allocation algorithms in cognitive radio based wireless mesh networks. The mesh nodes utilize cognitive overlay mode to share the spectrum with primary users. Prior to each transmission, mesh nodes sense the wireless medium to identify available spectrum resources. Depending on the primary user activities and traffic characteristics, the available spectrum resources will vary between mesh transmission attempts, posing a challenge that the routing and resource allocation algorithms have to deal with to guarantee timely delivery of the network traffic. To capture the channel availability dynamics, the system is analyzed from a queuing theory perspective, and the joint routing and resource allocation problem is formulated as a non-linear integer programming problem. The objective is to minimize the aggregate end-to-end delay of all the network flows. A distributed solution scheme is developed based on the Lagrangian dual problem. Numerical results demonstrate the convergence of the distributed solution procedure to the optimal solution, as well as the performance gains compared to other design methods. It is shown that the joint design scheme can accommodate double the traffic load, or achieve half the delay compared to the disjoint methods.

Multiconstrained and multipath QoS aware routing protocol for MANETs

Abstract: The multimedia applications such as audio, video transmission in Mobile Ad Hoc Network (MANET) requires that the path in which such data transmits must be delay sensitive, reliable and energy efficient. An existing MANET routing protocol Ad Hoc On demand Multipath Distance Vector (AOMDV) fails to perform well in terms of QoS metrics such as delay, jitter, packet delivery ratio (PDR) etc., where there is high mobility and heavy traffic. The paths which are stored in the Routing table are not reliable and energy efficient. It is possible to modify the route discovery of AODV so that more than one node disjoint, link reliable and energy efficient paths are stored in the routing table. The proposed protocol Multiconstrained and Multipath QoS Aware Routing Protocol (MMQARP) is novel, which takes care of QoS parameters dynamically and simultaneously along with path finding, so that only link reliable, energy efficient paths are available for data transmission. The extensive simulation study shows that the proposed protocol performs better in terms of PDR, delay and jitter compared to AOMDV protocol.

TIGHT: A Geographic Routing Protocol for Cognitive Radio Mobile Ad Hoc Networks

Abstract: This paper presents TIGHT, a geographic routing protocol for cognitive radio mobile ad hoc networks. TIGHT offers three routing modes and allows secondary users to fully explore the transmission opportunities over a primary channel without affecting primary users (PUs). The greedy mode routes a packet via greedy geographic forwarding until a PU region is encountered and then further routes the packet around the PU region to where greedy forwarding can resume. It works best when the PUs are only occasionally active. In contrast, the optimal and suboptimal modes route a packet along optimal and suboptimal trajectories to the destination, respectively. They work best when the PUs are active most of the time. The suboptimal mode is computationally more efficient than the optimal mode at the cost of using suboptimal trajectories in rare cases. The efficacy of TIGHT is confirmed by extensive simulations. Index Terms—Cognitive radio, geographic routing, CR-MANET.

A Survey: Routing Protocols in MANETs

Abstract: Mobile ad hoc network is a collection of wireless nodes that can dynamically be set up anywhere and anytime to exchange information without using any pre-existing network infrastructure. It is a self organized and self configurable network where the mobile nodes move randomly. In MANETs mobile nodes can receive and forward packets as a router and each node operates not only as an end system, but also as a router to forward packets. There is no fixed infrastructure, which results in addition and exclusion of any number of nodes from the network for relatively small networks routing protocols may be sufficient. However, in larger networks either hierarchical or geographic routing protocols are needed. In this survey paper three routing protocols AODV (Ad- Hoc On-Demand Distance Vector), OLSR (Optimized Link State Routing Protocol) and DSR (Dynamic Source Routing Protocol) along with many other algorithms are described briefly.

Routing Algorithm Based on Delay Rate in Wireless Cognitive Radio Network

Abstract: To reduce the end-to-end average delay of algorithm in wireless network, this paper proposes the real-time routing algorithm in spectrum network. It is analyzed that the dynamic changes of the radio network model and routing algorithm in spectrum network. Through using Markov state transition and adjusting the router with scaling factor, the high-quality resources in the network can be obtained and fully utilized, and then these can reduce the transmission time latency rate and timely adjust the route. After that the tendency of spectrum network and specific real-time algorithm are given. Finally, by using the network simulation NS-2, simulation experiments are used to estimate the performance test. Experimental results show that compared with the traditional algorithm, the proposed algorithm can obtain a lower end-to-end average delay and improves network throughput and the steady and reliability of the link connection.

NovaCube: A low latency Torus-based network architecture for data centers

Abstract: This paper presents the design, analysis, and implementation of a novel data center network architecture, named NovaCube. Based on regular Torus topology, NovaCube is constructed by adding a number of most beneficial jump-over links, which offers many distinct advantages and practical benefits. Moreover, in order to enable NovaCube to achieve its maximum theoretical performance, a probabilistic oblivious routing algorithm PORA is carefully designed. PORA is a both deadlock and livelock free routing algorithm, which achieves near-optimal performance in terms of average routing path length with better load balancing thus leading to higher throughput. Theoretical derivation and mathematical analysis further prove the good performance of NovaCube and PORA.

A multipath energy-conserving routing protocol for wireless ad hoc networks lifetime improvement

Abstract: Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. Traditional techniques of routing are not well adapted. Indeed, their lack of reactivity with respect to the variability of network changes makes them difficult to use. Moreover, conserving energy is a critical concern in the design of routing protocols for ad hoc networks because most mobile nodes operate with limited battery capacity, and the energy depletion of a node affects not only the node itself but also the overall network lifetime. In all proposed single-path routing schemes, a new path-discovery process is required once a path failure is detected, and this process causes delay and wastage of node resources. A multipath routing scheme is an alternative to maximize the network lifetime. In this paper, we propose an energy-efficient multipath routing protocol, called ad hoc on-demand multipath routing with lifetime maximization (AOMR-LM), which preserves the residual energy of nodes and balances the consumed energy to increase the network lifetime. To achieve this goal, we used the residual energy of nodes for calculating the node energy level. The multipath selection mechanism uses this energy level to classify the paths. Two parameters are analyzed: the energy threshold β and the coefficient α. These parameters are required to classify the nodes and to ensure the preservation of node energy. Our protocol improves the performance of mobile ad hoc networks by prolonging the lifetime of the network. This novel protocol has been compared with other protocols: ad hoc on-demand multipath distance vector (AOMDV) and ZD-AOMDV. The protocol performance has been evaluated in terms of network lifetime, energy consumption, and end-to-end delay.