Constrained Delaunay Triangulation for Ad-hoc Networks

(cid:151) Geometric spanners can be used for ef(cid:2)cient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc networks primarily focused on geometric properties without considering network requirements. In this paper we pro-pose a new spanner called Constrained Delaunay Triangulation (CDT) which considers both geometric properties and network requirements. The CDT is formed by introducing a small set of constraint edges into local Delaunay triangulation (LDel) to reduce the number of hops between nodes in the network graph. We have simulated the CDT in ns2.28 and compared with Gabriel graph (GG), relative neighborhood graph (RNG), local Delaunay triangulation (LDel), and planarized local Delaunay triangulation (PLDel). The simulation results show that the minimum number of hops from source to destination is less than other spanners. We also observed the decrease in delay, jitter, and improvement in throughput.


I. INTRODUCTION
An ad hoc network is a collection of wireless nodes with no fixed infrastructure.In wireless ad hoc networks, routing is one of the important challenging tasks because of its distributed nature, mobility, limited transmission range, shared communication media, and limited node capabilities.Many researchers proposed various network topologies for efficient routing.These topologies are used to route the packets from source to destination.These network topologies can be broadly divided into three categories.They are: flat, hierarchical, and hybrid network structures.The flat network graphs form connected graph with all nodes in the network.For example, minimum spanning tree (MST), nearest neighbor graph (NNG), relative neighborhood graph (RNG), Gabriel graph (GG), Yao graph (Yao), and Delaunay triangulation (Del) [20], [3], [21].In the hierarchical structures, only some subset of nodes is existed in the network graph based on the hierarchies created by the network.Mainly hierarchical structures are based on dominating set, connected dominating set, and ¢ -dominating set [30], [31], [2], [8], [22].On the other hand, hybrid structures [10], [1] combine both hierarchical structures and flat structures, and the graph contains the subset of nodes of the original network graph.
Another type of network graph is unit disk graph (UDG) [17] which can be defined as follows.Assume each node has the same and fixed transmission range as one unit then there exists an edge between two nodes £ and ¤ if and only if their Euclidean distance ¥ ¦£ §¤ ¨¥ is not more than one unit.The number of edges in UDG is in © , where is Yao RNG GG the number of nodes.The communication cost in this graph is high due to the large number of edges.
To reduce the communication cost over UDG, many researchers derived various connected geometric subgraphs of UDG, called spanner, with linear number of edges.The formal definition of spanner is as follows: A spanning subgraph !" is a # -spanner of a graph !if and only if the number of vertices in graph !$" is equivalent to the number of vertices in graph ! and the length of the shortest path connecting any two vertices in graph !$" is bounded by a value # to the length of the shortest path connecting the same vertexes in the graph ! .In other words, a graph !%" is a # -spanner of graph !if & ' (! $" ) 10 & ' (! 2 and 3 4£ 5 6¤ 87 9& ' (! 2 , ¥ A@ §B DC E £ 5 6¤ F G¥ IH P# )¥ ¦@ B Q£ D5 R¤ S )¥ , where & ' (! 2 is the vertex set of graph ! and ¥ ¦@ B Q£ D5 R¤ S )¥ is the length of the shortest path between two vertices £ and ¤ in the graph ! .

A. Survey
Recently, many researchers have shown interest on geometric spanners, because of its wide range of applications.Some of the spanners often used in wireless networks are briefly discussed below.
The edge £ U¤ exists between two nodes £ and ¤ in GG if there is no node V inside the circle with £ §¤ as the diameter as shown in Fig. 1.In other words, the edge £ §¤ '7 YX if and only if the circle centered at £ ab¤ F dc fe with the radius ¢ U £ 5 6¤ F dc fe does not contain any other node inside, where ¢ U £ 5 6¤ F denotes distance between £ and ¤ .Bose and Mortin given a localized algorithm [5] to construct GG for ad hoc networks.The spanning ratio of GG is bounded by Two nodes £ D5 R¤ p7 q& , are connected in RNG if and only if their lune r ts vu w does not contain any other node V x7 q& .The lune r ts vu w is defined as the intersection of the two circles of radius ¢ U £ 5 6¤ F centered at y and respectively, see the Figure 1.The algorithm to construct ! for wireless networks is given in [12].Bose et.al [3] has proved that the spanning ratio of RNG is in © i .RNG is a subgraph of GG.
In Yao graph [29], [21], the transmission range circle of a node £ is divided into equal sectors, where ' , as shown in Figure 1.In each sector, closest node is connected with £ by an edge, if exists.Ties are broken arbitrarily.The spanning ratio of Yao graph is bounded by a constant.Unlike GG and RNG, Yao graph is not a planar graph.
We can define Delaunay triangulation (Del) [25] of & as the triangulation of all the nodes such that the circumcircle of each triangle should not contain any other node 7 & , see the Fig. 2. Delaunay triangulation is a planar graph.The spanning ratio of Del is 2.42 [13], [14].Hence, it is a #spanner of UDG.RNG and GG are subgraphs of Del, but still it maintains linear number of edges in the graph.Del is not suitable for ad hoc networks, because it contains longer edges than the transmission range.The unit Delaunay triangulation UDel [19] can be obtained from the Delaunay triangulation Del by removing all the edges longer than one unit.UDel is a # -spanner of UDG [19], [10].
Though the unit Delaunay triangulation (UDel) is suitable for ad hoc networks, it is not known how to construct UDel locally.Xiang li et al. [20] gave a localized algorithm to construct Delaunay triangulation for ad hoc networks called localized Delaunay triangulation (LDel).In LDel" , as shown in Fig. 2, the circumcircle of each triangle a£ D5 R¤ §5 RV do not contain any other node such that 97 Y " £ 4 , 7 " Q¤ S and q7 " QV , where " £ 4 denotes the set of 1-hop neighbors.In this algorithm, first it constructs LDel" with one hop neighbors.LDel" is a t-spanner of UDG [19].But LDel" is not a planar graph.A planarization algorithm is applied on LDel" to make it a planar graph and it is called planarized local Delaunay triangulation (PLDel) or simply call localized Delaunay triangulation (LDel).LDel is a planar e S -spanner of UDG [20], [19].It contains all the edges that are in the both UDG and Del.

Gao et al [10],
[11] proposed a spanner called restricted Delaunay graph (RDG), which combines the node clustering algorithm with Delaunay triangulation graph.Alzoubi et al [1], [28] proposed another spanner which first constructs the backbone using clustering algorithm followed by the Delaunay triangulation.
LDel contains many desirable geometric properties which are suitable for wireless ad hoc networks.But at the same time, some of the problems in LDel motivated us to propose a new spanner called constrained Delaunay triangulation (CDT).The problems include high hop count between the nodes and large packet delays.Some times, in LDel, packet traversal may take more than one hop even though these nodes are in their communication range of each other.This can happen due to the geometric property of LDel.For example, consider the LDel shown in the Fig. 3(i), the outer circle indicates the transmission range of node f .Nodes g E5 dh i5 6¢ U5 and j are neighbor nodes of f .Even though the node ¢ is in the transmission range of node f , the packet traversal from node f to node ¢ takes more than one hop.Since, the edge f F¢ can not be placed in the LDel.The same thing can happen to other spanners also.For example, in the Gabriel graph (see Fig. 3(ii)), does not include the edge f Fh in the graph due to its property.In this paper, we propose a new spanner called Constrained Delaunay triangulation (CDT) by introducing longer edges to reduce the number of hops and packet delay between the nodes.We call these longer edges as constraints of localized Delaunay triangulation (LDel).The main objectives of the constrained Delaunay triangulation are: lk E reducing the number of hops between the nodes in LDel, and (e v reducing the end-to-end packet delay.We have simulated CDT in ns2.28 and compared with PLDel, LDel" , GG, and RNG using various greedy routing protocols.The simulation results show that CDT give better performance in terms of number of hops, packet delay, jitter, and throughput.
The remaining part of this paper is arranged as fallows.In the next Section, we define constrained Delaunay triangulation followed by the algorithm to construct CDT.The Section 3 presents the results of ns2 [24] simulation.We conclude the paper with the future research direction in the Section 4.

II. CONSTRAINED DELAUNAY TRIANGULATION (CDT)
Localized Delaunay triangulation (LDel) [20], [19] is popular because of its useful geometric properties and utility in wireless networks.In LDel, even though two nodes exits in the communication range of each other, they not have a direct edge between the nodes, because of the geometric properties.The same things happens in other geometric graphs such as GG and RNG.This leads to longer path from source to destination, hence more number of transmissions and high latency.We are motivated by this problem and proposed CDT, which reduces the number of transmissions and latency.
If we have an edge between the nodes f and ¢ in the Fig. 3(i) or f and h in the Fig. 3(ii), it reduces the number of hops between the nodes and in turn leads to many other benefits such as reduction in the delay, jitter, and energy consumption.But, these type of edges violate the geometric properties of the spanner.So, in order to improve the various network parameters, we introduce the so called constraint edges into the network graph.But, most of other edges satisfy the Delaunay property.This gives us improvement in network parameters and at the same time satisfying various geometric properties.
Constrained Delaunay triangulation is well studied problem in the area of computational geometry.Paul Chew proposed a divide-and-conquer algorithm for CDT [7].This algorithm is not suitable for wireless ad hoc networks, because it is a centralized algorithm.In this section, we give a localized algorithm to construct CDT for wireless networks.
Constrained Delaunay triangulation is a triangulation of the given set of nodes & with the following properties.(1) CDT is a subgraph of UDG.(2) Constraint edges exist at two hop away.(3) CDT is a planar graph.(4) The total number of edges in CDT are in © Q i .(5) CDT is a spanner of UDG.
The algorithm to construct CDT is a localized algorithm.That is, it uses only the constant number of neighborhood hop information.In this algorithm, we assume that each node is static and knows its location information.We can broadly divide the CDT algorithm into three parts.First we construct the planarized local Delaunay triangulation (PLDel) [20], [19] with one hop neighborhood information.For the sake of completeness, we briefly describe the algorithm.Each node £ computes Delaunay triangles q 'j Er R £ 4 with its 1-hop neighbors.The Gabriel edges are computed from Delaunay triangles, which will never be deleted from local Delaunay triangulation (LDel).Remove all the inconsistent triangles.A triangle pf Sg ¦h is called consistent if the nodes f , g , and h contain the triangle pf Fg Ah .The resulting graph is called LDel" , which is not planar graph.A separate planarization algorithm is applied on LDel" to induce a planarized local Delaunay triangulation (PLDel).
In the second part of CDT algorithm, we find BLACK nodes which are atleast two hop apart.These Black nodes place nonintersecting constraint edges on top of PLDel and mark the other side of the constraint edge to BROWN.The resulting graph is not planar graph.The third part planarizes this graph and forms new triangles with the constraint edges.The resulting graph is called constrained Delaunay triangulation (CDT).Please note that the new edges added are belongs to UDG.Formally, the algorithm is described below.
Algorithm for t q vu : 1) Construct PLDel, set color of each node to WHITE, and broadcast all its 1-hop neighbor information using the packet Neighbor Packet.2) Nodes having lowest id among its 2-hop neighbors set their color to BLACK.3) Each BLACK node chooses a set of nodes from its 1-hop neighbors using the following method, see Fig. then = w a z ¡ 4) Each BLACK node adds the constraint edges to the nodes in and broadcast these constraint edge information using the message Constraint Packet.

5) Each WHITE node sets its
other end of any constrained edges received using Constraint Packet.6) Each BROWN node broadcasts its constraint edge information using the control packet Constraint Packet.7) All WHITE and BROWN nodes remove edges connected to it which crosses constraint edges, see the Fig. 5(ii).This information is broadcasted using Edgecross Packet.8) Each BLACK node places a new edge from the WHITE nodes, from which the edge was deleted in the previous step to form new triangles, see the Fig. 6.Constrained Delaunay triangulation can be maintained efficiently in a distributed fashion.CDT has nice theoretical guarantees.The simulation results show that the performance of CDT is better than PLDel, GG, and RNG.Theorem 1: The expected number of BLACK nodes in any 2-hop disk is in © Rk .
Theorem 2: The expected total number of BLACK and BROWN nodes in an unit disk is in © lk E .
Proof: From the definition of BROWN node, for each BLACK node, the other side of each constraint edge is a BROWN node.Since, the maximum number of constraint edges for each BLACK node is 5, the total number of number of BROWN nodes for a single BLACK node is in © lk E .We know that the total number of $r t nodes in unit disk is in © lk E , from the u Uj E ij k .Thus, the total number of BROWN nodes in unit disk is in © lk E .Hence the total number of BLACK and BROWN nodes are in © lk .
From theoretical point of view, the constraint edges in CDT do not affect the link quality, as the definition of UDG says that every node in its vicinity receives the transmitted packet [17], [11], [20], [10], [1], [19], [28], [18].On the other hand, the quality of signal strength decreases with the increase in distance to the receiving node [23], [6], [26].In this case, the constraint edges may affect the link quality, as the constraint edges are considerably long.In addition to the distance, link quality also depends on walls, buildings, mountains, and weather conditions, which might obstruct signal propagation.We can use the following models for link quality [32], [27].In our proposed method, we can consider distance parameter for link quality while selecting the constrained edges.In other word, consider the link quality as a parameter for choosing the constraint edges.
In the remaining part of the section we analyze the communication cost in terms of the number of transmissions.In addition to the messages of planarized local Delaunay triangulation [20], [19], CDT uses the following control messages: 1) Neighbor Packet: This packet is used to broadcast the 1-hop neighborhood information.Theorem 3: The communication cost of constructing CDT from PLDel is in © i .
Theorem 4: The communication complexity to construct CDT is in © v i .
Proof: We know that the message complexity for constructing PLDel is in © Q t i [20].The total number of message exchanges by CDT, excluding PLDel, is in © Q i .Thus the total communication cost of constructing the CDT is in © Q v i .Hence, theorem is proved.

III. SIMULATION AND PERFORMANCE
In order to evaluate the performance of the proposed spanner, we have done various experimental work using networks simulator (ns2.28).We have simulated GG, RNG, LDel" , and PLDel, and compared with our t q vu spanner.The following routing protocols are simulated to run on these spanners.
1) Greedy routing (Grdy): As shown in the Fig. 7(i), let the node g is the destination node then the current node f selects a node h as the next relay node in its transmission range such that the distance ¥ h )g i¥ is the smallest among its neighbors.Here the circle with the center at f represents the transmission range of node f .Please node that if there exists a node in the shaded area then the node h cannot be next relay node.2) Compass routing (Cmp): Assume that the node g is the destination node.The current node f sends packet to the next relay node h which makes the smallest angle.That is, h Af Sg is the smallest among all f 's neighbors, see the Figure 7(ii).3) Random compass routing (RandCmp): It is similar to the compass routing.As shown in the Fig. 7(iii), let f and g are the current and destination nodes respectively.We compute the two nodes h and ¢ , above and below the line f Sg respectively.Here the angle h )f Fg and ¢ vf Sg are the minimum angles above and below the line f Sg respectively, among f 's neighbors.The current node f sends packet to the destination node, by randomly selecting, either node h or node ¢ as the next relay node.

4) Most forward routing (MFR):
As shown in the Fig. 7(iv), the current node f selects the next relay node h to transmit the packet to the destination node g such that the distance ¥ ¢ Fg i¥ is the smallest among f 's neighbors.5) Nearest neighbor routing (NN): Let f and g be the current and destination nodes respectively, as shown in the Fig. 7(v).For a particular angle , node f selects the next relay node h such that h Af Sg H and h is the nearest neighbor of f .6) Farthest neighbor routing (FN): In this routing protocol, for the given angle , as shown in the Fig. 7(vi), the current node f selects the next relay node h such that h Af Sg H b and h is the farthest neighbor of node f .Here g is the destination node.The greedy routing, compass routing, and random compass routing provide guarantee delivery of packets if the underlying network topology is a Delaunay triangulation [12], [5].

A. Performance metrics
In this paper, we have considered the following metrics to evaluate the performance of different spanners.
1) Hop count: This metric represent the total number of hops traveled by a data packet from source to destination on the underlying network graph.2) Delivery ratio: The delivery ratio (q ' ) is the ratio of the total number of packets received successfully to the total packets sent by the source.3) Delay: Delay metric is the total time spent by a packet during the data transmission from source to destination.4) Standard Delay: Standard delay is the standard deviation in the delay of a packet from source to destination.
The following mathematical formula is used to calculate the standard delay ( i ).
where f z denotes delay of y | ~packet, f is average delay, and is total number of packets 5) Throughput: Throughput is the total number of packets transmitted per unit time from source to destination.In the simulation results, we have presented average, minimum, and maximum of the above metrics.

B. Simulation model and results
Important parameters of the simulation are shown in the Table I.All experiments are conducted on ten different node scenarios.For each scenario, we have considered ten different connection patterns, by randomly choosing source nodes at one side and destination nodes at the other side.In our simulation model, we do not consider the link quality, as we assumed that the channel is error free.
The first experiment is on delivery ratio.The average delivery ratio of ten different scenarios with six different routing protocols is shown in the Table II.The delivery ratio of CDT is better than RNG and GG, because CDT is denser graph than RNG and GG.There is not much difference among CDT, PLDel, and LDel" , because many edges are common among them.
In the second experiment, we have computed the minimum hop count between source and destination on different network topologies.The source node sends the packet to the destination greedily on five different network topologies.The average hop count at different CBR intervals are shown in the Fig. 8.It clearly indicates that CDT has less average hop count than the other spanners.This happens, because CDT contains constraint edges which make packet transmission from source to destination with fewer hops.Since, the constraint edges are not available in RNG, GG, LDel" , and PLDel, they take more hops.
In third experiment we have checked the end-to-end packet delay on different network topologies.Here, we consider only the packets that reach the destination.The source node sends the packets greedily to the destination on five different spanners at different transfer rates.The Fig. 9 shows the average delays.We can observe that CDT contains less average delay compared to the other spanners.This is again because of constraint edges in CDT, which make the packets to reach destination with less number of transmissions.
In the fourth experiment, we have considered the standard deviation in delay, called Standard delay ( ).Standard delay is related to one of the quality of service (QoS) parameter called jitter.One can see from the Fig. 10, the standard deviation of the end-to-end packet delay on the spanner CDT is lesser than the other spanners.This could happen, because the total number of transmissions on the spanner CDT is less which make the variation to the average delay will also be less.
The minimum and maximum values of the packet end-to- We have done the final experiment on throughput.The Fig. 17, Fig. 18 and Fig. 19 show that the constrained Delaunay triangulation has better throughput compared to other spanners.This can happen because the constraint edges in CDT make the packets to reach the destination with fewer number of transmissions than in PLDel, LDel, GG, and RNG, which reduces the collisions, and latency thereby increasing

IV. CONCLUSION
The existing geometric spanners, GG, RNG, LDel" , and PLDel, have smaller edges due to its geometric properties, which increases the hop count and delay.We have proposed CDT by introducing larger constrained edges to reduce hop count and delay.The experimental results substantiate our claim.Moreover, CDT is most suitable geometric spanner for multimedia and real-time applications, because lower standard

Fig. 6 .
Fig. 6.Non Delaunay triangles d he , e s , G l , and G s are created in CDT.

2 )
Constraint Packet: This packet is used to broadcast the constraint edge information.3) Edgecross Packet: This packet is used to broadcast the edge cross information.The message Neighbor Packet is broadcasted at most once by each node in the network graph.So, the communication cost for this message is in © i bits, where is the total number of nodes.Only BLACK and BROWN nodes use the message Constraint Packet.Each BLACK and BROWN nodes broadcast the message Constraint Packet at most once.The