Constrained Delaunay Triangulation for Ad Hoc Networks

Satyanarayana, D.; Rao, S. Venugopal

doi:10.1155/2008/160453

Cited by 8 publications

(8 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A constrained Delaunay triangulation (CDT) method named new spanner was proposed for optimal placement of RSUs with the view to improve network area coverage with minimized end-to-end delay [19]. This new spanner method attained the objective of RSUs placement based on the requirements of network and geometric properties.…”

Section: Related Workmentioning

confidence: 99%

Chews First Delaunay Triangulation refinement Scheme-Based Positioning of RSUs for Optimal Network Coverage in VANETs

Selvakumari¹,

Lakshmi²,

Sheela³

et al. 2021

Preprint

View full text Add to dashboard Cite

The temporal network fragmentation and uncertain vehicle mobility are considered to impact the communication connectivity among the vehicular nodes of the network. In this context, Road Side Units (RSUs) play an anchor role in enhancing the vehicle-to-vehicle (V2V) communication connectivity and support Vehicle-to-Infrastructure (V2I) communication. In the current scenario, deploying a huge number of RSUs in the vehicular networks at an initial stage is completely impossible as it incurs high installation cost and authority restriction. Moreover, the optimal placement of RSUs in the vehicular network needs to be enforced for attaining maximized network coverage. In this paper, Chews First Delaunay Triangulation Refinement Scheme (CFDTRS) is proposed for optimal positioning of RSUs in order to attain optimal network coverage in the vehicular network with minimized cost. This CFDTRS considered the factors of vehicular density, number of obstacles in the map, intersection popularity and global coverage into account during the placement of RSUs. It is proposed with the objective of deploying required number of RSUs within the range of data transmission in order to achieve maximal coverage in the convex map, such that each area of the convex map is completely covered with at least a single RSU in the existence of multiple number of obstacles. The simulation results of the proposed CFDTRS attained from the real time situations of simplex, moderate and complex maps confirmed improved packet delivery rate of 9.32%, throughput by 10.74% with minimized packet loss of 9.14% and reduced end-to-end delay of 19.31$, compared to the benchmarked schemes considered for investigation.

show abstract

Section: Related Workmentioning

confidence: 99%

Chews First Delaunay Triangulation refinement Scheme-Based Positioning of RSUs for Optimal Network Coverage in VANETs

Selvakumari¹,

Lakshmi²,

Sheela³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…A triangulation of is a Delaunay triangulation if the circumcircle of each of its triangles does not contain any other nodes of in its interior. A triangle is called the Delaunay triangle if its circumcircle is empty of nodes of inside [15]. Delaunay triangulation has some properties that make it unique [16].…”

Section: Delaunay Triangulationmentioning

confidence: 99%

A Data Forwarding Scheme Based on Delaunay Triangulation for Cyber-Physical Systems

Luo

Cai

Zhong

2013

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Cyber-physical system (CPS) cooperates with physical processes, computing, communication, and control (3C) into multiple levels of information processing and operation management to streamline and fortify the operation of physical systems. Due to the unique characteristics, such as unpredictable node mobility, low node density, lack of global information and network intermittent connectivity, an algorithm for data forwarding in CPS is a considerably difficult and challenging problem, and there is no good solution to it in existing works. In this paper, we propose a fully-fledged data forwarding algorithm tailored to the CPS environment. The proposed protocol, called data forwarding based on Delaunay triangulation (DFDT), takes into account the computational geometry based on Delaunay triangulation to form a few triangle communities according to nodes' connectivity. Data in a community are forwarded to other nodes once a node comes into this community to increase the data delivery ratio. DFDT achieves a good performance by data gathering and sending data to other nodes with higher probability of meeting the link. An extensive simulation has been performed to validate the analytical results and to show the effectiveness of our approach compared with the three existing popular data forwarding algorithms.as they exploit computing to provide "anytime, anywhere" transparent services. While the added intelligence offers the promise of increased utilization, its impact must be assessed, as unrestricted information control can actually lower the reliability of existing infrastructure systems. Compared with the traditional networks, CPS owns characteristics, such as self-judgment, self-control and self-regulation, node mobility, and network intermittent connectivity.CPS has gained increasing attention in a wide range of application domains, such as transportation system, modern airplane, nuclear power plant, highway traffic, embedded medical devices, oil refiner, power grid, and health care. Such system must be able to operate safely, dependably, securely, efficiently, and in real-time, potentially highly uncertain or unstructured environments. CPS is expected to have great technical, economic, and social impacts in the near future.The convergence of sensing, communication, processing, control, and coordination in CPS poses enormous challenges. The aspects seem particularly challenging [4]: distributed and concurrent interactions between cyber and physical Submit your manuscripts at

show abstract

“…Bose et al [1] proposed a local routing algorithm that can find a route to the monitoring center whose length is within a bounded ratio of the shortest-path length of the Delaunay triangulation. Some subgraphs of the Delaunay triangulation, including the Gabriel graph, and the relative neighborhood graph, are also studied as underlying graphs for sensor networks [11]. Although the Delaunay triangulation and related graphs have many good properties, we need global computation to construct them.…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, locally computable variants have been proposed. They include localized Delaunay triangulations [9], partial Delaunay triangulations [10], almost Delaunay triangulations [3,4,5], restricted Delaunay graphs [2], constrained Delaunay triangulations [11], and planarized local Delaunay triangulations [14].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Success guaranteed routing in almost Delaunay planar nets for wireless sensor communication

Haider

Imahori

Sugihara

2011

IJSNET

View full text Add to dashboard Cite

This paper proposes a routing strategy for wireless sensor networks that is valid even when the sensor nodes are distributed nonuniformly. Energy efficiency is the most important consideration in wireless sensor networks; hence, global communication should be achieved by combinations of local messages. We first propose a new underlying graph called the almost Delaunay planar net, which can be calculated from information local to the sensor nodes. We statistically analyze the efficiency of existing routing strategies in the almost Delaunay planar net. We also propose a new routing strategy that always guarantees the reachability on planar graphs, including the almost Delaunay planar net. We show that the proposed routing strategy exhibits good performance if the underlying graph in the sensor network is the almost Delaunay planar net.

show abstract

Constrained Delaunay Triangulation for Ad Hoc Networks

Cited by 8 publications

References 36 publications

Chews First Delaunay Triangulation refinement Scheme-Based Positioning of RSUs for Optimal Network Coverage in VANETs

Chews First Delaunay Triangulation refinement Scheme-Based Positioning of RSUs for Optimal Network Coverage in VANETs

A Data Forwarding Scheme Based on Delaunay Triangulation for Cyber-Physical Systems

Success guaranteed routing in almost Delaunay planar nets for wireless sensor communication

Contact Info

Product

Resources

About