Efficient Key Pre-distribution for Sensor Nodes with Strong Connectivity and Low Storage Space

2008 ◽  
Author(s):  
Hung Yu Chien ◽  
Rung-Ching Chen ◽  
Annie Shen
Keyword(s):  
Sensor Nodes ◽  
Storage Space ◽  
Strong Connectivity

scholarly journals An Efficient Approach for Storage Balancing in Wireless Sensor Networks

2017 ◽  
Vol 13 (09) ◽  
pp. 4
Author(s):  
Asmaa Ez-zaidi ◽  
Said Rakrak
Keyword(s):  
Data Gathering ◽  
Mobile Sink ◽  
Memory Storage ◽  
Sensor Nodes ◽  
Storage Space ◽  
Effective Mechanism ◽  
New Approach ◽  
Mobile Sinks ◽  
Gathering Data ◽  
Improve Reliability

the use of mobile sinks in data collection has received much attention in recent years. In fact, mobility was introduced to solve problems that occur in data gathering with static sinks such as hotspots, quick energy depletion of sensor nodes and so on. Using mobile sinks provides an effective mechanism to improve reliability, security as well as connectivity within the network. Nevertheless, the sink’s mobility poses new challenges, especially when the sink follows an unpredictable movement while gathering data. In this case, the network will experience huge latency and suffer from significant packet loss particularly when sensor nodes do not have enough memory storage to buffer collected data between two successive visits of the mobile sink. In this paper we propose a new approach in which sensor nodes cooperate to manage the storage and prevent packet drops. When a node’s memory is almost full, it offloads its data to its neighbor nodes in function of their free spaces.  In case there are no neighbor nodes with sufficient storage space, the sink is urgently notified about the overloaded region that needs to be rapidly dumped. Simulation results reveal that our proposed approach decreases drastically the loss of packets and balances the sensor network.

Indirect measurements in micro-space with the EM

1995 ◽  
Vol 53 ◽  
pp. 598-599
Author(s):  
Sterling P. Newberry
Keyword(s):  
Electron Microscope ◽  
Standard Model ◽  
Particle Physics ◽  
Information Storage ◽  
Storage Space ◽  
Indirect Measurements ◽  
Storage And Retrieval ◽  
Adequate Information ◽  
Compelling Reason ◽  
The Standard Model

At the 1958 meeting of our society, then known as EMSA, the author introduced the concept of microspace and suggested its use to provide adequate information storage space and the use of electron microscope techniques to provide storage and retrieval access. At this current meeting of MSA, he wishes to suggest an additional use of the power of the electron microscope.The author has been contemplating this new use for some time and would have suggested it in the EMSA fiftieth year commemorative volume, but for page limitations. There is compelling reason to put forth this suggestion today because problems have arisen in the “Standard Model” of particle physics and funds are being greatly reduced just as we need higher energy machines to resolve these problems. Therefore, any techniques which complement or augment what we can accomplish during this austerity period with the machines at hand is worth exploring.

Distributed Entropy Energy-Efficient Clustering algorithm for cluster head selection (DEEEC)

2020 ◽  
Vol 39 (6) ◽  
pp. 8139-8147
Author(s):  
Ranganathan Arun ◽  
Rangaswamy Balamurugan
Keyword(s):  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Second Stage ◽  
Energy Efficient Clustering ◽  
Two Stages ◽  
Ch Selection

In Wireless Sensor Networks (WSN) the energy of Sensor nodes is not certainly sufficient. In order to optimize the endurance of WSN, it is essential to minimize the utilization of energy. Head of group or Cluster Head (CH) is an eminent method to develop the endurance of WSN that aggregates the WSN with higher energy. CH for intra-cluster and inter-cluster communication becomes dependent. For complete, in WSN, the Energy level of CH extends its life of cluster. While evolving cluster algorithms, the complicated job is to identify the energy utilization amount of heterogeneous WSNs. Based on Chaotic Firefly Algorithm CH (CFACH) selection, the formulated work is named “Novel Distributed Entropy Energy-Efficient Clustering Algorithm”, in short, DEEEC for HWSNs. The formulated DEEEC Algorithm, which is a CH, has two main stages. In the first stage, the identification of temporary CHs along with its entropy value is found using the correlative measure of residual and original energy. Along with this, in the clustering algorithm, the rotating epoch and its entropy value must be predicted automatically by its sensor nodes. In the second stage, if any member in the cluster having larger residual energy, shall modify the temporary CHs in the direction of the deciding set. The target of the nodes with large energy has the probability to be CHs which is determined by the above two stages meant for CH selection. The MATLAB is required to simulate the DEEEC Algorithm. The simulated results of the formulated DEEEC Algorithm produce good results with respect to the energy and increased lifetime when it is correlated with the current traditional clustering protocols being used in the Heterogeneous WSNs.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Developing Multi-Tier Network Design for Effective Energy Consumption of Cluster Head Selection in WSN

2016 ◽  
Vol 13 (1) ◽  
pp. 116
Author(s):  
Wan Isni Sofiah Wan Din ◽  
Saadiah Yahya ◽  
Mohd Nasir Taib ◽  
Ahmad Ihsan Mohd Yassin ◽  
Razulaimi Razali
Keyword(s):  
Sensor Network ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Cluster Head Selection ◽  
Energy Usage ◽  
Network Cluster ◽  
Fuzzy Logic Approach ◽  
The Stability

Clustering in Wireless Sensor Network (WSN) is one of the methods to minimize the energy usage of sensor network. The design of sensor network itself can prolong the lifetime of network. Cluster head in each cluster is an important part in clustering to ensure the lifetime of each sensor node can be preserved as it acts as an intermediary node between the other sensors. Sensor nodes have the limitation of its battery where the battery is impossible to be replaced once it has been deployed. Thus, this paper presents an improvement of clustering algorithm for two-tier network as we named it as Multi-Tier Algorithm (MAP). For the cluster head selection, fuzzy logic approach has been used which it can minimize the energy usage of sensor nodes hence maximize the network lifetime. MAP clustering approach used in this paper covers the average of 100Mx100M network and involves three parameters that worked together in order to select the cluster head which are residual energy, communication cost and centrality. It is concluded that, MAP dominant the lifetime of WSN compared to LEACH and SEP protocols. For the future work, the stability of this algorithm can be verified in detailed via different data and energy. 

PERANCANGAN DAN IMPLEMENTASI ALGORITMA ELIAS GAMMA CODE UNTUK MENGKOMPRESI RECORD DATABASE PADA APLIKASI RANGKUMAN PENGETAHUAN UMUM LENGKAP

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Hikka Sartika ◽  
Taronisokhi Zebua
Keyword(s):  
Compression Ratio ◽  
General Public ◽  
Storage Capacity ◽  
Storage Space ◽  
File Size ◽  
Compression Technique ◽  
Code Algorithm ◽  
Database File ◽  
Large File

Storage space required by an application is one of the problems on smartphones. This problem can result in a waste of storage space because not all smartphones have a very large storage capacity. One application that has a large file size is the RPUL application and this application is widely accessed by students and the general public. Large file size is what often causes this application can not run effectively on smartphones. One solution that can be used to solve this problem is to compress the application file, so that the size of the storage space needed in the smartphone is much smaller. This study describes how the application of the elias gamma code algorithm as one of the compression technique algorithms to compress the RPUL application database file. This is done so that the RPUL application can run effectively on a smartphone after it is installed. Based on trials conducted on 64 bit of text as samples in this research it was found that compression based on the elias gamma code algorithm is able to compress text from a database file with a ratio of compression is 2 bits, compression ratio is 50% with a redundancy is 50%. Keywords: Compression, RPUL, Smartphone, Elias Gamma Code

IMPLEMENTASI ALGORITMA LEVENSTEIN DALAM MENGKOMPRESI TEKS PADA APLIKASI RANGKUMAN PENGETAHUAN ALAM LENGKAP

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Winda Winda ◽  
Taronisokhi Zebua
Keyword(s):  
Compression Ratio ◽  
Mobile Application ◽  
Storage Space ◽  
Compression Technique ◽  
The Public ◽  
Natural Knowledge ◽  
Database Size ◽  
Text Database

The size of the data that is owned by an application today is very influential on the amount of space in the memory needed one of which is a mobile-based application. One mobile application that is widely used by students and the public at this time is the Complete Natural Knowledge Summary (Rangkuman Pengetahuan Alam Lengkap or RPAL) application. The RPAL application requires a large amount of material storage space in the mobile memory after it has been installed, so it can cause this application to be ineffective (slow). Compression of data can be used as a solution to reduce the size of the data so as to minimize the need for space in memory. The levestein algorithm is a compression technique algorithm that can be used to compress material stored in the RPAL application database, so that the database size is small. This study describes how to compress the RPAL application database records, so as to minimize the space needed on memory. Based on tests conducted on 128 characters of data (200 bits), the compression results obtained of 136 bits (17 characters) with a compression ratio is 68% and redundancy is 32%.Keywords: compression, levestein, aplication, RPAL, text, database, mobile

Sign in / Sign up

Export Citation Format

Share Document