Computer Engineering Commons^™

A Genetic Algorithm Approach For Optimized Routing, Pavithra Gudur

Electrical & Computer Engineering Theses & Dissertations

Genetic Algorithms find several applications in a variety of fields, such as engineering, management, finance, chemistry, scheduling, data mining and so on, where optimization plays a key role. This technique represents a numerical optimization technique that is modeled after the natural process of selection based on the Darwinian principle of evolution. The Genetic Algorithm (GA) is one among several optimization techniques and attempts to obtain the desired solution by generating a set of possible candidate solutions or populations. These populations are then compared and the best solutions from the set are retained. Subsequently, new candidate solutions are produced, and the …

Tuqr: A Topology Unaware Qos Routing Protocol For Manets, Ibrahim Zagli

Electrical & Computer Engineering Theses & Dissertations

In this thesis, the main purpose is to design a new Quality of Service (QoS) Routing Protocol for Mobile ad-hoc Networks that improves packet delivery ratio in QoS constrained communication in comparison to current well known protocols by using distributed multi-path routing. To accomplish that, a new approach to the QoS routing in Mobile ad hoc Networks (MANET) is developed to reduce the effects of the distrustful environment of MANET by keeping a number of suitable paths as high as possible and distributing the decision mechanism among the nodes on the path.

In most current protocols that mainly evaluate and …

Reversing Ticket Based Probing (Rtbp) Routing For Manet, Turgut Yucel

Electrical & Computer Engineering Theses & Dissertations

The delay-constrained maximum-bandwidth routing problem in MANET (Mobile Ad hoc Networks) is to find the maximum bandwidth path which satisfies a given delay constraint. The research challenge for this problem is that the networking information used for routing may be imprecise. The Ticket-Based Probing (TBP) routing algorithm provides a heuristic approach by using two types of ticket. In this thesis a Reversing Ticket-based Probing (RTBP) routing algorithm is proposed. The RTBP has two novel features compared to the original ticket based probing algorithms. The first feature is using just one type ticket, instead of two types of ticket. RTBP generates …

Dream: A Theoretical Analysis, Xueying Qi

Computer Science Theses & Dissertations

A Mobile Ad-hoc Network (MANET, for short) is a collection of mobile nodes deployed in support of a short-lived special-purpose operation. Examples include search-and-rescue missions, law-enforcement, multimedia classrooms, and among many others. Unlike cellular or satellite networks, MANET do not rely on any form of pre-existing infrastructure. The mobility of nodes combined with the lack of infrastructure makes routing in MANET notoriously difficult. It was recently suggested that routing in MANET can use to advantage geographic information that the nodes may acquire either by endowing them with a GPS chip or simply by using known localization algorithms. Distance Routing Effect …

Clustering And Hybrid Routing In Mobile Ad Hoc Networks, Lan Wang

Computer Science Theses & Dissertations

This dissertation focuses on clustering and hybrid routing in Mobile Ad Hoc Networks (MANET). Specifically, we study two different network-layer virtual infrastructures proposed for MANET: the explicit cluster infrastructure and the implicit zone infrastructure. In the first part of the dissertation, we propose a novel clustering scheme based on a number of properties of diameter-2 graphs to provide a general-purpose virtual infrastructure for MANET. Compared to virtual infrastructures with central nodes, our virtual infrastructure is more symmetric and stable, but still light-weight. In our clustering scheme, cluster initialization naturally blends into cluster maintenance, showing the unity between these two operations. …