Efficient route update and maintenance processes for multipath routing in large-scale industrial wireless sensor networks

Reliable communications is one of the major concerns in wireless sensor networks (WSNs). Multipath routing is an effective way to improve communication reliability in WSNs. However, most of existing multipath routing protocols for sensor networks are reactive and require dynamic route discovery. If there are many sensor nodes from a source to a destination, the route discovery process will create a long end-to-end transmission delay, which causes difficulties in some time-critical applications. To overcome this difficulty, the efficient route update and maintenance processes are proposed in this paper. It aims to limit the amount of routing overhead with two-tier routing architecture and introduce the combination of piggyback and trigger update to replace the periodic update process, which is the main source of unnecessary routing overhead. Simulations are carried out to demonstrate the effectiveness of the proposed processes in improvement of total amount of routing overhead over existing popular routing protocols.

Energy-aware dynamic route management for THAWS

In this research we focus on the Tyndall 25mm and 10mm nodes energy-aware topology management to extend sensor network lifespan and optimise node power consumption. The two tiered Tyndall Heterogeneous Automated Wireless Sensors (THAWS) tool is used to quickly create and configure application-specific sensor networks. To this end, we propose to implement a distributed route discovery algorithm and a practical energy-aware reaction model on the 25mm nodes. Triggered by the energy-warning events, the miniaturised Tyndall 10mm data collector nodes adaptively and periodically change their association to 25mm base station nodes, while 25mm nodes also change the inter-connections between themselves, which results in reconfiguration of the 25mm nodes tier topology. The distributed routing protocol uses combined weight functions to balance the sensor network traffic. A system level simulation is used to quantify the benefit of the route management framework when compared to other state of the art approaches in terms of the system power-saving.

An Effective Path Protection Method to Attain the Route Stability in MANET

With the increasing popularity of wireless network and its application, mobile ad-hoc networks (MANETS) emerged recently. MANET topology is highly dynamic in nature and nodes are highly mobile so that the rate of link failure is more in MANET. There is no central control over the nodes and the control is distributed among nodes and they can act as either router or source. MANTEs have been considered as isolated stand-alone network. Node can add or remove at any time and it is not infrastructure dependent. So at any time at any where the network can setup and a trouble free communication is possible. Due to more chances of link failures, collisions and transmission errors in MANET, the maintenance of network became costly. As per the study more frequent link failures became an important aspect of diminishing the performance of the network and also it is not predictable. The main objective of this paper is to study the route instability in AODV protocol and suggest a solution for improvement. This paper proposes a new approach to reduce the route failure by storing the alternate route in the intermediate nodes. In this algorithm intermediate nodes are also involved in the route discovery process. This reduces the route establishment overhead as well as the time to find the reroute when a link failure occurs.

On Optimal Performance in Mobile Ad-Hoc Networks

In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capacity region has long been known to be NP-hard. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the heuristic is very simple to implement and is not overly sensitive to the threshold value used. We find empirical conditions for our heuristic to be near-optimal as well as network scenarios when our simple heuristic does not perform very well. We provide extensive numerical and simulation results for different parameter settings of our model.

Prediction based location aided routing for mobile ad hoc networks

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided Routing (P-LAR) protocol. Simulation study and analytical results of P-LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.

Mobility prediction based routing for minimizing control overhead in mobile ad hoc networks

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided routing (P-LAR) protocol. Simulation study and analytical results of the of P-LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.

Redes dinâmicas de sensores sem fio ZigBee para aplicações de monitoramento e controle

Pós-graduação em Engenharia Elétrica - FEB

Secure routing and trust computation in multihop infrastructureless networks

Today's wireless networks rely mostly on infrastructural support for their operation. With the concept of ubiquitous computing growing more popular, research on infrastructureless networks have been rapidly growing. However, such types of networks face serious security challenges when deployed. This dissertation focuses on designing a secure routing solution and trust modeling for these infrastructureless networks. ^ The dissertation presents a trusted routing protocol that is capable of finding a secure end-to-end route in the presence of malicious nodes acting either independently or in collusion, The solution protects the network from active internal attacks, known to be the most severe types of attacks in an ad hoc application. Route discovery is based on trust levels of the nodes, which need to be dynamically computed to reflect the malicious behavior in the network. As such, we have developed a trust computational model in conjunction with the secure routing protocol that analyzes the different malicious behavior and quantifies them in the model itself. Our work is the first step towards protecting an ad hoc network from colluding internal attack. To demonstrate the feasibility of the approach, extensive simulation has been carried out to evaluate the protocol efficiency and scalability with both network size and mobility. ^ This research has laid the foundation for developing a variety of techniques that will permit people to justifiably trust the use of ad hoc networks to perform critical functions, as well as to process sensitive information without depending on any infrastructural support and hence will enhance the use of ad hoc applications in both military and civilian domains. ^

Channel-aware routing in MANETs with route handoff

In wireless mobile ad hoc networks (MANETs), packet transmission is impaired by radio link fluctuations. This paper proposes a novel channel adaptive routing protocol which extends the Ad-hoc On-Demand Multipath Distance Vector routing protocol (AOMDV) to accommodate channel fading. Specifically, the proposed Channel Aware AOMDV (CA-AOMDV) uses the channel average non-fading duration as a routing metric to select stable links for path discovery, and applies a preemptive handoff strategy to maintain reliable connections by exploiting channel state information. Using the same information, paths can be reused when they become available again, rather than being discarded. We provide new theoretical results for the downtime and lifetime of a live-die-live multiple path system, as well as detailed theoretical expressions for common network performance measures, providing useful insights into the differences in performance between CA-AOMDV and AOMDV. Simulation and theoretical results show that CA-AOMDV has greatly improved network performance over AOMDV.

An efficient proactive route maintenance process for reliable data transmissions in sensor networks

For industrial wireless sensor networks, maintaining the routing path for a high packet delivery ratio is one of the key objectives in network operations. It is important to both provide the high data delivery rate at the sink node and guarantee a timely delivery of the data packet at the sink node. Most proactive routing protocols for sensor networks are based on simple periodic updates to distribute the routing information. A faulty link causes packet loss and retransmission at the source until periodic route update packets are issued and the link has been identified as broken. We propose a new proactive route maintenance process where periodic update is backed-up with a secondary layer of local updates repeating with shorter periods for timely discovery of broken links. Proposed route maintenance scheme improves reliability of the network by decreasing the packet loss due to delayed identification of broken links. We show by simulation that proposed mechanism behaves better than the existing popular routing protocols (AODV, AOMDV and DSDV) in terms of end-to-end delay, routing overhead, packet reception ratio.

Pentitol phosphate dehydrogenases: Discovery, characterization and use in D-arabitol and xylitol production by metabolically engineered Bacillus subtilis

The ultimate goal of this study has been to construct metabolically engineered microbial strains capable of fermenting glucose into pentitols D-arabitol and, especially, xylitol. The path that was chosen to achieve this goal required discovery, isolation and sequencing of at least two pentitol phosphate dehydrogenases of different specificity, followed by cloning and expression of their genes and characterization of recombinant arabitol and xylitol phosphate dehydrogenases. An enzyme of a previously unknown specificity, D-arabitol phosphate dehydrogenase (APDH), was discovered in Enterococcus avium. The enzyme was purified to homogenity from E. avium strain ATCC 33665. SDS/PAGE revealed that the enzyme has a molecular mass of 41 ± 2 kDa, whereas a molecular mass of 160 ± 5 kDa was observed under non-denaturing conditions implying that the APDH may exist as a tetramer with identical subunits. Purified APDH was found to have narrow substrate specificity, converting only D-arabitol 1-phosphate and D-arabitol 5-phosphate into D-xylulose 5-phosphate and D-ribulose 5-phosphate, respectively, in the oxidative reaction. Both NAD+ and NADP+ were accepted as co-factors. Based on the partial protein sequences, the gene encoding APDH was cloned. Homology comparisons place APDH within the medium chain dehydrogenase family. Unlike most members of this family, APDH requires Mn2+ but no Zn2+ for enzymatic activity. The DNA sequence surrounding the gene suggests that it belongs to an operon that also contains several components of phosphotransferase system (PTS). The apparent role of the enzyme is to participate in arabitol catabolism via the arabitol phosphate route similar to the ribitol and xylitol catabolic routes described previously. Xylitol phosphate dehydrogenase (XPDH) was isolated from Lactobacillus rhamnosus strain ATCC 15820. The enzyme was partially sequenced. Amino acid sequences were used to isolate the gene encoding the enzyme. The homology comparisons of the deduced amino acid sequence of L. rhamnosus XPDH revealed several similar enzymes in genomes of various species of Gram-positive bacteria. Two enzymes of Clostridium difficile and an enzyme of Bacillus halodurans were cloned and their substrate specificities together with the substrate specificity of L. rhamnosus XPDH were compared. It was found that one of the XPDH enzymes of C. difficile and the XPDH of L. rhamnosus had the highest selectivity towards D-xylulose 5-phosphate. A known transketolase-deficient and D-ribose-producing mutant of Bacillus subtilis (ATCC 31094) was further modified by disrupting its rpi (D-ribose phosphate isomerase) gene to create D-ribulose- and D-xylulose-producing strain. Expression of APDH of E. avium and XPDH of L. rhamnosus and C. difficile in D-ribulose- and D-xylulose-producing strain of B. subtilis resulted in strains capable of converting D-glucose into D-arabitol and xylitol, respectively. The D-arabitol yield on D-glucose was 38 % (w/w). Xylitol production was accompanied by co-production of ribitol limiting xylitol yield to 23 %.