No abstract

This paper relates to the problem of energy conservation in Internet backbone networks. We propose a new Distributed Green Algorithm based on Sleep-scheduling (DGAS) to switch off some network links and nodes resulting in less energy consumption. Our solution does not depend on any centralized controller and uses a link-state protocol like Open Shortest Path First to share required information. In addition, DGAS does not require any knowledge of traffic matrix and switches off network nodes and links in 2 phases. In the first phase, some core nodes are switched off on the basis of their usage in network paths. In the second phase, DGAS starts with a minimal topology on the basis of resulted topology from the first phase and adds some links to it to minimize network paths length. Results, obtained by several real network scenarios, show that DGAS can switch off up to 27% of core nodes and up to 80% of links compared to the maximum number of switchable links.

No abstract

Mobile ad hoc network (MANET) is a type of ad hoc network that MANET nodes can change their locations and configure by themselves on the fly. Because of mobility the MANET nodes, the management of a large MANET is difficult, therefore, clustering in a MANET is an important technique. A large network is divided into several sub networks applying clustering method. When the topology of the network is dynamic and ad hoc, the process of clustering is very complicated. In this paper, we propose a Probabilistic Algorithm for MANET

Summary Over recent years, energy conservation in Internet backbone networks has been proposed to reduce economic cost and environmental pollution produced by networking sectors. In this regard, we propose a new dynamic vertex cover‐based green algorithm (DVCGA) in order to conserve energy. Our solution considers online local/global traffic knowledge to switch off some underutilized network devices during nonpeak periods and reswitch on some sleep devices in congestion situation. In addition, DVCGA does not require any centralized controller and uses only information provided by a link‐state protocol. Results, obtained by real network scenario, show that up to 28% of network nodes and up to 82% of the maximum number of switchable links are switched off after DVCGA running. In addition, network performance metrics such as delay and packet delivery ratio during DVCGA running are close to original network and better than similar works. Moreover, the number of device state changes in the effect of DVCGA execution during network running is lower than similar proposals resulting in low network overhead.