A Multi-Domain Awareness routingalgorithm is proposed to reduce the energy consumption in elastic optical networks. By adopting the fragmentation metrics both of the spectrum domain and spatial domain, the blocking p...
详细信息
ISBN:
(纸本)9781728106601
A Multi-Domain Awareness routingalgorithm is proposed to reduce the energy consumption in elastic optical networks. By adopting the fragmentation metrics both of the spectrum domain and spatial domain, the blocking probability of elastic optical networks can be reduced. When new services arrive, they are prioritized to work on existing links to reduce new optical paths and working network components. Then the holding time of existing services is fully considered in order to select the candidate route with a shorter working time and thus improve energy consumption. The simulation results show that the proposed algorithm can effectively reduce the network energy consumption and hence, result in overall lower connection blocking probability.
Clustering and multi-hop routingalgorithms substantially prolong the lifetime of wireless sensor networks (WSNs). However, they also result in the energy hole and network partition problems. In order to balance the l...
详细信息
Clustering and multi-hop routingalgorithms substantially prolong the lifetime of wireless sensor networks (WSNs). However, they also result in the energy hole and network partition problems. In order to balance the load between multiple cluster heads, save the energy consumption of the inter-cluster routing, in this paper, we propose an energy-efficient routing algorithm based on Unequal Clustering Theory and Connected Graph Theory for WSN. The new algorithm optimizes and innovates in two aspects: cluster head election and clusters routing. In cluster head election, we take into consideration the vote-based measure and the transmission power of sensor nodes when to sectionalize these nodes into different unequal clusters. Then we introduce the connected graph theory for inter-cluster data communication in clusters routing. Eventually, a connected graph is constituted by the based station and all cluster heads. Simulation results show that, this new algorithm balances the energy consumption among sensor nodes, relieves the influence of energy-hole problem, improve the link quality, achieves a substantial improvement on reliability and efficiency of data transmission, and significantly prolongs the network lifetime.
Recent technological advancements in wireless communication technologies and networking have enabled the Internet of Things (IoT) systems' designing. Since the wireless sensor networks refer to networks of embedde...
详细信息
Recent technological advancements in wireless communication technologies and networking have enabled the Internet of Things (IoT) systems' designing. Since the wireless sensor networks refer to networks of embedded IoT devices to provide sensing services with limited energy and storage resources, the energy consumption is an important requirement for communication in IoT applications. Clustering algorithms have been investigated as a technique for energy conservation in networks with scarce resources. The appropriate cluster head balances the load in the network, lowering energy consumption and extending the network lifetime. An energy-saving solution is proposed based on an effective cluster head selection method that assigns cluster heads to nodes based on which have the highest energy level. The proposed algorithm is called Adaptive Dynamic Multi-Hop-Low energy Adaptive Clustering Hierarchy (ADMH-LEACH). The proposed algorithm is intended for IoT applications in the oil and gas (O&G) industry. The deployment of the adopted algorithm leads to improved field communication, lower maintenance costs, real-time monitoring, digital oil field infrastructure, lower power consumption, increased asset safety and protection, and thus increased productivity. The ADMH-LEACH is based on a variety of variables, including initial energy, residual energy, and energy consumed per round, in order to meet quality-of-service constraints by following service level agreements for O&G IoT applications. The simulation results show that the proposed algorithm improves network reliability, network lifetime, and load balance significantly in comparison to current algorithms.
Optimization of energy consumption is major concern for the design and planning of wireless sensor networks (WSNs). Recent research has demonstrated that organizing nodes in clusters has higher energy efficiency. LEAC...
详细信息
Optimization of energy consumption is major concern for the design and planning of wireless sensor networks (WSNs). Recent research has demonstrated that organizing nodes in clusters has higher energy efficiency. LEACH is the most popular routing protocol for cluster-based in WSNs, and FCM algorithm is used for the optimum number of the clusters and their location. Aiming at the shortcomings of LEACH and FCM-LEACH, which including inaccurate cluster centers, unreasonable clustering and sole data transmission mode. This paper proposes a new energyefficientroutingalgorithm (NF-LEACH). In the new algorithm, There are many factors have considered to prolong the network life cycle that they are the degree of membership, residual energy, base station distance and data transmission mode. Finally, the comparison among LEACH, FCM-LEACH, and NF-LEACH has been done. The results show that the NF-LEACH has the longest lifetime and the most evenly distributed amongst three algorithms.
暂无评论