Topology Control Algorithm Research Articles

Foundation of Reactive Local Topology Control

We formalize the concept reactive (aka contention-based or beaconless) topology control and its underlying problem statement. By means of message complexity, we define the classes of O(k)- and Ω(k)-reactive topology control algorithms which allow us to distinguish reactive from conventional local approaches and to classify the former. Moreover, based on our formalisms we prove two fundamental propositions regarding the reactive computability of standard topology control structures. Thus, our contribution not only establishes a taxonomy for identification of research gaps, but constitutes a theoretical foundation for profound investigation of this algorithm classes' principal power.

Heterogeneous Node Deployment Model Based on Area Topology Control in WSNs

Balanced energy consumption in WSNs is the key to maximize network lifetime. After analyzing laws of energy consumption of WSNs, a heterogeneous node deployment model based on area topology control is proposed in this paper. It utilizes predetermined heterogeneous node deployment to balance area energy consumption ratio and the topology control algorithm based on area energy consumption ratio to maintain dynamic equilibrium energy consumption. Simulation results show that our model takes a superior performance on maintaining network coverage, balancing energy consumption, and maximizing network lifetime. Compared with similar WSNs deployment models, our model can be more efficient to prolong network lifetime and has advantages in reducing dependence on deployment accuracy, balancing dynamic energy consumption, and improving lifetime in poor network environment.

Energy-efficient topology control algorithm for maximizing network lifetime in wireless sensor networks with mobile sink

Uneven energy consumption is an inherent problem in wireless sensor networks characterized by multi-hop routing and many-to-one traffic pattern. Such unbalanced energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of prolonging network lifetime in large-scale wireless sensor networks where a mobile sink gathers data periodically along the predefined path and each sensor node uploads its data to the mobile sink over a multi-hop communication path. By using greedy policy and dynamic programming, we propose a heuristic topology control algorithm with time complexity O(n(m+nlogn)), where n and m are the number of nodes and edges in the network, respectively, and further discuss how to refine our algorithm to satisfy practical requirements such as distributed computing and transmission timeliness. Theoretical analysis and experimental results show that our algorithm is superior to several earlier algorithms for extending network lifetime.

An Augmentation of Topology Control Algorithm for Energy Saving in WSN Integrated into Street Lighting Control

Energy saving and improve the life time of the sensor node is main focus in the recent years for the researchers hence one of the application domain (Street light monitoring and controlling) of sensor required attention towards this direction. For contributing in this domain we have proposed a scheme for Street light controlling using distributed topology control (TC). The optimize version of A3 protocol reduces the number of messages send/received by the sensors which ultimately leads to the reduction of energy requirement. Experiments are carried on street light scenario for different no. of nodes by maintaining communication using Zigbee protocol. The performance of our extension is evaluated using, no. of messages send/receive & energy consumed during topology building and our approach is having good results as compared to the approach used for this type of network.

Simultaneous power control and power management algorithm with sector-shaped topology for wireless sensor networks

Abstract In this paper, we propose a topology control technique to reduce the energy consumption of wireless sensor networks (WSNs). The technique makes use of both power control and power management methods. The algorithm uses the power management technique to put as many idle nodes as possible into the sleep mode while invoking the power control method to adjust the transmission range of the active nodes. On the contrary to earlier works in which both of these methods were used separately, in this algorithm, they are utilized simultaneously to decide about the sleep nodes and the ranges of active nodes. It is an approximation algorithm which is called simultaneous power control and power management algorithm (SPCPM). The performance bound of this centralized algorithm is determined analytically. Then, to make the proposed method practical for WSNs, a distributed algorithm based on SPCPM is introduced. To assess the efficiency of the proposed algorithm, we compare its average energy consumption with those of three existing topology control algorithms for a sector-based WSN. The simulation results which were obtained for different numbers of transmitting sensor nodes reveal less average energy consumptions for SPCPM compared to other algorithms.

Noncooperative Game-Based Energy Welfare Topology Control for Wireless Sensor Networks

In this paper, we address the problem of minimizing energy consumption and balancing energy in a wireless sensor network, using a topology control algorithm. Such an algorithm is able to minimize and balance energy consumption by reasonably tuning the transmission power level while preserving network connectivity. This paper proposes an energy welfare topology control using game theory approach, which adopts the welfare function from social sciences to compute energy welfare as a goodness measure for energy populations. When each node tries to maximize the energy welfare of its local society, it collectively leads to energy balancing. We show that the resulting game is a potential game and that it possesses a unique Nash equilibrium, which is Pareto optimal. To evaluate the performance of the proposed algorithm, extensive simulations were carried out, and the results were compared with the existing algorithm. The results demonstrated the superiority of the proposed algorithm over the existing algorithm.

Interference-Based Topology Control Algorithm for Delay-Constrained Mobile Ad Hoc Networks

As the foundation of routing, topology control should minimize the interference among nodes, and increase the network capacity. With the development of mobile ad hoc networks (MANETs), there is a growing requirement of quality of service (QoS) in terms of delay. In order to meet the delay requirement, it is important to consider topology control in delay constrained environment, which is contradictory to the objective of minimizing interference. In this paper, we focus on the delay-constrained topology control problem, and take into account delay and interference jointly. We propose a cross-layer distributed algorithm called interference-based topology control algorithm for delay-constrained (ITCD) MANETs with considering both the interference constraint and the delay constraint, which is different from the previous work. The transmission delay, contention delay and the queuing delay are taken into account in the proposed algorithm. Moreover, the impact of node mobility on the interference-based topology control algorithm is investigated and the unstable links are removed from the topology. The simulation results show that ITCD can reduce the delay and improve the performance effectively in delay-constrained mobile ad hoc networks.

A Distributed Fault-Tolerant Topology Control Algorithm for Heterogeneous Wireless Sensor Networks

This paper introduces a distributed fault-tolerant topology control algorithm, called the Disjoint Path Vector (DPV), for heterogeneous wireless sensor networks composed of a large number of sensor nodes with limited energy and computing capability and several supernodes with unlimited energy resources. The DPV algorithm addresses the $k$ -degree Anycast Topology Control problem where the main objective is to assign each sensor’s transmission range such that each has at least $k$ -vertex-disjoint paths to supernodes and the total power consumption is minimum. The resulting topologies are tolerant to $k-1$ node failures in the worst case. We prove the correctness of our approach by showing that topologies generated by DPV are guaranteed to satisfy $k$ -vertex supernode connectivity. Our simulations show that the DPV algorithm achieves up to 4-fold reduction in total transmission power required in the network and 2-fold reduction in maximum transmission power required in a node compared to existing solutions.

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.

Effective link interference model in topology control of wireless Ad hoc and sensor networks

Topology control is an important way of reducing the link interference in wireless Ad hoc and sensor networks with shared channel. Modeling link interference is the primary step for designing interference-aware topology controls, and it is very critical to the efficacy of the topology control schemes in use. This paper presents a new link interference model, which can not only be easily calculated with global or local algorithms, but also more effectively profile the link interference in co-channel wireless Ad hoc and sensor networks than previous models. Based on the proposed model, a centralized topology control algorithm is designed to construct interference-optimal topologies. In fact, our model can also be fed into most of the already-existed topology control algorithms aimed at reducing link interferences. Finally, extensive simulations and analysis are conducted to evaluate our designs in detail. The simulation results show the outstanding effectiveness of interference reduction achieved by our model and algorithm, in comparison with the previous work.

Joint network lifetime and delay optimization for topology control in heterogeneous wireless multi-hop networks

The network lifetime maximization and the end-to-end delay minimization are tackled by jointly considering the two topology performance indexes in wireless multi-hop networks. Based on the existing eligibility metric for energy efficiency, as well as the new defined metrics for fair energy consumption and end-to-end delay, a new eligibility metric is modeled as ψtup (or ψtdown). From a node’s view point, the estimation over the neighboring nodes is made according to their ψtup (or ψtdown). The Lifetime and Delay based localized Topology Control (LDTC) algorithm is proposed to construct the topology, in which each node keeps its k physical neighbors with maximum ψtup (or ψtdown) as its logical neighbors. Then the Distributed Topology Symmetry (DTS) algorithm is proposed to enforce topology symmetry. Finally, we present the Distributed Logical Neighbor Adjustment (DLNA) algorithm, by which each node adjusts its logical neighbors during the interval between two successive executions of the LDTC and DTS algorithm in order to have nodes exhaust their energy fairly. The simulation results confirm that, under the most simulation settings, our topology control scheme has the minimized imbalance energy reserve and end-to-end delay when compared with the existing similar works. These results show that our topology control scheme suits to prolong the lifetime of the network and also satisfies the demand for low end-to-end delay.

A topology control algorithm for autonomous underwater robots in three-dimensional space using PSO

Data collection from seabed by means of underwater wireless sensor networks (UWSN) has recently attracted considerable attention. Autonomous underwater vehicles (AUVs) are increasingly used as UWSNs in underwater missions. Events and environmental parameters in underwater regions have a stochastic nature. Sensors to observe and report events must cover the target area. A ‘topology control algorithm’ characterizes how well a sensing field is monitored and how well pairs of sensors are mutually connected in UWSNs. It is prohibitive to use a central controller to guide AUVs’ behavior due to ever changing, unknown environmental conditions, limited bandwidth and lossy communication media. In this research, a completely decentralized three-dimensional topology control algorithm for AUVs is proposed. It is aimed at achieving maximal coverage of the target area. The algorithm enables AUVs to autonomously decide on and adjust their speed and direction based on the information collected from their neighbors. Each AUV selects the best movement at each step by independently executing a Particle Swarm Optimization (PSO) algorithm. In the fitness function, the global average neighborhood degree is used as the upper limit of the number of neighbors of each AUV. Experimental results show that limiting number of neighbors for each AUV can lead to more uniform network topologies with larger coverage. It is further shown that the proposed algorithm is more efficient in terms of major network parameters such as target area coverage, deployment time, and average travelled distance by the AUVs.

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.

Topology control in network-coding-based-multicast wireless sensor networks

Network coding is a promising technique to improve throughput and reliability. However, the benefit of network coding is restricted and affected by network topology, especially in wireless sensor networks (WSNs). Topology control algorithms adjust the transmission parameters of sensors, chiefly transmission power to achieve a desired topology. So both network coding and topology control algorithms reduce and improve WSN's lifetime. We provide a detailed analytical evaluation of an optimal topology control in network–coding–based–multicast WSNs as a mixed integer non–linear problem. Although this problem is NP–hard, but the mathematical formulation can help us assess the essence and understand the hardness of this problem. We then propose a heuristic algorithm for topology control in network–coding–based–multicast WSNs that run much faster. The efficiency of our algorithm is demonstrated by simulation results under different traffic patterns. We conclude that our algorithm can be used to control the topology of multicast–capable WSNs with significantly better lifetime when compared with conventional algorithms.

Delay Minimization Topology Control in Planetary Surface Network: An Autonomous Systems Approach

This paper investigates the topology control problem in the planetary surface network (PSN) of Interplanetary Internet (IPN) using an autonomous system (AS) approach. We propose a delay minimization topology control (DMTC) algorithm to achieve low time delay and strong connectivity in the planetary surface network. Compared with the most existing approaches where either the purely centralized or the purely distributed control method is adopted, the proposed algorithm is a hybrid control method. In order to reduce the cost of control, the control message exchange is constrained among neighboring AS networks. We prove that the proposed algorithm could achieve logicalk-connectivity on the condition that the original physical topology isk-connectivity. Simulation results validate the theoretic analysis and effectiveness of the DMTC algorithm.

Topology Control for Connectivity Maintenance in Cooperative Mobile Robot Networks

In multi-robot systems, communication is a critical factor to perform cooperative tasks. Maintain communication in a multi-robot systems is a complex task that is not feasible in certain conditions because the environmental interference or failures in the communication devices. This paper presents a topology control algorithm for maintaining connectivity in a network with dynamic number of mobile robots, using concepts of graphs theory and consensus. The algorithm and the theoretical basis involved are detailed along the paper and simulations evaluating the effectiveness of this algorithm are proposed at the end.

Energy balance and robustness adjustable topology control algorithm for wireless sensor networks

In wireless sensor networks, the interference around the application environment may cause the actual distance between any pair of nodes to fail to be measured accurately. Enclosure graph (EG) model uses this distance between nodes as its weight to construct the topology, which does not fully consider the interference. Consequently it will lead to a large amount of energy consumption induced by the application environment. Even it shortens the survival time. According to the feature of network energy inequality in a wireless sensor network and the defect of EG, we first introduce the adjustable factor of node degree, establish a model of communication metric and a model for the node actual survival time. Then according to the demand of network energy equalization and maximum network lifetime, we quantitatively analyze the network node degree, and achieve its regular pattern. In accordance with this regular pattern and sufficient conditions of function extremum, the maximum node energy consumption and the maximum node actual survival time are deduced. And the corresponding optimal node degree is achieved. Finally, according to the above model, in this paper we propose an energy balance and robustness adjustable topology control algorithm for wireless sensor networks. Theoretical analyses show that this algorithm can guarantee that the network is connected and the link of the network is bi-directionally connected. Experiments show that the network takes advantage of this optimal node degree to obtain the high robustness, thus guaranteeing that the information can be transferred unfailingly. This algorithm can effectively balance the node energy, improve the node survival time, enhance the network robustness, and prolong the network's lifetime.

Self-adaptive sleep scheduling for wireless sensor networks

The wireless sensor network WSN generally includes a large amount of cheap embedded equipment powered by battery. Therefore, the WSN is restricted in the aspect of resource dissipation. When designing WSN it is one of the core problems to optimise the power dissipation in order to lengthen the network life. In real-world usage, nodes of WSN are often densely distributed because nowadays the hardware cost of sensor nodes is relatively low. The net topological structure can be optimised by taking advantage of the data redundancy brought out by extra nodes. Thus we present a Self-Adaptive Sleep Scheduling SASS algorithm against the energy-conserving problem of high-density WSN on the basis of a classic topology control algorithm: ASCENT. We improve the state transition mechanism of ASCENT and take the data redundancy into consideration. Through the experiments, it is proved that SASS is more energy efficient and improves the stability.

Retracted: Reliable and Energy Efficient Topology Control Algorithm Based on Connected Dominating Set for Wireless Sensor Network

Retracted: Reliable and Energy Efficient Topology Control Algorithm Based on Connected Dominating Set for Wireless Sensor Network

Keeping Desired QoS by a Partial Coverage Algorithm for Cluster-Based Wireless Sensor Networks

Many studies were done on design algorithms to completely cover an area. We can call the issue as a complete coverage problem. Although there were many researches about proposing a partial coverage issue; almost all of the studies only focus on lengthening the lifespan of wireless sensor networks (WSNs) but ignore the truth that a wireless sensor network will inevitably lose its coverage because of exhausted energy during the operating time. Lifespan refers to wireless sensor network offering its service to meet the required coverage ratio. In this work, we propose a topology control algorithm for cluster-based wireless sensor networks to keep predefined Quality of Service (QoS) of coverage as long as the sensor nodes can stand. The algorithm forms a multi-hop cluster network with a required connectivity by using a novel cluster head competition scheme and proper transmission of power settings. It can organize sensor nodes into clusters actively to achieve required coverage ratio as long as possible. The algorithm is suitable for practical applications of large-scale or high-density wireless sensor networks due to its distributed processing and scalable cluster topology