CRCWSN: Presenting a Routing Algorithm by using Re-clustering to Reduce Energy Consumption in WSN

In this paper, we have presented an algorithm, based on genetics and re-clustering, to reduce energy consumption in Wireless Sensor Networks. Algorithm CRCWSN could be best used by selected chromosomes in different states. In this algorithm, a new technique of selecting cluster head(CH) has been initially used by genetic algorithm. These CHs have been used individually in each round to transmit data. In this research, considering distance and energy parameters, we have created a target function having more optimum conditions, compared to previous techniques. The created target function has been evaluated by input chromosome, and the combination of chromosomes has been done by a new technique having more efficiency compared to previous similar techniques. Consequently, the timing of generation repeat is based on local distribution in chromosomes, and their using in sending data from source to destination that decrease generations’ repeat, compared to previous methods. Results by simulation show that, at the end of each round, the number of alive nodes in the suggested algorithm increases, compared to previous methods, which increases network’s lifetime

VMRCD: an algorithm for dependable routing using the re-clustering for vehicular networks with v2v communication

Vehicle traffic congestion control has an essential role in time management and with a case study on clustering-based VANET networks, an algorithm for dependable routing using the re-clustering for vehicular networks with v2v communication has been proposed.The aggregation of vehicles has a direct role in controlling traffic congestion, By observation the index parameters, we obtain the objective function, that merging parameter such as weight and distance, it optimizes the route length compared to previous methods, And by re-clustering, we decreased the number of vehicle collisions using the neighborhood principle. In this case, by considering the Euclidean distance, we can prevent the aggregation of vehicles using the minimum distance to create an optimal route. With the help of the objective function, we will achieve a dependable route to optimize packet delivery and the delay END-TO-END.Ultimately, using the proposed an algorithm, By categorization the inputs and real execution time, we increase the dependable routing compared to the SCRS algorithm, and we also decreased fuel consumption