China
Africa
Explore chapters and articles related to this topic
Modeling and Simulation Tools for Mobile Ad Hoc Networks
Published in Jonathan Loo, Jaime Lloret Mauri, Jesús Hamilton Ortiz, Mobile Ad Hoc Networks, 2016
Kayhan Erciyes, Orhan Dagdeviren, Deniz Cokuslu, Onur Yılmaz, Hasan Gumus
A unit disk graph (UDG) is a special instance of a graph in which each node is identified with a disk of unit radius r = 1, and there is an edge between two nodes u and v if and only if the distance between u and v is at most 1 [2,3]. The model is depicted in Figure 3.1a. Each node’s transmission range is drawn as a dotted circle. The edges, which connect nodes, are drawn as straight lines. The neighbors of node u are node v, node w, node y, and node z as shown in the simplified graph in Figure 3.1b.
Dominating Set Theory and Algorithms
Published in Jiguo Yu, Xiuzhen Cheng, Honglu Jiang, Dongxiao Yu, Hierarchical Topology Control for Wireless Networks, 2018
Jiguo Yu, Xiuzhen Cheng, Honglu Jiang, Dongxiao Yu
Given a deterministic α, 0 < α ≤ 1. Graph G is a quasi-unit disk graph (QUDG), for two arbitrary nodes u, v ∊ V, if |uv| ≤ α, {u, v} ∊ E and if |uv| > 1, {u, v} ∉ E. If α = 1, G is a UDG. Barrière et al. first proposed a communication model based on QUDG [3]. Since it cannot ensure that QUDG can obtain a plane and connected spanning subtree, there are not so many topology control protocols on QUDG.
GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN
Published in Optimization Methods and Software, 2021
Roman Plotnikov, Adil Erzin, Vyacheslav Zalyubovskiy
For generating the test instances we used the examples of points allocation for the Euclidian Steiner Tree Problem from the Beasley's OR-Library (http://people.brunel.ac.uk/mastjjb/jeb/orlib). In each of these instances, a set of points are spread inside a planar square with a side of unit length. To simulate the communication network, we generated a unit disk graph-based (UDG) topology on the given set of nodes. We use the following definition of UDG taken from [5]. Given n points in the plane and some specified bound d, the unit disk graph is an undirected graph with n vertices corresponding to the given n points, where an edge connects two vertices if and only if the Euclidean distance between the two corresponding points does not exceed critical distanced. This is one of the most commonly used models for communication networks where each element has the same transmission range equal to the critical distance of the corresponding UDG. As a sink node, we always chose the vertex that lies closer to the square centre.