Distributed Topology Control Algorithm Research Articles

RDMST- A Novel Distributed Topology Control Algorithm for Low Probability of Detection Mobile Communication Networks

One aim of a military tactical network is to Lower the Probability of Detection, LPD, in order to hide the network from a possible adversary. Whilst there are numerous ways that communications can be hidden from an adversary the approach used in this paper is to minimise the transmitted power of the network's radios, whilst keeping the radios connected. Results from previous simulation experiments demonstrated the potential efficacy of these algorithms. In this paper we have implemented these algorithms into mobile radios and performed field trials to determine whether the LPD algorithm would transfer over into a more realistic environment. Problems associated with the noisy wireless medium were overcome and promising results obtained. This paper describes the field trials of the LPD algorithm, discusses some emerging issues, and presents the results from these trials.

Performance Evaluation of UAV-Enabled LoRa Networks for Disaster Management Applications

In hostile and remote environments, such as mountains, forests or suburban areas, traditional communications may not be available, especially after a disaster, such as a flood, a forest fire or an earthquake. In these situations, the wireless networks may become congested or completely disrupted and may not be adequate to support the traffic generated by rescuers. It is also considered as the key tool in Corona Virus (COVID-19) battle. Moreover, the conventional approaches with fixed gateways may not work either, and this might lead to decoding errors due to the large distance between mobile nodes and the gateway. To avoid the decoding errors and improve the reliability of the messages, we propose to use intermediate Unmanned Aerial Vehicles (UAVs) to transfer messages from ground-based Long Range (LoRa) nodes to the remote base station (BS). Specifically, this UAV-enabled LoRa architecture is based on the ad hoc WiFi network, wherein, UAVs act as relays for the traffic generated between LoRa nodes and BS. To make the architecture more efficient, a distributed topology control algorithm is also proposed for UAVs. The algorithm is based on virtual spring forces and movement prediction technique that periodically updates the UAV topology to adapt to the movement of the ground-based LoRa nodes that move on the surface. The simulation results show the feasibility of the proposed approach for packet reception rate and average delay quality of service (QoS) metrics. It is observed that the mechanisms implemented in a UAV-enabled LoRa network effectively help to improve the packet reception rate with nominal buffer delays.

Topology Control in Hybrid VLC/RF Vehicular Ad-Hoc Network

Vehicular ad-hoc network (VANET) is a promising technology to realize communications among vehicles in intelligent transportation systems. Conventional VANET utilizes radio frequency (RF) for vehicle to vehicle communications. However, as the vehicle density increases, RF-based VANET suffers from limited bandwidth and unavoidable interference. Visible light communication (VLC) is emerging as a complement candidate, which possesses the advantages of wide spectrum, high power efficiency and low interference, but also has the drawback of limited communication range. Therefore, the hybrid VLC/RF structure is beneficial to an efficient and reliable VANET. Since there are usually no center infrastructures in VANET and different vehicles could have different preferences, the distributed and non-cooperative topology control (TC) should be investigated for the establishment of VLC and RF links among various vehicles to satisfy some properties, e.g., interference level, power consumption, connectivity and delay requirements. Conventional TC schemes designed particularly for RF-based ad-hoc network can not be applied directly due to the distinctive features of VLC and RF links. In this paper, the TC problem for the hybrid VLC/RF VANET is modeled as a potential game. When considering the different features of the two kinds of links, a distributed TC algorithm is proposed to handle the TC game, in which the RF and VLC transmitting power of each vehicle is locally adapted based on the vehicle’s local knowledge about the VANET topology and can converge to a Nash Equilibrium state.

Distributed Topology Control Algorithm Based on Load Balancing Evaluation Model in Wireless Sensor Networks

In wireless sensor networks, the unbalanced load of nodes is easy to cause low energy nodes die prematurely. It may lead network collapse. According to the problem of unbalanced load and short network lifetime, we research the relationship between neighbour-residual energy, transmission power and load. Considering the centralized algorithm causes larger information easily, we introduce the distributed thought. Then a load balancing evaluation model is constructed. It is reasonable and effective, which is proved by Lyapunov stability theorem and Lagrange multiplier method. After that, a distributed topology control algorithm based on load balancing evaluation model (LBEM) is proposed. The simulation results show that LBEM can balance network load and energy consumption to enhance network lifetime.

NetADD: Network Flow-Based Distributed Topology Control on Addressing Asymmetric Data Delivery in Nanonetworks.

Architecting nanonetwork-based coronary heart disease monitoring requires a set of nanodevice-embedded drug-eluting stents (nanoDESs) inserted inside the affected sites of coronary arteries of the heart to cooperatively collect medical information therein and transmit the information via the nano-macro (NM) interface, which is inserted into the intercostal space of the rib cage. These nanonetworks, which operate in the terahertz band (0.1-10 THz), face increased complexity in delivering the data of underlying nanonetworks to the NM, due to the limited energy content of nanoDESs. In this paper, we propose a distributed topology control algorithm based on the solution of the well-known network flow problem for addressing asymmetric data delivery. The generated topology is dynamic in the sense that it changes according to the energy levels of the nanoDESs. The proposed algorithm helps establish the topology and balance the load on nanoDESs. The proposed approach changes the topology if there arises a need to balance the energy content of the nanoDESs. We study the problem of asymmetric data delivery in various types of network topologies as well. The proposed solution is shown via extensive simulation to yield improved performance over the existing topology control solutions with respect to data delivery ratio, energy consumption, delay, and the events of shutdown.

Fault-Tolerant Topology Control Towards <inline-formula> <tex-math notation="LaTeX">${K}$ </tex-math> </inline-formula>-Channel-Connectivity in Cognitive Radio Networks

In a cognitive radio network (CRN), connectivity is essential for the information exchange between secondary users (SUs). However, the unpredictable activities of primary users (PUs) may result in an unconnected network. Most of the existing works could only guarantee the CRN’s connectivity with one channel reclaimed by PU, without considering a more general case that PUs request multiple channels simultaneously, and thus, a network partition may occur more likely. In this paper, first, k-channel-connectivity is defined to derive a CRN that remains connected whenever any $k-1$ channels are occupied concurrently. Then, we propose both centralized and distributed topology control algorithms to ensure both the ${k}$ -channel-connected and conflict-free properties. Particularly, it is accomplished by ensuring that any $k-1$ independent sets (i.e., groups of SUs transmitting on the same channel) are not any vertex-cut set of the CRN. Next, the correctness of both the algorithms is verified via theoretical analysis; meanwhile, the analysis demonstrates that the proposed algorithms can achieve the target with a reasonable computation complexity, and in particular, the distributed one can work with limited local information. Finally, simulation results reveal that the proposed algorithms enable the reduction of not only the required channels but also the power consumption of the CRN.

Energy Management Dynamic Control Topology In MANET

Topology management via per-node transmission power adjustment has been shown effective in extending network lifetime. The existing algorithms constructs static topologies which fail to take the residual energy of network nodes, and cannot balance energy consumption efficiently. To address this problem, a Light Weighted Distributed Topology Control algorithm EMDCT(Energy Management Dynamic Control Topology ) is proposed in this paper. Based on the link metric of the network, both the energy consumption rate level and residual energy levels at the two end nodes are considered. EMDCT generates a Dynamic Topology that changes with the variation of node energy without the aid of location information, each node determines its transmission power according to local network information, which reduces the overhead complexity of EMDCT greatly. The experiment results show that EMDCT preserves network connectivity and manitains minimum-cost property of the network also it can extend network lifetime more remarkably.

A Cross Layer Distributed Topology Control Algorithm for Mobile Ad Hoc Networks

Objectives: Mobile Ad-Hoc Networks (MANETs) have several constraints because of its changing nature. So the routing and topology control algorithms for MANETs should be designed in such a way that on any instance the network should ensure minimum interference among the nodes. Hence there is always a need for Quality of Service (QoS). This is contradictory to the objective of minimizing interference. Analysis of Methods: The existing topology control algorithms have taken only the interference as the deciding factor. But the implementation of those works have failed to justify that interference caused delay and thereby the QoS. Several security related issues are there in MANETs. The commonly used security strategy for MANET is Certificate management. In Voting based revocation systems, time consumption and communication overheads are high. In non-Voting based revocation systems, security is at risk. Findings: So in the proposed work, the delay-constrained topology control problem is taken with delay and security as performance metrics. The delay caused due to transmission, contention and queuing delay are taken into account in the proposed algorithm. How the mobility of a node plays a major role in MANET is investigated and the unstable links along with malicious nodes are removed from the topology. Improvement: The results obtained from this proposed cross-layer distributed algorithm for MANETs, where delay plays a crucial role are compared with the existing protocols and has proven to be more advantageous.

A distributed lightweight Redundancy aware Topology Control Protocol for wireless sensor networks

WSN consists of a large number of sensor nodes randomly deployed, and, in many cases, it is impossible to replace sensors when a node failure occurs. Thus, applications tend to deploy more nodes than necessary to cope with possible node failures and to increase the network lifetime, which leads to create some sensing and communication redundancy. However, sensors in the same region, may collect and forward the same information, which will waste more energy. In this paper, we propose a distributed Lightweight Redundancy aware Topology Control Protocol (LRTCP) for wireless sensor networks. It exploits the sensor redundancy in the same region by dividing the network into groups so that a connected backbone can be maintained by keeping a minimum of working nodes and turning off the redundant ones. LRTCP identifies equivalent nodes in terms of communication based on their redundancy degrees with respect of some eligibility rules. Simulation results indicate that, compared with existing distributed topology control algorithms, LRTCP improves network capacity and energy efficiency.

Energy-Efficient Distributed Topology Control Algorithm for Low-Power IoT Communication Networks

Topology control is one of the significant research topics in traditional wireless networks. The primary purpose of topology control ensures the connectivity of wireless nodes participated in the network. Low-power Internet of Things communication networks look like wireless network environments in which the main communication devices are wireless devices with limited energy like battery. In this paper, we propose a distributed topology control algorithm by merging the combinatorial block design from a design theory with the multiples of 2. The proposed technique especially focuses on asynchronous and asymmetric neighbor discovery. The concept of block design is used to generate the neighbor discovery schedule when a target duty cycle is given. In addition, the multiples of 2 are applied to overcome the challenge of the block design and support asymmetric operation. We analyze the worst case discovery latency and energy consumption numerically by calculating the total number of slots and wake-up slots based on the given duty cycle. It shows that our proposed method has the smallest total number of slots and wake-up slots among existing representative neighbor discovery protocols. The numerical analysis represents the proposed technique find neighbors quickly with minimum battery power compared with other protocols for distributed topology control. For future research direction, we could perform a simulation study or real experiment to investigate the best parameter for choosing the multiple of a certain number.

EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Control Algorithm for Mobile Ad Hoc Network

EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Control Algorithm for Mobile Ad Hoc Network

Cooperative Topology Control with Adaptation for improved lifetime in wireless sensor networks

Topology control algorithms allow each node in a wireless multi-hop network to adjust the power at which it makes its transmissions and choose the set of neighbors with which it communicates directly, while preserving global goals such as connectivity or coverage. This allows each node to conserve energy and contribute to increasing the lifetime of the network. In this paper, we consider (i) both the energy costs of communication as well as the amount of available energy at each node, (ii) the realistic situation of varying rates of energy consumption at different nodes, and (iii) the fact that co-operation between nodes, where some nodes make a sacrifice by increasing energy consumption to help other nodes reduce their consumption, can be used to extend network lifetime. This paper introduces a new distributed topology control algorithm, called the Cooperative Topology Control with Adaptation (CTCA), based on a game-theoretic approach that maps the problem of maximizing the network’s lifetime into an ordinal potential game. We prove the existence of a Nash equilibrium for the game. Our simulation results indicate that the CTCA algorithm extends the life of a network by more than 50% compared to other algorithms. We also study the performance of the distributed CTCA algorithm in comparison to an optimal centralized algorithm as a function of the communication ranges of nodes and node density.

A Topology Control Algorithm for Sensor Networks Based on Robust Optimization

In recent years, wireless sensor networks have been widely used in data acquisition, surveillance, event monitoring, and so forth. Topology control is an important issue in designing sensor networks. Considering the uncertainty of distance between nodes, a distributed topology control algorithm named as LRMST, which is based on the local minimum spanning tree (LMST) algorithm, is proposed by applying the 0-1 robust discrete optimization theory. Firstly, when only the cost coefficients are subject to uncertainty, it is proved that the robust counterpart of the 0-1 discrete optimization problem on n variables can be solved by solving at most [Formula: see text] deterministic problems, where Γ denotes the number of cost coefficients which change in an uncertainty set. Then we present a robust model for the MST problem under distance uncertainty. According to the proved conclusion, an algorithm is proposed to obtain the robust solution of uncertain MST problem by solving only one deterministic MST problem, after which LRMST algorithm is designed when the distance between nodes is affected by uncertainty. Simulation results show that LRMST algorithm tends to select some edges whose estimated distance is slightly longer and obtains the robustness when the distance is uncertain at the expense of less optimal value compared with LMST algorithm.

Achieving Bi-Channel-Connectivity with Topology Control in Cognitive Radio Networks

In cognitive radio networks (CRNs), secondary users (SUs) must vacate the spectrum when it is reclaimed by the primary users (PUs). As such, multiple SUs transmitting on the same channel will be affected when the channel is requested by the PUs, thereby resulting in a possible network partition of CRNs. Therefore, how to maintain the connectivity of CRNs considering the activity of PUs is a critical problem. In this paper, we propose a centralized and a distributed topology control algorithm respectively to address this problem. Particularly, we combine power control and channel assignment to construct a bi-channel-connected and conflict-free topology using the minimum number of channels. In the power control phase, we tailor the topology for the channel assignment in the second phase. In the channel assignment phase, we utilize the graph coloring algorithm to achieve conflict-free transmission by assigning a channel to each SU. Theoretical analysis and simulation study show that the derived topology can maintain connectivity in the event of any single channel interruption by PUs. Simulation results also demonstrate that the proposed algorithms can efficiently reduce the average number of required channels for achieving bi-channel-connectivity and conflict-free transmission and ensure that the minimum power paths in the original network preserved in the final topology.

A Topology Control Algorithm Based on Pass Loss for Wireless Sensor Network

We present PLTC,a distributed topology control algorithm that based on pass-loss for wireless sensor network .In contrast to the algorithm based on RSSI,it can be applied on a heterogeneous network and nodes with different transmitting power.In this paper,we discuss the shortcomings of other parameters used to determine the link quality and present PLTC.We evaluate PLTC by analytic proofs and simulation results.The result shows it has good performance on bounded degree,connectivity and planarity.

Distributed topology control algorithm on broadcasting in wireless sensor network

Topology control can enhance energy efficiency and prolong network lifetime for wireless sensor networks. Several studies that attempted to solve the topology control problem focused only on topology construction or maintenance. This work designs a novel distributed and reliable energy-efficient topology control (RETC) algorithm for topology construction and maintenance in real application environments. Particularly, many intermittent links and accidents may result in packet loss. A reliable topology can ensure connectivity and energy efficiency, prolonging network lifetime. Thus, in the topology construction phase, a reliable topology is generated to increase network reachable probability. In the topology maintenance phase, this work applies a novel dynamic topology maintenance scheme to balance energy consumption using a multi-level energy threshold. This topology maintenance scheme can trigger the topology construction algorithm to build a new network topology with high reachable probability when needed. Experimental results demonstrate the superiority of the RETC algorithm in terms of average energy consumption and network lifetime.

A new distributed topology control algorithm based on optimization of delay and energy in wireless networks

Topology Control (TC) is one of the most important techniques used in wireless networks to obtain the desired network property. Most existing works with regard to TC focus on reducing energy consumption. Even though there are some works to consider delay in their resulting topologies, they do not consider the effect of radio interference on delay. Aiming at wireless sensor networks, we model a link delay as a function of the signal to interference noise ratio of the receiving node in this link and its packet forwarding time, and take a weight sum of delay and energy consumption as weight of edge (or link). The minimum weight sum of any edge can be solved by using the Get_min-cost_of_edge_(i,j) algorithm proposed in this paper. An Optimal Edge-cost Topology Control (OETC) algorithm is proposed to ensure that all approximate minimum-edge-cost paths exist in final topology. We also propose a Distributed Symmetric Link Maintenance (DSLM) algorithm to ensure that all links are symmetric in final topology if all links in original topology are symmetric. We prove that the communication complexity and computational complexity in OETC+DLSM are O(Nu) and O(Ne∗Nu2) respectively, where Nu denotes the number of any node u’s neighbors and Ne denotes the times of executing the Get_min-cost_of_edge_(i,j) algorithm. Furthermore, we verify through simulation that the network topologies produced by OETC+DLSM show good performance in terms of expected average link delay and node hop-count while keeping average energy consumption at an acceptable level.

An Energy-Balance Based Distributed Topology Control Algorithm for Wireless Sensor Networks

Topology control is an efficient approach which can reduce energy consumption for wireless sensor networks, and the current algorithms mostly focus on reducing the nodes’ energy consumption by power adjusting, but pay little attention to balance energy consumption of the whole network, which results in premature death of many nodes. Thus, a distributed topology control algorithm based on path-loss and residual energy (PRTC) is designed in this paper. This algorithm not only maintains the least loss links between nodes but also balances the energy consumption of the network. The simulation results show that the topology constructed by PRTC can preserve network connectivity as well as extend the lifetime of the network and provide good performance of energy consumption.

Connected Dominating Set Topology Control Algorithm of Heterogeneous Wireless Sensor Networks

By using the theory of minimum connected dominating set,the issue of topology optimization for heterogeneous wireless sensor networks is studied.Considering the heterogeneous feature of sensor nodes' communication capabilities,a function named area energy consumption rate has been built by integrating the quality of communication links,the transmission range and the remaining energy of nodes.This function has been used to estimate the energy consumption rate of communication areas and determine the selection of dominating nodes.Thus,a distributed topology control algorithm which is minimum connected,has been proposed.The experimental results show that network topology constructed by this algorithm has reliable communication links and high efficiency of energy utilization.It has the potential to significantly prolong the lifecycle of heterogeneous wireless sensor networks.

Path-Loss Based Distributed Topology Control Algorithm for Wireless Sensor Networks

对无线传感器网络中目前最常用的3种链路度量标准进行分析和比较得出,在满足一定收包率要求时,节点的接收信号强度存在一个最小阈值.考虑接收信号强度作为拓扑构建条件时需节点具备相同发射功率的不足,提出将路径损耗大小作为拓扑构建的条件,设计了一种分布式拓扑控制算法——PLBD.该算法在保证收包率的同时,还使各节点之间的通信保留最小损耗链路.仿真结果表明,PLBD算法构建的拓扑不仅能够保证网络连通性,还具有通信时延低,健壮性好,能量消耗相对均衡的特点.