Synchronization of multihop ad hoc networks using connected dominating sets

Abstract

Network synchronization of flat multihop ad hoc II. CONNECTED DOMINATING SETS networks is considerably different from conventional systems Operation of flat Mobile Ad Hoc Networks (MANETs) is a that are usually hierarchically organized. Lately, Connected Dominating Sets (CDSs) are used in ad hoc networks to structure challenging task. No dedicated infrastructure is available that even larger scaled topographies into smaller portions. While these may be used for efficient operation. A virtual infrastructure can virtual infrastructures are initially utilized for efficient flooding be introduced that allows to organize flat networks in a hieror routing purposes, this paper presents a global network syn-archical way. This gives major advantages, mainly in resource chronization scheme that also uses a CDS in order to synchronize . . . and . 'network members in an efficient manner. An extension to the o c Predictive Timer Synchronization Function (PTSF) is presented Since a detailed description of clustering algorithms is behind that has been tailored to this specific application and allows the scope of this paper and just a brief overview should be to synchronize even widely distributed systems by supporting given, interested readers are referred to the literature cited in multihop operation. this section.In order to structure a MANET, the entire network must I. INTRODUCTION be subdivided into several clusters, where one station is the clusterhead that dominates all remaining stations within itsMultihop ad hoc networks are complex communication cutrrgo.Sc lseha scle oiao hl structures that are formed by numerous autonomous systems oterstaionS a absoer s Partitionig aMAE int which may be distributed locally or even cover wide areas. In atherarical tpoy i a m in inumb of cute such networks, all members have equal rights and therefore a dina tor elts in a minimum nne ominating the hierarchy is flat. Due to this fact, all algorithms are Set (mCDs) Sebuldin a M CDS neqiesgobaline fully distributed and cooperation of all members must be ke Dge and ilcin iS rdq[],estalishingra ensured in order to enable a stable interaction. Furthermore, MCdSi a lag caleuMaNET is a very extensvehtsk.a predetermined properties of ad hoc networks must be taken MCopmise bet salgoriThm c exy and p an.ce int acoun wileevovin agorthm tht re ailredto compromise between algorithm complexity and performance into account while evolving algorithms that are tailored to is to build up a Connected Dominating Set (CDS) instead of an special applications. MCDS. A CDS is defined by a set of connected dominatorsA virtual hierarchy can be used to bring ad hoc networks where all absorbers have at least one neighbor that belongs more close to conventional systems with hierarchic topologies to the dominating set. Due to this definition, an MCDS of a Recently, Connected Dominating Sets (CDSs) are deployed for network is also a CDS, but not vice versa. building up virtual infrastructures. Using a CDS, the global set Various algorithms for establishing a CDS are k...