Search

Generally the accelerators type identifies the edge computing performance hugely and it includes Integrated Circuit (IC), Graphical Processing Unit (GPU) and Field Programmable Gate Array (FPGA). Among these accelerator FPGAs are widely used in several edge computing areas since it has the ability to reconfigure and has high energy efficient. The consequence also comes out with the paradigm of scheduling efficiency on CPU’s (software tasks) and FPGA (hardware tasks). However the conventional schemes not entirely exploited the variations among hardware and software tasks which results in low scheduling efficiency. Therefore a task scheduling system is proposed on basis of fully active reconfigurable system. The scheduling efficiency for the proposed scheme can be increased by switching the task overheads and by predicting the execution time for hardware with minimum task switching times.

Trust is an essential parameter among sensor nodes to provide secured and successful communication. Many trust management schemes have been proposed earlier for large scale Wireless Sensor Network (WSN) however not cooperates well in terms of low dependability, memory overheads, large communication etc, therefore a system called Data Traffic Trust Scheme (DTTS) for clustered WSN is proposed here. Here the trust nodes are identified through the data traffic sampling rate. The trust rate is identified through the number of sent and receive data packets and the malicious packets are diagnosed through the un-matching packet rate. The simulation results are evaluated to show the efficiency for the proposed scheme.

Routing process should be more reliable in Mobile Adhoc Network (MANET) for effective communication between nodes. It can be carried out either single or multiple hops on basis of the transmission distance that exist between the source nodes and sink hub. Nodes are mobile in MANET system and hence the connectivity between the nodes may change continuously. Therefore Resourceful and Reliable Routing Selection (R3S) process is done by estimating node connectivity factor, relay hop-count measure, bandwidth aspect measure between relay hubs. Node connectivity factor is calculated by taking the metrics like distance exist between them and node travelling speed since routing should be done with good node bond quality. To reduce number of hop counts and loss rates of packets in the network, an efficient routing path must be selected from source to sink. From the simulation results, it is proved to be that the proposed scheme has better packet delivery rates, system delay and high balance energy level of nodes.

In a MANET, there is not necessitating arrange any structure to create nodes to transmit with every other. The recurrent updates of the topography as well as the mutual scenery of the wireless channel create important disputes. Hence, several congestion control methods have been introduced. MANETs have a numerous of approaches to encourage the routing function through inactive as well as active routing schemes. Though, there is not an enduring resolution which subsists to resolve the fundamental congestion trouble in the MANETs. This paper proposes a Forecast function based Congestion Control in MANET Routing (FFCC). In this scheme, the congestion rate is applied for measuring the highest congested node and isolates that node. Next we choose the less congested node thus the data reach the destination correctly. In addition, the Forecasts Congestion Rate is used to predict the congested node perfectly based on the five transactions. Thus transmits the data via less congested route efficiently. Network simulator is applied for examine the simulation experiments. The results demonstrate the minimized network delay as enhances the network throughput