توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقاله‌های نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده می‌شوند.
۱FW–BW : A New Method for Routing of Jobs in Grid Networks
نویسنده(ها): ،
اطلاعات انتشار: دومین سمینار عصر اطلاعات با رویکرد فناوریهای نوین، سال
تعداد صفحات: ۱۱
The Grid networks consist of several heterogeneous resources that are geographically distributed and it is feasible to have remote access to these resources. Because of the large of resources in Grid, routing and finding the best resource for providing the service for the users is animportant and difficult problem. The use of Dijkstra algorithm , routing table, brokers and also anycast routing methods are among the existingmethods which are used for Grid networks. This paper represents a new soluthin by the use of the anycast method based on Ant Colony Optimization (ACO) for routing. This approach sets the capability of each resource for the acceptance of job by subtraction of backward and forward ants. The results of simulation shows that the proposed method can decreases the number of computations and also it increases the acceptance probability of users request.<\div>

۲An insertion mutation operator for solving project scheduling problem
نویسنده(ها): ،
اطلاعات انتشار: دوازدهمین کنفرانس ملی سیستمهای هوشمند، سال
تعداد صفحات: ۴
Project scheduling problem is to determine the schedule of allocating resources to activities so as to balance the total cost and completion time of the project. The problem hasbeen studied considering certain and uncertain activity duration times. In project scheduling with certain activity duration times,the duration of activities are previously obvious while in the project scheduling with uncertain activity duration times, the duration of each activity is considered to be uncertain.For each kind of project scheduling problem, various optimization methods such as genetic algorithm have been used.In this paper, an insertion mutation is proposed for solving the project scheduling problem with uncertain activity duration times which ensures earlier convergence to the optimal solution if being added to the mutation operator of genetic algorithm.<\div>

۳Enhancing Energy Efficiency in Wireless Sensor Networks via Improving Elliptic Curve Digital Signature Algorithm
نویسنده(ها): ،
اطلاعات انتشار: World Applied Sciences Journal، بيست و يكم،شماره۱۱، ۲۰۱۳، سال
تعداد صفحات: ۵
The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). It is used in wireless sensor networks in order to establish security and allow legitimate users to join in the network and disseminate messages into the networks. The ECDSA needs an addition point and two multi scalar for verifying users'' signature in WSNs, that because decrease signature verification speed, in result it has also incurred a series of problems such as high energy consumption and long verification delay. In this paper we propose an efficient technique to accelerate signature verification in WSNs by exploiting cooperation among sensor nodes. In order to verify the effectiveness of the proposed method, simulations were carried out on 4×4 grid–based WSN.
نمایش نتایج ۱ تا ۳ از میان ۳ نتیجه