FPGA Implementation and Energy Cost Analysis of Two Light-Weight Involutional Block Ciphers Targeted to Wireless Sensor Networks

2012 ◽  
Vol 18 (2) ◽  
pp. 222-234 ◽  
Author(s):  
Xueying Zhang ◽  
H. M. Heys ◽  
Cheng Li
2016 ◽  
Vol 12 (07) ◽  
pp. 59
Author(s):  
Zeyu Sun ◽  
Yuanbo Li ◽  
Chuanfeng Li ◽  
Yalin Nie

<p><span style="font-family: Times New Roman;"><strong>The mismatch of task scheduling results in rapid network energy consumption during data transmission in wireless sensor networks. To address this issue, the paper proposed an </strong><strong>E</strong><strong>nergy-consumption </strong><strong>O</strong><strong>ptimization-oriented </strong><strong>T</strong><strong>ask </strong><strong>S</strong><strong>cheduling </strong><strong>A</strong><strong>lgorithm (EOTS algorithm) which formally described the overall power dissipation in the network system. On this basis, a network model was built up such that both the idle energy consumption in sensor nodes and energy consumption during the execution of tasks were taken into account, with which the whole task was effectively decomposed into sub-task sequences. They underwent simulated annealing and iterative refinement, with the intention of improving sensor nodes’ utilization rate, reducing local idle energy cost, as well as cutting down the overall energy consumption accordingly. The experiment result shows that under the environment of multi-task operation, from the perspective of energy cost optimization, the proposed scheduling strategy recorded an increase of 21.24% compared with the FIFO algorithm, and an increase of 16.77% in comparison to the EMRSA algorithm; while in light of network lifetimes, the EOTS algorithm surpassed the ECTA algorithm by a gain of 19.21%. Therefore, the effectiveness of the proposed EOTS algorithm is verified.</strong></span></p>


2015 ◽  
Vol 39 ◽  
pp. 44-57 ◽  
Author(s):  
Davut Incebacak ◽  
Kemal Bicakci ◽  
Bulent Tavli

2013 ◽  
Vol 475-476 ◽  
pp. 564-568
Author(s):  
Wei Yong Jiang ◽  
Pin Wan ◽  
Yong Hua Wang ◽  
Dong Liang

Localization of sensors is one key technique in wireless sensor networks (WSN).Because the midnormal-based localization algorithm (MBLA) has shortcomings such as low accuracy, relatively large number of iterations, a localization algorithm based on permutation and combination midnormal (PACMLA) for WSN is proposed. Nodes are divided into anchor nodes and unknown nodes. In its own communication range, unknown node can communicate with anchor nodes. In PACMLA algorithm, the unknown node communicates with the anchor nodes in turn, and collects their coordinate information and RSSI value. Then by comparing the RSSI values received by unknown node, these RSSI values are formed an array in accordance with the order from small to large. Then starting from the first value of the RSSI array, each of these values and the value behind them will be combined into data sets. Finally, according to corresponding coordinate information of the RSSI value in the data sets, we will determine the position of the unknown node by Point In Which Side (PIWS) determination. In addition, our algorithm is a kind of Range-free algorithm, and it can cuts down the node energy cost. The experiment results illustrate that the PACMLA algorithm has lower error and higher accuracy.


2013 ◽  
Vol 3 (4) ◽  
pp. 298-306 ◽  
Author(s):  
Sana H. Jokhio ◽  
Imran Ali Jokhio ◽  
Andrew H. Kemp

Sign in / Sign up

Export Citation Format

Share Document