Energy-efficient Topology Control Algorithm Research Articles

An energy-efficient topology control algorithm for optimizing the lifetime of wireless ad-hoc IoT networks in 5G and B5G

Wireless ad-hoc IoT (WAIoT) is promising in providing connections for a considerable amount of devices in the next generation (5G and beyond 5G) networks. A challenge in WAIoT networks is that most network nodes are not stable due to the limited power supply (such as a battery). In this paper, we focus on balancing node residual energy and node degree to prolong the network lifetime. We first present a statistic-based algorithm (named ED-index) for evaluating the network topology and further develop an energy-efficient topology control algorithm (named EDTC). The EDTC algorithm leverages the maximum spanning tree algorithm to build a robust backbone topology and utilizes the proposed ED-index algorithm to re-introduce some edges to the topology. We also present a graph convolutional network (GCN) based algorithm to imitate the initial EDTC algorithm through learning. In the random communication experiment, the proposed EDTC algorithm achieves two times the network lifetime than the state-of-the-art. Moreover, the GCN-based EDTC algorithm saves around 99% optimization time than the initial EDTC algorithm when the number of network nodes is 100.

A Game Theoretical Approach for Topology Control in Wireless Ad Hoc Networks with Selfish Nodes

In ad hoc networks, a significant amount of energy available to devices is utilized in network management operations. Since devices have limited energy resources, therefore, they drop data packets of other nodes to reduce their energy consumption. This selfish behaviour increases number of retransmissions over the link which increases energy consumption of the source node, introduces time delays, and degrades throughput of the network. Although conventional distributed topology control solutions minimize energy utilization of the nodes by adjustment of transmission power, however, selfish behaviour by devices introduce additional complexity in design which make topology control a challenging task. In this paper, we proposed Energy Efficient Topology Control Algorithm (EETCA) using game theoretical approach, in which, utility of the node depends on selfishness of the neighbors, link traffic rate, and link length. In decision-making step, nodes remove the links with other nodes that have high drop rate under the condition that network remains connected. We show that Nash Equilibrium point of the proposed game results in Pareto optimal network topology. We compare results of EETCA with Optimum (OPT) and Minimum Least Power Path Tree (MLPT) algorithms presented in literature. We carried our simulations under multiple sources scenario which show that EETCA outperforms previous approaches when number of nodes in the network increases. Furthermore, we simulate the performance of Ad-hoc On-demand Distance Vector (AODV) routing protocol under EETCA topology and compare it with MLPT and OPT topologies. The results show that the ad hoc network constructed using proposed solution substantially improves throughput of AODV routing protocol as compared to MLPT and OPT topology control algorithms.

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.

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

Distributed Energy-Efficient Topology Control Algorithm in Home M2M Networks

Because machine-to-machine (M2M) technology enables machines to communicate with each other without human intervention, it could play a big role in sensor network systems. Through wireless sensor network (WSN) gateways, various information can be collected by sensors for M2M systems. For home M2M networks, this study proposes a distributed energy-efficient topology control algorithm for both topology construction and topology maintenance. Topology control is an effective method of enhancing energy efficiency and prolonging network lifetime. During the topology construction phase, each node builds a new topology based on the best parent node. Nodes can extend the network lifetime by adjusting transmission power to control the topology. In the topology maintenance phase, each node monitors the energy status of neighbors and triggers topology construction as needed. By balancing energy consumption, topology maintenance also avoids the hot spot problem. Simulation results confirm the superior performance of the proposed algorithm for distributed energy-efficient topology control (DETC) in terms of energy efficiency and network lifetime in home M2M networks.

The restricted shortest-path-based topology control algorithm in wireless multihop networks

In this paper, we present an energy-efficient topology control algorithm named RLSP. The algorithm first tries to preserve the minimum-energy paths. However, when a node finds it needs a large transmission power to cover some of its logical neighbors, it uses two-hop paths to reach them instead of using single links. Simulation results show that RLSP can effectively decrease the transmission power and reduce the energy consumption when transmitting.