Data secrecy is one of the key concerns for wireless body sensor networks (WBSNs). Usually, a data
secrecy scheme should accomplish two tasks: key establishment and encryption. WBSNs generally face
more serious limitations than general wireless networks in terms of energy supply. To address this, in this
paper, we propose an energy efficient data secrecy scheme for WBSNs. On one hand, the proposed key
establishment protocol integrates node IDs, seed value and nonce seamlessly for security, then
establishes a session key between two nodes based on one-way hash algorithm SHA-1. On the other hand,
a low-complexity threshold selective encryption technology is proposed. Also, we design a security
selection patter exchange method with low-complexity for the threshold selection encryption. Then, we
evaluate the energy consumption of the proposed scheme. Our scheme shows the great advantage over
the other existing schemes in terms of low energy consumption.
A secure and energy saving protocol for wireless sensor networksjournalBEEI
The research domain for wireless sensor networks (WSN) has been extensively conducted due to innovative technologies and research directions that have come up addressing the usability of WSN under various schemes. This domain permits dependable tracking of a diversity of environments for both military and civil applications. The key management mechanism is a primary protocol for keeping the privacy and confidentiality of the data transmitted among different sensor nodes in WSNs. Since node's size is small; they are intrinsically limited by inadequate resources such as battery life-time and memory capacity. The proposed secure and energy saving protocol (SESP) for wireless sensor networks) has a significant impact on the overall network life-time and energy dissipation. To encrypt sent messsages, the SESP uses the public-key cryptography’s concept. It depends on sensor nodes' identities (IDs) to prevent the messages repeated; making security goals- authentication, confidentiality, integrity, availability, and freshness to be achieved. Finally, simulation results show that the proposed approach produced better energy consumption and network life-time compared to LEACH protocol; sensors are dead after 900 rounds in the proposed SESP protocol. While, in the low-energy adaptive clustering hierarchy (LEACH) scheme, the sensors are dead after 750 rounds.
2.espk external agent authentication and session key establishment using publ...EditorJST
Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed and deployed in a un attend environment, these are vulnerable to numerous security threats. In this paper, describe the design and implementation of public-key-(PK)-based protocols that allow authentication and session key establishment between a sensor network and a third party. WSN have limitations on computational capacity, battery etc which provides scope for challenging problems. We fundamentally focused on the security issue of WSNs The proposed protocol is efficient and secure in compared to other public key based protocols in WSNs.
Balancing Trade-off between Data Security and Energy Model for Wireless Senso...IJECEIAES
An extensive effort to evolve various routing protocol to ensure optimal data delivery in energy efficient way is beneficial only if there is additional means of security process is synchronized. However, the security process consideration introduces additional overhead thus a security mechanism is needed to accomplish an optimal trade-off that exists in-between security as well as resource utilization especially energy. The prime purpose of this paper is to develop a process of security in the context of wireless sensor networks (WSN) by introducing two types of sensor node deployed with different capabilities. The proposed algorithm Novel Model of Secure Paradigm (N-MSP) which is further integrated with WSN. However, this algorithm uses a Hash-based Message Authentication Code (HMAC) authentication followed by pairwise key establishment during data aggregation process in a WSN. The extensive simulation carried out in a numerical platform called MATLAB that depicts that the proposed N-MSP achieves optimal processing time along with energy efficient pairwise key establishment during data aggregation process.
Multi-Tiered Communication Security Schemes in Wireless Ad-Hoc Sensor NetworksIDES Editor
Networks of wireless micro-sensors for monitoring
physical environments have emerged as an important new
application area for wireless technology. Key attributes of
these new types of networked systems are the severely
constrained computational and energy resources and an ad
hoc operational environment. This paper is a study of the
communication security aspects of these networks. Resource
limitations and specific architecture of sensor networks call
for customized security mechanisms. Our approach is to
classify the types of data existing in sensor networks, and
identify possible communication security threats according
to that classification. We propose a communication security
scheme where for each type of data we define a corresponding
security mechanism. By employing this multi-tiered security
architecture where each mechanism has different resource
requirements, we allow for efficient resource management,
which is essential for wireless sensor networks.
A secure trust-based protocol for hierarchical routing in wireless sensor ne...IJECEIAES
Wireless sensor networks (WSNs) became the backbone of the internet of things (IoT). IoT applications are vital and demand specific quality of service (QoS) requirements. In addition, security has become a primary concern to provide secure communication between wireless nodes, with additional challenges related to the node’s computational resources. Particular, the design of secure and resource efficient routing protocol is a critical issue in the current deployment of WSNs. Therefore, this paper proposes a novel secure-trust aware routing protocol (ST2A) that provides secure and reliable routing. The proposed protocol establishes communication routes based on calculated trust value in joint with a novel cluster head selection algorithm in the hierarchical routing process. The proposed trust-aware routing algorithm improves the routing security in WSN and optimizes many performance metrics related to WSNs unique characteristics. The results of simulation validate the feasibility of the proposed algorithm for enhancing the network lifetime up to 18% and data delivery by 17% as compared with some state-of-the-art routing algorithms.
International Journal of Computational Engineering Research(IJCER) ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Secure and Efficient DiDrip Protocol for Improving Performance of WSNsINFOGAIN PUBLICATION
Wireless Sensor Networks consists of a set of resource constrained devices called nodes that communicate wirelessly with each other. Wireless Sensor Networks have become a key application in number of technologies. It also measures the unit of vulnerability to security threats. Several Protocols are projected to make them secure. Some of the protocols within the sensor network specialize in securing data. These protocols are named as data discovery and dissemination protocols. The data discovery and dissemination protocol for wireless sensor networks are utilized for distributing management commands and altering configuration parameters to the sensor nodes. All existing data discovery and dissemination protocols primarily suffer from two drawbacks. Basically, they are support centralized approach (only single station can distribute data item).This approach is not suitable for multiple owner-multiple users. Second, the protocols are not designed with security in mind. This Paper proposes the first distributed knowledge discovery and dissemination protocol called DiDrip which is safer than the existing one. The protocol permits multiple owners to authorize many network users with altogether totally different priorities to at an equivalent time and directly flow into data items to sensor nodes.
A secure and energy saving protocol for wireless sensor networksjournalBEEI
The research domain for wireless sensor networks (WSN) has been extensively conducted due to innovative technologies and research directions that have come up addressing the usability of WSN under various schemes. This domain permits dependable tracking of a diversity of environments for both military and civil applications. The key management mechanism is a primary protocol for keeping the privacy and confidentiality of the data transmitted among different sensor nodes in WSNs. Since node's size is small; they are intrinsically limited by inadequate resources such as battery life-time and memory capacity. The proposed secure and energy saving protocol (SESP) for wireless sensor networks) has a significant impact on the overall network life-time and energy dissipation. To encrypt sent messsages, the SESP uses the public-key cryptography’s concept. It depends on sensor nodes' identities (IDs) to prevent the messages repeated; making security goals- authentication, confidentiality, integrity, availability, and freshness to be achieved. Finally, simulation results show that the proposed approach produced better energy consumption and network life-time compared to LEACH protocol; sensors are dead after 900 rounds in the proposed SESP protocol. While, in the low-energy adaptive clustering hierarchy (LEACH) scheme, the sensors are dead after 750 rounds.
2.espk external agent authentication and session key establishment using publ...EditorJST
Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed and deployed in a un attend environment, these are vulnerable to numerous security threats. In this paper, describe the design and implementation of public-key-(PK)-based protocols that allow authentication and session key establishment between a sensor network and a third party. WSN have limitations on computational capacity, battery etc which provides scope for challenging problems. We fundamentally focused on the security issue of WSNs The proposed protocol is efficient and secure in compared to other public key based protocols in WSNs.
Balancing Trade-off between Data Security and Energy Model for Wireless Senso...IJECEIAES
An extensive effort to evolve various routing protocol to ensure optimal data delivery in energy efficient way is beneficial only if there is additional means of security process is synchronized. However, the security process consideration introduces additional overhead thus a security mechanism is needed to accomplish an optimal trade-off that exists in-between security as well as resource utilization especially energy. The prime purpose of this paper is to develop a process of security in the context of wireless sensor networks (WSN) by introducing two types of sensor node deployed with different capabilities. The proposed algorithm Novel Model of Secure Paradigm (N-MSP) which is further integrated with WSN. However, this algorithm uses a Hash-based Message Authentication Code (HMAC) authentication followed by pairwise key establishment during data aggregation process in a WSN. The extensive simulation carried out in a numerical platform called MATLAB that depicts that the proposed N-MSP achieves optimal processing time along with energy efficient pairwise key establishment during data aggregation process.
Multi-Tiered Communication Security Schemes in Wireless Ad-Hoc Sensor NetworksIDES Editor
Networks of wireless micro-sensors for monitoring
physical environments have emerged as an important new
application area for wireless technology. Key attributes of
these new types of networked systems are the severely
constrained computational and energy resources and an ad
hoc operational environment. This paper is a study of the
communication security aspects of these networks. Resource
limitations and specific architecture of sensor networks call
for customized security mechanisms. Our approach is to
classify the types of data existing in sensor networks, and
identify possible communication security threats according
to that classification. We propose a communication security
scheme where for each type of data we define a corresponding
security mechanism. By employing this multi-tiered security
architecture where each mechanism has different resource
requirements, we allow for efficient resource management,
which is essential for wireless sensor networks.
A secure trust-based protocol for hierarchical routing in wireless sensor ne...IJECEIAES
Wireless sensor networks (WSNs) became the backbone of the internet of things (IoT). IoT applications are vital and demand specific quality of service (QoS) requirements. In addition, security has become a primary concern to provide secure communication between wireless nodes, with additional challenges related to the node’s computational resources. Particular, the design of secure and resource efficient routing protocol is a critical issue in the current deployment of WSNs. Therefore, this paper proposes a novel secure-trust aware routing protocol (ST2A) that provides secure and reliable routing. The proposed protocol establishes communication routes based on calculated trust value in joint with a novel cluster head selection algorithm in the hierarchical routing process. The proposed trust-aware routing algorithm improves the routing security in WSN and optimizes many performance metrics related to WSNs unique characteristics. The results of simulation validate the feasibility of the proposed algorithm for enhancing the network lifetime up to 18% and data delivery by 17% as compared with some state-of-the-art routing algorithms.
International Journal of Computational Engineering Research(IJCER) ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Secure and Efficient DiDrip Protocol for Improving Performance of WSNsINFOGAIN PUBLICATION
Wireless Sensor Networks consists of a set of resource constrained devices called nodes that communicate wirelessly with each other. Wireless Sensor Networks have become a key application in number of technologies. It also measures the unit of vulnerability to security threats. Several Protocols are projected to make them secure. Some of the protocols within the sensor network specialize in securing data. These protocols are named as data discovery and dissemination protocols. The data discovery and dissemination protocol for wireless sensor networks are utilized for distributing management commands and altering configuration parameters to the sensor nodes. All existing data discovery and dissemination protocols primarily suffer from two drawbacks. Basically, they are support centralized approach (only single station can distribute data item).This approach is not suitable for multiple owner-multiple users. Second, the protocols are not designed with security in mind. This Paper proposes the first distributed knowledge discovery and dissemination protocol called DiDrip which is safer than the existing one. The protocol permits multiple owners to authorize many network users with altogether totally different priorities to at an equivalent time and directly flow into data items to sensor nodes.
Efficient Data Aggregation in Wireless Sensor NetworksIJAEMSJORNAL
Sensor network is a term used to refer to a heterogeneous system combining tiny sensors and actuators with general/special-purpose processors. Sensor networks are assumed to grow in size to include hundreds or thousands of low-power, low-cost, static or mobile nodes. This system is created by observing that for any densely deployed sensor network, high redundancy exists in the gathered information from the sensor nodes that are close to each other we have exploited the redundancy and designed schemes to secure different kinds of aggregation processing against both inside and outside attacks.
Energy Proficient and Security Protocol for WSN: A Reviewtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Theoretical work submitted to the Journal should be original in its motivation or modeling structure. Empirical analysis should be based on a theoretical framework and should be capable of replication. It is expected that all materials required for replication (including computer programs and data sets) should be available upon request to the authors.
The International Journal of Engineering & Science would take much care in making your article published without much delay with your kind cooperation
A N E NERGY -E FFICIENT A ND S CALABLE S LOT - B ASED P RIVACY H OMOMOR...ijassn
With the advent of Wireless Sensor Networks (WSN) a
nd its immense popularity in a wide range of
applications, security has been a major concern for
these resource-constraint systems. Alongside secur
ity,
WSNs are currently being integrated with existing t
echnologies such as the Internet, satellite, Wi-Max
, Wi-
Fi, etc. in order to transmit data over long distan
ces and hand-over network load to more powerful dev
ices.
With the focus currently being on the integration o
f WSNs with existing technologies, security becomes
a
major concern. The main security requirement for WS
N-integrated networks is providing end-to-end
security along with the implementation of in-proces
sing techniques of data aggregation. This can be
achieved with the implementation of Homomorphic enc
ryption schemes which prove to be computationally
inexpensive since they have considerable overheads.
This paper addresses the ID-issue of the commonly
used Castelluccia Mykletun Tsudik (CMT) [12] homomo
rphic scheme by proposing an ID slotting
mechanism which carries information pertaining to t
he security keys responsible for the encryption of
individual sensor data. The proposed scheme proves
to be 93.5% lighter in terms of induced overheads a
nd
11.86% more energy efficient along with providing e
fficient WSN scalability compared to the existing
scheme. The paper provides analytical results compa
ring the proposed scheme with the existing scheme
thus justifying that the modification to the existi
ng scheme can prove highly efficient for resource-
constrained WSNs.
AN ENERGY-EFFICIENT AND SCALABLE SLOTBASED PRIVACY HOMOMORPHIC ENCRYPTION SCH...ijassn
With the advent of Wireless Sensor Networks (WSN) and its immense popularity in a wide range of applications, security has been a major concern for these resource-constraint systems. Alongside security, WSNs are currently being integrated with existing technologies such as the Internet, satellite, Wi-Max, WiFi, etc. in order to transmit data over long distances and hand-over network load to more powerful devices. With the focus currently being on the integration of WSNs with existing technologies, security becomes a major concern. The main security requirement for WSN-integrated networks is providing end-to-end security along with the implementation of in-processing techniques of data aggregation. This can be achieved with the implementation of Homomorphic encryption schemes which prove to be computationally inexpensive since they have considerable overheads. This paper addresses the ID-issue of the commonly used Castelluccia Mykletun Tsudik (CMT) [12] homomorphic scheme by proposing an ID slotting mechanism which carries information pertaining to the security keys responsible for the encryption of individual sensor data. The proposed scheme proves to be 93.5% lighter in terms of induced overheads and 11.86% more energy efficient along with providing efficient WSN scalability compared to the existing scheme. The paper provides analytical results comparing the proposed scheme with the existing scheme thus justifying that the modification to the existing scheme can prove highly efficient for resourceconstrained WSNs.
Significant Storage on Sensor Storage Space, Energy Consumption and Better Se...ijasuc
WSNs are characterized by limited resources in terms of communication, computation and energy supply.
A critical constraint on sensors networks is that sensor nodes employ batteries. A second constraint is that
sensors will be deployed unattended and in large numbers, so that it will be difficult to change or recharge
batteries in the sensors .The Energy Consumption in wireless sensor networks varies greatly based on the
protocols the sensors use and computations used to generate keys for communication among neighbor
nodes. Previous research on sensor network security mainly considers homogeneous sensor networks,
where all sensor nodes have the same capabilities. Research has shown that homogeneous ad hoc networks
have poor performance and scalability. The many-to-one traffic pattern dominates in sensor networks, and
hence a sensor may only communicate with a small portion of its neighbors. Key Management is a
fundamental security operation. Most existing key management schemes try to establish shared keys for all
pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and this
causes large overhead and more energy consumption and more storage requirement. In this paper, we
adopt a Hybrid Sensor Network (HSN) model for better performance and security. We propose a novel
routing-driven key establishment scheme, which only establishes shared keys for neighbor sensors that
communicate with each other. We utilize Elliptic Curve Cryptography in the design of an efficient key
Establishment scheme for sensor nodes. The performance evaluation and security analysis show that our
key Establishment scheme can provide better security with significant reductions on communication
overhead, storage space and energy consumption than other key Establishment schemes.
A Survey on Secure Hierarchical LEACH Protocol over Wireless Sensor NetworkIJERD Editor
Wireless Sensor Network contain number of nodes. Lifetime of Sensor nodes depend on their battery
power, which cannot be reenergize. Thus, to save the node energy & lifetime of the Network energy efficient
LEACH protocol is introduced. Wireless sensor networks are facing many experiments such as the partial source
in processing power, storage and energy. The inadequate energy source is one of the main tasks facing the security
in such networks. LEACH doesn’t shield the safety harms. So we want to improve security scenario of Secure
LEACH protocol. Hierarchical or cluster base routing protocol for WSNs is the most energy-efficient among other
routing protocols. This paper shows different security mechanism used in LEACH protocol. This all protocol is
based on Hierarchical routing protocol. This paper shows basic scenario of security in LEACH.
AN ANTI-CLONE ATTACK KEY MANAGEMENT SCHEME FOR WIRELESS SENSOR NETWORKScsandit
Wireless Sensor Networks (WSNs) are subject to various kinds of attacks such as replaying of
messages, battery exhausting, and nodes compromising. While most of these attacks can be
dealt with through cryptographic security protocols provided by key management schemes,
there are always a few that manage to really cause problems. One such attack that is most
common and significant in WSNs is cloning attack. In clone attack, the intruder tries to capture
and compromise some nodes and inject them into several locations throughout the network in
order to conduct other types of attacks. Moreover, if this attack is not detected early, then these
replicated injected nodes will consume a large amount of the network resources. In this paper,
we analyze several key management schemes that can be used for checking integrity and
preventing cloning attacks. After analyzing the problems associated with these schemes, we
propose a model that allows us to distinguish between legitimate nodes and cloned nodes in
such sensor networks.
Concealed Data Aggregation with Dynamic Intrusion Detection System to Remove ...csandit
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
CONCEALED DATA AGGREGATION WITH DYNAMIC INTRUSION DETECTION SYSTEM TO REMOVE ...cscpconf
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
Physical layer security and energy efficiency over different error correcting...IJECEIAES
Despite the rapid growth in the market demanding for wireless sensor networks (WSNs), they are far from being secured or efficient. WSNs are vulnerable to malicious attacks and utilize too much power. At the same time, there is a significant increment of the security threats due to the growth of the several applications that employ wireless sensor networks. Therefore, introducing physical layer security is considered to be a promising solution to mitigate the threats. This paper evaluates popular coding techniques like Reed solomon (RS) techniques and scrambled error correcting codes specifically in terms of security gap. The difference between the signal to nose ratio (SNR) of the eavesdropper and the legitimate receiver nodes is defined as the security gap. We investigate the security gap, energy efficiency, and bit error rate between RS and scrambled t-error correcting codes for wireless sensor networks. Lastly, energy efficiency in RS and Bose-Chaudhuri-Hocquenghem (BCH) is also studied. The results of the simulation emphasize that RS technique achieves similar security gap as scrambled error correcting codes. However, the analysis concludes that the computational complexities of the 푅푆 is less compared to the scrambled error correcting codes. We also found that BCH code is more energy-efficient than RS.
Wireless Sensor Network (WSN) is a promising field for research. As the use of this field increases, it is
required to give proper security to this field. So to ensure the security of communication of data or messages and to
control the use of data in WSN is of great importance. As sensor networks interact with responsive data and operate
in unfriendly unattended area, from the time of system design these security concerns should be addressed. The paper,
presents a modified Motesec security protocol which is a security mechanism for Wireless sensor network. In this
protocol a hash function based approach is used to detect replay attacks. For data access control key lock matching
method i.e. memory data access control policy is used to prevent unauthorized data access. Encoding and
reconstruction scheme is used to find out attacker. Flooding attack detection by comparing data rate. There is currently
massive research is present in the area of wireless sensor network security..Keywords: GPS,GCM,LBS Android.
Keywords: secure communication architecture, wireless Sensor network security.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
IOT SOLUTIONS FOR SMART PARKING- SIGFOX TECHNOLOGYCSEIJJournal
Sigfox technology has emerged as a competitive product in the communication service provider market for
approximately a decade. Widely implemented for smart parking solutions across various European
countries, it has now gained traction in Germany as well. The technology's successful track record and
reputation in the market demonstrate its effectiveness and reliability in addressing the communication
needs of IoT applications, particularly in the context of vehicle parking systems. This is noted in terms of a
city like Berlin-Germany, for on which the study is conducted. The major challenge being on how to relate
the parking techniques in a more user friendly, cost effective and less energy consumpmti0n mode where
the questions had at the beginning of the paper, relatively at the end the answers are sought to it via Sigfox
and its comparison with other related technologies like LoRA WAN and weightless. But more so future
areas of research study is also pointed out on areas which are not clearly identified in this particular
research area.
This paper entails the pros, cons adaptive, emerging and existing technology study in terms of cloud, big
data, Data analytics are all discussed in tandem to Sigfox.
Reliability Improvement with PSP of Web-Based Software ApplicationsCSEIJJournal
In diverse industrial and academic environments, the quality of the software has been evaluated using
different analytic studies. The contribution of the present work is focused on the development of a
methodology in order to improve the evaluation and analysis of the reliability of web-based software
applications. The Personal Software Process (PSP) was introduced in our methodology for improving the
quality of the process and the product. The Evaluation + Improvement (Ei) process is performed in our
methodology to evaluate and improve the quality of the software system. We tested our methodology in a
web-based software system and used statistical modeling theory for the analysis and evaluation of the
reliability. The behavior of the system under ideal conditions was evaluated and compared against the
operation of the system executing under real conditions. The results obtained demonstrated the
effectiveness and applicability of our methodology
More Related Content
Similar to An Energy Efficient Data Secrecy Scheme For Wireless Body Sensor Networks
Efficient Data Aggregation in Wireless Sensor NetworksIJAEMSJORNAL
Sensor network is a term used to refer to a heterogeneous system combining tiny sensors and actuators with general/special-purpose processors. Sensor networks are assumed to grow in size to include hundreds or thousands of low-power, low-cost, static or mobile nodes. This system is created by observing that for any densely deployed sensor network, high redundancy exists in the gathered information from the sensor nodes that are close to each other we have exploited the redundancy and designed schemes to secure different kinds of aggregation processing against both inside and outside attacks.
Energy Proficient and Security Protocol for WSN: A Reviewtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Theoretical work submitted to the Journal should be original in its motivation or modeling structure. Empirical analysis should be based on a theoretical framework and should be capable of replication. It is expected that all materials required for replication (including computer programs and data sets) should be available upon request to the authors.
The International Journal of Engineering & Science would take much care in making your article published without much delay with your kind cooperation
A N E NERGY -E FFICIENT A ND S CALABLE S LOT - B ASED P RIVACY H OMOMOR...ijassn
With the advent of Wireless Sensor Networks (WSN) a
nd its immense popularity in a wide range of
applications, security has been a major concern for
these resource-constraint systems. Alongside secur
ity,
WSNs are currently being integrated with existing t
echnologies such as the Internet, satellite, Wi-Max
, Wi-
Fi, etc. in order to transmit data over long distan
ces and hand-over network load to more powerful dev
ices.
With the focus currently being on the integration o
f WSNs with existing technologies, security becomes
a
major concern. The main security requirement for WS
N-integrated networks is providing end-to-end
security along with the implementation of in-proces
sing techniques of data aggregation. This can be
achieved with the implementation of Homomorphic enc
ryption schemes which prove to be computationally
inexpensive since they have considerable overheads.
This paper addresses the ID-issue of the commonly
used Castelluccia Mykletun Tsudik (CMT) [12] homomo
rphic scheme by proposing an ID slotting
mechanism which carries information pertaining to t
he security keys responsible for the encryption of
individual sensor data. The proposed scheme proves
to be 93.5% lighter in terms of induced overheads a
nd
11.86% more energy efficient along with providing e
fficient WSN scalability compared to the existing
scheme. The paper provides analytical results compa
ring the proposed scheme with the existing scheme
thus justifying that the modification to the existi
ng scheme can prove highly efficient for resource-
constrained WSNs.
AN ENERGY-EFFICIENT AND SCALABLE SLOTBASED PRIVACY HOMOMORPHIC ENCRYPTION SCH...ijassn
With the advent of Wireless Sensor Networks (WSN) and its immense popularity in a wide range of applications, security has been a major concern for these resource-constraint systems. Alongside security, WSNs are currently being integrated with existing technologies such as the Internet, satellite, Wi-Max, WiFi, etc. in order to transmit data over long distances and hand-over network load to more powerful devices. With the focus currently being on the integration of WSNs with existing technologies, security becomes a major concern. The main security requirement for WSN-integrated networks is providing end-to-end security along with the implementation of in-processing techniques of data aggregation. This can be achieved with the implementation of Homomorphic encryption schemes which prove to be computationally inexpensive since they have considerable overheads. This paper addresses the ID-issue of the commonly used Castelluccia Mykletun Tsudik (CMT) [12] homomorphic scheme by proposing an ID slotting mechanism which carries information pertaining to the security keys responsible for the encryption of individual sensor data. The proposed scheme proves to be 93.5% lighter in terms of induced overheads and 11.86% more energy efficient along with providing efficient WSN scalability compared to the existing scheme. The paper provides analytical results comparing the proposed scheme with the existing scheme thus justifying that the modification to the existing scheme can prove highly efficient for resourceconstrained WSNs.
Significant Storage on Sensor Storage Space, Energy Consumption and Better Se...ijasuc
WSNs are characterized by limited resources in terms of communication, computation and energy supply.
A critical constraint on sensors networks is that sensor nodes employ batteries. A second constraint is that
sensors will be deployed unattended and in large numbers, so that it will be difficult to change or recharge
batteries in the sensors .The Energy Consumption in wireless sensor networks varies greatly based on the
protocols the sensors use and computations used to generate keys for communication among neighbor
nodes. Previous research on sensor network security mainly considers homogeneous sensor networks,
where all sensor nodes have the same capabilities. Research has shown that homogeneous ad hoc networks
have poor performance and scalability. The many-to-one traffic pattern dominates in sensor networks, and
hence a sensor may only communicate with a small portion of its neighbors. Key Management is a
fundamental security operation. Most existing key management schemes try to establish shared keys for all
pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and this
causes large overhead and more energy consumption and more storage requirement. In this paper, we
adopt a Hybrid Sensor Network (HSN) model for better performance and security. We propose a novel
routing-driven key establishment scheme, which only establishes shared keys for neighbor sensors that
communicate with each other. We utilize Elliptic Curve Cryptography in the design of an efficient key
Establishment scheme for sensor nodes. The performance evaluation and security analysis show that our
key Establishment scheme can provide better security with significant reductions on communication
overhead, storage space and energy consumption than other key Establishment schemes.
A Survey on Secure Hierarchical LEACH Protocol over Wireless Sensor NetworkIJERD Editor
Wireless Sensor Network contain number of nodes. Lifetime of Sensor nodes depend on their battery
power, which cannot be reenergize. Thus, to save the node energy & lifetime of the Network energy efficient
LEACH protocol is introduced. Wireless sensor networks are facing many experiments such as the partial source
in processing power, storage and energy. The inadequate energy source is one of the main tasks facing the security
in such networks. LEACH doesn’t shield the safety harms. So we want to improve security scenario of Secure
LEACH protocol. Hierarchical or cluster base routing protocol for WSNs is the most energy-efficient among other
routing protocols. This paper shows different security mechanism used in LEACH protocol. This all protocol is
based on Hierarchical routing protocol. This paper shows basic scenario of security in LEACH.
AN ANTI-CLONE ATTACK KEY MANAGEMENT SCHEME FOR WIRELESS SENSOR NETWORKScsandit
Wireless Sensor Networks (WSNs) are subject to various kinds of attacks such as replaying of
messages, battery exhausting, and nodes compromising. While most of these attacks can be
dealt with through cryptographic security protocols provided by key management schemes,
there are always a few that manage to really cause problems. One such attack that is most
common and significant in WSNs is cloning attack. In clone attack, the intruder tries to capture
and compromise some nodes and inject them into several locations throughout the network in
order to conduct other types of attacks. Moreover, if this attack is not detected early, then these
replicated injected nodes will consume a large amount of the network resources. In this paper,
we analyze several key management schemes that can be used for checking integrity and
preventing cloning attacks. After analyzing the problems associated with these schemes, we
propose a model that allows us to distinguish between legitimate nodes and cloned nodes in
such sensor networks.
Concealed Data Aggregation with Dynamic Intrusion Detection System to Remove ...csandit
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
CONCEALED DATA AGGREGATION WITH DYNAMIC INTRUSION DETECTION SYSTEM TO REMOVE ...cscpconf
Data Aggregation is a vital aspect in WSNs (Wireless Sensor Networks) and this is because it
reduces the quantity of data to be transmitted over the complex network. In earlier studies
authors used homomorphic encryption properties for concealing statement during aggregation
such that encrypted data can be aggregated algebraically without decrypting them. These
schemes are not applicable for multi applications which lead to proposal of Concealed Data
Aggregation for Multi Applications (CDAMA). It is designed for multi applications, as it
provides secure counting ability. In wireless sensor networks SN are unarmed and are
susceptible to attacks. Considering the defence aspect of wireless environment we have used
DYDOG (Dynamic Intrusion Detection Protocol Model) and a customized key generation
procedure that uses Digital Signatures and also Two Fish Algorithms along with CDAMA for
augmentation of security and throughput. To prove our proposed scheme’s robustness and
effectiveness, we conducted the simulations, inclusive analysis and comparisons at the ending.
Physical layer security and energy efficiency over different error correcting...IJECEIAES
Despite the rapid growth in the market demanding for wireless sensor networks (WSNs), they are far from being secured or efficient. WSNs are vulnerable to malicious attacks and utilize too much power. At the same time, there is a significant increment of the security threats due to the growth of the several applications that employ wireless sensor networks. Therefore, introducing physical layer security is considered to be a promising solution to mitigate the threats. This paper evaluates popular coding techniques like Reed solomon (RS) techniques and scrambled error correcting codes specifically in terms of security gap. The difference between the signal to nose ratio (SNR) of the eavesdropper and the legitimate receiver nodes is defined as the security gap. We investigate the security gap, energy efficiency, and bit error rate between RS and scrambled t-error correcting codes for wireless sensor networks. Lastly, energy efficiency in RS and Bose-Chaudhuri-Hocquenghem (BCH) is also studied. The results of the simulation emphasize that RS technique achieves similar security gap as scrambled error correcting codes. However, the analysis concludes that the computational complexities of the 푅푆 is less compared to the scrambled error correcting codes. We also found that BCH code is more energy-efficient than RS.
Wireless Sensor Network (WSN) is a promising field for research. As the use of this field increases, it is
required to give proper security to this field. So to ensure the security of communication of data or messages and to
control the use of data in WSN is of great importance. As sensor networks interact with responsive data and operate
in unfriendly unattended area, from the time of system design these security concerns should be addressed. The paper,
presents a modified Motesec security protocol which is a security mechanism for Wireless sensor network. In this
protocol a hash function based approach is used to detect replay attacks. For data access control key lock matching
method i.e. memory data access control policy is used to prevent unauthorized data access. Encoding and
reconstruction scheme is used to find out attacker. Flooding attack detection by comparing data rate. There is currently
massive research is present in the area of wireless sensor network security..Keywords: GPS,GCM,LBS Android.
Keywords: secure communication architecture, wireless Sensor network security.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Similar to An Energy Efficient Data Secrecy Scheme For Wireless Body Sensor Networks (20)
IOT SOLUTIONS FOR SMART PARKING- SIGFOX TECHNOLOGYCSEIJJournal
Sigfox technology has emerged as a competitive product in the communication service provider market for
approximately a decade. Widely implemented for smart parking solutions across various European
countries, it has now gained traction in Germany as well. The technology's successful track record and
reputation in the market demonstrate its effectiveness and reliability in addressing the communication
needs of IoT applications, particularly in the context of vehicle parking systems. This is noted in terms of a
city like Berlin-Germany, for on which the study is conducted. The major challenge being on how to relate
the parking techniques in a more user friendly, cost effective and less energy consumpmti0n mode where
the questions had at the beginning of the paper, relatively at the end the answers are sought to it via Sigfox
and its comparison with other related technologies like LoRA WAN and weightless. But more so future
areas of research study is also pointed out on areas which are not clearly identified in this particular
research area.
This paper entails the pros, cons adaptive, emerging and existing technology study in terms of cloud, big
data, Data analytics are all discussed in tandem to Sigfox.
Reliability Improvement with PSP of Web-Based Software ApplicationsCSEIJJournal
In diverse industrial and academic environments, the quality of the software has been evaluated using
different analytic studies. The contribution of the present work is focused on the development of a
methodology in order to improve the evaluation and analysis of the reliability of web-based software
applications. The Personal Software Process (PSP) was introduced in our methodology for improving the
quality of the process and the product. The Evaluation + Improvement (Ei) process is performed in our
methodology to evaluate and improve the quality of the software system. We tested our methodology in a
web-based software system and used statistical modeling theory for the analysis and evaluation of the
reliability. The behavior of the system under ideal conditions was evaluated and compared against the
operation of the system executing under real conditions. The results obtained demonstrated the
effectiveness and applicability of our methodology
DATA MINING FOR STUDENTS’ EMPLOYABILITY PREDICTIONCSEIJJournal
This study has been undertaken to predict the student employability.Assessing student employability
provides a method of integrating student abilities and employer business requirements, which is becoming
an increasingly important concern for academic institutions. Improving student evaluation techniques for
employability can help students to have a better understanding of business organizations and find the right
one for them. The data for the training classification models is gathered through a survey in which students
are asked to fill out a questionnaire in which they may indicate their abilities and academic achievement.
This information may be used to determine their competency in a variety of skill categories, including soft
skills, problem-solving skills and technical abilities and so on.The goal of this research is to use data
mining to predict student employability by considering different factors such as skills that the students have
gained during their diploma level and time duration with respect to the knowledge they have captured
when they expect the placement at the end of graduation. Further during this research most specific skills
with relevant to each job category also was identified. In this research for the prediction of the student
employability different data mining models such as such as KNN, Naive Bayer’s, and Decision Tree were
evaluated and out of that best model also was identified for this institute's student’s employability
prediction.So, in this research classification and association techniques were used and evaluated.
Call for Articles - Computer Science & Engineering: An International Journal ...CSEIJJournal
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.
A Complexity Based Regression Test Selection StrategyCSEIJJournal
Software is unequivocally the foremost and indispensable entity in this technologically driven world.
Therefore quality assurance, and in particular, software testing is a crucial step in the software
development cycle. This paper presents an effective test selection strategy that uses a Spectrum of
Complexity Metrics (SCM). Our aim in this paper is to increase the efficiency of the testing process by
significantly reducing the number of test cases without having a significant drop in test effectiveness. The
strategy makes use of a comprehensive taxonomy of complexity metrics based on the product level (class,
method, statement) and its characteristics.We use a series of experiments based on three applications with
a significant number of mutants to demonstrate the effectiveness of our selection strategy.For further
evaluation, we compareour approach to boundary value analysis. The results show the capability of our
approach to detect mutants as well as the seeded errors.
XML Encryption and Signature for Securing Web ServicesCSEIJJournal
In this research, we have focused on the most challenging issue that Web Services face, i.e. how to secure
their information. Web Services security could be guaranteed by employing security standards, which is the
main focus of this search. Every suggested model related to security design should put in the account the
securities' objectives; integrity, confidentiality, non- repudiation, authentication, and authorization. The
proposed model describes SOAP messages and the way to secure their contents. Due to the reason that
SOAP message is the core of the exchanging information in Web Services, this research has developed a
security model needed to ensure e-business security. The essence of our model depends on XML encryption
and XML signature to encrypt and sign SOAP message. The proposed model looks forward to achieve a
high speed of transaction and a strong level of security without jeopardizing the performance of
transmission information.
Performance Comparison of PCA,DWT-PCA And LWT-PCA for Face Image RetrievalCSEIJJournal
This paper compares the performance of face image retrieval system based on discrete wavelet transforms
and Lifting wavelet transforms with principal component analysis (PCA). These techniques are
implemented and their performances are investigated using frontal facial images from the ORL database.
The Discrete Wavelet Transform is effective in representing image features and is suitable in Face image
retrieval, it still encounters problems especially in implementation; e.g. Floating point operation and
decomposition speed. We use the advantages of lifting scheme, a spatial approach for constructing wavelet
filters, which provides feasible alternative for problems facing its classical counterpart. Lifting scheme has
such intriguing properties as convenient construction, simple structure, integer-to-integer transform, low
computational complexity as well as flexible adaptivity, revealing its potentials in Face image retrieval.
Comparing to PCA and DWT with PCA, Lifting wavelet transform with PCA gives less computation and
DWT-PCA gives high retrieval rate..
Call for Papers - Computer Science & Engineering: An International Journal (C...CSEIJJournal
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.
Paper Submission - Computer Science & Engineering: An International Journal (...CSEIJJournal
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.
Performance Comparison of PCA,DWT-PCA And LWT-PCA for Face Image RetrievalCSEIJJournal
This paper compares the performance of face image retrieval system based on discrete wavelet transforms
and Lifting wavelet transforms with principal component analysis (PCA). These techniques are
implemented and their performances are investigated using frontal facial images from the ORL database.
The Discrete Wavelet Transform is effective in representing image features and is suitable in Face image
retrieval, it still encounters problems especially in implementation; e.g. Floating point operation and
decomposition speed. We use the advantages of lifting scheme, a spatial approach for constructing wavelet
filters, which provides feasible alternative for problems facing its classical counterpart. Lifting scheme has
such intriguing properties as convenient construction, simple structure, integer-to-integer transform, low
computational complexity as well as flexible adaptivity, revealing its potentials in Face image retrieval.
Comparing to PCA and DWT with PCA, Lifting wavelet transform with PCA gives less computation and
DWT-PCA gives high retrieval rate..
Call for Papers - Computer Science & Engineering: An International Journal (C...CSEIJJournal
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.
Data security and privacy are important to prevent the re-
veal, modification and unauthorized usage of sensitive information. The
introduction of using critical power devices for internet of things (IoTs),
e-commerce, e-payment, and wireless sensor networks (WSNs) has brought
a new challenge of security due to the low computation capability of sen-
sors. Therefore, the lightweight authenticated key agreement protocols
are important to protect their security and privacy. Several researches
have been published about authenticated key agreement. However, there
is a need of lightweight schemes that can fit with critical capability de-
vices. Addition to that, a malicious key generation center (KGC) can
become a threat to watch other users, i.e impersonate user by causing
the key escrow problem
Call for Papers - Computer Science & Engineering: An International Journal (C...CSEIJJournal
Computer Science & Engineering: An International Journal (CSEIJ) is a bi-monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of the Computer Science & Computer Engineering. The journal is devoted to the publication of high quality papers on theoretical and practical aspects of computer science and computer Engineering.
Recommendation System for Information Services Adapted, Over Terrestrial Digi...CSEIJJournal
The development of digital television in Colombia has grown in last year’s, specially the digital terrestrial
television (DTT), which is an essential part to the projects of National Minister of ICT, thanks to the big
distribution and use of the television network and Internet in the country. This article explains how joining
different technologies like social networks, information adaptation and DTT, to get an application that
offers information services to users, based on their data, preferences, inclinations, use and interaction with
others users and groups inside the network.
Reconfiguration Strategies for Online Hardware Multitasking in Embedded SystemsCSEIJJournal
An intensive use of reconfigurable hardware is expected in future embedded systems. This means that the
system has to decide which tasks are more suitable for hardware execution. In order to make an efficient
use of the FPGA it is convenient to choose one that allows hardware multitasking, which is implemented by
using partial dynamic reconfiguration. One of the challenges for hardware multitasking in embedded
systems is the online management of the only reconfiguration port of present FPGA devices. This paper
presents different online reconfiguration scheduling strategies which assign the reconfiguration interface
resource using different criteria: workload distribution or task’ deadline. The online scheduling strategies
presented take efficient and fast decisions based on the information available at each moment. Experiments
have been made in order to analyze the performance and convenience of these reconfiguration strategies.
Performance Comparison and Analysis of Mobile Ad Hoc Routing ProtocolsCSEIJJournal
A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peer-to-peer routing instead
of static network infrastructure to provide network connectivity. MANETs have applications in rapidly
deployed and dynamic military and civilian systems. The network topology in a MANET usually changes
with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing
protocols may not be suitable for MANETs. Researchers are designing new MANET routing protocols
and comparing and improving existing MANET routing protocols before any routing protocols are
standardized using simulations. However, the simulation results from different research groups are not
consistent with each other. This is because of a lack of consistency in MANET routing protocol models
and application environments, including networking and user traffic profiles. Therefore, the simulation
scenarios are not equitable for all protocols and conclusions cannot be generalized. Furthermore, it is
difficult for one to choose a proper routing protocol for a given MANET application. According to the
aforementioned issues, this paper focuses on MANET routing protocols. Specifically, my contribution
includes the characterization of different routing protocols and compare and analyze the performance of
different routing protocols.
Adaptive Stabilization and Synchronization of Hyperchaotic QI SystemCSEIJJournal
The hyperchaotic Qi system (Chen, Yang, Qi and Yuan, 2007) is one of the important models of four-
dimensional hyperchaotic systems. This paper investigates the adaptive stabilization and synchronization
of hyperchaotic Qi system with unknown parameters. First, adaptive control laws are designed to
stabilize the hyperchaotic Qi system to its equilibrium point at the origin based on the adaptive control
theory and Lyapunov stability theory. Then adaptive control laws are derived to achieve global chaos
synchronization of identical hyperchaotic Qi systems with unknown parameters. Numerical simulations
are shown to demonstrate the effectiveness of the proposed adaptive stabilization and synchronization
schemes.
To improve the QoS in MANETs through analysis between reactive and proactive ...CSEIJJournal
A Mobile Ad hoc NETwork (MANET), is a self-configuring infra structure less network of mobile devices
connected by wireless links. ad hoc is Latin and means "for this purpose". Each device in a MANET is free
to move independently in any direction, and will therefore change its links to other devices frequently. Each
must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building
a MANET is equipping each device to continuously maintain the information required to properly route
traffic. QOS is defined as a set of service requirements to be met by the network while transporting a
packet stream from source to destination. Intrinsic to the notion of QOS is an agreement or a guarantee by
the network to provide a set of measurable pre-specified service attributes to the user in terms of delay,
jitter, available bandwidth, packet loss, and so on. The analysis is mainly between proactive or table-driven
protocols like OLSR (Optimized Link State Routing) viz DSDV (Destination Sequenced Distance Vector) &
CGSR (Cluster Head Gateway Switch Routing) and reactive or source initiated routing protocols viz
AODV (Ad hoc on Demand distance Vector) & DSR (Dynamic Source Routing). The QoS analysis of the
above said protocols is simulated on NS2 and results are shown thereby.
This paper introduces Topic Tracking for Punjabi language. Text mining is a field that automatically
extracts previously unknown and useful information from unstructured textual data. It has strong
connections with natural language processing. NLP has produced technologies that teach computers
natural language so that they may analyze, understand and even generate text. Topic tracking is one of the
technologies that has been developed and can be used in the text mining process. The main purpose of topic
tracking is to identify and follow events presented in multiple news sources, including newswires, radio and
TV broadcasts. It collects dispersed information together and makes it easy for user to get a general
understanding. Not much work has been done in Topic tracking for Indian Languages in general and
Punjabi in particular. First we survey various approaches available for Topic Tracking, then represent our
approach for Punjabi. The experimental results are shown.
EXPLORATORY DATA ANALYSIS AND FEATURE SELECTION FOR SOCIAL MEDIA HACKERS PRED...CSEIJJournal
In machine learning, the intelligence of a developed model is greatly influenced by the dataset used for the
target domain on which the developed model will be deployed. Social media platform has experienced
more of hackers’ attacks on the platform in recent time. To identify a hacker on the platform, there are two
possible ways. The first is to use the activities of the user while the second is to use the supplied details the
user registered the account with. To adequately identify a social media user as hacker proactively, there
are relevant user details called features that can be used to determine whether a social media user is a
hacker or not. In this paper, an exploratory data analysis was carried out to determine the best features
that can be used by a predictive model to proactively identify hackers on the social media platform. A web
crawler was developed to mine the user dataset on which exploratory data analysis was carried out to
select the best features for the dataset which could be used to correctly identify a hacker on a social media
platform.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
An Energy Efficient Data Secrecy Scheme For Wireless Body Sensor Networks
1. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
DOI : 10.5121/cseij.2011.1201 1
AN ENERGY EFFICIENT DATA SECRECY SCHEME
FOR WIRELESS BODY SENSOR NETWORKS
Jun Wu and Shigeru Shimamoto
Graduate School of Global Information and Telecommunication Studies,
Waseda University, Tokyo, Japan
junwu@akane.waseda.jp, shima@waseda.jp
ABSTRACT
Data secrecy is one of the key concerns for wireless body sensor networks (WBSNs). Usually, a data
secrecy scheme should accomplish two tasks: key establishment and encryption. WBSNs generally face
more serious limitations than general wireless networks in terms of energy supply. To address this, in this
paper, we propose an energy efficient data secrecy scheme for WBSNs. On one hand, the proposed key
establishment protocol integrates node IDs, seed value and nonce seamlessly for security, then
establishes a session key between two nodes based on one-way hash algorithm SHA-1. On the other hand,
a low-complexity threshold selective encryption technology is proposed. Also, we design a security
selection patter exchange method with low-complexity for the threshold selection encryption. Then, we
evaluate the energy consumption of the proposed scheme. Our scheme shows the great advantage over
the other existing schemes in terms of low energy consumption.
KEYWORDS
Wireless Body Sensor, Security, Key Establishment, Hash, Selective Encryption
1. INTRODUCTION
Wireless body sensor networks (WBSNs) take an important role in telemedicine systems. In
WBSNs, wireless sensor technology is used for health monitoring applications. Body sensors
can be used to collect patients’ medical data unobtrusively and ubiquitously around the clock
without disrupting their normal daily lives. Moreover, advances in wireless communications
technology have overcome most of the geographical, temporal, and even organizational barriers
to facilitate a completely roaming way of transferring medical data.
In WBSNs, lack of adequate security features may not only leads to a breach of patients’
privacy but also potentially allows adversaries to modify actual data resulting in wrong
diagnosis and treatment [1], [2]. Also, health information collected from sensors needs to be
secured and in many countries (for example USA) security is mandated [3]. Therefore, the
security features should be implemented in WBSNs.
Although WBSNs share many of challenges and opportunities with general wireless sensor
networks (WSNs), many WBSN-specific research and design questions have emerged that
require new lines of inquiry. For example, a WBSN must have fewer and smaller nodes relative
to a conventional WSN. Smaller nodes imply smaller batteries, creating strict tradeoffs between
the energy consumed by processing, storage, and communication resources and the fidelity,
throughput, and latency required by applications [4]. Therefore, the energy cost of the security
designs for WBSNs should be lower than those of general WSNs. It is very necessary to
investigate energy efficient data secrecy for WBSNs.
2. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
2
Many authentication models based on public/private key for MANET networks are complex [5].
Hence, symmetric encryption is a poplar way to design the data secrecy schemes for WSNs.
Usually, the data secret design include two important issues: 1) Key establishment; and 2)
Encryption during data exchange. We focus on energy efficient data secrecy on these two
phases.
On one hand, the establishment of a shared secret key between a pair of nodes is the basis for
other security services such as encryption. In this paper, we propose a key establishment
protocol, which seamlessly integrates node IDs, seed value and nonce for generating
cryptographic keys. Our protocol applies the one-way hash algorithm SHA-1 to ensure the
security of the process of key establishment.
On the other hand, in general WSNs, strong encryption algorithms, such as Advanced
Encryption Standard (AES), are usually used for the data secrecy. However, the energy
consumption of strong encryption is relatively high. As a matter of fact, the security
requirements in of medical data usually are quite different from those of general WSNs. A good
example would be an audit report on a medical system. This report may be generated for an
external auditor, and contain sensitive information. The auditor will check the report for the
medical information that indicates possible cases of fraud or abuse. Assume that management
has required that some personal information (i.e. “Names”, “Occupation”, “Home address”, etc.)
should not be available to the auditor. Moreover, the data needs to be presented to the auditor in
a way that allows the examination of all data, so that patterns in the data may be detected. Full
encryption cannot suitable for this case, because only some parts of the data are secret. As a
matter of fact, selective encryption is a proven technology in the field of secure multimedia
communication [6]. The purpose of selective encryption is just to encrypt certain portions of the
message with less overhead consumption. In this paper, we introduce selective encryption and
adopt it for WBSNs.
The rest of this paper is organized as follows: In Sect. 2, we describe the related works about
data secrecy with its energy consumption for sensor networks. In Sect. 3, we discuss
preliminaries and assumptions including topology model, protocol model and attack model. We
present our key establishment protocol in details in Sect. 4. The proposed threshold selective
encryption scheme is shown in Sect. 5. Then, we discuss the security features of proposed
scheme in Sect. 6. In Sect. 7, we evaluate the energy cost of the proposed scheme and make
comparisons with other existing schemes. Finally, we conclude the paper in Sect. 8.
2. RELATED WORKS
Recently, data secrecy scheme for WSNs and WBSNs as well as their energy cost have been
attracted a lot of attentions.
Yee Wei Law et al. [7] proposed a data secret scheme, KALwEN, which combines the
cryptographic techniques of ECDH, combinatorial key pre-distribution, authenticated broadcast
by one-way hash and threshold secret sharing. Haowen Chan et al. [8] proposed key
establishment scheme for WSNs, which is called Peer Intermediaries of Key Establishment
(PIKE). PIKE is a key-establishment protocol which uses one or more sensor nodes as a trusted
intermediary to facilitate key establishment. Giacomo de Meulenaer et al. [9] investigated
Kerberos protocol with symmetric key cryptography for WSNs. Also, they studied ECDH-
ECDSA authentication protocol, which uses Diffie-Hellman key agreement based on Elliptic
Curve Cryptography (ECC) and Elliptic Curve Digital Signature Algorithm (ECDSA). Also, the
energy costs of both the Kerberos and ECDH-ECDSA on MICAz as well as TelosB nodes are
analyzed. Patrick W. Fitzgibbons et al. [10] investigated the implementation of existing typical
3. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
3
protocol (such as Kerberos) on resource-restrained sensor nodes. The energy of related
protocols is evaluated on several exiting sensor motes.
3. PRELIMINARIES AND ASSUMPTIONS
3.1. Network Architecture
Network topology must be considered before designing the key establishment protocol. There
are five common kinds of topologies for WBSNs: point-to-point, star, mesh, tree and hybrid.
The topology is the choice of application design. Indeed, mesh topology contains the features of
all the other topology, because mesh topology is a network where all the nodes are connected to
each other. Moreover, mesh topology are used in many application projects, such as BASUMA
project [11].
Without loss of generality, we assume that our key establishment protocol is designed for
WBSNs with mesh topology, so that our protocol can be used universally for all the topologies.
The mesh topology is preferable when sensors need to communicate with each other. Usually,
one of the nodes of a WBSN can be the aggregator. This aggregator can serve as a user interface,
and bridging the WBSN to higher-level infrastructures and thus to other stakeholders.
3.2. Protocol Model
We consider a set of nodes interconnected by point-to-point links over which messages can be
exchanged. We define that message-driven protocols are collections of interactive procedures,
which specify a particular processing of incoming messages and the generation of outgoing
messages. Key establishment and medical data exchange are message-driven protocols where
the communication the communication takes place between pairs of nodes in the network.
3.3. Adversary Model
This paper considers attackers whose main goal is to obtain sensor data which they are not
authorized to access. The adversaries could be either external intruders or network nodes who
are unauthorized to access the target type of data [12]. We consider the attack models shown as
follows.
Eavesdrop attack: the possible damage of a successful wireless attack starts with the ability to
eavesdrop on the data transferred during the communication of two nodes, ends with the ability
to fully impersonate other devices.
Replay attack: a message or a fragment of a message is taken out of its original context and
replayed as a part of another message, in another protocol run, or even in a run of another
protocol.
Denial of service (DoS) attack: adversary can launch large number of bogus packets to interrupt
communication. Then the legitimate users or nodes are deprived of the services of a resource
they would normally expect to have.
4. THE PROPOSED KEY ESTABLISHMENT SCHEME
4.1. Design of Key Establishment Protocol
In this paper, the cryptographic algorithm used to design the key establishment protocol is one-
way hash algorithm SHA-1. SHA-1 is a cryptographic hash function designed by the National
Security Agency and published by the NIST as a U.S. Federal Information Processing Standard.
SHA stands for Secure Hash Algorithm. SHA-1 is the most widely used of the existing SHA
4. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
4
hash functions, and is employed in several widely-used security applications and protocols. The
SHA-1 algorithm takes as input a message with maximum length of less than 264
bits and
produces as output a 160-bit message digest [13]. As a one-way hash function, the most
important property of SHA-1is that it has no inverse function x=F-1
(y), which means for a given
x, it is easy to calculate y=F(x).
Before design the key establishment protocol, we first define some notations used in the key
establishment protocol, as shown in Table 1.
Table 1 Notations used by the key establishment protocol
Notation Meaning
IDI The identity of node I
T A timestamp generated by node A
KA,B The session key between node A and B
nI A nonce generated by node I, it is a randomized value to defend reply attack
X||Y A concatenation of message X and Y
SHA-1(K: M) Use SHA-1 to calculate the digest value of message M by key K
VS Seed value stored in each node
Msg.i The ith
message in the protocol
Si Verifier of the ith
message
Our key establishment protocol is illustrated in Fig. 1. When a WBSN is deployed, each node of
the network is assigned an identical seed value VS. The length of VS is 128 bits. VS is stored in
the protected storage of the nodes, so it is unreadable for external programs. Note that there are
many existing designs the protected storage, such as the design in [14].
Let node A is the initiator of the key establishment process, and B shall be the node which A
wants to set up a unique session key. Node A first generates a nonce nA and a timestamp T. At
the same time, A starts its timer that will fire after time Tmin. Note that the nonce nA is a 32-bit
random value and the timestamp T is a sequence of characters, denoting the time at which a
certain event occurred. Then she uses the 160-bit nA||VS as the key of one-way hash algorithm
SHA-1, and generates her master key KA. Then she computes a digital digest of VS||nA, which is
marked as S0 working as a verifier. After that she sends node B a message, which contains nA,
IDA , T and the verifier S0. This message is marked as Msg. 1.
Upon receiving the Msg. 1 from node A, node B first checks whether the nonce has been
received before and whether the message is created in a very recent time. If that is not true, node
B will drop the packet from node A. Otherwise she will continue the next computation. She first
computes KA based on nA, IDA and VS. Then she uses KA to calculate digital digest S0’ based on
nA in Msg. 1 and VS. After that she verifies the validity of Msg. 1. If S0’ does not equal S0, she
will drop the packet from node A. If S0’ equals S0, she uses VS||nA as the key of SHA-1 to
compute her mater key KB. Then she uses KB as the key of SHA-1 to compute the session key
KA,B, and IDA||IDB||nA is the input to SHA-1 algorithm. After that she uses KA as the key of SHA-
1 algorithm to compute a digital digest of IDB||nA, which is marked as S1 working as a verifier.
At last, she sends node A a message, which contains IDB and S1. This message is marked as
Msg. 2.
Upon receiving the Msg. 2, node A first uses KA to calculate digest S1’ based on IDB and nA in
the Msg. 2. Then she verifies the validity of Msg. 2. If S1’ does not equal S1, she will drop the
packet from node B. If S1’ equals S1, she uses VS||nA as the key of SHA-1 to compute KB. After
that she uses KB as the key of SHA-1 to compute the session key KA,B, and IDA||IDB||nA is the
5. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
5
input to SHA-1 algorithm. When A’s timer fires after Tmin, she erase the seed value VS and B’s
master key KB, but keeps her own master key KA. Then a session key KA,B is established between
node A and node B.
Node A Node B
generate nA
generate T
calculate KA=SHA-1(VS||nA: IDA)
calculate S0=SHA-1(KA: VS||nA)
Msg. 1: nA, T, IDA, S0
verify S0’;
if S0=S0'{
calculate KB=SHA-1(VS||nA: IDB);
calculate KA,B=SHA-1(KB, IDA||IDB||nA);
calculate S1=SHA-1(KA: IDB||nA);}
else drop packet from Node A;
calculate KA=SHA-1(VS||nA: IDA)
calculate S0’=SHA-1(KA: VS||nA)
Msg. 2: IDB, S1
calculate S1’=SHA-1(KA: IDA||nA)
verify S1’;
if S1=S1'{
calculate KB=SHA-1(VS||nA: IDB);
calculate KA,B=SHA-1(KB, IDA||IDB||nA);}
else drop packet from Node B;
Event
Time
starts its timer that will fire after Tmin
when t>Tmin ,erase KB, VS
Figure 1. Key establishment protocol
4.2. Message Structure of Key Establishment
In the proposed key establishment protocol, a node identifier (node ID) consists of 64 bits.
Furthermore, we count 32 bits for the nonce and 64 bits for the timestamp. An output of SHA-1
algorithm consists 160 bits. Therefore, the message structure of the proposed protocol is
illustrated in Fig. 2. The lengths of Msg. 1 and Msg. 2 are 320 bits and 224 bits respectively.
plaintext ciphertext
64 bits 32 bits 64 bits 160 bits
320 bits
64 bits 160 bits
224 bits
Msg. 1
Msg. 2
IDA nA T S0
S1
IDB
Figure 2. Message structure
6. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
6
5. THRESHOLD SELECTIVE ENCRYPTION FOR DATA EXCHANGE
After designing the key establishment, we focus on the encryption during data exchange. In this
section, we propose a threshold selective encryption for WBSNs. Although a lot of selective
encryption algorithms have been proposed for securing multimedia communication, the
complexity of these schemes are relative high. Hence, the existing selective encryption schemes
cannot be applied in WBSNs directly. In this section, we develop a threshold selective
encryption as well as secure selection pattern transmission scheme, which satisfies the
requirements on security and low energy cost of WBSN.
5.1. Encryption Process
During the deployment of WBSNs, an encryption threshold H (H∈[0, 1]) is set for each type of
medical data. During the data exchange, a sender node generates a random value Y, where Y∈[0,
1]. Then, the sender node compares the value of Y with the pre-determined threshold H. Then,
based on the result of the comparison, the sender node makes a decision whether the message
should be encrypted or not. If the random value Y is greater than or equal to the threshold H,
the sender node encrypts the data based on existing symmetric algorithm, such as AES.
Otherwise, the sender node sends the data as plaintext. The key used to perform encryption is
the symmetric key established by the method in Sect. 4. The principle of threshold selective
encryption is shown in Fig. 3.
Yes
Encrypt data
No
Send data
Set the threshold
value H
?
Y H
≥
Generate Y
Figure 3. The process of threshold selective encryption
In our scheme, the sensitive data can be set a low threshold. The low threshold means the data
have a high probability to be encrypted. If the data includes the highest secrecy, the responding
threshold can be set as zero. In this case, the data must be encrypted. On the contrary, if the data
dose not include any secrecy. The threshold can be set as one. In this case, the data will not be
encrypted and be sent as plaintext. Note that value of the threshold depends on the application
scenario and the requirements of the users. Moreover, the value of the threshold can be set based
on the security requirements and the computation resources of the system. The users can get a
trade-off between security and resource consumption.
5.2. Secure Selection Pattern Transmission
Once the sender node of the communication parties, it will let the corresponding receiver know
the encryption pattern. Then the receiver node can know which part of the data is encrypted.
Thus she can use the symmetric key to decrypt the corresponding parts of the data. The
selection patter can also be eavesdropped by the attackers. Therefore, it must be transferred in a
7. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
7
secure way. Many existing selective encryption schemes use public key cryptography to
exchange the selection patter, which is too expensive for resource-restrained WBSNs.
To address the above challenge, we propose a low-complexity secure exchange of selection
patter. In our scheme, we add a selection stamp to every data block. The selection stamp marks
whether the data block is encrypted or not. The receiver node can decide whether perform the
corresponding decryption or not according to the selection stamp. Note that selection stamp is
not the secret information of the individual. Also, the number of the bits in the encryption stamp
is not large. Hence, using strong encryption to secure the stamp will course unnecessary energy
cost. The structure of medical data with selection stamps is shown in Fig. 4. We embed the
selection stamp into the original medical data. Then, we secure the exchange of selection stamp
based on secure random checksums (SRCs).
Original medical data Selection stamp
Message
Figure 4. Medical data message with selection stamps
SRCs [15] are proposed as a simple alternative to more complex and computationally expensive
homomorphic hashing functions. SRCs work well in Galois Fields of the form GF(2q
), while
homomorphic hashing takes place in modular fields of prime order, where arithmetic operations
are more expensive.
SRCs are created by a server in possession of the complete file. The server node chooses a
vector r = [r1 . . . rm] of random coefficients from the same field that is used for the source
coding operations. The secure random checksum of an original block b is then defined as the
sum of pairwise products of r and b:
1
SRC( )
m
i i
i
b rb
=
= ∑
Suppose that the original medical data file is divided into n blocks. Every block is followed a
selection stamp. Selection stamp P = [p1, p2, …, pn]. Every selection stamp composed of m
symbols pi= [pi1, pi2, …, pim]. The structure of the original medical data with selection stamps is
shown as Fig. 4. Then, the original medical data with the selection stamps is transferred to the
receiver node by the sender node. Also, the SRCs together with r are transmitted to the user.
Because of the linear nature of the computation, it is obvious that the SRCs of the original
blocks can be used to calculate SRCs for any received encoded blocks. A peer that received a
combined block c with associated identity g needs just to check the stamp as following:
1 1 1
( )
m m n
j j j i i
j j i
r c r g p
= = =
=
∑ ∑ ∑
where pi refers to the selection stamp of the ith
original block of the file.
Based on the above secure design, the attackers cannot modify or replace the selection stamp.
Thus the receiver node can decrypt the messages according the selection stamps. The selection
stamps do not need to be encryption because they are not the private data of patients.
8. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
8
6. SECURITY ANALYSIS
In this section, we analyze the security of our scheme. We evaluate the security of our work by
analyzing its resistance to the attacks described in sect. 3.
Eavesdrop attack resistance: During the key establishment, each node is assigned a seed value
VS when the node is deployed. Therefore, even if Msg. 1 or Msg. 2 in our protocol are
eavesdropped, the attacker can not get the seed value VS. And the attacker cannot get the session
key KA,B, because KA,B is calculated by KA,B=SHA-1(KB, IDA||IDB||nA). Attacker cannot derive VS
from S0 because the property of SHA-1 described in sect. 3. During the medical data exchange,
our scheme encrypts the secret data in the message based on the symmetric key. Thus the
attackers cannot get the plaintext of secret data, because they do not have the symmetric key.
Replay attack resistance: During the key establishment, a sender node first generates a nonce nA
and a timestamp T. nA and T are embedded into Msg. 1. When receiving a message, the receiver
node checks whether the nonce has been received before. At the same time, the receiver node
checks whether the message is created in a very recent time. If nA has been received before or
the message is not created in a very recent time, receiver node will regard the message is from
an attack. If an attacker wants to modify nA to implement replay attack, the receiver node will
drop the packet because S0’ will not equal S0 when the verification is implemented. During the
medical data exchange, the replay attackers cannot get the symmetric key. Thus the receiver can
distinguish the validity of the message based on the encrypted data. Hence the attacker cannot
generate available replay attacks.
DoS attack resistance: the receiver node checks nA and T of queries as soon as she receive it.
Also, the receiver node verifies the verifiers. The receiver node will drop the packet soon if the
check or the verifying cannot pass. Before verifying, few calculations will be implemented,
which process SHA-1 algorithm twice. Also, before verifying S0 and S1, few values need be
stored. In all, our protocol can resist DoS attack to some extent. During the medical data
exchange, our scheme selectively encrypts the messages, hence the computation consumption is
reduced. Also, every message is authenticated. This may avoid the attackers to spoof the packets
of messages. Hence, our scheme can resist against DoS attacks to some extent.
In addition to the security capabilities listing above, our protocol can also resist some other
attacks. For example, our protocol can resist node capture attack. If one of the nodes is captured,
the attacker cannot get the seed value VS, because that VS is stored in the protected storage and it
is unreadable for attackers. Moreover, nA is different for each session. Hence, the attacker
cannot get the session key.
7. ENERGY CONSUMPTION EVALUATION AND COMPARISON
7.1. Energy Consumption of Key Establishment
In this section, we evaluate the energy cost of the proposed scheme. We conducted our
evaluation of the energy cost of cryptographic key establishment on a WINS sensor node from
Rockwell Scientific [16]. Our motivation for using this specific sensor node is twofold. First, we
wanted to use the same node as the authors of [10] so that we can directly compare the results.
The second reason for choosing the WINS node is because this kind of sensor mote has been
applied to perform monitor and control for health care.
Computation energy cost: The computation of our protocol is one-way hash computation. For
the cost of computation, we make the approximation that the overall power consumption of the
node while computing remains constant with the type of microcode operation performed.
9. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
9
Hence, the cost of particular computation can be assessed based on per cycle mean energy
consumption and the total number of cycles of the computation. This simplifying assumption
was verified by Yee Wei Law et al. in [17]. For the energy cost of SHA-1 algorithm, we use the
implementation results of Patrick W. Fitzgibbons et al. [10]. They implemented SHA-1 on
WINS node. And the energy cost of SHA-1 on 160-bit block is 2.16µJ. In our protocol, ten
SHA-1 computation operations on 160-bit blocks have to be carried out in each run. Therefore,
we can get the computation energy cost of our protocol on Rockwell WINS node 21.6µJ.
Communication energy cost: A WINS node sending data with a transmit power of 0.12 mW has
an overall power consumption of about 771.1 mW. The overall power consumption increases to
1080.5 mW for a transmit power of 36.3 mW [16]. On the other hand, when the radio module
operates in receive (Rx) mode, the WINS node consumes about 751.6 mW. Given the 100 kbit/s
transmission rate of the WINS radio module, the transmission of one bit of data requires an
energy between 7.71μJ and 10.8μJ on the sending node, and 7.52 μJ on the receiving node,
respectively. The overall energy cost for transmitting (i.e. sending and receiving) a single bit of
data is between15.2μJ and 18.3 μJ. The communication energy cost is shown in Table 2.
Total energy cost: the overall energy cost of a key establishment protocol is not only determined
by energy required for calculating cryptographic primitives, but also by the energy cost of radio
communication between the involved nodes. Gathering the computation and communication
costs found above provides the total costs for the protocol shown in Table 3.
Table 2. Communication energy cost
Message Length Energy
Msg. 1 320bits 4.86-5.86mJ
Msg. 2 224bits 3.40-4.10mJ
All msgs. 544bits 8.26-9.96mJ
Table 3. Total energy cost
Energy cost Energy
Computation 21.6 μJ (0.24%-0.2%)
Communication 8.26-9.96 mJ (99.76%-99.8%)
Total 8.28-9.98mJ
Then we compare the energy of our protocol with other existing schemes. In order to verify
whether the energy cost of our protocol is lower than that of existing schemes, we use the
maximum energy 9.98 mJ to make comparisons. For the purpose of making comparisons under
the same condition, we assume that the symmetric key cryptographic is AES and one-way hash
algorithm is SHA-1 in the related schemes. And we also assume that the node platform is WINS
node. For the SHA-1 and AES algorithm, we use the implementation results in [10]. In PIKE
scheme [8], twelve AES operations as well as twelve SHA-1 operations have to be carried out.
And 1248-bit data need to be transferred in PIKE. In KALwEN scheme [7], ECDH is the
computation operation which courses the main energy cost. In addition, we choose Kerberos,
Just-Vaudenary and Otway-Rees as the representatives of general protocols for comparison.
Patrick W. Fitzgibbons et al. [10] implemented these general protocols on WINS node. The
comparison between our protocol and above related protocols is shown in Fig. 5. Based on Fig.
5, we can see that our protocol is around respectively 2.3 times less costly than PIKE, 10 times
less costly than KALwEN, 5.2 times less costly than Kerberos, 13 times less costly than Just-
10. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
10
Vaudanary, and 10 times less costly than Otway-Rees. In sum, the energy cost of our protocol
is much lower than that of other existing protocols.
0 10 20 30 40 50 60 70 80 90 100 110 120 130 140
Otway-Rees
Just-
Vaudenary
Kerberos
KALwEN
PIKE
Our scheme
Energy consumption (mJ)
Figure 5. Comparisons of energy cost
7.1. Saving Energy Consumption during Data Exchange
In this section, in order to evaluate the saving energy of our scheme during data exchange, we
implement a simulation experiment based on NetLogo [18]. We use AES as the symmetric
cryptography algorithm to evaluate our scheme. Because the length of plaintext and cipertext
are same for AES, we just evaluate the advantages of our scheme on encryption energy during
data exchange. The energy required for the calculation of cryptographic primitives is simply the
product of the average power consumption and the execution time. We setup a WBSN with 10
to 30 sensor nodes. Considering the relative mobility between the body sensors, we set these
sensor nodes randomly move within a 2m×2m rectangle area. Each node randomly chooses its
initial position, moves at a speed distributed randomly between zero and a maximum speed. We
set the maximum speed as 0.1m/s.
10 15 20 25 30
30
40
50
60
70
80
Saving
energy
(%)
Network size
H=0.75
H=0.5
H=0.25
Figure 6. Saving energy vs. network size
11. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
11
Figure 6 shows the saving energy ratio on encryption of our scheme comparing with full
encryption. As shown in Fig. 6, saving energy consumption depends on the encryption threshold
H. If the encryption threshold increases, the ratio of saving energy increases.
8. CONCLUSIONS
In this paper, we propose energy efficient data secrecy scheme WBSNs. Our scheme includes
two parts: key establishment and threshold selective encryption. In the proposed key
establishment protocol, node IDs and seed value were combined with a nonce for generating
cryptographic keys. SHA-1 algorithm was used in this protocol to generate the session key and
ensure the validity of the messages. In the proposed encryption scheme, we introduced selective
technology and adopted it into a low-complexity method for WBSNs. Also, a secure selection
patter transmission scheme with low-complexity is proposed for our selective encryption.
Through security analysis, our scheme can resist efficiently against the main attacks in WBSNs.
Furthermore, we evaluated the energy cost of our scheme and made comparisons with other
existing schemes. Our scheme shows a great advantage over existing schemes in terms of low
energy cost. Consequently, the proposed data secrecy scheme is applicable for energy restricted
WBSNs, which take an important role in telemedicine. Moreover, because of the energy
efficiency feature, the proposed data secrecy scheme can also be applied well in general WSNs.
ACKNOWLEDGEMENTS
This work was supported by Japan Society for the Promotion of Science (JSPS) under Grant-in-
Aid for Scientific Research(C) (No.20560373) and by the Ph. D. Fellowship program of the
China Scholarship Council (No.2008638003).
REFERENCES
[1] K. Venkatasubramanian and S. K. S. Gupta, Chapter 15: Security for pervasive Healthcare, Y.
Xiao, Ed. CRC Press, 2007.
[2] K. Venkatasubramanian and S. K. S. Gupta, “Security for Pervasive Health Monitoring Sensor
Applications,” In Proc. 4th International Conference on Intelligent Sensing and Information
Processing, Dec. 2006, pp. 197-202.
[3] HIPAA-Report 2003, “Summary of HIPAA Health Insurance Probability and Accountability
Act” US Department of Health and Human Service, May 2003.
[4] M. A. Hanson, H. C. Powell., A. T. Barth, K. Ringgenberg, B. H. Calhoun, J. H. Aylor, and J.
Lach, “Body Area Sensor Networks: no. Challenges and Opportunities,” Computer, vol. 42, no.
1, pp. 58-65, Jan. 2009.
[5] J. Wu and S. Shigeru Shimamoto, “Usage Control based Security Access Scheme for Wireless
Sensor Networks,” in the Proc. IEEE International Conference on Communications (ICC 2010),
May 2010.
[6] H. Hofbauer and A. Uhl, “Selective Encryption of the MC EZBC Bitstream for DRM
Scenarios,” in Proc. of the 11th ACM workshop on Multimedia and Security, pp. 161-170, 2009.
[7] Yee Wei Law, Giorgi Moniava, Marimuthu Palaniswami, “KALwEN: A New Practical and
Interoperable Key Management Scheme for Body Sensor Networks”. In the Proc. of 4th
International Conference on Body Area Networks (BodyNets 2009), Apr. 2009.
[8] H. Chan and A. Perrig, “PIKE: Peer Intermediaries for Key Establishment in Sensor Networks,”
In Proc. of 24th IEEE International Conference on Computer Communications (INFOCOM
2005), vol. 1, pp. 524-535, Mar. 2005.
12. Computer Science & Engineering: An International Journal (CSEIJ), Vol.1, No.2, June 2011
12
[9] G. Meulenaer, F. Gosset, F. Standaert and O. Pereia, “On the Energy Cost of Communication
and Cryptography in Wireless Sensor Networks,” In Proc. IEEE International Confernce on
Wireless and Mobile Computing and Communication, Avignon, France, Oct. 2008, pp. 580-585.
[10] P. W. Fitzgibbons, D. Das, and L. J. Hash, “Constraints and Approaches for Distributed Mobile
Ad-hoc Network Security,” Tech. Rep. AD-A442043. Air Force Research Laboratory (AFRL),
Internet draft available from http://hdl.handle.net/100.2/ADA44204, Nov 2005.
[11] BASUMA project, Internet draft available from http://www.basuma.de/
[12] J. Wu and S. Shimamoto, “Integrated UCON-Based Access Control and Adaptive Intrusion
Detection for Wireless Sensor Networks,” in Proc. of IEEE Global Communications Conference
(GLOBECOM 2010), Dec. 2010.
[13] SHA-1 Standard, National Institute of Standards and Technology Secure Hash Standard, Federal
Information Processing Standards Publication 180-1, 1995.
[14] A. Cilardo, A. Mazzeo, L. Romano, and G. P. Saggese, ,” An FPGA-Based Key-Store for
Improving the Dependability of Security Services,” in Proc. of 10th IEEE International
Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2005), Feb. 2005, pp.
389- 396.
[15] C. Gkantsidis, J. Miller, and P. Rodriguez, “Comprehensive View of A Live Network Coding
P2P System,” In Proc. of 6th ACM SIGCOMM Conference on Internet Measurement (IMC),
pages 177–188, 2006.
[16] WINS Project, Rockwell Science Center, Internet draft available from
http://wins.rsc.rockwell.com/
[17] Y. Law, J. Doumen, and P. Hartel, “Survey and Benchmark of Block Ciphers for Wireless
Sensor Networks,” ACM Transactions on Transactions on Sensor Networks, vol.2, no.1, pp. 65–
93, 2006.
[18] S. Tisue and U. Wilensky, “Netlogo: A simple Environment for Modeling Complexity,”
International Conference on Complex System, Boston, May 2004.
Authors
Jun Wu was born in Hunan, China. He is currently pursuing the Ph.D. degree at
Waseda University, Japan, funded by China Scholarship Council. He received
the B.S. degree and M.S. degree from the Information Engineering College,
Xiangtan University, Hunan, China, in 2002 and 2005, respectively. From July
2005 to September 2008, he was a lecturer in the Xiangtan University. His
current research interests include wireless sensor networks and their information
security. Mr. Wu is a student member of the IEEE.
Shigeru Shimamoto was born was born in Mie, Japan, in 1963. He received the
B.E and M.E. degrees in communications engineering from the University of
Electro Communication, Tokyo, Japan, in 1985 and 1987, respectively. He
received the Ph. D. degree from Tohoku University, Japan in 1992. From April
1987 to March 1991, he joined NEC Corporation. From April 1991 to September
1992, he was an Assistant Professor in the University of Electro
Communications, Tokyo, Japan. He has been an Assistant Professor in the
Gunma University from October 1992 to December 1993. Since January 1994 to
March 2000, he has been an Associate Professor in Department of Computer
Science, Faculty of Engineering, Gunma University, Gunma, Japan. Since April
2002, he has been a Professor at GITS, Waseda University. In 2008, he also
served as a visiting professor at Stanford University, USA. His main fields of
research interest include sensor networks, satellite and mobile communications,
optical wireless, Ad-hoc networks and body area network. Dr. Shimamoto is a
member of the IEEE.