A new QoS routing algorithm based on self-organizing maps for wireless sensor networks

For the past ten years, many authors have focused their investigations in wireless sensor networks. Different researching issues have been extensively developed: power consumption, MAC protocols, self-organizing network algorithms, data-aggregation schemes, routing protocols, QoS management, etc. Due to the constraints on data processing and power consumption, the use of artificial intelligence has been historically discarded. However, in some special scenarios the features of neural networks are appropriate to develop complex tasks such as path discovery. In this paper, we explore and compare the performance of two very well known routing paradigms, directed diffusion and Energy- Aware Routing, with our routing algorithm, named SIR, which has the novelty of being based on the introduction of neural networks in every sensor node. Extensive simulations over our wireless sensor network simulator, OLIMPO, have been carried out to study the efficiency of the introduction of neural networks. A comparison of the results obtained with every routing protocol is analyzed. This paper attempts to encourage the use of artificial intelligence techniques in wireless sensor nodes

Using artificial intelligence in routing schemes for wireless networks

For the latest 10 years, many authors have focused their investigations in wireless sensor networks. Different researching issues have been extensively developed: power consumption, MAC protocols, self-organizing network algorithms, data-aggregation schemes, routing protocols, QoS management, etc. Due to the constraints on data processing and power consumption, the use of artificial intelligence has been historically discarded. However, in some special scenarios the features of neural networks are appropriate to develop complex tasks such as path discovery. In this paper, we explore the performance of two very well-known routing paradigms, directed diffusion and Energy-Aware Routing, and our routing algorithm, named SIR, which has the novelty of being based on the introduction of neural networks in every sensor node. Extensive simulations over our wireless sensor network simulator, OLIMPO, have been carried out to study the efficiency of the introduction of neural networks. A comparison of the results obtained with every routing protocol is analyzed. This paper attempts to encourage the use of artificial intelligence techniques in wireless sensor nodes

Giving Neurons to Sensors: An Approach to QoS Management Through Artificial Intelligence in Wireless Networks

For the latest ten years, many authors have focused their investigations in wireless sensor networks. Different researching issues have been extensively developed: power consumption, MAC protocols, selforganizing network algorithms, data-aggregation schemes, routing protocols, QoS management, etc. Due to the constraints on data processing and power consumption, the use of artificial intelligence has been historically discarded. However, in some special scenarios the features of neural networks are appropriate to develop complex tasks such as path discovery. In this paper, we explore the performance of two very well known routing paradigms, directed diffusion and Energy-Aware Routing, and our routing algorithm, named SIR, which has the novelty of being based on the introduction of neural networks in every sensor node. Extensive simulations over our wireless sensor network simulator, OLIMPO, have been carried out to study the efficiency of the introduction of neural networks. A comparison of the results obtained with every routing protocol is analyzed. This paper attempts to encourage the use of artificial intelligence techniques in wireless sensor nodes

Novel Energy Aware Hierarchical Round Robin Schedule Cluster-Based (NEAHRC) Routing Protocol

Wireless sensor networks (WSNs) are developing as vital and prevalent ways of providing persistent computing environments for various applications. Unstable energy consumption is an essential problem in WSNs, categorised by multi-hop routing and a many-to-one traffic pattern. In an energy-aware routing approach, the protocols focus on minimizing the total energy consumption and maximizing the network lifetime. In this paper, we propose a novel energy aware hierarchical round robin schedule cluster-based (NEAHRC) routing protocol to improve the energy consumption of wireless sensor network and prolong its system lifetime. We also evaluate the proposed algorithm via simulations

IMPROVED VIRTUAL CIRCUIT ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORKS UNDER THE ASPECT OF POWER AWARENESS

Routing algorithms have shown their importance in the power aware wireless micro-sensor networks. In this paper first we present virtual circuit algorithm (VCRA), a routing algorithm for wireless sensor networks. We analyze the power utilized by nodes to lengthen the battery life and thus improving the lifetime of wireless sensor network. We discuss VCRA in comparison with the Multihoprouter, an algorithm developed by UC Berkeley. Then we present Improved Virtual Circuit Routing Algorithm (IVCRA) which is an improved form of VCRA. In IVCRA node failure detection and path repairing scheme has been implemented. We also present the energy analysis of IVCRA and prove that IVCRA is the best choice. We first implement our routing algorithms in simulator TOSSIM and then on real hardware of mica2 mote-sensor network platform and prove the reliable routing of the data packets from different nodes to the base station. The motes used as nodes in our mote-sensor network are from Berkeley USA. By using simulator POWERTOSSIM, we estimate and present the energy utilized by different nodes of the network. At the end we present a comparison of our work with the network layer of Zigbee/IEEE 802.15.4, which is an emerging standard for wireless sensor networks and then compare its energy efficiency with the packet size chosen for our algorithm

Hop-by-hop Channel - Alert Routing to Congestion Control in Wireless Sensor Networks

One of the major challenges in wireless sensor networks (WSNs) research is to prevent traffic congestion without compromising with the energy of the sensor nodes. Network congestion leads to packet loss, throughput impairment, and energy waste. To address this issue in this paper, a distributed traffic-aware routing scheme with a capacity of adjusting the data transmission rate of nodes is proposed for multi-sink wireless sensor networks that effectively distribute traffic from the source to sink nodes. Our algorithm is designed through constructing a hybrid virtual gradient field using depth and normalized traffic loading to routing and providing a balance between optimal paths and possible congestion on routes toward those sinks. The simulation results indicate that the proposed solution can improve the utilization of network resources, reduce unnecessary packet retransmission, and significantly improve the performance of WSNs. Keywords: Wireless sensor networks; Traffic-aware; Routing; Data transmission rate; Congestion; Gradien

Energy efficient geographic routing for wireless sensor networks.

A wireless sensor network consists of a large number of low-power nodes equipped with wireless radio. For two nodes not in mutual transmission range, message exchanges need to be relayed through a series of intermediate nodes, which is a process known as multi-hop routing. The design of efficient routing protocols for dynamic network topologies is a crucial for scalable sensor networks. Geographic routing is a recently developed technique that uses locally available position information of nodes to make packet forwarding decisions. This dissertation develops a framework for energy efficient geographic routing. This framework includes a path pruning strategy by exploiting the channel listening capability, an anchor-based routing protocol using anchors to act as relay nodes between source and destination, a geographic multicast algorithm clustering destinations that can share the same next hop, and a lifetime-aware routing algorithm to prolong the lifetime of wireless sensor networks by considering four important factors: PRR (Packet Reception Rate), forwarding history, progress and remaining energy. This dissertation discusses the system design, theoretic analysis, simulation and testbed implementation involved in the aforementioned framework. It is shown that the proposed design significantly improves the routing efficiency in sensor networks over existing geographic routing protocols. The routing methods developed in this dissertation are also applicable to other location-based wireless networks