Computational Geometry is a branch of Computer Science that focuses on algorithms solving geometricproblems. Computational Geometry has applications in various fields such as Modern Engineering and Mathematics, Compu...
详细信息
ISBN:
(纸本)9783031734168;9783031734175
Computational Geometry is a branch of Computer Science that focuses on algorithms solving geometricproblems. Computational Geometry has applications in various fields such as Modern Engineering and Mathematics, Computer Graphics, Robotics, VLSI design, Computer-Aided design, Molecular Modeling, Metallurgy, Manufacturing, Textile design, Forestry, and Statistics. Graph theory is useful in defining problems and determining structural relationships. Hundreds of interesting computational problems are stated in graphs. In this study, the term of a circuit that more tightly covers the vertex set of the Euclidean complete graph has been defined, and an algorithm has been proposed to find this circuit. The complexity of the proposed algorithm is O(n). The proposed Boundary Point term in our presented work given in [5] allows for the expansion of the defined set of Boundary Vertices, enabling a more tightly construction of the Circuit Covering the Graph. The proposed algorithm can be applied to geometric design problems.
Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink. Besides striving for elongated lifetime...
详细信息
ISBN:
(纸本)9781457705137
Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink. Besides striving for elongated lifetimes, many applications of WSNs are time-sensitive, i.e., they strongly benefit from bounds on the message transfer delay. Further, large WSNs require multiple sinks in order to scale well with respect to delay and lifetime. Therefore, it becomes very interesting to investigate how to plan the trajectories of multiple mobile sinks such that lifetime and delay goals are met simultaneously. To that end, we propose a geometrically principled heuristic for finding good trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs. First, we discuss the high analytical challenges of optimally planning the trajectories of multiple mobile sinks. Based on this, we relax the problem by transforming it into a geometric design problem, which, subsequently, is solved in closed form. In simulations, we investigate how well this geometric heuristic for sink trajectories of multiple mobile sinks performs with respect to delay and lifetime. We find that it excels especially in large-scale WSNs, for example in a WSN with 500 nodes and 20 sinks, it roughly cuts delay bounds by 50% while tripling the lifetime compared to the sinks following random walks. Hence planning the sink trajectories carefully really pays off.
暂无评论