Abstract—Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations, many routing messa ges are propagated unnecessarily. We propose a gossiping-based approa ch, where each node forwards a message with some probability, to reduce the ov erhead of the routing

We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity

We propose a new routing technique called Security-Aware ad hoc Routing (SAR) that incorporates security attributes as parameters into ad hoc route discovery. SAR enables the use of security as a negotiable metric to improve the relevance of the routes discovered by ad hoc routing protocols. We

All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly efficient

We explore and evaluate methods for validation of ad hoc routing protocols which are used to set up forwarding paths in spontaneous networks of mobile devices. The focus is automatic formal verification but we also make an initial account of a protocol performance comparison using structured live

The members of the Committee appointed to examine the thesis of KNUT-HELGE VIK find it satisfactory and recommend that it be accepted. ii Chair ACKNOWLEDGEMENT I would like to acknowledge my advisor Sirisha Medidi, for all her help and valuable input. I would also like to acknowledge all the members of the Washington State Networking and Security Research Group. I would not have been able to complete my Master’s degree without the help of my fellow students. Thank you all for your support. iii

A novel framework is presented for the study of scalability in ad hoc networks. Using this framework, the first asymptotic analysis is provided with respect to network size, mobility, and traffic for each fundamental class of ad hoc routing algorithms. Protocols studied include the following: Plain

Abstract—In present era the Security has become one of the major issues for data communication over wired and wireless networks. Apart from the earlier work on the designs of cryptography algorithms and system infrastructures, we will propose an ad hoc routing algorithm that could randomize

Absiract—CEDARis an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and main-tenance of a setf-organizing routing infrastructure catted the core for per-forming route computations, (b) the propagation of the link-state of stable high

This paper describes the Chord Ad-Hoc Routing Protocol, which is a multi-hop, ad-hoc networking protocol that provides the Chord Distributed Hash Table (DHT) abstraction to the network. Nodes form a spanning tree among themselves, which forms a cycle that becomes the Chord overlay network