Customized Hardware Crypto Engine for Wireless Sensor Networks

2017 ◽  
Vol 7 (1) ◽  
pp. 263
Author(s):  
Medhat Awadalla ◽  
Ahmed Al Maashri ◽  
Lavanya Pathuri ◽  
Afaq Ahmad
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Reconfigurable Computing ◽  
Research Area ◽  
Wireless Sensor ◽  
Open Problems ◽  
Algorithmic Approach ◽  
Power Efficient ◽  
Alternative Routing ◽  
Active Research

Nowadays, managing for optimal security to wireless sensor networks (WSNs) has emerged as an active research area. The challenging topics in this active research involve various issues such as energy consumption, routing algorithms, selection of sensors location according to a given premise, robustness, and efficiency. Despite the open problems in WSNs, already a high number of applications available shows the activeness of emerging research in this area. Through this paper, authors propose an alternative routing algorithmic approach that accelerate the existing algorithms in sense to develop a power-efficient crypto system to provide the desired level of security on a smaller footprint, while maintaining real-time performance and mapping them to customized hardware. To achieve this goal, the algorithms have been first analyzed and then profiled to recognize their computational structure that is to be mapped into hardware accelerators in platform of reconfigurable computing devices. An intensive set of experiments have been conducted and the obtained results show that the performance of the proposed architecture based on algorithms implementation outperforms the software implementation running on contemporary CPU in terms of the power consumption and throughput.

scholarly journals Wireless Sensor Networks Formation: Approaches and Techniques

2016 ◽  
Vol 2016 ◽  
pp. 1-18 ◽  
Author(s):  
Miriam Carlos-Mancilla ◽  
Ernesto López-Mellado ◽  
Mario Siller
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Research Area ◽  
Wireless Sensor ◽  
Open Problems ◽  
Key Factor ◽  
Network Backbone ◽  
Active Research ◽  
Selection Of ◽  
Open Issues

Nowadays, wireless sensor networks (WSNs) emerge as an active research area in which challenging topics involve energy consumption, routing algorithms, selection of sensors location according to a given premise, robustness, efficiency, and so forth. Despite the open problems in WSNs, there are already a high number of applications available. In all cases for the design of any application, one of the main objectives is to keep the WSN alive and functional as long as possible. A key factor in this is the way the network is formed. This survey presents most recent formation techniques and mechanisms for the WSNs. In this paper, the reviewed works are classified into distributed and centralized techniques. The analysis is focused on whether a single or multiple sinks are employed, nodes are static or mobile, the formation is event detection based or not, and network backbone is formed or not. We focus on recent works and present a discussion of their advantages and drawbacks. Finally, the paper overviews a series of open issues which drive further research in the area.

MAC and Routing Integration in Wireless Sensor Networks

2012 ◽  
pp. 253-281
Author(s):  
Fabrice Theoleyre ◽  
Bogdan Pavkovic
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ieee 802.15.4 ◽  
Research Area ◽  
Link Quality ◽  
Wireless Sensor ◽  
Radio Link ◽  
Open Problems ◽  
Mac Layers ◽  
Memory Resources

Wireless Sensor Networks are a promising way to interconnect smart objects sensing and acting on the environment, enabling the Internet of Things. However, this kind of network is particularly constrained: nodes have limited energy reserve, their CPU and memory resources are limited, and the radio bandwidth is very low. After exposing the main approaches for the routing and MAC layers, the authors explain why they must be jointly optimized. They explain why a metric reflecting the radio link quality is necessary and how it should integrate different criteria in layers 2 and 3. The authors also introduce a new architecture based on IEEE 802.15.4 and RPL so that both protocols work in symbiosis. Finally, they conclude detailing some open problems in this research area.

Determination of Adjacent Nodes for Power Efficient Wireless Sensor Networks

2014 ◽  
Vol 134 (5) ◽  
pp. 612-619 ◽  
Author(s):  
Kohei Kamimura ◽  
Hitoshi Hayashi ◽  
Takaaki Hatauchi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Power Efficient

Improved DV-Hop Localization Scheme for Randomly Deployed WSNs

2020 ◽  
Vol 10 (1) ◽  
pp. 94-109 ◽  
Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Research Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Nodes ◽  
Least Energy ◽  
Range Free

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.

scholarly journals Comparative Study on Various Authentication Protocols in Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
S. Raja Rajeswari ◽  
V. Seenivasagam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Low Cost ◽  
Wireless Sensor ◽  
Authentication Protocols ◽  
Security Services ◽  
Management Schemes ◽  
Active Research ◽  
Lightweight Authentication

Wireless sensor networks (WSNs) consist of lightweight devices with low cost, low power, and short-ranged wireless communication. The sensors can communicate with each other to form a network. In WSNs, broadcast transmission is widely used along with the maximum usage of wireless networks and their applications. Hence, it has become crucial to authenticate broadcast messages. Key management is also an active research topic in WSNs. Several key management schemes have been introduced, and their benefits are not recognized in a specific WSN application. Security services are vital for ensuring the integrity, authenticity, and confidentiality of the critical information. Therefore, the authentication mechanisms are required to support these security services and to be resilient to distinct attacks. Various authentication protocols such as key management protocols, lightweight authentication protocols, and broadcast authentication protocols are compared and analyzed for all secure transmission applications. The major goal of this survey is to compare and find out the appropriate protocol for further research. Moreover, the comparisons between various authentication techniques are also illustrated.

PECA

2014 ◽  
pp. 239-248
Author(s):  
Maytham Safar ◽  
Hasan Al-Hamadi ◽  
Dariush Ebrahimi
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Power Consumption ◽  
Low Power ◽  
The Self ◽  
Wireless Sensor ◽  
Human Intervention ◽  
Electronic Circuits ◽  
Power Efficient

Wireless sensor networks (WSN) have emerged in many applications as a platform to collect data and monitor a specified area with minimal human intervention. The initial deployment of WSN sensors forms a network that consists of randomly distributed devices/nodes in a known space. Advancements have been made in low-power micro-electronic circuits, which have allowed WSN to be a feasible platform for many applications. However, there are two major concerns that govern the efficiency, availability, and functionality of the network—power consumption and fault tolerance. This paper introduces a new algorithm called Power Efficient Cluster Algorithm (PECA). The proposed algorithm reduces the power consumption required to setup the network. This is accomplished by effectively reducing the total number of radio transmission required in the network setup (deployment) phase. As a fault tolerance approach, the algorithm stores information about each node for easier recovery of the network should any node fail. The proposed algorithm is compared with the Self Organizing Sensor (SOS) algorithm; results show that PECA consumes significantly less power than SOS.

On Vertex Cover Problems in Distributed Systems

2016 ◽  
pp. 1-29 ◽  
Author(s):  
Can Umut Ileri ◽  
Cemil Aybars Ural ◽  
Orhan Dagdeviren ◽  
Vedat Kavalci
Keyword(s):  
Wireless Sensor Networks ◽  
Distributed Systems ◽  
Sensor Networks ◽  
Communication Networks ◽  
Distributed Algorithms ◽  
Data Aggregation ◽  
Undirected Graph ◽  
Vertex Cover ◽  
Research Area ◽  
Wireless Sensor

An undirected graph can be represented by G(V,E) where V is the set of vertices and E is the set of edges connecting vertices. The problem of finding a vertex cover (VC) is to identify a set of vertices VC such that at least one endpoint of every edge in E is incident to a vertex V in VC. Vertex cover is a very important graph theoretical structure for various types of communication networks such as wireless sensor networks, since VC can be used for link monitoring, clustering, backbone formation and data aggregation management. In this chapter, we will define vertex cover and related problems with their applications on communication networks and we will survey some important distributed algorithms on this research area.

Sign in / Sign up

Export Citation Format

Share Document