An Enhanced Algorithm to Find Dominating Set Nodes in Ad Hoc Wireless Networks

A wireless ad hoc network is a collection of wireless mobile nodes forming a temporary network without the aid of any established infrastructure or centralized administration. A connection is achieved between two nodes through a single hop transmission if they are directly connected or multi-hop transmission if they are not. The wireless networks face challenges to form an optimal routing protocol. Some approaches are based on a dominating set, which has all the nodes either in the set or within its neighborhood. The proposed algorithm is an enhancement of the distributed algorithm proposed by Wu and Li. The simulation results from the new algorithm are compared to results from Wu and Li’s algorithm. The simulation results show that the average dominating set of nodes decreased considerable after applying the new algorithm. The decrease in number of dominate set nodes is not very much noticeable in low density space

Topology Control, Routing Protocols and Performance Evaluation for Mobile Wireless Ad Hoc Networks

A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralized administration. There are many potential applications based the techniques of MANETs, such as disaster rescue, personal area networking, wireless conference, military applications, etc. MANETs face a number of challenges for designing a scalable routing protocol due to their natural characteristics. Guaranteeing delivery and the capability to handle dynamic connectivity are the most important issues for routing protocols in MANETs. In this dissertation, we will propose four algorithms that address different aspects of routing problems in MANETs. Firstly, in position based routing protocols to design a scalable location management scheme is inherently difficult. Enhanced Scalable Location management Service (EnSLS) is proposed to improve the scalability of existing location management services, and a mathematical model is proposed to compare the performance of the classical location service, GLS, and our protocol, EnSLS. The analytical model shows that EnSLS has better scalability compared with that of GLS. Secondly, virtual backbone routing can reduce communication overhead and speedup the routing process compared with many existing on-demand routing protocols for routing detection. In many studies, Minimum Connected Dominating Set (MCDS) is used to approximate virtual backbones in a unit-disk graph. However finding a MCDS is an NP-hard problem. In the dissertation, we develop two new pure localized protocols for calculating the CDS. One emphasizes forming a small size initial near-optimal CDS via marking process, and the other uses an iterative synchronized method to avoid illegal simultaneously removal of dominating nodes. Our new protocols largely reduce the number of nodes in CDS compared with existing methods. We show the efficiency of our approach through both theoretical analysis and simulation experiments. Finally, using multiple redundant paths for routing is a promising solution. However, selecting an optimal path set is an NP hard problem. We propose the Genetic Fuzzy Multi-path Routing Protocol (GFMRP), which is a multi-path routing protocol based on fuzzy set theory and evolutionary computing

ADMP: an adaptive multicast routing protocol for mobile ad hoc networks

We present ADMP, the adaptive mesh-based multicast routing protocol, in which nodes are able to independently tune the amount of redundancy used to transmit data packets with the goal of improving the overall packet delivery ratio while keeping the retransmission overhead as low as possible. ADMP is based on a novel distributed algorithm for computing connected dominating sets. ADMP uses a single type of control packet, called multicast announcement, which is used to build the meshes of multicast groups, elect the core of each mesh and obtain two-hop neighborhood information. Using detailed simulations for different scenarios, we show that ADMP achieves similar or better reliability than two mesh-based multicast protocols that are very resilient (ODMRP and PUMA) while inducing low packet retransmission overhead.1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI

Connectivity, Coverage and Placement in Wireless Sensor Networks

Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes

Broadcasting Protocol for Effective Data Dissemination in Vehicular Ad Hoc Networks

VANET topology is very dynamic due to frequent movements of the nodes. Using beacon information connected dominated set are formed and nodes further enhanced with neighbor elimination scheme. With acknowledgement the inter section issues are solve. A modified Broadcast Conquest and Delay De-synchronization mechanism address the broadcasting storm issues. Although data dissemination is possible in all direction, the performance of data dissemination in the opposite direction is investigated and compared against the existing protocols

A cluster based communication architecture for distributed applications in mobile ad hoc networks

Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2006Includes bibliographical references (leaves: 63-69)Text in English; Abstract: Turkish and Englishx, 85 leavesIn this thesis, we aim to design and implement three protocols on a hierarchical architecture to solve the balanced clustering, backbone formation and distributed mutual exclusion problems for mobile ad hoc network(MANET)s. Our ¯rst goal is to cluster the MANET into balanced partitions. Clustering is a widely used approach to ease implemen-tation of various problems such as routing and resource management in MANETs. We propose the Merging Clustering Algorithm(MCA) for clustering in MANETs that merges clusters to form higher level of clusters by increasing their levels. Secondly, we aim to con-struct a directed ring topology across clusterheads which were selected by MCA. Lastly, we implement the distributed mutual exclusion algorithm based on Ricart-Agrawala algo-rithm for MANETs(Mobile RA). Each cluster is represented by a coordinator node on the ring which implements distributed mutual exclusion algorithm on behalf of any member in the cluster it represents. We show the operations of the algorithms, analyze their time and message complexities and provide results in the simulation environment of ns2