Rumor Routing Research Articles

An optimized crypto‐based routing protocol for secure routing in wireless sensor networks

SummaryIn Wireless Sensor Networks (WSN), energy‐efficient, reliable routing is the core objective for the data transmission process. Anomaly nodes in the communication environment can affect reliable routing and network efficiency. Therefore, the present research created a novel Arithmetic Optimization‐based Rumor Routing Protocol with SKINNY Crypto mechanism (AORRP‐SCrypt) for secure Routing in WSN. Primarily, the required nodes are deployed in the related WSN environment. The arithmetic function traced the nodes' higher energy consumption and malicious action to avoid security vulnerabilities during data transmission. The sensed data packets are transmitted based on the Rumor routing function of the proposed system. Furthermore, to avoid data access by unauthorized users, it is encrypted using the SKINNY Crypto mechanism. Finally, the network efficiency and security performance are validated in the NS3 platform. The model gained 98.1% network throughput, 95.6% PDR, a lower energy consumption of between 0.001 and 0.01 J, and a 99% confidentiality rate. The developed system provided increased network security and efficiency.

Two energy and time-efficient data dissemination protocols for large-scale wireless sensor networks

In a wireless sensor network (WSN) where positioning information is not assumed or is partially available, efficient data access is a very challenging issue especially in an environment with multiple random sources and sinks. Few years back, an interesting rumor-agent based protocol named rumor routing (RR) was proposed. The key concept RR introduced is that the agents are used to spread request and environmental information in an attempt to not affect the limited bandwidth of WSN. Moreover, in this protocol, the cooperation of agents helps build optimal paths leading to events with low energy cost. In this paper, we first review the major RR extensions classifying them into two categories: location-based and free location-based. Then, based on this classification, we propose two rumor-based data dissemination protocols designed to ensure both energy and time-efficient data access for realistic WSN deployments. The two proposed protocols have been compared with the relevant previous works through simulation campaigns. Performance evaluation results show that our proposed protocols achieve significant improvements in terms of data accessibility, generated traffic, and query latency.

On Energy-Efficient Straight-Line Routing Protocol for Wireless Sensor Networks

One of the limitations of a wireless sensor network (WSN) is its limited sensor node energy resource; this necessitates an energy-efficient routing protocol that maximizes the overall system performance. Rumor routing is a classic random-walk routing protocol that, unfortunately, is not scalable and can result in spiral paths. We consider that the shortest distance between two points is a straight line and that two straight lines in a plane are likely to intersect and develop for WSNs an improved protocol called straight-line routing (SLR), in which we construct a straight path using two-hop information without the assistance of geographic information. SLR thus reduces the energy consumption of sensor nodes in WSNs. We propose enhanced schemes to improve performance and conserve more energy and, with extensive simulation results, demonstrate the effectiveness of these SLR schemes in comparison with rumor routing.

An Improved Rumor Routing Protocol Based on Optimized Intersection Angle Theory and Localization Technologies in WSN

Routing mechanism is a key issue in Wireless Sensor Networks, and rumor routing protocol can reduce energy consumption and extend the lifecycle of network with unicast mechanism. However, in Rumor Routing protocol, the transmission path of event message is not optimal and random forwarding mechanism will lead to routing loop. In this paper, we investigate Rumor Routing protocol, and propose an improved rumor routing protocol based on optimized intersection angle theory. Localization technology and vector intersection angle mechanism are brought into the new protocol as two metrics of route selection. The new mechanism can reduce the energy consumption of data transmission. We compare Rumor Routing protocol, GPSR protocol, a Rumor Routing-based protocol, and the improved protocol. Results of simulation experiments indicate that the improved routing protocol can reduce the energy consumption of routing path and extend the lifecycle of network.

Routing Protocols used in Wireless Sensor Network

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

A Multi-Aware Query Driven (MAQD) routing protocol for mobile wireless sensor networks based on neuro-fuzzy inference

A Mobile Wireless Sensor Network (MWSN) is composed of mobile sensor nodes, whereby the life time of a sensor is specified by the life time of its battery. MWSN is used to measure a mobile object parameters then transmit the sensed data to center station called Sink Node (SN). Routing of the sensed data is a challenging issue since several parameters and restrictions should be managed carefully in MWSN. Although the sensor's power (e.g., sensor's battery level) is a critical issue, managing data transmission time is also a considerable subject especially for real time applications. Several routing protocols had been proposed for MWSN, however, each protocol considers a single type of awareness (such as; long life, delay time, total energy…). While some protocols consider the sensor's energy to maximize the network lifetime, others aim to find the shortest path to reach the destination. In this paper, a multi-aware query driven (MAQD) routing protocol will be proposed for MWSN based on a neuro-fuzzy inference system. MAQD considers four types of awareness; the long life of the sensor, delay time of data transmission, total cost of the network, and the shortest transmission path. Hence, based on the selected type of awareness, a fuzzy inference system selects the proper path for routing data. MAQD is a query driven protocol, accordingly, SN can collect data from some/all sensors by employing a request (REQ) message in which the awareness type is specified. MAQD is simulated and tested using OPNET 14.5 and compared with the latest MWSN routing protocols. Simulation results have shown that MAQD outperforms the selected competitors routing protocols (LEACH, ERTLD, RACE, SPIN, EAR2, DCBM, and Rumor routing) as it introduces the best data delivery with the minimum routing overheads in terms of time penalties and power consumed.

An Improved Rumor Routing Protocol Based on Distance Constraint in Wireless Sensor Network

An Improved Rumor Routing Protocol Based on Distance Constraint in Wireless Sensor Network

Optimization approach for energy minimization and bandwidth estimation of WSN for data centric protocols

Wireless sensor nodes are battery powered so there life times are limited. Hence there is need to maximize the overall network life time. The various authors have used different approaches to enhance the network lifetime like by minimization of the energy consumed per packet, bandwidth management, optimizing shortest path, minimizing the cost packet ratio and reduce the energy exhaustion of sensor nodes. In this article, we have used an optimization system for WSNs which is able to applied and optimize the physical distance between two nodes and signal strength between source node (p) to sink node (q) in transmission range. The analysis reported based on ant colony optimization (ACO) meta heuristic method at the network layer routing protocols (data centric) namely directed diffusion protocol, gradient based protocol, energy aware routing protocol and rumor routing protocol. The remaining energy of the nodes has been computed in wireless sensor network area using different parameter. Results show that by using optimization scheme (ACO) give the better performance of directed diffusion protocol as compare to other protocol (gradient based, energy aware routing, and rumor routing) in terms of remaining energy of the node. Link bandwidth has been evaluated considering transmission rate from source node to sink node. The bandwidth of above stated routing protocols has been computed and gradient based protocol is found to be the most efficient among others routing protocol.

WSN: Lifetime Maximization of Rumor Routing Protocol with Optimization Scheme and Bandwidth Evaluation

DOI: 10.9734/BJMCS/2015/15452 Editor(s): (1) Doina Bein, Applied Research Laboratory, The Pennsylvania State University, USA. Reviewers: (1) Anonymous, Turkey. (2) Anonymous, India. (3) Anonymous, Morocco. (4) Ganesh Subramanian, ECE department, Panimalar Institute of Technology, Anna University, Chennai, India. (5) Hafiz Bilal Khalil, Department of Electrical Engineering, University of Gujrat, Pakistan. (6) Anonymous, Taiwan. Complete Peer review History: http://www.sciencedomain.org/review-history.php?iid=935&id=6&aid=8168

Performance Study of an Improved Routing Algorithm in Wireless Sensor Networks

The Relative Coordinate Rumor Routing (RCRR) is a hybrid routing protocol based on a straight line routing scheme proposed to overcome the drawbacks of the Rumor Routing (RR) protocol which is based on a random walk approach. This paper presents a performance study of the RCRR protocol for Wireless Sensor Networks. The main objective is to evaluate the performances of the new RCRR protocol under different situations and considering different factors such as network size or the impact of the positions of the Beacon nodes originally placed along the horizontal and the vertical line of the 4 cardinal points. Through the presented scenarios and simulations, it is shown that the energy consumption is much more in some cases and much less in other cases. Based on this study, guidelines can be deduced to improve the behavior of the RCCR routing protocol.

Optimized query-driven appointment routing based on Expectation-Maximization in wireless sensor networks

Query-driven routing plays an important role in wireless sensor networks, especially when Sink looks for data with unknown location in the network. Rumor routing propagates event information in some select paths in the network, in effect, creating an event trace. When an agent on an event trace is crossed by a query agent, a route to event location is established. The main goal in all rumor-based algorithms is to expedite the cross over by the query-agents. This paper introduces a new class of rumor-based algorithms based on a concept called appointment, adding determinism to the cross-over point location as well as agent traversal trajectory in a randomly set-up network and event scenarios. Two flavors of the algorithm are proposed. In the first approach, query-agents and event-agents make an appointment at the edge of the network. In the second approach, the appointment is made at a central point in the network. We study the optimality conditions for such a central point as a function of the system parameters. A Gaussian mixture model is used to model the events’ spatial stochastic distribution, and a dynamic Expectation-Maximization algorithm is developed to estimate its rank and parameters. A data fusion algorithm is then applied to calculate the appointment point. We formulate a trade-off among search speed, route length, and network life time. Simulation results in various scenarios are used to compare the proposed algorithms to other competing algorithms and also to the optimal solution. The results illustrate that algorithms proposed in this paper are nearly optimal and are superior compared to other query-based routing algorithms.

A Small-World Routing Protocol and the Effect of Pass-Over for Wireless Sensor Networks

One of the fundamental issues of wireless sensor networks is that an event can be detected by some sensor nodes and delivered to the query devices. This kind of queries and events can be happening anytime and anywhere. Due to the battery constrained nature of sensor nodes, it is important to design routing protocols that are efficient and power saving. In this work, we propose a new routing protocol, the small-world routing protocol (SWRP), which is at the same time a generalization of both flooding and rumor routing and can be operating in between both extremes. With the idea originating from the small-world theory, the proposed protocol finds paths between the queries and events through recurrent propagations of strong and weak links. The operation of the protocol is simple, flexible and requires not much computational power. The SWRP may also minimize the pass-over problem, which occurs when a query agent passes over an event agent even though the two lines cross each other and thus prevents a query from finding the event. It has been shown that by increasing the number of strong links of the SWRP within a controlled area, we may be able to reduce the occurrences of pass-over. Accordingly, the proposed SWRP may achieve much better successful rate in routing as well as cut the number of hop-count at the same time. In particular, our simulation results show that with approximately the same routing overhead (in term of number of routing messages), our protocol may achieve up to 22% more in success rate and 10-hop less in average path length. To reach a 100% successful routing rate, our protocol may save up to 41.2% additional routing overhead as compared to the rumor routing. Most important of all, the SWRP makes the improvements without sacrificing the power consumption of each individual sensor node as the average inter-hop distance for discovered routing paths does not increase as a result of shorter path length.

On random routing in wireless sensor grids: A mathematical model for rendezvous probability and performance optimization

Random routing protocols in Wireless Sensor Networks (WSNs) forward packets to randomly selected neighbors. These packets are ‘agents’ carrying information about events or ‘queries’ seeking such information. A novel mathematical framework is proposed for analyzing random routing protocols. Exact probability of a packet visiting a given node within a given hop count as well as the rendezvous probability of agents and queries meeting at a given node in a 2-D grid-based WSN are derived. The basic relationship needed for extending the models to a 3-D grid topology is provided. Exact probabilities of agents meeting queries are derived while ignoring physical boundary effects and packet losses, under two different strategies for forwarding the packet to a neighbor: (a) with equal probability, and (b) self-avoiding forwarding. We then extend the model to account for packet losses by considering the case where a packet is forwarded to a neighbor with equal probability. Also provided is the extension of the analysis for a network with rectangular boundaries. The exact solutions presented, unlike existing models relying on asymptotic behavior, are also applicable to small and medium scale networks. They can be used to set parameters and optimize performance of several classes of random routing protocols. All the models are validated using Monte Carlo simulations. Simulation results indicate that the model is also a good approximation for sparse arrays with 75% or higher node density. Finally, the utility of the model is demonstrated by determining the protocol parameters to optimize the performance of rumor routing protocol under a fixed energy budget.

New routing framework base on rumor routing in wireless sensor networks

Rumor routing is a classic routing algorithm based on agents’ random walk. This paper proposes a novel approach based on this routing algorithm. Here, we try to improve the latency and energy consumption of the traditional algorithm using propagation of query and event agents within straight lines, instead of using purely random walk paths. As can be seen in our results, this method improves the delivery ratio of the queries which is a drawback of traditional rumor routing. Due to the reduction of final path length between source and destination, we introduce a second layer geographical routing. Moreover, a method is proposed to reduce the cost of localization equipments by using cheaper equipments like AoA antennas. In order to compare the performance measures with traditional algorithm, a simulation framework is developed and extensive simulations are performed.

Gradient-based routing in sensor networks

A distributed sensor network (DSN) consists of sensor nodes with limited energy source, sensor devices, short-range radio and on-board processing capability. Sensing capability of the attached sensing devices and their small size, make these sensor nodes highly suitable for environmental monitoring. But characteristics of sensor nodes, e.g., expensive wireless communication, high probability of failure or malfunction and the unstructured nature of DSN, make routing in DSN a challenging problem. Traditional routing protocols in DSN are based mostly on flooding (Directed Diffusion[1]) or random-walk (Rumor routing [1], ACQUIRE [3], etc.). Flooding causes huge communication overhead due to frequent route discovery, especially for one-shot query and for large-scale networks. Though asymptotically, random-walk shows good performance, in practice it causes high latency and without directionality and proper TTL, sometimes fails to find resource. We note that many physical phenomena follow decay law. For example, if some location’s temperature is 100C, then nearby locations temperature should be correlated with that based on distance. So, routing protocols can use this natural gradient as an important attribute to forward the query towards source. A proactive informative driven protocol is proposed in [4] for querying and routing in sensor net. It uses proactive information utility measurement to select optimal node and guide query routing, which creates extra overhead at low query rate due to exchange of information between neighbors and leader. Also that protocol does not handle scenarios with local maxima or minima or multiple sources. To overcome these limitations, in this paper we propose a novel energy efficient, fully distributed and reactive routing protocol based on gradient of event’s effect for environmental monitoring sensor networks. Our protocol handles local and isolated maxima or hole of information using simulated annealing concepts.