A pheromone-aided multipath QoS routing protocol and its applications in manets

by 1970- Jeon, Paul Barom

Ad hoc wireless networks are wireless networks that utilize multi-hop relaying without the aid of a fixed infrastructure or centralized coordinator. Routing in ad hoc wireless networks is made additionally challenging by the dynamic nature of the communication channel. In this thesis, we present an ant-based multipath QoS routing protocol that utilizes a link metrics combining multiple weighted criteria. We apply the proposed scheme to various fields in ad hoc wireless networks and study the performance via simulations. We present an energy-efficient multipath routing algorithm, named PPRA, utilizing the proposed metrics. We also study the performance of our scheme considering both energy and latency for two classes of traffic: latency-critical and latency-non-critical. Our study indicates that PPRA shows good minimum energy performance, an important factor for maximized network lifetime, with small amount of additional overhead. We investigate the performance of our scheme for a geocasting protocol that we designed combining anycasting, restricted broadcasting, and local broadcasting. The proposed scheme, named GeoPPRA, reduces the routing overhead sigiii nificantly. Also, GeoPPRA performs energy-efficient load balancing that increases network lifetime. Simulation results show significant reductions of routing overhead and energy consumption and show comparable performance to the state of the art geocasting protocols. We then apply PPRA to a security context in order to avoid malicious packet dropping. Ad hoc wireless networks are more vulnerable to Denial of Service (DoS) attacks since nodes are assumed to be trustworthy and cooperative. In our approach, messages are distributed over multiple paths between source and destination. In proportion to the throughput of each path, a routing table is updated and, subsequently, paths that contain malicious nodes are naturally avoided. Simulation results show that our scheme can avoid most of the paths that contain malicious nodes. For delay-sensitive applications, it is important to minimize the probability that the end-to-end packet transfer delay is greater than a certain threshold. We propose an overlay framework that considers both delay and mobility to satisfy the QoS requirements of delay-sensitive applications. Also, we propose network and application layer QoS and mobility management schemes which utilize both reactive and proactive methods. iv