Title of Thesis

A Bee-Inspired Power Aware Routing Protocol for Wireless ADHOC Network

Author(s)

Muhammad Saleem

Abstract
Design and development of power-aware, scalable and performance efficient routing protocols for Wireless Sensor Networks (WSNs) is an active area of research. In this dissertation, we show that insect colonies based intelligence – commonly referred to as Swarm Intelligence (SI) – provides an ideal metaphor for developing routing protocols for WSNs because they consist of minimalists, autonomous individuals that through local interactions self-organize to produce system-level behaviors that show life long adaptability to changes and perturbations in an external environment. In this context, we propose a new routing protocol for WSNs – BeeSensor – inspired by the foraging principles of honey bees. We follow a three phase novel protocol engineering cycle. In the first phase, we study the foraging principles of a bee colony and utilize the inspirational concepts to develop a distributed, simple and energy-efficient routing protocol for WSNs.We then evaluate and compare the performance of this protocol with existing classical and SI-based WSN protocols.The simulation results demonstrate that BeeSensor consistently outperforms the existing well-known protocols in terms of packet delivery ratio and energy efficiency.However, its performance degrades slightly as the network size is increased.
To gain more insights into the parameters governing the behavior of BeeSensor in large-scale networks, in the second phase, we develop a generic mathematical evaluation framework to model two key performance metric of an ad hoc routin protocol: routing overhead and route optimality. We then develop specific routing overhead and route optimality models of the BeeSensor protocol.The metric models unfold several interesting insights about the performance of BeeSensor in large-scale networks.For instance, with an increase in the average hop length, route discovery probability of BeeSensor decays exponentially. We also model the reliability of packet delivery of the BeeSensor protocol.The model shows that the reliability of packet delivery is a concave function of the total number of paths. Therefore, maintenance of a set of paths beyond a certain threshold limit does not result in a proportional increase in the packet delivery ratio.
Based on the insights inferred through the formal modeling, we revise the design of BeeSensor protocol in the third phase.To conclude this dissertation, we perform simulation studies – using prowler simulator – to analyze and compare the performance of the final BeeSensor design with existing protocols. In the first set of experiments, we compare its performance with SI-based energy-efficient WSN protocols. The simulation results demonstrate that BeeSensor outperforms its competitors in all assumed scenarios and metrics.We then implement the BeeSensor protocol in NS-2 simulator to further investigate its performance in mobile networks and large-scale static sensor networks.The results clearly show that BeeSensor not only performs well in large-scale networks, but is equally good in MANETs as well.Therefore, BeeSensor is a viable protocol for hybrid ad hoc networks.

1

1.1 Motivation
1.2 ProblemStatement
1.3 ResearchMethodology
1.4 Major Contributions of the Dissertation
1.5 Organization of the Thesis

2.1 Introduction
2.2 Routing inWSNs: Challenging Issues
2.3 Taxonomy of Routing Protocols
2.4 A CO-based Routing Protocols
2.5 Classical Routing Protocols for Wireless Sensor Networks
2.6 Conclusions

3.1 Introduction
3.2 Bees in Nature
3.3 Froma Bee Colony to SensorNets
3.4 BeeSensor: A rchitecture andWorking
3.5 AR eview of SI-Inspired Routing Protocols Used in Comparison
3.6 Empirical Evaluation Framework
3.7 Discussion on Simulation Results
3.8 Conclusions

4.1 Introduction
4.2 Introduction to Graph Theory
4.3 SystemDescription andModeling A ssumptions
4.4 Definitions
4.5 The Routing OverheadModel
4.6 Route Optimality
4.7 Derivatives of Routing Overhead and Route Optimality
4.8 Routing Overhead and Route Optimality Models of BeeSensor
4.9 Conclusions

5.1 Introduction
5.2 Background on Reliability Theory
5.3 SystemDescription and Definitions
5.4 Packet Delivery Reliability of BeeSensor
5.5 The Safe Flooding Distance
5.6 Reliability Analysis of Ad Hoc Routing Algorithms: An Application Perspective
5.7 Conclusions

6.1 Introduction
6.2 Modifications to BeeSensor Design
6.3 Empirical Evaluation of BeeSensor
6.4 Conclusions

7.1 Conclusions
7.2 FutureWork: Suggestions and Directions