- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

International Journal of Vehicular Technology

Volume 2009 (2009), Article ID 958056, 13 pages

http://dx.doi.org/10.1155/2009/958056

## Evaluation of Physical Carrier Sense Based Backbone Maintenance in Mobile Ad Hoc Networks

^{1}Department of Electrical Engineering, Arizona State University, Goldwater Center, MC 5706, Tempe, AZ 85287-5706, USA^{2}Department of Computer Science and Engineering, Arizona State University, Box 878809, Tempe, AZ 85287-8809, USA

Received 4 December 2008; Accepted 15 April 2009

Academic Editor: Kui Wu

Copyright © 2009 Sapna Deval et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Physical carrier sensing has to date mainly been exploited for improving medium access control in wireless networks. Recently, a parallel algorithm striving to extensively exploit physical carrier sensing
for constructing and maintaining a connected dominating set (CDS), which is also known as spanner,
backbone, or overlay network in wireless ad hoc networks with interference ranges larger than transmission
ranges has been proposed. Existing evaluations of this algorithm are limited to theoretical asymptotic
bounds and simulations of *static* networks. In this paper, we evaluate the physical carrier sensing-based
CDS maintenance for *mobile* ad hoc networks through discrete event simulations. For a wide range of
node speeds and node densities, we evaluate the CDS characteristics and message exchanges required for
maintaining the CDS. We find that the algorithm maintains a stable leader set dominating all nodes in the
network for a wide range of mobility levels but struggles to maintain connectivity at high mobility levels.
We also quantify the portions of the control messages for CDS maintenance that are exchanged through
physical carrier sensing. We find that the parallel algorithm manages to greatly reduce the reliance on
intact message receptions.

#### 1. Introduction

Efficiently maintaining topology control in the form of a connected dominating set (CDS), which is also widely referred to as spanner or backbone network, is a key challenge in mobile ad hoc networks (MANETs). A CDS is *dominating *, that is, each ordinary node is within the transmission range of at least one leader node, and *connected *, that is, all leader nodes are interconnected by paths through gateway nodes, such that each hop along the path is shorter than the transmission range. The CDS can facilitate a wide range of network layer functions, such as routing [1] and name resolution. Constructing and maintaining the CDS requires control message exchanges over the unreliable link and physical wireless layers. In recent algorithm-theoretic work [2] we have proposed an algorithm for constructing and maintaining a CDS in MANETs. The algorithm proposed in [2] considers a physical layer model with interference ranges longer than transmission ranges. This model with interference exceeding the transmission ranges is more realistic than the simpler, less detailed models, such as the unit-disk model, which considers only a disk-shaped transmission range and ignores interference, and the packet radio model, which considers disk-shaped transmission and interference ranges whereby both ranges are equal. Furthermore, while existing approaches exploit physical carrier sensing primarily for improving medium access control, our algorithm strives to extensively exploit physical carrier sensing for constructing and maintaining a CDS—a network layer task—while explicitly incorporating the medium access control in the network layer control message exchanges.

In this paper we present an original simulation study of the CDS maintenance algorithm proposed in [2] for MANETs. Our previous evaluations (i) provided only asymptotic performance bounds [2] which provide only rather loose characterizations of the actual performance for typical network scenarios, and (ii) considered only static ad hoc networks without any node mobility [3]. In this paper, we evaluate the actual performance of the CDS maintenance algorithm for typical *mobile * ad hoc network scenarios through simulations. We find that the first phase of the parallel algorithm proposed in [2], which is reviewed in Section 2.1, maintains a stable set leader nodes that dominate almost all ordinary network nodes even at high levels of mobility. The second phase of the algorithm maintains over a wide range of mobility levels a stable assignment of noninterfering leader transmission rounds such that transmissions by leaders never interfere with each other. The third phase of the algorithm interconnects neighboring leader nodes through paths traversing intermediate gateway nodes. We find that the gateway discovery and maintenance is highly effective at low speeds in keeping the CDS connected. However, at high levels of mobility, the algorithm has trouble to keep up the gateway connections, resulting in the CDS being connected only between 55% and 75% of the time.

Our simulations provide detailed insights into the control message exchanges in the individual phases of our algorithm. We find that over 95% of the control messages are exchanged through physical carrier sensing. In particular, most short messages are exchanged through physical carrier sensing, while most of the longer messages (carrying more information bits) require intact message reception. Nevertheless, we find that roughly one third of all information bits required for maintaining the CDS are exchanged through physical carrier sensing. In addition, typically around 75% of the bits that need to be exchanged through intact messages receptions are sent during the noninterfering transmission round maintained by phase II and are thus not subject to collisions.

This paper is structured as follows. In the following two subsections, we review related work and the network model, including the physical carrier sensing ranges. In Section 2, we give a brief overview of the CDS construction and maintenance algorithm proposed in [2]. In Section 3, we present our simulation evaluations of the CDS maintenance for MANETs. We explain our simulation setup and define our performance metrics. We then proceed to present both sample path simulation results as well as steady state simulation results characterizing the CDS and the control message exchanges. We summarize our conclusions in Section 4.

##### 1.1. Related Work

In this section we briefly review related work, which falls into three main areas, namely clustering in ad hoc networks, backbone (spanner) construction and maintenance in ad hoc networks, and exploitation of physical carrier sensing in wireless networks.

###### 1.1.1. Clustering

Numerous clustering mechanisms have been proposed in recent years for ad hoc networks, see, for instance, [4–9]. Key distinctions of our clustering, which is completed in phase I of our algorithm, are that we consider a network model with interference reaching farther than transmission ranges and exploit physical carrier sensing for rapid, low-complexity clustering of nodes without any prior topology knowledge.

Regarding the way mobility is addressed in existing clustering mechanisms, most existing clustering schemes divide the clustering process into two phases—cluster initialization and cluster maintenance. In contrast, Wang and Olariu [10] consider a unifying clustering approach that blends cluster initialization mechanism with cluster maintenance. Their tree-based algorithm requires each node to maintain a depth-2 breadth-first-search tree, rooted at itself, resulting in significant storage overhead. Our algorithm also integrates initial clustering and backbone construction with clustering and backbone maintenance. However, due to the *constant density* of our set of leader nodes (dominating set), the information about gateway nodes leading to neighboring leader nodes is limited to a constant amount of storage irrespective of the network density or total number of nodes in the network.

###### 1.1.2. Backbone (CDS) Construction and Maintenance

Constructing an optimal backbone network (CDS) is often formally characterized as finding minimum connected dominating sets and spanning sets. Distributed algorithms that approximate the minimum connected dominating set with polynomial or polylogarithmic running time include, for example, [11–17]. The first phase of our algorithm is an extension of the dominating set algorithm [18]. Comprehensive simulation comparisons of clustering and overlay network formation algorithms developed for unit-disk and packet radio models are reported in [19]. The comparison study [19] takes MAC packet collisions into consideration and classifies the algorithms according to their level of localization, that is, over how many hops does the information for forming the overlay travel, a classification also employed in [20]. Approaches with a high level of localization that require information from within only a 2-hop local neighborhood, such as approaches based on [14, 21], are compared with approaches that have lower levels of localization, such as algorithms based on [22, 23]. It is found that highly localized approaches tend to give the best performance. Our approach, which is developed for a more realistic network model with interference ranges larger than transmission ranges, is highly localized. In our backbone construction, information never travels further than twice the interference range (via two physical carrier sensing communication hops in phase II) or three times the transmission range (via three actual packet transmissions in phase III).

Kuhn et al. [24] as well as Parthasarathy and Gandhi [25, 26] developed distributed algorithms that compute constant factor approximations of a minimum dominating set in poly-logarithmic time. Both extend the unit disk model by taking interference into account, but nodes need to know an estimate of the size of the network. In contrast, our approach does not require any estimates of network size, nor network density.

For mobility management, existing approaches rely typically on an explicit *mobility control mechanism *, as for instance examined by Wu and Dai [27]. Dedicated local neighborhood information exchanges are used in [27] to control for node mobility. In contrast, our parallel algorithm phases continuously construct and maintain the CDS without an explicit mobility control mechanism.

###### 1.1.3. Physical Carrier Sensing

Physical carrier sensing has been studied from a variety of perspectives. In single-hop communication, physical carrier sense is used in many random-access schemes, such as 802.11's version of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). Many lines of work focus on the MAC layer—studying or optimizing the effect of CSMA on throughput and power consumption, see, for example, [28–37]. The problem of topology control in ad hoc networks (see, e.g., [38, 39]) has some similarity to our work in goals and approaches. For example, Muqattash and Krunz [40, 41] use virtual and physical carrier sense with power control to increase throughput and energy efficiency. Similarly, Tavli and Heinzelman [42] employ a cross-layer approach spanning the MAC and network layer to minimize energy for broadcast. However, to the best of our knowledge, our protocol is the first to directly exploit physical carrier sense for the network layer task of distributed CDS construction.

##### 1.2. Network Model

We define a fixed *transmission range * such that any two nodes closer together than can reliably communicate, while nodes farther apart cannot. We define a fixed *interference range * such that if a transmission fails due to interference, the interfering transmission must have originated at a node closer than to the receiving node. Not all transmissions from nodes within need to cause interference, but transmissions from nodes outside of it never will. In a typical network, is 2-3 times larger than ; our simulations use a ratio of .

We suppose that each node can perform physical carrier sensing, achieved in 802.11 through Received Signal Strength Indicator (RSSI) measurements, to detect when the medium is busy. We define the *certain-sensing range * and the *nonsensing range * for the carrier sense operation: signals traveling less than are sensed with probability close to one, whereas signals traveling farther than are sensed with close to zero probability, and in between with arbitrary probability. These ranges can be tuned by adjusting the SNR threshold at the receiver, which is accomplished through the Clear Channel Assessment rules in 802.11. However, the ratio of the sensing ranges is fixed due to the physical radio propagation characteristics to 2-3 typically, and in our simulations we set .

We note that this model is a close match for the actual performance of current wireless interfaces. Forward error correction mechanisms allow for relatively sharp cutoffs between the area where messages are almost always received (*transmission range *; a range such that the communication cost is less than the transmission range , i.e., ), where they may still interfere (*interference range *; ), and where they never interfere . We refer to nodes as “connected’’ if a series of hops between pairs of nodes within transmission range exists between them. We briefly note that the algorithm in [2] accommodates nondisk shaped transmission, interference, and sensing areas. However, in this study focused on the effects of mobility, we consider only disk-shaped transmission, interference, and sensing areas.

#### 2. CDS Construction and Maintenance Algorithm

##### 2.1. Overview of CDS Construction

The algorithm presented in [2] constructs a CDS in three phases.

(i) Phase I elects “leader’’ nodes in a distributed probabilistic fashion such that (a) every node in the network is either a leader or within the transmission range of at least one leader, and (b) leaders are spaced at least apart.(ii) Phase II creates a distributed assignment of leader time slots such that each leader can communicate with neighboring nonleader nodes without interfering with other leaders' transmissions; more specifically, each leader becomes an “owner’’ of a particular round within the frame such that two leaders owing the same round are spaced at least apart.(iii) Phase III connects leaders that are up to apart by up to two gateway nodes; in particular, lists of local gateway nodes are created in both leader and nonleader nodes.The timing structure of the algorithm is organized according to locally synchronized *rounds *, such that each round contains 11 slots to accommodate phases I–III (see Figure 1). A sequence of rounds forms a *frame *; setting the parameter accommodates all possible network densities and sizes, as shown in [3]. The beginning of each frame is not required to be synchronized between nodes, only the round/slot timing.

The CDS construction relies on both carrier sensing (accomplished through sensing with a specific setting for either or , which may vary from slot to slot) and actual packet receptions for information exchange between nodes. We measure the amount of information bits exchanged through each mechanism with the following rules for each communication slot. The durations of the individual slots depend on the information contained in them, which is either presence/absence of sensed physical carrier (neglected in byte count), node address (counted as 6 bytes), or time stamp (counted as 2 bytes); in addition, we count 6 bytes of overhead for each slot. For all slots, except the third slot of phase I, which is examined in Section 2.2, the lengths of the control messages sent in the individual slots are established in [3] and are summarized in Table 1. Based on rounds/frame, a 1 Mbit/s transmission rate and a 20 s spacing between slots, a frame (including the third slot of phase I) is 219.6 ms long.

##### 2.2. CDS Maintenance

The algorithm evaluated in [3] considers static networks, which can be accommodated with only the first two slots in phase I. The third slot in phase I is needed to recover from arbitrary placements of leader nodes [2], as may arise with node mobility. More specifically, phase I—the leader election phase executed for a static network—ensures that leaders are at least spaced apart. If our protocol were to start with a configuration with two leader nodes closer than together (which could arise through node mobility), the algorithm with two slots in phase I may not succeed in establishing a dominating set. To overcome this problem, we add a third slot in phase I, called the “self stabilization’’ slot. In this slot, every active node sends a simple signal with a constant probability in every round; any reasonable value of is proven to give fast convergence back to a valid configuration in [2]. Another active node becomes inactive if it senses a message in this slot and is closer than to the transmitting node, as determined by setting the certain sensing range .

All three phases of the algorithm run in parallel. Each round contains slots for all three phases, as illustrated in Figure 1. Once a given phase has stabilized, the next phase can self-stabilize without any global signal that this transition has occurred. Running in parallel is important for the algorithm to adapt to mobility: when the network topology changes, the three phases running continuously in parallel re-establish leader nodes, owner nodes, and gateway nodes.

#### 3. Evaluation of CDS Maintenance for Mobility

To evaluate the performance of our CDS maintenance algorithm for mobile ad hoc networks, we conducted simulation experiments for , and 600 node networks. We present sample-path simulation results providing detailed insights into the responses of the different algorithm phases to node movements, and aggregate (steady-state) simulation results providing insights into the overall performance of our algorithm. Due to space constraints, we present detailed results for the case and summarize the results for the and 600 cases, which are presented in detail in [43].

We conducted our simulation studies using a custom built simulator based on OMNeT++. We consider a m square network area and set the transmission range to m and the interference range to m (and ). In order to conduct a worst-case analysis of interference, we let all transmissions within interfere.

##### 3.1. Simulation Setup

###### 3.1.1. Random WayPoint Mobility Model

We use the Random WayPoint mobility model (RWP) [44, 45], which initially selects a random destination and a random speed for each node. Once a node reaches its destination it pauses for 100 frames which, according to our frame length, is approximately 21.96 seconds. This pause time achieves a mix of stationary and moving nodes throughout the simulation duration, which appears to be a realistic mobility scenario for the considered networks with relatively large numbers of nodes. A new random destination and speed are again chosen for the node at the end of the pause time, which is synchronized to the beginning of a frame.

For our simulation, we use maximum speeds, [m/s], of 0.01, 0.1, 1, 5, 10, 20, and 30. The speeds are chosen from a uniformly random distribution in . We select the minimum speed based on [46], which showed a “speed decay’’ problem when directly using the RWP model. Yoon et al. [46] define as the ratio of the node's maximum speed to its minimum speed , that is, . Yoon et al. [46] find that a smaller value, that is, a larger , considerably delays the process of the average speed of the nodes' settling around its long run time average. However, a large value for would mean less randomness in the range . Taking into consideration these trade-offs and other simulation parameters, we have set for our simulations. With , the long run time average nodal speed is about 87% of the initial average speed [46].

###### 3.1.2. Simulation Time Structure

At startup, we simulate the CDS construction algorithm on a static ad hoc network whereby the nodes are uniformly randomly placed on the network area and have no prior knowledge of their neighbors or topology. We define the CDS to be stable when the status of each node (leader/owner status and gateway list length) remains unchanged for ten consecutive frames. Once the CDS is stable we start simulating node mobility using the Random WayPoint model. Consistent with [46], we allow the mobile system to warm up for 200 frames before we start collecting data for the aggregate simulation experiments.

In our simulations, we consider only the rounds, each made up of 11 slots, and set the data period in Figure 1 to zero. The results for a nonzero data period can be inferred from the presented results for a zero data period by scaling the speed as follows. Let [m/s] denote the speed in the zero data phase model and let [m/s] denote the speed in the model with an byte data phase, which has duration , that is, is long enough to transmit a packet of bytes with the considered transmission rate of 1 Mbps. Note that the corresponding frame lengths are 219.6 ms in the model with zero data phase and, noting that there are data phases in a frame, ms with an byte data phase. Then, a movement by ms in the zero data phase model is equivalent to a movement by ms in the byte data phase model, that is, .

###### 3.1.3. Performance Metrics

Aside from counting the numbers of leader, owner, and gateway nodes, and measuring the overhead of the CDS algorithm, we assess the connectedness and dominance properties of the CDS (backbone network). In particular, at the end of each frame, we determine whether the mobile network is connected, whether the current CDS is connected, and whether the current leader nodes are a dominating set of the present topology.

We use Dijkstra's shortest path algorithm to evaluate the network and backbone connectivity status. To determine if the network is connected, we check if there exists a path between any given node to all the nodes in the network through a series of links between nodes within the transmission range . The measure “Network Connected” gives the long run fraction of time (in frames) when the mobile ad hoc network is connected. Similarly, the measure “CDS Connected’’ gives the long run fraction of time (in frames) when the backbone network is connected. We define the CDS to be connected if each and every pair of leader nodes is connected through a series of links that pass through the leader nodes' respective gateway(s).

For each frame, we define the measure “CDS dominating’’ as the proportion of ordinary nodes covered by leader nodes plus leader nodes to the total number of nodes in the network. In order for an ordinary node to be covered, the node must be located within the transmission range of at least one leader. A CDS is defined to be fully (100%) dominating when every ordinary node of the network is at most one hop away from a leader node.

##### 3.2. Sample Path Simulation Results

After the CDS has stabilized for the static network and the 200 frames warm-up of the mobility simulations are over, each simulation is run for 2000 more frames. All these three parts of the simulations are depicted in the sample path simulation plots. Each data point in the plots represents the average of 18 independent runs.

###### 3.2.1. Numbers of Leader, Owner, and Gateway Nodes

We plot in Figures 2, 3, and 4 the number of leader nodes determined by phase I, the number of leader nodes owning noninterfering transmission rounds determined by phase II, and the number of gateway nodes determined by phase III of our algorithm, respectively, as a function of time in frames. Each line depicts data for a different maximum node speed, ranging from 0 m/s to 30 m/s. (We omit the curves for 10 m/s and 20 m/s from these plots as they overlap with the curves for 5 m/s and 30 m/s; the aggregate results for 10 m/s and 20 m/s are provided in Table 2.)

We observe from Figures 2 and 3 that the numbers of leader and owner nodes very quickly reach a stable plateau for the initially static network. When mobility is introduced around 285 frame times into the simulation, the numbers of leaders and owners drop relatively slowly for low node speed and quite fast for higher node speeds to the level around 40 leaders and owners, which remains stable for the remainder of the simulations. Throughout, the number of owners tracks quite closely the number of leaders, indicating that phase II is highly agile in finding noninterfering transmission rounds for the leaders. The results for the 200 and 600 node networks are very similar; the only difference is that in the 200 node network there are around 50 leaders/owners in the static network and roughly 38 leaders/owners in the mobile network. For the 600 node network, there are approximately 58 and 43 leaders/owners in the static and mobile network, respectively.

The lower number of leaders/owners in the mobile network, compared to the static network appears to be due to the RWP model, which tends to concentrate the nodes toward the center of the network area with increasing simulation time. When phase I runs its self-stabilization slot and finds two leaders closer than together, one of them loses its leader status. Overall, we conclude from the mobility simulations that our algorithm maintains stable numbers of leader nodes and nodes owning noninterfering transmissions rounds even with relatively high levels of node mobility.

From Figure 4 we observe that for very low speeds (0.01 m/s and 0.1 m/s) the number of gateway nodes increases very slowly during the mobility simulation as the gateway connections are refined by the constantly running parallel algorithm phases. The number of gateway connections from a given leader node to neighboring leader nodes is bounded due to the constant density enforced by phase I on the leader set (i.e., two leaders must be at least apart). Overall, we observe that the gateway discovery process is highly effective in establishing and maintaining gateway node connections than for low to moderate speeds up to 1 m/s.

We observe from Figure 4 that for high speeds (5 m/s to 30 m/s), the number of gateway nodes initially drops during the mobility simulation and then settles around a stable level from around 1000 frame times onwards in the simulation runs. For these smaller number of gateway nodes, the CDS connectivity drops to between roughly 55% and 75% (as further examined in Section 3.4 and Table 2). The drop in gateway nodes and CDS connectivity to fairly low levels for high node mobility indicates that phase III is not fast enough for keeping up with finding new gateway nodes as nodes move in and out of each other’s transmission range relatively quickly. As reviewed in Section 2.1, Phase III requires a four-way exchange (with two of the exchanges requiring intact message receptions) between leader nodes and neighboring ordinary nodes for identifying gateway nodes. The simulation results appear to indicate that this four-way exchange is too slow to keep up with fast moving nodes.

Overall, we may conclude that the CDS maintenance is agile enough to maintain functional sets of leader nodes and ownerships of noninterfering transmission rounds up to high levels of mobility. On the other hand, the connectivity through the gateway nodes is high (close to 90% or higher) for small and moderate levels of mobility (up to about 1 m/s, see Figures 4 and 6); for higher levels of mobility, the gateway connectivity drops. Developing more agile gateway discovery and maintenance mechanisms that support high gateway connectivities at high levels of mobility is an important direction for future research.

###### 3.2.2. Connectivity and Dominance Properties

We present in Figure 5 the per-frame “CDS Dominating’’ percentage for different node speeds for the node network. We observe from the plots that the leaderset covers typically more than 90% of the mobile nodes for all considered speeds; similar observations were made for the and networks. The corresponding long-run average CDS dominating percentages with 95% confidence intervals for the mobility phase of the simulation are reported in Table 2.

In Figure 6 we plot the mean values of the “CDS Connected’’ measure across the 18 independent simulation replications as a function of time in frames. The plotted mean is one when CDS Connected is one in all 18 replications at the considered time. We observe from Figure 6(a) that the CDS is connected almost always at low speeds (up to 0.1 m/s), as also confirmed by the corresponding long-run average across the mobility phase (see Table 2). For the higher speeds considered in Figure 6(b), and in Table 2, we observe that the mean CDS connected measure drops to levels between 55% and 75%. We observe from Figure 6(b) that for those higher levels of mobility, the CDS connectivity fluctuates randomly with periods of brief CDS connectivity in close to all 18 replications taking turns with periods with CDS connectivity in fewer replications. The periods without CDS connectivity in any replications are relatively rare and brief even at the highest mobility levels.

In summary, we find that the dominance and connectivity results reflect the performance of the leader and gateway discovery and maintenance mechanisms evaluated in the preceding section. The leader set is quite stable even at high mobility levels and correspondingly we find high levels of CDS dominance even at high speeds. Similarly, the gateway node numbers are stable for low to moderate speeds and correspondingly the CDS connected values are high at low to moderate mobility levels. For high levels of mobility, the gateway node numbers drop, and so do the CDS connected values.

Wu and Dai in [27] state that without a mobility control mechanism in place, a connected dominating set may lose its global domination and connectivity status due to node movement. However, we demonstrate through our simulations, that by using physical carrier sensing to form locally noninterfering rounds and running the phases of the algorithm in parallel, we are able to achieve global domination and connectivity for our backbone network without making use of any explicit mobility control mechanism.

##### 3.3. Overhead: Transmitted Bytes for CDS Maintenance

In Figure 7 we plot the number of bytes transmitted by a node per frame for each phase for different node speeds. Note that the three algorithm phases run continuously in parallel and we count the packets sent by a node in each phase in every frame throughout each simulation run. We note that the total number of transmitted bytes by a node per frame, which is obtained by adding the numbers of transmitted bytes for the three phases, is approximately 200 bytes per frame, irrespective of the level of mobility. From our more detailed evaluations, we found that this total number of 200 transmitted bytes per frame is roughly the same for the 200 node and 600 node scenarios. The main difference for the different node numbers is that at high speeds the relatively contribution of phase III is higher for the 200 node network and lower for the 600 node network than for the 400 node network.

Overall, the results for the algorithm overhead indicate that the overhead stays essentially constant even for high network densities and high mobility levels. Correspondingly, the energy required for the overlay network maintenance (which is typically proportional to the number of transmitted bytes) is roughly constant.

##### 3.4. Aggregate Simulation Results

We summarize our aggregate simulation results in Table 2 by computing the overall CDS characteristics in terms of the average number of leader nodes, leader nodes owning noninterfering leader transmission rounds (owners), and gateway nodes as well as the overhead for CDS maintenance in terms of the number of messages and bits transmitted, received, collided, and sensed per node for various node velocities for the node network. For this analysis we define a collision to be an event in which a node that could have received a message is only able to sense a busy carrier. These collisions, however, do not imply retransmissions. To arrive at our aggregate results, we use the 2000 frames of mobility simulations and discard data from the static network simulations of the CDS and the 200 frames of warm-up period. Each statistic is obtained, by collecting samples of every frame for every of the 18 independent replications, totaling the collected samples, averaging across the number of collected samples from the 18 replications, and dividing by the number of nodes in the network.

Table 2 first gives the means and 95% confidence intervals for the numbers of leader, owner, and gateway nodes during the mobility phase for the range of maximum node speeds. The table also reports the long run fraction of frames that the network is connected as well as the fraction of frames that the CDS is connected and the percentage of dominance. As the sample path plots in the preceding sections indicated, we confirm from Table 2 that the numbers of leaders and owner nodes drop only slightly from the levels for static and close to static networks (speeds of 0 m/s and 0.01 m/s) to the levels for mobile networks (speeds of 0.1 m/s and higher). Correspondingly, the levels of dominance drop only relatively little from the 100% achieved for static networks. On the other hand, the number of gateway nodes and correspondingly the CDS connectivity drop quite appreciably from the level for static and close to static networks (speeds 0–0.1 m/s) to the level for moderately mobile networks (speed of 1 m/s) and again considerably to the level for highly mobile networks (speeds 5–30 m/s).

Next, in Table 2, we compare the information reception that is due to physical carrier sensing versus intact message receptions by expressing both quantities in bits. We find that the vast majority (over 97.5%) of the messages exchanged by nodes are received through carrier sensing rather than through intact message receptions. We also observe that between 26% and 38% of all information bits received by a node per frame are received through physical carrier sensing. Form our more extensive evaluations we found that these percentages are slightly higher (between approximately 33% and 44%) for the 600 node network, and somewhat lower (between roughly 12% and 30%) for the 200 node network.

Overall, these percentages of messages and bits received through physical carrier sensing observed from Table 2 are significantly higher than the corresponding percentages observed for constructing a CDS in a static network in [3]. This is mainly because the evaluation in [3] only considered the periods when the individual phases were active for constructing the CDS. That is, phase I exchanges were only considered until the set of leaders was stable. Phase II exchanges were only considered from the time the leader set was stable to the time the ownership status was stable. Similarly, phase III exchanges were only considered from the time the ownership status was stable to the time the gateways were stable. In contrast, for the present evaluation in Table 2 we consider all exchanges by all phases all throughout the simulations. As a result, phases I and II, which rely exclusively on physical carrier sensing and are constantly active for maintaining the leaders and owners in the mobile network, contribute relatively more to the overall message exchanges.

Examining closer the message exchanges for the individual phases in Table 2, we observe that the number of transmitted messages in phases I and II drops with increasing speeds, essentially mirroring the trends of the numbers of leader and owner nodes. The numbers of sensed bits, which are needed for the functions of phases I and II, stay relatively constant. Overall, these results on transmitted messages and sensed bits, in conjunction with the results for leader and owner nodes indicate that these two algorithm phases are well-suited for a wide range of mobility levels. We briefly note also that the total number of received bits in phases I and II, which are information collected in advance for phase III, stays roughly constant across the range of speeds (although the relative contributions from phase I and II vary).

Turning to phase III, we note that information exchange through physical carrier sensing takes only place in slot 1 (see also Table 1). The contribution of these sensed bits to the overall control information exchange in phase III is negligible. All other slots rely on the reception of intact control messages, whereby slot 4 has by far the longest control messages (exchanging the list of gateway nodes). Indeed, we observe that slot 4 contributes by far the most toward the information bits exchanged in phase III. Further, we observe that for increasing node speed there is a decrease in the number of sent as well as received messages in slots 3 and 4. This indicates that nodes moving at higher speeds are not able to participate in the gateway information update process as much as nodes that are moving with lower speeds, resulting in the decline in the number of gateway nodes for increasing node speeds.

Finally, we note that the number of collisions, which are only possible in slots 1 and 3 (see Table 1), are quite low for all mobility levels. Consequently, the number of bits received in phase III that have not experienced a prior collision is essentially equal to the total number of bits received in phase III. Furthermore, all bits received in slots 2 and 4 were not vulnerable to collisions due to the noninterfering transmission rounds (established in phase II) and the reservations established in slots 1 and 3. We observe from Table 2 that typically close to three quarters of the information bits exchanged in phase III are not vulnerable to collisions.

#### 4. Conclusion

We have evaluated the parallel algorithm for construction and maintenance of a connected domination set (CDS) in wireless ad hoc networks proposed in [2, 3] for different levels of node mobility. Throughout, the examined algorithm considers interference ranges larger than transmission ranges and incorporates medium access control in the control message exchanges. We found that the first phase of the algorithm, which requires only control message exchanges through physical carrier sensing, maintains a leader set covering over 90% of all ordinary nodes up to high levels of mobility. Similarly, exclusively with control messages exchanged through physical carrier sensing, the second phase of the parallel algorithm maintains a stable assignment of noninterfering transmission rounds to leader nodes. We found that for low levels of mobility (speeds up to 0.1 m/s), phase III of the algorithm maintains leader connections through gateways ensuring that the CDS is connected over 90% of the time. For higher levels of node mobility, the connectivity steadily drops (down to about 55% of the time for a speed of 30 m/s), indicating that the algorithm is not agile enough to maintain gateway connections at those higher levels of mobility.

Regarding the goal to maximize the information extracted from the ongoing transmissions through physical carrier sensing, we found that the parallel algorithm manages to exchange over 97.5% of the control messages and roughly 30% of the control information bits for CDS maintenance through physical carrier sensing.

Improving the agility of the gateway connection discovery and maintenance is an important direction for future research. As demonstrated by the results for leaders and owners of noninterfering transmission rounds, the first two phases of the parallel algorithm maintain this “infrastructure’’ of leaders and noninterfering rounds up to high levels of mobility. Future research should explore how this infrastructure could be better exploited for keeping the CDS connected at higher node speeds.

Another important direction for future work is to examine how other network layer functions in MANETs, such as routing and name resolution, can be integrated with the physical carrier sensing based CDS algorithm. The goal of such integration should be to exploit as extensively as possible physical carrier sensing for these other network layer functions so as to reduce the reliance on control message exchanges through intact message receptions.

#### References

- Y. Wang and X.-Y. Li, “Efficient delaunay-based localized routing for wireless sensor networks,”
*International Journal of Communication Systems*, vol. 20, no. 7, pp. 767–789, 2007. View at Publisher · View at Google Scholar - K. Kothapalli, C. Scheideler, M. Onus, and A. W. Richa, “Constant density spanners for wireless ad-hoc networks,” in
*Proceedings of the Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '05)*, pp. 116–125, Las Vegas, Nev, USA, July 2005. View at Publisher · View at Google Scholar - L. Ritchie, S. Deval, M. Reisslein, and A. W. Richa, “Evaluation of physical carrier sense based spanner construction and maintenance as well as broadcast and convergecast in ad hoc networks,”
*Ad Hoc Networks*, vol. 7, no. 7, pp. 1347–1369, 2009. View at Publisher · View at Google Scholar - H. Cheng, J. Cao, X. Wang, S. K. Das, and S. Yang, “Stability-aware multi-metric clustering in mobile ad hoc networks with group mobility,”
*Wireless Communications and Mobile Computing*, vol. 9, no. 6, pp. 757–771, 2009. View at Google Scholar - M. Gerla, T. J. Kwon, and G. Pei, “On demand routing in large ad-hoc wireless networks with passive clustering,” in
*Proceedings of IEEE Wireless Communications and Networking Conference (WCNC '00)*, pp. 100–105, Chicago, Ill, USA, September 2000. - R. Ghosh and S. Basagni, “Mitigating the impact of node mobility on ad hoc clustering,”
*Wireless Communications and Mobile Computing*, vol. 8, no. 3, pp. 295–308, 2008. View at Publisher · View at Google Scholar - R. Palit, E. Hossain, and P. Thulasiraman, “MAPLE: a framework for mobility-aware pro-active low energy clustering in ad hoc mobile wireless networks,”
*Wireless Communications and Mobile Computing*, vol. 6, no. 6, pp. 773–789, 2006. View at Publisher · View at Google Scholar - K. Xu, X. Hong, and M. Gerla, “An ad hoc network with mobile backbones,” in
*Proceedings of IEEE International Conference on Communications (ICC '02)*, vol. 5, pp. 3138–3143, New York, NY, USA, April-May 2002. - J. Y. Yu and P. H. J. Chong, “A survey of clustering schemes for mobile ad hoc networks,”
*IEEE Communications Surveys and Tutorials*, vol. 7, no. 1, pp. 32–48, 2005. View at Google Scholar - L. Wang and S. Olariu, “A unifying look at clustering in mobile ad hoc networks,”
*Wireless Communications and Mobile Computing*, vol. 4, no. 6, pp. 623–637, 2004. View at Publisher · View at Google Scholar - K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder, “Geometric spanners for wireless ad hoc networks,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 14, no. 4, pp. 408–421, 2003. View at Publisher · View at Google Scholar - X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du, “A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless
networks,”
*Networks*, vol. 42, no. 4, pp. 202–208, 2003. View at Publisher · View at Google Scholar · View at MathSciNet - J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, “Geometric spanners for routing in mobile networks,”
*IEEE Journal on Selected Areas in Communications*, vol. 23, no. 1, pp. 174–185, 2005. View at Publisher · View at Google Scholar - I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 13, no. 1, pp. 14–25, 2002. View at Publisher · View at Google Scholar - Y. Wang, W. Wang, and X.-Y. Li, “Efficient distributed low-cost backbone formation for wireless networks,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 17, no. 7, pp. 681–693, 2006. View at Publisher · View at Google Scholar - J. Wu and F. Dai, “Virtual backbone construction in MANETs using adjustable transmission ranges,”
*IEEE Transactions on Mobile Computing*, vol. 5, no. 9, pp. 1188–1199, 2006. View at Publisher · View at Google Scholar - H.-Y. Yang, C.-H. Lin, and M.-J. Tsai, “Distributed algorithm for efficient construction and maintenance of connected $k$-hop dominating sets in mobile ad hoc networks,”
*IEEE Transactions on Mobile Computing*, vol. 7, no. 4, pp. 444–457, 2008. View at Publisher · View at Google Scholar - M. Luby, “A simple parallel algorithm for the maximal independent set problem,”
*SIAM Journal on Computing*, vol. 15, no. 4, pp. 1036–1055, 1986. View at Google Scholar - S. Basagni, M. Mastrogiovanni, A. Panconesi, and C. Petrioli, “Localized protocols for ad hoc clustering and backbone formation: a performance comparison,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 17, no. 4, pp. 292–306, 2006. View at Publisher · View at Google Scholar - H. Liu, X. Jai, P.-J. Wan, X. Liu, and F. F. Yao, “A distributed and efficient flooding scheme using 1-hop information in mobile ad hoc networks,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 18, no. 5, pp. 658–671, 2007. View at Publisher · View at Google Scholar - F. Dai and J. Wu, “An extended localized algorithm for connected dominating set formation in ad hoc wireless networks,”
*IEEE Transactions on Parallel and Distributed Systems*, vol. 15, no. 10, pp. 908–920, 2004. View at Publisher · View at Google Scholar - S. Basagni, “Distributed clustering for ad hoc networks,” in
*Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN '99)*, pp. 310–315, Perth, Australia, June 1999. View at Google Scholar - P.-J. Wan, K. M. Alzoubi, and O. Frieder, “Distributed construction of connected dominating set in wireless ad hoc networks,”
*Mobile Networks and Applications*, vol. 9, no. 2, pp. 141–149, 2004. View at Publisher · View at Google Scholar - F. Kuhn, T. Moscibroda, and R. Wattenhofer, “Radio network clustering from scratch,” in
*Proceedings of European Symposium on Algorithms (ESA '04)*, pp. 460–471, 2004. - S. Parthasarathy and R. Gandhi, “Distributed algorithms for coloring and domination in wireless ad hoc networks,” in
*Proceedings of Foundations of Software Technology and Theoretical Computer Science*, pp. 447–459, 2004. - R. Gandhi, S. Parthasarathy, and A. Mishra, “Minimizing broadcast latency and redundancy in ad hoc networks,” in
*Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '03)*, pp. 222–232, Annapolis, Md, USA, June 2003. - J. Wu and F. Dai, “Mobility control and its applications in mobile ad hoc networks,”
*IEEE Network*, vol. 18, no. 4, pp. 30–35, 2004. View at Publisher · View at Google Scholar - R. Bruno, C. Chaudet, M. Conti, and E. Gregori, “A novel fair medium access control for 802.11-based multi-hop ad hoc networks,” in
*Proceedings of the 14th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN '05)*, pp. 1–6, September 2005. View at Publisher · View at Google Scholar - J. Deng, B. Liang, and P. K. Varshney, “Tuning the carrier sensing range of IEEE 802.11 MAC,” in
*Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '04)*, vol. 5, pp. 2987–2991, November-December 2004. - T.-S. Kim, H. Lim, and J. C. Hou, “Improving spatial reuse through tuning transmit power, carrier sense threshold, and data rate in multihop wireless networks,” in
*Proceedings of the Annual International Conference on Mobile Computing and Networking (MOBICOM '06)*, pp. 366–377, September 2006. - H. Ma, H. Alazemi, and S. Roy, “A stochastic model for optimizing physical carrier sensing and spatial reuse in wireless ad hoc networks,” in
*Proceedings of the 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS '05)*, pp. 615–622, November 2005. View at Publisher · View at Google Scholar - K. Sanzgiri, I. D. Chakeres, and E. M. Belding-Royer, “Determining intra-flow contention along multihop paths in wireless networks,” in
*Proceedings of the 1st International Conference on Broadband Networks (BroadNets '04)*, pp. 611–620, October 2004. - E. C. Wong and R. L. Cruz, “A spatio-temporal model for physical carrier sensing wireless ad-hoc networks,” in
*Proceedings of the 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks (SECON '06)*, vol. 1, pp. 276–285, September 2006. View at Publisher · View at Google Scholar - X. Yang and N. Vaidya, “On physical carrier sensing in wireless ad hoc networks,” in
*Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05)*, vol. 4, pp. 2525–2535, Miami, Fla, USA, March 2005. - Y. Yang, J. C. Hou, and L.-C. Kung, “Modeling the effect of transmit power and physical carrier sense in multi-hop wireless networks,” in
*Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '07)*, pp. 2331–2335, May 2007. View at Publisher · View at Google Scholar - H. Zhai and Y. Fang, “Physical carrier sensing and spatial reuse in multirate and multihop wireless ad hoc networks,” in
*Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '06)*, pp. 1–12, April 2006. View at Publisher · View at Google Scholar - J. Zhu, X. Guo, L. L. Yang, and W. S. Conner, “Leveraging spatial reuse in 802.11 mesh networks with enhanced physical carrier sensing,” in
*Proceedings of IEEE International Conference on Communications*, vol. 7, pp. 4004–4011, June 2004. - R. Ramanathan and R. Rosales-Hain, “Topology control of multihop wireless networks using transmit power adjustment,” in
*Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '00)*, vol. 2, pp. 404–413, 2000. - C.-C. Shen, C. Srisathapornphat, R. Liu, Z. Huang, C. Jaikaeo, and E. L. Lloyd, “CLTC: a cluster-based topology control framework for ad hoc networks,”
*IEEE Transactions on Mobile Computing*, vol. 3, no. 1, pp. 18–32, 2004. View at Publisher · View at Google Scholar - A. Muqattash and M. M. Krunz, “A distributed transmission power control protocol for mobile ad hoc networks,”
*IEEE Transactions on Mobile Computing*, vol. 3, no. 2, pp. 113–128, 2004. View at Publisher · View at Google Scholar - A. Muqattash and M. Krunz, “POWMAC: a single-channel power-control protocol for throughput enhancement in wireless ad hoc networks,”
*IEEE Journal on Selected Areas in Communications*, vol. 23, no. 5, pp. 1067–1084, 2005. View at Publisher · View at Google Scholar - B. Tavli and W. B. Heinzelman, “Energy and spatial reuse efficient network-wide real-time data broadcasting in mobile ad hoc networks,”
*IEEE Transactions on Mobile Computing*, vol. 5, no. 10, pp. 1297–1312, 2006. View at Publisher · View at Google Scholar - S. Deval,
*Resilience of physical carrier sense based MANET backbones*, M.S. thesis, Department of Electrical Engineering, Arizona State University, Tempe, Ariz, USA, 2008. - D. Johnson and D. Maltz, “Dynamic source routing in ad hoc wireless networks,” in
*Mobile Computing*, pp. 153–181, Kluwer Academic Publishers, Norwood, Mass, USA, 1996. View at Google Scholar - J. Broch, D. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols,” in
*Proceedings of the ACM Conference on Mobile Computing and Networking (MobiCom '98)*, pp. 85–97, Dallas, Tex, USA, October 1998. - J. Yoon, M. Liu, and B. Noble, “Random waypoint considered harmful,” in
*Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '03)*, vol. 2, pp. 1312–1321, 2003.