Scalable Routing in Sensor Actuator Networks with Churn

Mobile Ad-Hoc Networks (MANETs) are becoming increasingly popular as more and more mobile devices find their way to the public. A crucial problem in Ad-Hoc networks is finding an efficient route between a source and a destination. Due to MANET’s inherent characteristics, secure routing may be one of the most difficult areas to tackle because opponents can add themselves to a MANET using the existing common routing protocols. Hence, this paper proposed a new model of routing protocol called ARANz, which is an extension of the original Authenticated Routing for Ad-Hoc Networks (ARAN). Apart from the authentication methods adopted from ARAN, ARANz aims to increase security, achieve robustness and solve the single point of failure and attack problems by introducing multiple Local Certificate Authority servers. Moreover, by dealing with the network as zones and using restricted directional flooding, our new model will exhibit better scalability and performance. An overview and a qualitative comparison between ARANz and some existing Ad-Hoc routing protocols is presented in this paper.

The nodes in wireless sensor networks are energy-constrained and have limited bandwidth. In addition, communication links between nodes are unpredictable and unstable. These factors make the design of routing protocols for such a network very challenging. We propose a scalable, efficient and reliable routing protocol called EAR that provides reliable data delivery from nodes to hubs in a wireless sensor network. Simulation results have shown EAR outperforming existing routing protocols.KeywordsWireless Sensor NetworkData PacketMedium Access Control ProtocolPacket Delivery RatioRREQ PacketThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

We introduce WRP-Lite, which is a table-driven routing protocol that uses non-optimal routes, and compare its performance with the performance of the dynamic source routing (DSR) protocol, which is an on-demand routing protocol for wireless ad-hoc networks. We evaluate the performance of WRP-Lite and DSR for varying degree of mobility and traffic in a 20-node network. The performance parameters are end-to-end delay, control overhead, percentage of packets delivered, and hop distribution. We show that WRP-Lite has much better delay and hop performance while having comparable overhead to DSR.

Mobile ad hoc networks (MANET) are self-configured and self-maintained network without any central authority. In MANET the route discovery from source node to destination node is a critical issue due to frequent changes in network topology and mobility of nodes. The MANET consists of problems such as load balancing, scalability, stability, reliability security and robustness. It is therefore necessary to check node stability with respect to node mobility and Bandwidth during path establishment. The Scalable Multipath On-demand Routing Protocol for Mobile Ad-hoc Network (SMORT) is suitable for Scalability only. The proposed protocol is an advanced version of SMORT which includes additional stability factor. This paper presents a new multipath routing protocol, stable and scalable on-demand routing for mobile ad hoc networks which improves the lifetime of the network and improves the performance.

Wireless Sensor Networks, referred to as WSNs, are made up of various types of sensor nodes. Recent developments in micro electro-mechanical technology have given rise to new integrated circuitry, microprocessor hardware and nano technology, wireless technology, and advanced networking routing protocols. Hospitals and health service facilities, the armed forces, and even residential customers represent a potential huge market for these devices. The problem is that existing sensor network nodes are incapable of providing the support needed to maximize usage of wireless technology. For this reason, there are many novel routing protocols for the wireless sensor networks proposed recently. One is Hierarchical or cluster-based routing. In this paper, we analyze three different types of hierarchical routing protocols: Low Energy Adaptive Clustering Hierarchy (LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), and Virtual Grid Architecture (VGA). We tried to analyze the performance of these protocols, including the power consumption and overall network performance. We also compared the routing protocol together. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks. The simulation results, using same limited sensing range value, show that PEGASIS outperforms all other protocols while LEACH has better performance than VGA. Furthermore, the paper investigates the power consumption for all protocols. On the average, VGA has the worst power consumption when the sensing range is limited, while VGA is the best when the sensing range is increased. Using homogeneous nodes can greatly prolong sensor network’s life time. Also, The network lifetime increases as the number of clusters decreases

Routing protocols for wireless sensor networks are important in addressing the various quality-of-service (QoS) issues pertaining to different applications. The most important QoS issues while designing routing protocols for WSN are energy awareness, scalability and network lifetime. However to deal with these issues the solutions provided in related literature have certain inherent disadvantages like high control overhead, low packet delivery ratio and requirement of global location information. In order to resolve these issues, we propose an orthogonal transmission based scalable, lightweight and energy aware routing protocol named as OD-PPRP which does not require global location information and has low control overhead. The proposed protocol OD-PRRP has the characteristics of both reactive and proactive routing protocols and utilizes fuzzy logic and Ant Colony Optimization to identify energy efficient and optimal paths. The simulation results show in both static and dynamic environment, OD-PRRP has better network lifetime, low end to end transmission delay, less overhead and high packet delivery ratio than other state of art QoS aware routing protocol viz. EARQ, EAODV and EEABR.

Data aggregation plays an important role in energy constrained wireless sensor networks (WSN). Redundant data can be aggregated at intermediate nodes of a WSN reducing the number of messages exchanged and consequently reducing communication costs. In this work we consider the problem of constructing a dynamic and scalable structure for data aggregation in WSN. Although there are many proposed solutions to data aggregation in WSN, most of them build the data aggregation structure based on the order in which events occur. This kind of structure leads to low quality routing trees and does not address the load balancing problem, since the same tree is used throughout the network life. To tackle these challenges we propose a novel routing protocol called Dynamic and Scalable Tree (DST), which reduces the number of messages necessary to set up a routing tree, maximizes the number of overlapping routes, and selects routes with the highest aggregation rate. The routing tree created by DST does not depend on the order of events and is not held fixed along the occurrence of events. DST was extensively compared with two solutions reported in the literature regarding communication costs, aggregation rate and quality of the routing tree. Results show that the routing tree built by DST provides the best aggregation quality compared with other algorithms outperforming them for different scenarios in all evaluations performed.

Delay Tolerant Networks enable data transmission in different applications, mainly in environments where communication infrastructure is missing. The existence of links is casual and even when links are created, they are short in time and unstable/unreliable in terms of connectivity. Thus, underwater network applications tend to be delay tolerant. In this paper, we propose a mobility-aware routing protocol for underwater wireless sensor networks. The protocol is based on Focused Beam Routing (FBR) protocol and considers nodes’ next destination location when making forwarding decisions. The routing protocol is called Destination-aware Focused Beam Routing (D-FBR) protocol and we compare its performance with FBR protocol for different FBR angles and different applications. We use Delivery Probability (DP), Average Number of Hops (ANH), Overhead Ratio (OR) and simulate our scenarios by The ONE simulator. Simulation results show that, for D-FBR protocol, when FBR angle is 30 ∘ , OR and ANH is improved by 34.5 % and 23.1 %, respectively, while DP is 6.5 % lower, compared to FBR protocol. Both D-FBR and FBR outperform Epidemic Routing Protocol.

<span lang="EN-US">Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.</span>

This paper conduct a comprehensive simulation study on the behavior of TCP-friendly Rate Control (TFRC) protocol over Ad-Hoc On Demand Vector (AODV) routing protocol and Dynamic Source Routing (DSR) protocol. The aim are first, to measure the performance of TFRC in terms of throughput, delay and jitter. The second objective is to identify which Mobile Ad-Hoc Network (MANET) routing protocols work well with TFRC. We conduct the experiment by sending multimedia streaming traffic carried by TFRC over AODV and DSR respectively. Random-Waypoint mobility model is used for both experiments. Results obtained shows that in average TFRC over AODV has more throughput and less delay as compared with TFRC over DSR. However, in terms of jitter, TFRC over DSR gives better result.

The rapid advances in the wireless communication industry have paved the way for the enhancement of wireless mobile ad-hoc networks (MANETs) to support various domains including civilian environments, emergency operations, and military affairs. Source routing in MANETs is subject to some issues such as changes in the network topology, which lead to frequent link breakages that may increase the requests of route discoveries. Thus, this paper aims to enhance on-demand source routing protocols by proposing two mechanisms, a zone-based route discovery mechanism (ZRDM) and a link failure prediction mechanism (LFPM). ZRDM aims to control the flooding of route requests, and LFPM aims to avoid route breakages caused by node mobility. The performance of the proposed mechanisms was evaluated using network simulator 3 in terms of normalized routing load, average end-to-end delay, and packet delivery ratio. The experimental results showed that the proposed mechanisms outperform well-known mechanisms such as the dynamic source routing (DSR) protocol, reliable DSR, and zone-based DSR and segment-based DSR.

The existing routing protocols for wireless sensor networks were not reasonable in design, which limited their application. Most of the existing studies did not take into account the energy consumption of the network and the balanced use of the energy of sensor nodes, which led to the unsatisfactory application effect of wireless sensor networks in some fields. Therefore, from the perspective of energy balance in wireless sensor networks, this paper proposed a construction method of an energy balance routing protocol in wireless sensor networks based on a fuzzy control strategy. Firstly, based on the analysis of the basic composition of wireless sensor networks and the structure of sensor nodes, this paper expounded the basic process of wireless data transmission and summarized the classification and characteristics of routing protocols in wireless sensor networks from different angles. Secondly, according to the node data transmission characteristics of wireless sensor networks, the energy balance use model of sensor nodes was established, and the design method of the energy balance routing protocol based on fuzzy control strategy was proposed, and the data transmission link was optimized. Finally, through experimental comparative analysis, the results showed that the energy balanced routing protocol proposed in this paper can effectively realize the energy balanced use of the network data transmission process. Compared with other common routing protocols, the wireless sensor network routing protocol proposed in this paper can not only improve the data transmission efficiency and reduce the data redundancy but also save energy consumption and prolong the network running time. The design method of routing protocol proposed in this paper will be conducive to the optimization and application of routing protocol in wireless sensor networks and provide a theoretical basis for the related research of wireless sensor networks.

The full text of this article is not available on SOAR. WSU users can access the article via IEEE Xplore database licensed by University Libraries: http://libcat.wichita.edu/vwebv/holdingsInfo?bibId=1045954

Due to different requirements in applications, sensors with different capacities are deployed. How to design efficient, reliable and scalable routing protocols in such wireless heterogeneous sensor networks (WHSNs) with intermittent asymmetric links is a challenging task. In this paper, we propose ProHet: a distributed probabilistic routing protocol for WHSNs that utilizes asymmetric links to reach assured delivery rate with low overhead. The ProHet protocol first produces a bidirectional routing abstraction by finding a reverse path for every asymmetric link. Then, it uses a probabilistic strategy to choose forwarding nodes based on historical statistics using local information. Analysis shows that ProHet can achieve assured delivery rate ρ if ρ is set within its upper-bound. Extensive simulations are conducted to verify its efficiency.

Recent advances in environmental sources harvesting technologies is a promising solution to provide sustainable energy sources for wireless sensor networks (WSN). Renewable energy sources such as solar, thermal and electromagnetic waves constitute viable alternatives to maximize the network lifetime. Therefore, networking software awareness and adaptability to energy availability conditions should translate into innovative supporting features for data gathering, aggregation, routing and dissemination. Thus, it is paramount to develop robust energy harvesting-aware networking platforms that support the above services and guarantee low energy consumption and data integrity in a noisy, constrained environment. In this paper, we present an opportunistic routing and data dissemination protocol for energy harvesting wireless sensor network (EH-WSN) based on cross-layer constructs that allows across the layers synchronization and coordination between the routing protocol and the application layer services. The OMNET++ based extensive simulation of this protocol showed promising results in terms of meeting application requirements of handling urgent traffic and delay tolerant traffic seamlessly and ensuring energy usage efficiency.