Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this paper a new fault tolerant multi disjoint path routing algorithm is proposed based on AHP decision making method in IP/MPLS networks. Metrics for decision are bandwidth, delay and our defined availability factor. According to our algorithm, more reliable multi paths are found from source to destination in the network. Multi disjoint paths are selected in these steps: First, a given source...
In this paper a new fuzzy evaluation method is proposed to rank several multi disjoint paths selection algorithms in network. This method combines fuzzy theory and Copeland method to evaluate rank of each proposed method base on bandwidth, availability and delay of end to end paths as determinative factors which their importance are expressed in linguistic variables. The Copeland ranking can be seen...
In this paper, the performance of traffic based adaptive (TBA) and size based adaptive (SBA) backoff algorithms for IEEE 802.11 DCF has been evaluated. TBA backoff algorithm utilizes contention status in the channel for adjusting the backoff algorithm but SBA backoff algorithm assigns different priority levels based on packet size to traffic loads which is involved with best effort and real time traffic...
Tracking moving objects with wireless sensor networks (WSNs) has received much concern because of its practical applications in nowadays world. Tracking accuracy is deeply dependant upon tracking time interval of the tracking network. This paper proposes a new adaptive power optimization scheme for target tracking sensor networks. This scheme includes a fast dynamic adaptive prediction-based tracking...
In this paper, we propose a new cross layer technique to design a joint MAC and routing protocol for wireless sensor networks. A wireless sensor network is characterized by the limited energy resource, many-to-one communication pattern, self-organization and etc. which make its protocol design different from other wireless network. In the other hand, due to wide area of wireless sensor network applications,...
The wireless sensor network is an autonomous collection of sensors which makes a simple, high speed and inexpensive network. These kinds of network are able to monitor a parameter where the coverage is impossible via wired networks. Since, the sensors in wireless networks are equipped with batteries, these networks are energy constrained and clustering approaches play an important role in energy efficiency...
Reconfigurable computing systems allow executing tasks in a true multitasking manner. Such systems share the reconfigurable device and processing unit as computing resources which leads to highly dynamic allocation situations. To manage such systems at runtime, a reconfigurable operating system is needed. The main part of this operating system is resource management unit which performs HW/SW partitioning,...
Wireless sensor networks are simple, high speed and inexpensive networks that include large number of sensors. These networks are able to monitor a parameter where the coverage is impossible via wired networks. Since clustering improves energy consumption, clustering algorithms aim at this improvement. In this paper, an energy efficient algorithm entitled EECDP (energy efficient clustering with direct...
Scheduling a parallel application on a set of processors is a well-known NP-complete problem. The problem becomes more complex when the base system is composed of heterogeneous processors. In this paper, we present a low-complexity task scheduling algorithm for heterogeneous computing systems, which we call the multiple critical path dominator (MCPD) algorithm. This algorithm is based on task duplication...
In this paper, size based adaptive backoff algorithm (SBA backoff algorithm) for IEEE 802.11 DCF has been developed to provide quality of service (QoS) requirements. SBA backoff algorithm assigns different priority levels based on packet size. Also, SBA backoff algorithm was utilized in the mobile ad-hoc network (MANET), which is a collection of mobile independent nodes. Because of dynamic topology,...
Optimal task scheduling of a direct acyclic graph (DAG) onto distributed environments is a NP-hard problem. In this paper, we propose a new scheduling algorithm called earliest starting and finishing time duplication based (ESFD). ESFD has three phases: priority processing, task scheduling and task duplication. ESFD considers all parameters related to the task and its immediate predecessors to assigning...
Due to the special characteristics of wireless sensor networks, traditional MAC approaches are not suitable for them. So designing MAC protocol for WSNs in a specific manner is critical to meet their intrinsic constraints. In this paper, we proposed an energy efficient MAC protocol which reduce energy consumption due to idle listening and control packet overhead. It is called W-MAC. W-MAC protocol...
Reconfigurable embedded systems which exploit a processor core in conjunction with a run-time reconfigurable unit (such as FPGA) provide the simultaneous execution of complex applications faster than before. In most of these systems several complex applications run simultaneously and hence we call them multitask reconfigurable system. In this paper we propose a heuristic method for HW/SW partitioning...
Power analysis is a dominant method that reveals side channel information by tracing power signal. In elliptic curve cryptosystem (ECC), they have received considerable attention. The main operation of ECC is scalar multiplication which is vulnerable to power analysis attacks. In this paper we present an algorithm for securing elliptic curve scalar multiplication against Power Analysis. However some...
Reconfigurable systems have become very popular because of their impact in increasing performance improvement for executing a number of applications such as morphology, image compression, etc. These systems provide a general platform for executing applications. However, effectively using the full potential of these systems cars be challenging without the knowledge of the system's performance characteristics...
Recently, elliptic curve cryptosystems have become more and more fashionable, and researchers have focused on power analysis attacks particularly on elliptic curves, type of side channel attacks that exploit leakage information from the device. This paper proposes a countermeasure which improves performance and resistance against recent power analysis attacks such as RPA and ZPA in addition to SPA...
In this paper NASH1 algorithm, a new matrix-based method for identification of radar pulse train, is implemented by systolic array. NASH can be used to identify the PRI for constant, staggered, and jittered signal. Previous matrix-based methods can only identify the first type of signal, i.e. constant PRI. The complexity of the computation in NASH is more than the previous matrix-based method. To...
A novel structure is proposed for massive parallel processing systems. This structure is expandable in a vertical and horizontal manner and covers many of the previous computer designs. Queuing theory and the Jackson queuing network are applied for constructing an analytical model for the proposed structure. This model gives a closed-form solution for the system performance metrics, such as processor...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.