A Routing Algorithm Based on Ant Colony, Local Search and Fuzzy Inference to Improve Energy Consumption in Wireless Sensor Networks

Wireless sensor network is a new generation of networks in which the main aim is to collect data from the surrounding environment of network sensors. The major differences of wireless sensor networks with other networks are limited energy resources and relatively low processing capabilities. Therefore, managing power and reducing energy consumption are of great importance in these networks. In this paper, there was presented a mechanism for Wireless sensor network routing which can be more effective regarding the criteria of route length, end–to–end delay and network node energy for the quality of mechanism service. The proposed method used ant colony–based routing algorithm and local enquiry to find optimal routes. Also, a fuzzy inference system was used to determine the route quality which showed better performance compared with equation of route quality. The results of simulating mechanism showed that energy consumption and network efficiency had improved compared with those of previous methods.DOI:http://dx.doi.org/10.11591/ijece.v3i5.362

Maximizing the System Lifetime in Wireless Sensor Networks using Improved Routing Algorithm

In wireless sensor networks, the maximum lifetime routing problem has received increasing attention among researchers. There are several critical features that need to be considered while designing a wireless sensor networks such as cost, network lifetime and Quality of service. Due to the limitation on the energy of sensor nodes, energy efficient routing is a very important issue in sensor networks. Therefore, to prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. One solution is to formulate the routing problem as a linear programming problem by maximizing the time at which the first node runs out of battery. In this paper, with the notion of maximizing the system lifetime, we implemented a new heuristic and evaluated the performance of it with the existing algorithm called flow augmentation algorithm. Further, our experimental results demonstrate that the proposed algorithm significantly outperform FA algorithm, in terms of system lifetime

TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS SENSOR NETWORKS

Congestion in Wireless Sensor Networks has negative impact on the Quality of Service. Congestion effects the performance metrics, namely throughput and per-packet energy consumption, network lifetime and packet delivery ratio. Reducing congestion allows better utilization of the network resources and thus enhances the Quality of Service metrics of the network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks reduces congestion by considering one hop neighbor routing in the network. This paper proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for congestion control in wireless sensor networks based on two hop neighbor information. On detection of congestion, the algorithm forwards data packets around the congestion areas by spreading the excessive packets through multiple paths. The path with light load or under loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the algorithm is to build path to the destination using two independent potential fields depth and queue length. Queue length field solves the traffic-aware problem. Depth field creates a backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential field to make dynamic decision for data forwarding. Network Simulator used for simulating the algorithm is NS2. The proposed algorithm performs better

Graded Reliance Based Routing Scheme for Wireless Sensor Networks

In this paper Graded Reliance based routing algorithm is proposed to deal with defective nodes in Wireless Sensor Networks (WSN’s).The algorithm is intended to validated or build evidence that, by dynamically learning from previous experience and adapting the changes in the operational environment the application performance can be maximized and also enhance operative agility. Quality of service and social network measures are used to evaluate the confidence score of the sensor node. A dynamic model-based analysis is formulated for best reliance composition, aggregation, and formation to maximize routing performance. The results indicate that reliance based routing approaches yields better performance in terms of message delivery ratio and message delay without incurring substantial message overhead

A Priority Rate-Based Routing Protocol for wireless multimedia sensor networks

The development of affordable hardware has made it possible to transmit multimedia data over a wireless medium using sensor devices. Deployed sensors span larger geographical areas, generating different kinds of traffic that need to be communicated either in real-time or non-real-time mode to the sink. The tiny sized design of sensor nodes has made them even more attractive in various environments as they can be left unattended for longer periods. Since sensor nodes are equipped with limited resources, newer energy-efficient protocols and architectures are required in order to meet requirements within their limited capabilities when dealing with multimedia data. This is because multimedia applications are characterized by strict quality of service requirements that distinctively differentiate them from other data types during transmission. However, the large volume of data produced by the sensor nodes can easily cause traffic congestion making it difficult to meet these requirements. Congestion has negative impacts on the data transmitted as well as the sensor network at large. Failure to control congestion will affect the quality of multimedia data received at the sink and further shorten the system lifetime. Next generation wireless sensor networks are predicted to deploy a different model where service is allocated to multimedia while bearing congestion in mind. Applying traditional wireless sensor routing algorithms to wireless multimedia sensor networks may lead to high delay and poor visual quality for multimedia applications. In this research, a Priority Rate-Based Routing Protocol (PRRP) that assigns priorities to traffic depending on their service requirements is proposed. PRRP detects congestion by using adaptive random early detection (A-RED) and a priority rate-based adjustment technique to control congestion. We study the performance of our proposed multi-path routing algorithm for real-time traffic when mixed with three non real-time traffic each with a different priority: high, medium or low. Simulation results show that the proposed algorithm performs better when compared to two existing algorithms, PCCP and PBRC-SD, in terms of queueing delay, packet loss and throughput

Cross-layer design of multi-hop wireless networks

MULTI -hop wireless networks are usually defined as a collection of nodes equipped with radio transmitters, which not only have the capability to communicate each other in a multi-hop fashion, but also to route each others’ data packets. The distributed nature of such networks makes them suitable for a variety of applications where there are no assumed reliable central entities, or controllers, and may significantly improve the scalability issues of conventional single-hop wireless networks. This Ph.D. dissertation mainly investigates two aspects of the research issues related to the efficient multi-hop wireless networks design, namely: (a) network protocols and (b) network management, both in cross-layer design paradigms to ensure the notion of service quality, such as quality of service (QoS) in wireless mesh networks (WMNs) for backhaul applications and quality of information (QoI) in wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of this Ph.D. dissertation, different network settings are used as illustrative examples, however the proposed algorithms, methodologies, protocols, and models are not restricted in the considered networks, but rather have wide applicability. First, this dissertation proposes a cross-layer design framework integrating a distributed proportional-fair scheduler and a QoS routing algorithm, while using WMNs as an illustrative example. The proposed approach has significant performance gain compared with other network protocols. Second, this dissertation proposes a generic admission control methodology for any packet network, wired and wireless, by modeling the network as a black box, and using a generic mathematical 0. Abstract 3 function and Taylor expansion to capture the admission impact. Third, this dissertation further enhances the previous designs by proposing a negotiation process, to bridge the applications’ service quality demands and the resource management, while using WSNs as an illustrative example. This approach allows the negotiation among different service classes and WSN resource allocations to reach the optimal operational status. Finally, the guarantees of the service quality are extended to the environment of multiple, disconnected, mobile subnetworks, where the question of how to maintain communications using dynamically controlled, unmanned data ferries is investigated

An Energy Efficient, Load Balancing, and Reliable Routing Protocol for Wireless Sensor Networks

AN ENERGY EFFICIENT, LOAD BALANCING, AND RELIABLE ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS by Kamil Samara The University of Wisconsin-Milwaukee, 2016 Under the Supervision of Professor Hossein Hosseini The Internet of Things (IoT) is shaping the future of Computer Networks and Computing in general, and it is gaining ground very rapidly. The whole idea has originated from the pervasive presence of a variety of things or objects equipped with the internet connectivity. These devices are becoming cheap and ubiquitous, at the same time more powerful and smaller with a variety of onboard sensors. All these factors with the availability of unique addressing, provided by the IPv6, has made these devices capable of collaborating with each other to accomplish common tasks. Mobile AdHoc Networks (MANETS) and Wireless Sensor Networks (WSN) in particular play a major role in the backbone of IoT. Routing in Wireless Sensor Networks (WSN) has been a challenging task for researchers in the last several years because the conventional routing algorithms, such as the ones used in IP-based networks, are not well suited for WSNs because these conventional routing algorithms heavily rely on large routing tables that need to be updated periodically. The size of a WSN could range from hundreds to tens of thousands of nodes, which will make routing tables’ size very large. Managing large routing tables is not feasible in WSNs due to the limitations of resources. The directed diffusion algorithm is a well-known routing algorithm for Wireless Sensor Networks (WSNs). The directed diffusion algorithm saves energy by sending data packets hop by hop and by enforcing paths to avoid flooding. The directed diffusion algorithm does not attempt to find the best or healthier paths (healthier paths are paths that use less total energy than others and avoid critical nodes). Hence the directed diffusion algorithm could be improved by enforcing the use of healthier paths, which will result in less power consumption. We propose an efficient routing protocol for WSNs that gives preference to the healthier paths based on the criteria of the total energy available on the path, the path length, and the avoidance of critical nodes. This preference is achieved by collecting information about the available paths and then using non-incremental machine learning to enforce path(s) that meet our criteria. In addition to preferring healthier paths, our protocol provides Quality of Service (QoS) features through the implementation of differentiated services, where packets are classified as critical, urgent, and normal, as defined later in this work. Based on this classification, different packets are assigned different priority and resources. This process results in higher reliability for the delivery of data, and shorter delivery delay for the urgent and critical packets. This research includes the implementation of our protocol using a Castalia Simulator. Our simulation compares the performance of our protocol with that of the directed diffusion algorithm. The comparison was made on the following aspects: • Energy consumption • Reliable delivery • Load balancing • Network lifetime • Quality of service Simulation results did not point out a significant difference in performance between the proposed protocol and the directed diffusion algorithm in smaller networks. However, when the network’s size started to increase the results showed better performance by the proposed protocol