The operation scheduling problem in network on chip is NP-hard; therefore effective heuristic methods are needful to provide modal solutions. This paper introduces ant colony scheduling, a simple and effective method to increase allocator matching efficiency and hence n More
The operation scheduling problem in network on chip is NP-hard; therefore effective heuristic methods are needful to provide modal solutions. This paper introduces ant colony scheduling, a simple and effective method to increase allocator matching efficiency and hence network performance, particularly suited to networks with complex topology and asymmetric traffic patterns. Proposed algorithm has been studied in torus and flattened-butterfly topologies with multiple types of traffic pattern. Evaluation results show that this algorithm in many causes has showed positive effects on reducing network delays and increased chip performance in comparison with other algorithms.
Manuscript profile
Wireless sensor networks (WSNs) consist of numerous tiny sensors which can be regarded as a robust tool for collecting and aggregating data in different data environments. The energy of these small sensors is supplied by a battery with limited power which cannot be rech More
Wireless sensor networks (WSNs) consist of numerous tiny sensors which can be regarded as a robust tool for collecting and aggregating data in different data environments. The energy of these small sensors is supplied by a battery with limited power which cannot be recharged. Certain approaches are needed so that the power of the sensors can be efficiently and optimally utilized. One of the notable approaches for reducing energy consumption in WSNs is to decrease the number of packets to be transmitted in the network. Using data aggregation method, the mass of data which should be transmitted can be remarkably reduced. One of the related methods in this approach is the data aggregation tree. However, it should be noted that finding the optimization tree for data aggregation in networks with one working-station is an NP-Hard problem. In this paper, using cuckoo optimization algorithm (COA), a data aggregation tree was proposed which can optimize energy consumption in the network. The proposed method in this study was compared with genetic algorithm (GA), Power Efficient Data gathering and Aggregation Protocol- Power Aware (PEDAPPA) and energy efficient spanning tree (EESR). The results of simulations which were conducted in matlab indicated that the proposed method had better performance than GA, PEDAPPA and EESR algorithm in terms of energy consumption. Consequently, the proposed method was able to enhance network lifetime.
Manuscript profile