Connectivity in WSNs is vital to preserve the network performance. Reported algorithms try to restore connectivity by appropriately selecting the failure handler. This paper, initially presents a hybrid algorithm based on distributed learning automata named DLA-BuS for critical node backup selection. Then, we present DLA-MRF to repair stimulant failure of two adjacent actors. Simulations using Castalia demonstrate that proposed algorithms outperform representative methods in terms of some well-known performance parameters. پرونده مقاله

Vehicular communications have been considered to be an enabler for numerous vehicle safety and information applications.Vehicle Social Networks (VSNs) are a type of ad-hoc networks which allows wireless communication between two adjacent vehicles. Routing and communicating with adjacent nodes are one of the problems in VSNs. A literature review indicated that the time limit to transmit data and route is a problem due to the geographical distance and speed.. پرونده مقاله

In Software Defined Network (SDN), the controller layer that is separated from the data layer is responsible for all system functionalities. However, centralized solutions suffer from single-point-of-failure and bottleneck problems. Several controllers are used to increase availability and performance in large networks to solve the aforementioned problems. One of the main concerns is finding the optimal number of controllers and their locations, which is known as an NP-hard problem. To do this, in this paper, in addition to presenting an efficient algorithm based on Garter snake algorithm (GSO), a new statistical analysis for determining the number of controllers is figured out. پرونده مقاله