The document summarizes two novel group-wise key distribution schemes for secure group communications in wireless sensor networks that are based on dual directional hash chains (DDHC) and hash binary trees (HBT). The schemes offer self-healing rekeying message distribution with efficient tolerance for lost messages. They also feature time-limited dynamic node attachment and detachment. Security evaluation shows the schemes satisfy requirements for group communications in WSNs with lightweight overhead.
The document proposes a trigger identification service to defend against reactive jammers in wireless sensor networks. The service aims to efficiently identify all sensor nodes whose transmissions trigger jamming attacks, known as trigger nodes. This is achieved through a group testing process using a randomized error-tolerant nonadaptive group testing scheme. The identification of trigger nodes can then be used to exclude them from routing paths and help locate reactive jammers. The paper presents models for the sensor network, jammer behaviors, and analyzes the performance of the proposed identification service.
A Traffic-Aware Key Management Architecture for Reducing Energy Consumption i...IDES Editor
In Wireless Sensor Networks (WSNs), most
of the existing key management schemes, establish shared
keys for all pairs of neighbor sensor nodes without
considering the communication between these nodes.
When the number of sensor nodes in WSNs is increased
then each sensor node is to be loaded with bulky amount
of keys. In WSNs a sensor node may communicate with a
small set of neighbor sensor nodes. Based on this fact, in
this paper, an energy efficient Traffic-Aware Key
Management (TKM) scheme is developed for WSNs,
which only establishes shared keys for active sensors
which participate in direct communication. The proposed
scheme offers an efficient Re-keying mechanism to
broadcast keys without the need for retransmission or
acknowledgements. Numerical results show that proposed
key management scheme achieves high connectivity. In
the simulation experiments, the proposed key
management scheme is applied for different routing
protocols. The performance evaluation shows that
proposed scheme gives stronger resilence, low energy
consumption and lesser end to end delay.
A Fuzzy Based Priority Approach in Mobile Sensor Network CoverageIDES Editor
In this paper a new fuzzy based approach for
improving network coverage in wireless mobile sensor
networks is proposed. In the proposed approach firstly
each mobile sensor node determines its neighbors and its
distance from borders and obstacles. According to these
values, fuzzy inference engine calculates the priority of
node for movement. Then according to the priority, in
turn, nodes move away from each other to increase
coverage area in the target field. Simulation results show
that our fuzzy approach can reach higher degree of
coverage against other common approaches like FOA,
VEC and TRI algorithms.
Communication by Whispers Paradigm for Short Range Communication in Cognitive...IDES Editor
With ever increasing demand for efficiency
and increased throughput over the wireless domain, we
have now reached a point where in a method for efficient
utilization of the electromagnetic spectrum is in demand.
Cognitive radio provides us with a way in which this demand
could be catered, it does so by using devices which
autonomously adjust their communication parameters to
adapt to the external environment. However, the most
critical of this entire technology is the parameter relating to
the Spectrum Sensing aspects. In order for cognitive radio
devices to properly configure and identify the presence of
a primary carrier in a communication mode, spectrum
sensors and efficient sensing algorithms are required. There
have been many algo- rithms developed in this field.
However, these available spectrum sensing algorithms are
prohibitively expensive to implement in wireless devices that
cater to only short distance communication. In this paper,
we propose a parsimonious spectrum sensing algorithm
which would deal with sensing and couple them with short
distance wireless devices over WiFi networks operating in the
2.4 GHz band. The efficiency parameters are also shown
using demonstrations.
Iaetsd secure data dissemination based onIaetsd Iaetsd
This document proposes a secure data dissemination protocol called Se-Drip for wireless sensor networks. Se-Drip uses a Merkle hash tree to securely disseminate data from a base station to sensor nodes in the network. The protocol has three phases: 1) initialization where the base station generates keys and loads them on nodes, 2) packet preprocessing where the base station constructs data packets and their authentication paths in a Merkle hash tree, and 3) packet verification where nodes verify received packets against the hash tree to authenticate the data. Se-Drip aims to securely disseminate data while being lightweight, robust to packet loss, and resistant to denial-of-service attacks.
Popularity of ubiquitous computing increases the importance of location-aware applications,
which increases the need for finding location of the user. In this paper, we present a novel localization method
for indoor environments using Wi-Fi infrastructure.
While localization using Wi-Fi is cost effective, handling the obstructions which are the main cause of
signal propagation error in indoor environments is a challenging task. We address this problem in two levels,
resulting in increased accuracy of localization. In the first level, we "localize" the residing area of user node in
coarse granularity. Then, we use building layout to find the objects that attenuate the signal between the
reference node and the coarse estimate of the location of user node. Using multi-wall propagation model, we
apply corrections for all obstructions and find the location of user node. Empirical results based on experiments
conducted in lab-scale, shows meter-level accuracy.
Analysis of GPSR and its Relevant Attacks in Wireless Sensor NetworksIDES Editor
Most of the routing protocols proposed for ad-hoc
networks and sensor networks are not designed with security
as a goal. Hence, many routing protocols are vulnerable to an
attack by an adversary who can disrupt the network or harness
valuable information from the network. Routing Protocols
for wireless sensor networks are classified into three types
depending on their network structure as Flat routing protocols,
Hierarchical routing protocol and Geographic routing
protocols. We mainly concentrate on location-based or
geographic routing protocol like Greedy Perimeter Stateless
Routing Protocol (GPSR). Sybil attack and Selective
forwarding attack are the two attacks feasible in GPSR. These
attacks are implemented in GPSR and their losses caused to
the network are analysed
Energy saving Wireless Sensor Networks using KerberosEditor IJCATR
The wireless sensor network is an networking field that combines sensing, computation, and communication into a single
tiny device. As sensor networks frame closer towards well-known deployment, security issues become a vital concern. So far, much
work has focused on making sensor networks realistic and useful, but still security in sensor network data communication is big issue
for research. This paper proposed the idea of having different Kerberos authentication architecture for the different clusters in sensor
network to save energy factor of the sensor nodes and to save time for data communication between the sensor nodes in the network
The document proposes a trigger identification service to defend against reactive jammers in wireless sensor networks. The service aims to efficiently identify all sensor nodes whose transmissions trigger jamming attacks, known as trigger nodes. This is achieved through a group testing process using a randomized error-tolerant nonadaptive group testing scheme. The identification of trigger nodes can then be used to exclude them from routing paths and help locate reactive jammers. The paper presents models for the sensor network, jammer behaviors, and analyzes the performance of the proposed identification service.
A Traffic-Aware Key Management Architecture for Reducing Energy Consumption i...IDES Editor
In Wireless Sensor Networks (WSNs), most
of the existing key management schemes, establish shared
keys for all pairs of neighbor sensor nodes without
considering the communication between these nodes.
When the number of sensor nodes in WSNs is increased
then each sensor node is to be loaded with bulky amount
of keys. In WSNs a sensor node may communicate with a
small set of neighbor sensor nodes. Based on this fact, in
this paper, an energy efficient Traffic-Aware Key
Management (TKM) scheme is developed for WSNs,
which only establishes shared keys for active sensors
which participate in direct communication. The proposed
scheme offers an efficient Re-keying mechanism to
broadcast keys without the need for retransmission or
acknowledgements. Numerical results show that proposed
key management scheme achieves high connectivity. In
the simulation experiments, the proposed key
management scheme is applied for different routing
protocols. The performance evaluation shows that
proposed scheme gives stronger resilence, low energy
consumption and lesser end to end delay.
A Fuzzy Based Priority Approach in Mobile Sensor Network CoverageIDES Editor
In this paper a new fuzzy based approach for
improving network coverage in wireless mobile sensor
networks is proposed. In the proposed approach firstly
each mobile sensor node determines its neighbors and its
distance from borders and obstacles. According to these
values, fuzzy inference engine calculates the priority of
node for movement. Then according to the priority, in
turn, nodes move away from each other to increase
coverage area in the target field. Simulation results show
that our fuzzy approach can reach higher degree of
coverage against other common approaches like FOA,
VEC and TRI algorithms.
Communication by Whispers Paradigm for Short Range Communication in Cognitive...IDES Editor
With ever increasing demand for efficiency
and increased throughput over the wireless domain, we
have now reached a point where in a method for efficient
utilization of the electromagnetic spectrum is in demand.
Cognitive radio provides us with a way in which this demand
could be catered, it does so by using devices which
autonomously adjust their communication parameters to
adapt to the external environment. However, the most
critical of this entire technology is the parameter relating to
the Spectrum Sensing aspects. In order for cognitive radio
devices to properly configure and identify the presence of
a primary carrier in a communication mode, spectrum
sensors and efficient sensing algorithms are required. There
have been many algo- rithms developed in this field.
However, these available spectrum sensing algorithms are
prohibitively expensive to implement in wireless devices that
cater to only short distance communication. In this paper,
we propose a parsimonious spectrum sensing algorithm
which would deal with sensing and couple them with short
distance wireless devices over WiFi networks operating in the
2.4 GHz band. The efficiency parameters are also shown
using demonstrations.
Iaetsd secure data dissemination based onIaetsd Iaetsd
This document proposes a secure data dissemination protocol called Se-Drip for wireless sensor networks. Se-Drip uses a Merkle hash tree to securely disseminate data from a base station to sensor nodes in the network. The protocol has three phases: 1) initialization where the base station generates keys and loads them on nodes, 2) packet preprocessing where the base station constructs data packets and their authentication paths in a Merkle hash tree, and 3) packet verification where nodes verify received packets against the hash tree to authenticate the data. Se-Drip aims to securely disseminate data while being lightweight, robust to packet loss, and resistant to denial-of-service attacks.
Popularity of ubiquitous computing increases the importance of location-aware applications,
which increases the need for finding location of the user. In this paper, we present a novel localization method
for indoor environments using Wi-Fi infrastructure.
While localization using Wi-Fi is cost effective, handling the obstructions which are the main cause of
signal propagation error in indoor environments is a challenging task. We address this problem in two levels,
resulting in increased accuracy of localization. In the first level, we "localize" the residing area of user node in
coarse granularity. Then, we use building layout to find the objects that attenuate the signal between the
reference node and the coarse estimate of the location of user node. Using multi-wall propagation model, we
apply corrections for all obstructions and find the location of user node. Empirical results based on experiments
conducted in lab-scale, shows meter-level accuracy.
Analysis of GPSR and its Relevant Attacks in Wireless Sensor NetworksIDES Editor
Most of the routing protocols proposed for ad-hoc
networks and sensor networks are not designed with security
as a goal. Hence, many routing protocols are vulnerable to an
attack by an adversary who can disrupt the network or harness
valuable information from the network. Routing Protocols
for wireless sensor networks are classified into three types
depending on their network structure as Flat routing protocols,
Hierarchical routing protocol and Geographic routing
protocols. We mainly concentrate on location-based or
geographic routing protocol like Greedy Perimeter Stateless
Routing Protocol (GPSR). Sybil attack and Selective
forwarding attack are the two attacks feasible in GPSR. These
attacks are implemented in GPSR and their losses caused to
the network are analysed
Energy saving Wireless Sensor Networks using KerberosEditor IJCATR
The wireless sensor network is an networking field that combines sensing, computation, and communication into a single
tiny device. As sensor networks frame closer towards well-known deployment, security issues become a vital concern. So far, much
work has focused on making sensor networks realistic and useful, but still security in sensor network data communication is big issue
for research. This paper proposed the idea of having different Kerberos authentication architecture for the different clusters in sensor
network to save energy factor of the sensor nodes and to save time for data communication between the sensor nodes in the network
Torsten Braun presented on developing and evaluating energy-efficient and adaptive protocols for wireless sensor networks. He discussed wireless sensor network applications like environmental and building monitoring. Key application requirements include energy efficiency, low delays, reliability, and adaptivity. He described designing, implementing, and evaluating WSN protocols through simulations and experiments on a wireless sensor network testbed called WISEBED, which is a pan-European federation of over 1000 sensor nodes across 9 testbeds. The testbed infrastructure includes sensor nodes, backbones to connect to a portal, and a portal that acts as a gateway between the internet and the wireless sensor network.
(1) The document proposes an energy efficient protocol for wireless sensor networks (WSNs) that employs replicated data sinks to achieve resiliency against data sink failures and efficient storage and retrieval of sensor data.
(2) It introduces a simple address assignment scheme that partitions the sensor field into cells, with each cell containing one data sink and sensors closest to that sink. This scheme is scalable and resilient against data sink and sensor node failures.
(3) The protocol uses five types of messages and a routing approach based on de Bruijn digraphs to minimize energy consumption during data transmission between sensors and sinks. It aims to maximize the lifetime of the sensor network.
Secure and Efficient DiDrip Protocol for Improving Performance of WSNsINFOGAIN PUBLICATION
1. The document proposes a new distributed data discovery and dissemination protocol called DiDrip for wireless sensor networks (WSNs) that aims to improve security and performance over existing protocols.
2. Existing protocols primarily use a centralized approach where a single node distributes data, which is not suitable for multiple owners and users, and they do not focus on security.
3. DiDrip allows for a distributed approach where multiple owners can authorize different users simultaneously to access sensor data with different priorities, while improving security.
TARGET LOCALIZATION IN WIRELESS SENSOR NETWORKS BASED ON RECEIVED SIGNAL STRE...sipij
We consider the problem of localizing a target taking the help of a set of anchor beacon nodes. A small
number of beacon nodes are deployed at known locations in the area. The target can detect a beacon
provided it happens to lie within the beacon’s transmission range. Thus, the target obtains a measurement
vector containing the readings of the beacons: ‘1’ corresponding to a beacon if it is able to detect the
target, and ‘0’ if the beacon is not able to detect the target. The goal is twofold: to determine the location
of the target based on the binary measurement vector at the target; and to study the behaviour of the
localization uncertainty as a function of the beacon transmission range (sensing radius) and the number of
beacons deployed. Beacon transmission range means signal strength of the beacon to transmit and receive
the signals which is called as Received Signal Strength (RSS). To localize the target, we propose a gridmapping
based approach, where the readings corresponding to locations on a grid overlaid on the region
of interest are used to localize the target. To study the behaviour of the localization uncertainty as a
function of the sensing radius and number of beacons, extensive simulations and numerical experiments
are carried out. The results provide insights into the importance of optimally setting the sensing radius and
the improvement obtainable with increasing number of beacons.
This document discusses multihop/direct forwarding (MDF) for wireless sensor networks deployed in 3D environments. It analyzes the behavior of MDF and compares it to other forwarding schemes. The key points are:
1) MDF is analyzed for its ability to balance energy consumption across sensor nodes in a 3D network model, with the goal of prolonging network lifetime.
2) The network is divided into logical nodes based on distance from the base station. Equations are derived for dividing packet flows between nodes to optimize battery lifespan.
3) Simulation results show MDF balances energy use better than other schemes like closest forwarding, leading to longer network lifetime when applied in 3D wireless sensor networks.
This document summarizes a research paper that proposes a scheme for secure data sharing and fine-grained access control in wireless sensor networks. The scheme uses attribute-based encryption to encrypt sensor data under various attributes. It divides the network lifetime into phases and stages to distribute computation. Sensor nodes encrypt data with symmetric keys derived from a master key, which is itself encrypted under user attributes. This allows only authorized users to decrypt based on their access policy. The scheme aims to provide security against node compromise and colluding users. Formal analysis and experiments show it achieves fine-grained access control while remaining efficient for resource-constrained sensors.
Key Management Schemes for Secure Communication in Heterogeneous Sensor NetworksIDES Editor
Hierarchical Sensor Network organization is
widely used to achieve energy efficiency in Wireless Sensor
Networks(WSN). To achieve security in hierarchical WSN,
it is important to be able to encrypt the messages sent
between sensor nodes and its cluster head. The key
management task is challenging due to resource constrained
nature of WSN. In this paper we are proposing two key
management schemes for hierarchical networks which
handles various events like node addition, node compromise
and key refresh at regular intervals. The Tree-Based
Scheme ensures in-network processing by maintaining some
additional intermediate keys. Whereas the CRT-Based
Scheme performs the key management with minimum
communication and storage at each node.
This document summarizes a research paper about denial of service (DoS) attacks on wireless sensor networks. It begins by outlining some key security goals for wireless sensor networks, including data confidentiality, integrity, availability, and authentication. It then discusses DoS attacks specifically, noting they aim to degrade efficient use of network resources. The document proposes that DoS attacks can occur at different layers of the OSI model. It provides examples of physical layer attacks like jamming and describes how frequency hopping can help counter jamming. In closing, it notes DoS attacks threaten the availability security goal for wireless sensor networks.
Optimized rationalize security and efficient data gathering in wireless senso...ijmnct
Wireless reprogramming during a wireless detector net- work (WSN) is that the method of propagating a
replacement code image or relevant commands to detector nodes. As a WSN is sometimes deployed in
hostile environments, secure reprogramming is and can continue to be a significant concern. Whereas all
existing insecure/secure reprogramming protocols square measure supported the centralized approach,
it\'s necessary to support distributed reprogramming during which multiple licensed network users will at
the same time and directly reprogram detector nodes while not involving the bottom station. Terribly
recently, a novel secure rationalize and distributed reprogramming protocol named SRDRP has been
planned, that is that the initial work of its kind. However, during this paper, we have a tendency to establish
associate inherent style weakness within the increased signature verification of SRDRP associated demonstrate
that it\'s at risk of associate impersonation attack by that an resister will simply impersonate any
licensed user to hold out reprogramming. Later on, we have a tendency to propose a straightforward
modification to mend the known security drawback while not losing any options of SRDRP. Our
experimental results demonstrate that it\'s able to eliminate the planning weakness by adding one-B
redundant information which the execution time of the prompt answer during a 1.6-GHz laptop personal
computer is not any quite one ms. Therefore, our answer is possible and secure for real-world applications.
Moreover, we have a tendency to show that, so as to additional improve the safety and potency of SRDRP;
any higher established identity-based position formula will be directly utilized in SRDRP. Supported
implementation results, we have a tendency to demonstrate potency improvement over the initial SRDRP
Security Attacks and its Countermeasures in Wireless Sensor NetworksIJERA Editor
Wireless Sensor Networks have come to the forefront of the scientific community recently. Present WSNs typically communicate directly with a centralized controller or satellite. Going on the other hand, a smart WSN consists of a number of sensors spread across a geographical area; each sensor has wireless communication ability and sufficient intelligence for signal processing and networking of the data. This paper surveyed the different types of attacks, security related issues, and it’s Countermeasures with the complete comparison between Layer based Attacks in Wireless Sensor Networks
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
The document discusses a machine learning-based technique for detecting wormhole attacks in wireless sensor networks. It proposes using a multipoint relay-based Watchdog monitoring and prevention protocol. The technique will use a dynamic threshold to detect wormhole attacker nodes. Then, clustering and Watchdog-based optimistic path selection will be used to communicate packets and reduce packet dropping, improving the network's performance. The approach aims to address limitations of existing Watchdog techniques, such as not being able to distinguish collisions from attacks. It incorporates a cooperative cross-layer monitoring framework to handle falsely reported attacks.
CTAS is a collaborative two-level task scheduling algorithm for wireless sensor nodes with multiple sensing units:
1) It performs coarse-grain scheduling at the group level, scheduling event types and data transmissions for neighboring sensor nodes based on their overlapping sensing areas.
2) It performs fine-grain scheduling at the individual node level, scheduling the tasks of the assigned event types for each sensor node.
3) Simulation results show CTAS significantly improves energy consumption by up to 67% and reduces event misses by 75% compared to existing techniques.
Probablistic Inference With Limited InformationChuka Okoye
The document presents a probabilistic approach to answering queries in sensor networks using limited and stochastic information. It uses a Bayesian network to model the relationships between sensor measurements, enemy agent locations, and whether a friendly agent is surrounded. Approximate inference is performed using Markov Chain Monte Carlo sampling to estimate the posterior probability of being surrounded given the sensor data. Simulation results show the algorithm can effectively handle noisy sensor measurements and provide useful estimates even when direct information is limited or unavailable.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
IRJET- An Introduction to Wireless Sensor Networks, its Challenges and SecurityIRJET Journal
- Wireless sensor networks (WSNs) are composed of small, battery-powered sensor nodes that collect data from the environment and transmit it to each other and a base station. They face challenges related to node mobility, energy efficiency, and lifetime.
- The document discusses clustering in WSNs, which involves organizing nodes into clusters with cluster heads to improve stability and reduce energy consumption. It also covers security issues and applications of WSNs in various fields like healthcare, the environment, and more.
This document summarizes an academic paper that proposes a new Energy Minimized Opportunistic Routing (EMOR) protocol for wireless sensor networks. EMOR aims to enhance source location privacy and minimize energy usage. It uses opportunistic routing to dynamically change paths from source to destination, hiding the source location. Additionally, EMOR reduces transmission power of each node to minimize energy consumption while still reliably transmitting packets. The paper reviews related work on source privacy and energy efficiency in wireless routing protocols and presents simulation results showing EMOR provides better source privacy compared to existing opportunistic routing while also reducing energy usage.
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
This document summarizes clustering techniques for wireless sensor networks. It discusses how clustering helps improve energy efficiency and network lifetime by organizing nodes into clusters with cluster heads. The document surveys several clustering algorithms, including LEACH, DEEC, SEP, HEED, LCA, LCA2, Max-Min D-Cluster algorithm, and weighted clustering algorithms like WCA. It describes how these algorithms elect cluster heads and organize nodes into clusters using different metrics and probabilities based on remaining energy levels or node connectivity. The document concludes that clustering is a key technique for extending network lifetime in wireless sensor networks.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Cluster Head and RREQ based Detection and Prevention of Gray hole and Denial ...IJSRD
Wireless sensor network is a type of network which have no communications pattern for communication between nodes, any node can easily join the network and leave the network so attacks are more probable. Gray hole is one of such attacks and it is tough to detect since malicious node switches behavior between normal node and malicious node. For detection and prevention of gray hole attacks our proposed technique is based on Cluster head and RREQ based approach in WSN. In our proposed technique we select a node which has the highest energy as a cluster head and remaining node are marked as work as cluster member. For each node we decide a threshold for sending RREQ if any node generate RREQ more than threshold then we check its RREP threshold value if it’s less than one than cluster head will conclude this node as a malicious node and broadcast its node id so that all other nodes also mark it as malicious node and drop the request arrive from this malicious node and for gray hole detection.
Datos y metadatos, Francisca Hernández Carrascalguestc2d800
El documento habla sobre los datos y metadatos para representar objetos digitales de manera fiel. Explica diferentes estándares para describir los metadatos de libros, imágenes y textos. También describe cómo se usan los metadatos para garantizar la preservación digital a largo plazo y para transmitir la información y propiedad intelectual asociada a los objetos digitales.
Descripción automatizada de objetos digitales mediante Digibib. César Juanesguestc2d800
Este documento describe las funcionalidades de Digibib para la digitalización avanzada y creación de bibliotecas digitales. Digibib permite la creación y descripción automatizada de objetos digitales asociados a registros bibliográficos, de autoridad y de holding. Ofrece una interfaz amigable para gestionar metadatos normalizados y acceder a documentos electrónicos mediante identificadores uniformes de recursos.
Torsten Braun presented on developing and evaluating energy-efficient and adaptive protocols for wireless sensor networks. He discussed wireless sensor network applications like environmental and building monitoring. Key application requirements include energy efficiency, low delays, reliability, and adaptivity. He described designing, implementing, and evaluating WSN protocols through simulations and experiments on a wireless sensor network testbed called WISEBED, which is a pan-European federation of over 1000 sensor nodes across 9 testbeds. The testbed infrastructure includes sensor nodes, backbones to connect to a portal, and a portal that acts as a gateway between the internet and the wireless sensor network.
(1) The document proposes an energy efficient protocol for wireless sensor networks (WSNs) that employs replicated data sinks to achieve resiliency against data sink failures and efficient storage and retrieval of sensor data.
(2) It introduces a simple address assignment scheme that partitions the sensor field into cells, with each cell containing one data sink and sensors closest to that sink. This scheme is scalable and resilient against data sink and sensor node failures.
(3) The protocol uses five types of messages and a routing approach based on de Bruijn digraphs to minimize energy consumption during data transmission between sensors and sinks. It aims to maximize the lifetime of the sensor network.
Secure and Efficient DiDrip Protocol for Improving Performance of WSNsINFOGAIN PUBLICATION
1. The document proposes a new distributed data discovery and dissemination protocol called DiDrip for wireless sensor networks (WSNs) that aims to improve security and performance over existing protocols.
2. Existing protocols primarily use a centralized approach where a single node distributes data, which is not suitable for multiple owners and users, and they do not focus on security.
3. DiDrip allows for a distributed approach where multiple owners can authorize different users simultaneously to access sensor data with different priorities, while improving security.
TARGET LOCALIZATION IN WIRELESS SENSOR NETWORKS BASED ON RECEIVED SIGNAL STRE...sipij
We consider the problem of localizing a target taking the help of a set of anchor beacon nodes. A small
number of beacon nodes are deployed at known locations in the area. The target can detect a beacon
provided it happens to lie within the beacon’s transmission range. Thus, the target obtains a measurement
vector containing the readings of the beacons: ‘1’ corresponding to a beacon if it is able to detect the
target, and ‘0’ if the beacon is not able to detect the target. The goal is twofold: to determine the location
of the target based on the binary measurement vector at the target; and to study the behaviour of the
localization uncertainty as a function of the beacon transmission range (sensing radius) and the number of
beacons deployed. Beacon transmission range means signal strength of the beacon to transmit and receive
the signals which is called as Received Signal Strength (RSS). To localize the target, we propose a gridmapping
based approach, where the readings corresponding to locations on a grid overlaid on the region
of interest are used to localize the target. To study the behaviour of the localization uncertainty as a
function of the sensing radius and number of beacons, extensive simulations and numerical experiments
are carried out. The results provide insights into the importance of optimally setting the sensing radius and
the improvement obtainable with increasing number of beacons.
This document discusses multihop/direct forwarding (MDF) for wireless sensor networks deployed in 3D environments. It analyzes the behavior of MDF and compares it to other forwarding schemes. The key points are:
1) MDF is analyzed for its ability to balance energy consumption across sensor nodes in a 3D network model, with the goal of prolonging network lifetime.
2) The network is divided into logical nodes based on distance from the base station. Equations are derived for dividing packet flows between nodes to optimize battery lifespan.
3) Simulation results show MDF balances energy use better than other schemes like closest forwarding, leading to longer network lifetime when applied in 3D wireless sensor networks.
This document summarizes a research paper that proposes a scheme for secure data sharing and fine-grained access control in wireless sensor networks. The scheme uses attribute-based encryption to encrypt sensor data under various attributes. It divides the network lifetime into phases and stages to distribute computation. Sensor nodes encrypt data with symmetric keys derived from a master key, which is itself encrypted under user attributes. This allows only authorized users to decrypt based on their access policy. The scheme aims to provide security against node compromise and colluding users. Formal analysis and experiments show it achieves fine-grained access control while remaining efficient for resource-constrained sensors.
Key Management Schemes for Secure Communication in Heterogeneous Sensor NetworksIDES Editor
Hierarchical Sensor Network organization is
widely used to achieve energy efficiency in Wireless Sensor
Networks(WSN). To achieve security in hierarchical WSN,
it is important to be able to encrypt the messages sent
between sensor nodes and its cluster head. The key
management task is challenging due to resource constrained
nature of WSN. In this paper we are proposing two key
management schemes for hierarchical networks which
handles various events like node addition, node compromise
and key refresh at regular intervals. The Tree-Based
Scheme ensures in-network processing by maintaining some
additional intermediate keys. Whereas the CRT-Based
Scheme performs the key management with minimum
communication and storage at each node.
This document summarizes a research paper about denial of service (DoS) attacks on wireless sensor networks. It begins by outlining some key security goals for wireless sensor networks, including data confidentiality, integrity, availability, and authentication. It then discusses DoS attacks specifically, noting they aim to degrade efficient use of network resources. The document proposes that DoS attacks can occur at different layers of the OSI model. It provides examples of physical layer attacks like jamming and describes how frequency hopping can help counter jamming. In closing, it notes DoS attacks threaten the availability security goal for wireless sensor networks.
Optimized rationalize security and efficient data gathering in wireless senso...ijmnct
Wireless reprogramming during a wireless detector net- work (WSN) is that the method of propagating a
replacement code image or relevant commands to detector nodes. As a WSN is sometimes deployed in
hostile environments, secure reprogramming is and can continue to be a significant concern. Whereas all
existing insecure/secure reprogramming protocols square measure supported the centralized approach,
it\'s necessary to support distributed reprogramming during which multiple licensed network users will at
the same time and directly reprogram detector nodes while not involving the bottom station. Terribly
recently, a novel secure rationalize and distributed reprogramming protocol named SRDRP has been
planned, that is that the initial work of its kind. However, during this paper, we have a tendency to establish
associate inherent style weakness within the increased signature verification of SRDRP associated demonstrate
that it\'s at risk of associate impersonation attack by that an resister will simply impersonate any
licensed user to hold out reprogramming. Later on, we have a tendency to propose a straightforward
modification to mend the known security drawback while not losing any options of SRDRP. Our
experimental results demonstrate that it\'s able to eliminate the planning weakness by adding one-B
redundant information which the execution time of the prompt answer during a 1.6-GHz laptop personal
computer is not any quite one ms. Therefore, our answer is possible and secure for real-world applications.
Moreover, we have a tendency to show that, so as to additional improve the safety and potency of SRDRP;
any higher established identity-based position formula will be directly utilized in SRDRP. Supported
implementation results, we have a tendency to demonstrate potency improvement over the initial SRDRP
Security Attacks and its Countermeasures in Wireless Sensor NetworksIJERA Editor
Wireless Sensor Networks have come to the forefront of the scientific community recently. Present WSNs typically communicate directly with a centralized controller or satellite. Going on the other hand, a smart WSN consists of a number of sensors spread across a geographical area; each sensor has wireless communication ability and sufficient intelligence for signal processing and networking of the data. This paper surveyed the different types of attacks, security related issues, and it’s Countermeasures with the complete comparison between Layer based Attacks in Wireless Sensor Networks
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
The document discusses a machine learning-based technique for detecting wormhole attacks in wireless sensor networks. It proposes using a multipoint relay-based Watchdog monitoring and prevention protocol. The technique will use a dynamic threshold to detect wormhole attacker nodes. Then, clustering and Watchdog-based optimistic path selection will be used to communicate packets and reduce packet dropping, improving the network's performance. The approach aims to address limitations of existing Watchdog techniques, such as not being able to distinguish collisions from attacks. It incorporates a cooperative cross-layer monitoring framework to handle falsely reported attacks.
CTAS is a collaborative two-level task scheduling algorithm for wireless sensor nodes with multiple sensing units:
1) It performs coarse-grain scheduling at the group level, scheduling event types and data transmissions for neighboring sensor nodes based on their overlapping sensing areas.
2) It performs fine-grain scheduling at the individual node level, scheduling the tasks of the assigned event types for each sensor node.
3) Simulation results show CTAS significantly improves energy consumption by up to 67% and reduces event misses by 75% compared to existing techniques.
Probablistic Inference With Limited InformationChuka Okoye
The document presents a probabilistic approach to answering queries in sensor networks using limited and stochastic information. It uses a Bayesian network to model the relationships between sensor measurements, enemy agent locations, and whether a friendly agent is surrounded. Approximate inference is performed using Markov Chain Monte Carlo sampling to estimate the posterior probability of being surrounded given the sensor data. Simulation results show the algorithm can effectively handle noisy sensor measurements and provide useful estimates even when direct information is limited or unavailable.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
IRJET- An Introduction to Wireless Sensor Networks, its Challenges and SecurityIRJET Journal
- Wireless sensor networks (WSNs) are composed of small, battery-powered sensor nodes that collect data from the environment and transmit it to each other and a base station. They face challenges related to node mobility, energy efficiency, and lifetime.
- The document discusses clustering in WSNs, which involves organizing nodes into clusters with cluster heads to improve stability and reduce energy consumption. It also covers security issues and applications of WSNs in various fields like healthcare, the environment, and more.
This document summarizes an academic paper that proposes a new Energy Minimized Opportunistic Routing (EMOR) protocol for wireless sensor networks. EMOR aims to enhance source location privacy and minimize energy usage. It uses opportunistic routing to dynamically change paths from source to destination, hiding the source location. Additionally, EMOR reduces transmission power of each node to minimize energy consumption while still reliably transmitting packets. The paper reviews related work on source privacy and energy efficiency in wireless routing protocols and presents simulation results showing EMOR provides better source privacy compared to existing opportunistic routing while also reducing energy usage.
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
This document summarizes clustering techniques for wireless sensor networks. It discusses how clustering helps improve energy efficiency and network lifetime by organizing nodes into clusters with cluster heads. The document surveys several clustering algorithms, including LEACH, DEEC, SEP, HEED, LCA, LCA2, Max-Min D-Cluster algorithm, and weighted clustering algorithms like WCA. It describes how these algorithms elect cluster heads and organize nodes into clusters using different metrics and probabilities based on remaining energy levels or node connectivity. The document concludes that clustering is a key technique for extending network lifetime in wireless sensor networks.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Cluster Head and RREQ based Detection and Prevention of Gray hole and Denial ...IJSRD
Wireless sensor network is a type of network which have no communications pattern for communication between nodes, any node can easily join the network and leave the network so attacks are more probable. Gray hole is one of such attacks and it is tough to detect since malicious node switches behavior between normal node and malicious node. For detection and prevention of gray hole attacks our proposed technique is based on Cluster head and RREQ based approach in WSN. In our proposed technique we select a node which has the highest energy as a cluster head and remaining node are marked as work as cluster member. For each node we decide a threshold for sending RREQ if any node generate RREQ more than threshold then we check its RREP threshold value if it’s less than one than cluster head will conclude this node as a malicious node and broadcast its node id so that all other nodes also mark it as malicious node and drop the request arrive from this malicious node and for gray hole detection.
Datos y metadatos, Francisca Hernández Carrascalguestc2d800
El documento habla sobre los datos y metadatos para representar objetos digitales de manera fiel. Explica diferentes estándares para describir los metadatos de libros, imágenes y textos. También describe cómo se usan los metadatos para garantizar la preservación digital a largo plazo y para transmitir la información y propiedad intelectual asociada a los objetos digitales.
Descripción automatizada de objetos digitales mediante Digibib. César Juanesguestc2d800
Este documento describe las funcionalidades de Digibib para la digitalización avanzada y creación de bibliotecas digitales. Digibib permite la creación y descripción automatizada de objetos digitales asociados a registros bibliográficos, de autoridad y de holding. Ofrece una interfaz amigable para gestionar metadatos normalizados y acceder a documentos electrónicos mediante identificadores uniformes de recursos.
El documento describe las características de los nuevos sistemas de información multimedia frente a las necesidades de información de la sociedad. Estos sistemas permiten la multicanilidad, interactividad, multidireccionalidad y multireferencialidad de los documentos. También presentan interactividad, multidireccionalidad, multiformidad y facilidad de manejo. Otras características incluyen la descentralización, diversificación, actualización, personalización, universalización y simultaneidad de la información.
Dispositivos de gestion de sistemas operativosTikoLiko76
El documento describe varios dispositivos y herramientas de gestión de sistemas operativos como agregar/quitar programas, sonido, fecha/hora, barra de tareas, mouse, pantalla, firewall, agregar hardware, gestión de entrada/salida y opciones de teléfono y modem. Explica brevemente las funciones de cada uno y cómo configurarlos.
Este documento presenta las mejores prácticas de seguridad operacional (OPSEC) para analistas de seguridad. Explica que la OPSEC identifica información crítica para determinar si nuestras acciones pueden ser observadas por adversarios. Señala que la regla de oro es mantener silencio como disciplina defensiva, aunque es difícil de implementar. También recomienda adoptar un nivel de OPSEC que se pueda cumplir para evitar ser más vulnerable. Finalmente, concluye que la OPSEC es difícil pero no es necesario hacerlo a n
El documento habla sobre metadatos, la web semántica, ontologías y XML. Explica que los metadatos son datos que describen información y contenido. La web semántica busca mejorar Internet agregando metadatos semánticos para que las máquinas puedan procesar la información de manera automática. Las ontologías definen formalmente los conceptos y relaciones de un dominio particular. XML es un lenguaje de marcas extensible usado para definir otros lenguajes y formatos como XHTML.
Este documento proporciona instrucciones para escribir buenos metadatos. Explica reglas como mantener a los usuarios en mente, usar un vocabulario consistente, y revisar el trabajo final. También describe los pasos para crear metadatos, incluyendo organizar la información, escribir el archivo de metadatos, y validarlo. Finalmente, detalla los roles y responsabilidades de los participantes en el proceso de creación de metadatos.
Sistemas de informacion Geográfico metadatos Edgar Espin
Este documento define los metadatos y describe sus ventajas y aplicaciones. Explica que los metadatos son datos que describen otros datos y permiten catalogar y caracterizar conjuntos de datos. También cubre estándares de metadatos como FGDC, ISO y Dublin Core, y destaca la convergencia hacia el estándar ISO 19115. Resalta que los metadatos organizan datos, mejoran la gestión y acceso a los mismos, y facilitan la interoperabilidad.
Intentar despejar dudas sobre el concepto de metadatos y su uso en el Software Herramienta de Documentalista.
Como se describe la informacion almacenada y las diversas formas de recuperar la informacion de la base de datos
Este documento presenta información sobre las anotaciones. Explica que las anotaciones son metadatos adjuntos al código que proveen información adicional sin afectar el funcionamiento del programa. Detalla los usos comunes de las anotaciones, incluyendo proveer información al compilador, procesamiento en tiempo de compilación y ejecución. También describe las anotaciones predefinidas en Java como @Override y @Deprecated, y cómo definir un nuevo tipo de anotación.
Este documento describe varios antipatrones comunes en SQL, incluyendo almacenar múltiples valores en una columna, usar una sola tabla genérica para diferentes tipos de entidades, y dividir datos en múltiples tablas similares ("tribbles"). Estos patrones dificultan consultas y mantenimiento. Se recomiendan enfoques como tablas de intersección y herencia para modelar datos de forma más normalizada y flexible.
Anonimato, tecnicas anti forenses y seguridad informaticaEstudianteSeguridad
Este documento proporciona una introducción a técnicas de anonimato y seguridad informática. Explica que todo sistema de información deja registros y rastros que pueden utilizarse para auditar las actividades de un usuario y comprometer su anonimato. A continuación, presenta algunas técnicas como la estenografía, criptografía y borrado seguro de datos que pueden emplearse para ocultar información y evitar dejar rastros digitales que comprometan la privacidad de una persona. El objetivo final es enseñar métodos b
Este documento trata sobre los metadatos, que son datos sobre los datos que proveen información estructurada y descriptiva. Explica que los metadatos se usan en sistemas de información, gestión documental y archivos para describir, buscar y recuperar información. También cubre los diferentes tipos de metadatos, estándares internacionales, legislación colombiana relevante, y campos de aplicación de los metadatos como gestión documental, repositorios digitales y preservación digital.
PechaKucha es un formato de presentación creado en Tokio en 2003 que consiste en 20 diapositivas mostradas durante 20 segundos cada una, para una duración total de 6 minutos y 40 segundos. Fue diseñado para mantener un alto nivel de interés del público a través de presentaciones muy concisas. Este formato se está adoptando también en el mundo de los negocios y fuerza al presentador a concentrarse en el mensaje clave.
Este documento describe los metadatos, que son datos que describen otros datos. Explica que los metadatos permiten identificar recursos, describir su contenido y localización, y gestionar derechos. También describe diferentes tipos de metadatos e iniciativas y sistemas de metadatos como Dublin Core y MARC.
Los metadatos son datos que describen otros datos. Proporcionan información sobre el contenido, contexto y estructura de los recursos digitales para facilitar su identificación, recuperación y preservación a largo plazo. Existen diferentes tipos y sistemas de metadatos para describir distintos tipos de recursos y funciones como Dublin Core para la Web, EAD para archivos o MARC para bibliotecas. Los metadatos son útiles para la gestión y el intercambio de información en la Web siguiendo estándares que permitan la interoperabilidad.
Presentación sobre los metadatos dentro del curso "Acceso abierto, repositorios y metadatos" impartido al Personal del Servicio de Biblioteca de la Universidad de La Laguna en noviembre de 2013
Este documento habla sobre los metadatos y su importancia para describir y recuperar información en la era digital. Explica que los metadatos son datos que describen el contenido de otros datos y documentos, y que ayudan a ordenar, transferir, distribuir e identificar información de manera estructurada. También define conceptos clave como normas, estándares y formatos relacionados con los metadatos.
Análisis crítico de los metadatos distribuidos por la IDEC presentacionPaula Díaz
Diaz, P., (2009). Análisis comparativo de los metadatos distribuidos por la IDEC, en: Treballs del Màster en Teledetecció i Sistemes d’Informació Geogràfica, 10ª edició. Universitat Autònoma de Barcelona y CREAF. Bellaterra, Septiembre 2009.
IMPLEMENTATION OF SECURITY PROTOCOL FOR WIRELESS SENSORijcsa
Intrusion Detection is one of the methods of defending against these attacks. In the proposed a security protocol for homogeneous wireless sensor network; network with all nodes are of same type. Clustering is used to improve the energy efficiency. Zone-Based Cluster Protocol (ZBCA) is used for selection of cluster head which is effective in scalability and energy consumption. Single hop technique is used for
communication within normal nodes and cluster head to base station. Simulation of proposed algorithm is performed in MATLAB. Sleep Deprivation Attack has been analyzed where attacker changes the environmental values by an artificial event. Attacker produces an event in environment due to which nodes have to sense the environment more than once in the same round that increase the power consumption of
the node. This interrupt reduces the network life time as nodes are not allowed to go in sleep mode and they are not able to perform their function of data collection and reporting to Cluster head and Base Station properly. Proposed protocol identifies this attack and prevents it from happening by solating the attacker node.
This document provides an overview of wireless sensor networks, including their architecture, requirements, and differences from conventional networks. Wireless sensor networks consist of dense deployments of sensor nodes that self-organize into a collaborative network. The nodes have stringent limitations on energy, computing power, and bandwidth. They monitor physical conditions and transmit aggregated sensor data in a multi-hop fashion to sink nodes for collection and analysis. Routing protocols are critical given the constraints of wireless sensor networks.
This document discusses energy consumption in wireless sensor networks using routing protocols. It introduces a new routing protocol called MIN-RC, which aims to balance energy consumption among sensor nodes. MIN-RC is based on the LEACH-C protocol and uses adaptive round control to adjust cluster size, head location, and round time based on network conditions to minimize energy usage. The document compares MIN-RC to LEACH-C through simulations to evaluate its ability to extend network lifetime by more evenly distributing energy consumption across sensor nodes.
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
Optimal sensor deployment is necessary condition in homogeneous and heterogeneous wireless sensor
network. Effective deployment of sensor nodes is a major point of concern as performance and lifetime of any
WSN. Proposed sensor deployment in WSN explore every sensor node sends its data to the nearest sink node
of the WSN. In addition to that system proposes a hexagonal cell based sensor deployment which leads to
optimal sensor deployment for both homogeneous and heterogeneous sensor deployment. Wireless sensor
networks are receiving significant concentration due to their potential applications ranging from surveillance
to tracking domains. In limited communication range, a WSN is divided into several disconnected sub-graphs
under certain conditions. We deploy sensor nodes at random locations so that it improves performance of the
network.This paper aims to study, discuss and analyze various node deployment strategies and coverage
problems for Homogeneous and Heterogeneous WSN.
VIRTUAL ARCHITECTURE AND ENERGYEFFICIENT ROUTING PROTOCOLS FOR 3D WIRELESS SE...ijwmn
This paper proposes a virtual architecture for three-dimensional (3D) wireless sensor networks (WSNs), a
dynamic coordinate system, and a scalable energy-efficient training protocol for collections of nodes
deployed in the space that are initially anonymous, asynchronous, and unaware of their initial location.
The 3D WSNs considered comprise massively deployed tiny energy-constrained commodity sensors and
one or more sink nodes that provide an interface to the outside world. The proposed architecture is a
generalization of a two-dimensional virtual architecture previously proposed in the literature, in which a
flexible and intuitive coordinate system is imposed onto the deployment area and the anonymous nodes are
partitioned into clusters where data can be gathered from the environment and synthesized under local
control. The architecture solves the hidden sensors problem that occurs because of irregularities in rugged
deployment areas or environments containing buildings by training the network of nodes arbitrarily
dispersed in the 3D space. In addition, we derive two simple and energy-efficient routing protocols,
respectively for dense and sparse networks, based on the proposed dynamic coordinate system. They are
used to minimize the power expended in collecting and routing data to the sink node, thus increasing the
lifetime of the network.
VIRTUAL ARCHITECTURE AND ENERGYEFFICIENT ROUTING PROTOCOLS FOR 3D WIRELESS SE...ijwmn
This paper proposes a virtual architecture for three-dimensional (3D) wireless sensor networks (WSNs), a
dynamic coordinate system, and a scalable energy-efficient training protocol for collections of nodes
deployed in the space that are initially anonymous, asynchronous, and unaware of their initial location.
The 3D WSNs considered comprise massively deployed tiny energy-constrained commodity sensors and
one or more sink nodes that provide an interface to the outside world. The proposed architecture is a
generalization of a two-dimensional virtual architecture previously proposed in the literature, in which a
flexible and intuitive coordinate system is imposed onto the deployment area and the anonymous nodes are
partitioned into clusters where data can be gathered from the environment and synthesized under local
control. The architecture solves the hidden sensors problem that occurs because of irregularities in rugged
deployment areas or environments containing buildings by training the network of nodes arbitrarily
dispersed in the 3D space. In addition, we derive two simple and energy-efficient routing protocols,
respectively for dense and sparse networks, based on the proposed dynamic coordinate system. They are
used to minimize the power expended in collecting and routing data to the sink node, thus increasing the
lifetime of the network.
VIRTUAL ARCHITECTURE AND ENERGYEFFICIENT ROUTING PROTOCOLS FOR 3D WIRELESS SE...ijwmn
This paper proposes a virtual architecture for three-dimensional (3D) wireless sensor networks (WSNs), a dynamic coordinate system, and a scalable energy-efficient training protocol for collections of nodes deployed in the space that are initially anonymous, asynchronous, and unaware of their initial location. The 3D WSNs considered comprise massively deployed tiny energy-constrained commodity sensors and one or more sink nodes that provide an interface to the outside world. The proposed architecture is a generalization of a two-dimensional virtual architecture previously proposed in the literature, in which a flexible and intuitive coordinate system is imposed onto the deployment area and the anonymous nodes are partitioned into clusters where data can be gathered from the environment and synthesized under local control. The architecture solves the hidden sensors problem that occurs because of irregularities in rugged deployment areas or environments containing buildings by training the network of nodes arbitrarily dispersed in the 3D space. In addition, we derive two simple and energy-efficient routing protocols, respectively for dense and sparse networks, based on the proposed dynamic coordinate system. They are used to minimize the power expended in collecting and routing data to the sink node, thus increasing the lifetime of the network.
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.
seminar report on wireless Sensor networkJawhar Ali
This document provides an overview of wireless sensor networks (WSNs) including their technologies, applications, architectures, and trends. It discusses how WSNs enable new applications through low-cost, low-power sensor nodes that can monitor environments. The document outlines several key applications of WSNs such as environmental monitoring, health monitoring, traffic control, and smart buildings. It also describes common WSN architectures including clustered and layered architectures.
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
VEBEK is an energy-efficient framework for secure communication in wireless sensor networks. It uses dynamic encryption keys based on the residual virtual energy of sensor nodes, eliminating the need for rekeying messages. Each packet is encrypted with a different one-time key, improving security. VEBEK provides authentication, integrity, and non-repudiation without enlarging packets through modular design. It can efficiently detect and filter malicious data through two operational modes: VEBEK-1 watches all neighbors, VEBEK-2 watches some nodes statistically. Evaluation shows VEBEK eliminates malicious data without transmission overhead.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
An Efficient Security Way of Authentication and Pair wise Key Distribution wi...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
This document discusses security issues related to wireless sensor networks. It begins with an introduction to wireless sensor networks and an overview of security challenges due to limited sensor node capabilities. It then summarizes common attacks on different layers of wireless sensor networks and discusses security objectives. The document outlines key areas of research on sensor network security including key management, secure time synchronization, and secure routing. It provides details on different key management schemes, time synchronization protocols, and discusses vulnerabilities of existing synchronization schemes to various attacks.
Nowadays, managing for optimal security to wireless sensor networks (WSNs) has emerged as an active research area. The challenging topics in this active research involve various issues such as energy consumption, routing algorithms, selection of sensors location according to a given premise, robustness, and efficiency. Despite the open problems in WSNs, already a high number of applications available show the activeness of emerging research in this area. Through this paper, authors propose an alternative routing algorithmic approach that accelerate the existing algorithms in sense to develop a power-efficient crypto system to provide the desired level of security on a smaller footprint, while maintaining real-time performance and mapping them to customized hardware. To achieve this goal, the algorithms have been first analyzed and then profiled to recognize their computational structure that is to be mapped into hardware accelerators in platform of reconfigurable computing devices. An intensive set of experiments have been conducted and the obtained results show that the performance of the proposed architecture based on algorithms implementation outperforms the software implementation running on contemporary CPU in terms of the power consumption and throughput.
The document summarizes recent developments in node clustering for wireless sensor networks. It discusses how clustering helps organize the network topology to balance load and prolong lifetime. Several key challenges in clustering sensor networks are outlined, including the need for distributed clustering algorithms that rely only on local neighborhood information. Clustering approaches are classified based on their objectives and design principles. Key issues that affect practical deployment of clustering techniques are also discussed.
The document summarizes recent developments in node clustering techniques for wireless sensor networks. It discusses how clustering helps organize sensor networks into hierarchies to balance load and prolong network lifetime. Several key clustering approaches are described and classified based on their objectives, design principles, and assumptions. Distributed clustering is preferred over centralized approaches for large-scale sensor network deployments. Representative clustering protocols like LEACH and HEED are compared in terms of their design, criteria for electing cluster heads, assumptions, and overhead. Challenges in practical deployment of clustering techniques are also highlighted.
However, the problem of authentication and pairwise key
establishment in sensor networks with MSs is still not solved
in the face of mobile sink replication attacks. For the basic
probabilistic [12] and q-composite [13] key predistribution
schemes, an attacker can easily obtain a large number of keys
by capturing a small fraction of the network sensor nodes,
making it possible for the attacker to take control of the
entire network by deploying a replicated mobile sink,
preloaded with some compromised keys to authenticate
and then initiate data communication with any sensor node.
This document summarizes a research paper that proposes a new routing protocol called U-LEACH for wireless sensor networks. U-LEACH aims to prolong the lifetime of sensor networks by uniformly distributing cluster head selection throughout the network, unlike the original LEACH protocol. It describes how LEACH works and its limitations in ensuring uniform cluster head distribution. The proposed U-LEACH protocol incorporates a Uniform Distribution Technique to select cluster heads in a way that ensures each sensor node is within transmission range of a cluster head, extending the overall network lifetime.
5th LF Energy Power Grid Model Meet-up SlidesDanBrown980551
5th Power Grid Model Meet-up
It is with great pleasure that we extend to you an invitation to the 5th Power Grid Model Meet-up, scheduled for 6th June 2024. This event will adopt a hybrid format, allowing participants to join us either through an online Mircosoft Teams session or in person at TU/e located at Den Dolech 2, Eindhoven, Netherlands. The meet-up will be hosted by Eindhoven University of Technology (TU/e), a research university specializing in engineering science & technology.
Power Grid Model
The global energy transition is placing new and unprecedented demands on Distribution System Operators (DSOs). Alongside upgrades to grid capacity, processes such as digitization, capacity optimization, and congestion management are becoming vital for delivering reliable services.
Power Grid Model is an open source project from Linux Foundation Energy and provides a calculation engine that is increasingly essential for DSOs. It offers a standards-based foundation enabling real-time power systems analysis, simulations of electrical power grids, and sophisticated what-if analysis. In addition, it enables in-depth studies and analysis of the electrical power grid’s behavior and performance. This comprehensive model incorporates essential factors such as power generation capacity, electrical losses, voltage levels, power flows, and system stability.
Power Grid Model is currently being applied in a wide variety of use cases, including grid planning, expansion, reliability, and congestion studies. It can also help in analyzing the impact of renewable energy integration, assessing the effects of disturbances or faults, and developing strategies for grid control and optimization.
What to expect
For the upcoming meetup we are organizing, we have an exciting lineup of activities planned:
-Insightful presentations covering two practical applications of the Power Grid Model.
-An update on the latest advancements in Power Grid -Model technology during the first and second quarters of 2024.
-An interactive brainstorming session to discuss and propose new feature requests.
-An opportunity to connect with fellow Power Grid Model enthusiasts and users.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
Webinar: Designing a schema for a Data WarehouseFederico Razzoli
Are you new to data warehouses (DWH)? Do you need to check whether your data warehouse follows the best practices for a good design? In both cases, this webinar is for you.
A data warehouse is a central relational database that contains all measurements about a business or an organisation. This data comes from a variety of heterogeneous data sources, which includes databases of any type that back the applications used by the company, data files exported by some applications, or APIs provided by internal or external services.
But designing a data warehouse correctly is a hard task, which requires gathering information about the business processes that need to be analysed in the first place. These processes must be translated into so-called star schemas, which means, denormalised databases where each table represents a dimension or facts.
We will discuss these topics:
- How to gather information about a business;
- Understanding dictionaries and how to identify business entities;
- Dimensions and facts;
- Setting a table granularity;
- Types of facts;
- Types of dimensions;
- Snowflakes and how to avoid them;
- Expanding existing dimensions and facts.
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
Digital Marketing Trends in 2024 | Guide for Staying AheadWask
https://www.wask.co/ebooks/digital-marketing-trends-in-2024
Feeling lost in the digital marketing whirlwind of 2024? Technology is changing, consumer habits are evolving, and staying ahead of the curve feels like a never-ending pursuit. This e-book is your compass. Dive into actionable insights to handle the complexities of modern marketing. From hyper-personalization to the power of user-generated content, learn how to build long-term relationships with your audience and unlock the secrets to success in the ever-shifting digital landscape.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
Project Management Semester Long Project - Acuityjpupo2018
Acuity is an innovative learning app designed to transform the way you engage with knowledge. Powered by AI technology, Acuity takes complex topics and distills them into concise, interactive summaries that are easy to read & understand. Whether you're exploring the depths of quantum mechanics or seeking insight into historical events, Acuity provides the key information you need without the burden of lengthy texts.
2. work controller is responsible for distributing
rekeying messages to the nodes in the group Data processing and
secured by encrypting them using the key management unit
encrypting key (KEK) [3]. Based on the security
requirement of the actual applications, a rekey-
ing process may be triggered to update the TEK
after each node attaches to or detaches from an Sensor field
active group session. This process ensures that a Internet/
new node cannot decrypt previous group mes- satellite
sages and prevents a detached node from eaves-
dropping on future group messages. Since each
network topology change triggers a new rekeying
process, the load of TEK refreshment messages
may degrade performance and scalability in case
of frequent network topology changes. Base station
Humidity sensor Temperature sensor
In this article we introduce two efficient self-
healing group-wise key schemes with time-limit-
ed node revocation, which ensures forward/ I Figure 1. The architecture of a wireless sensor network.
backward secrecy, certain collusion freedom, and
group confidentiality in high packet loss environ-
ments. Based on the dual directional hash chain ISSUES OF KEY MANAGEMENT IN WSNS
(DDHC) and hash binary tree (HBT), respec- Offering efficient key management in WSNs is
tively, the proposed schemes offer a practical challenging due to their constraints in hard-
seal-healing method and an implicit node revo- ware, deployment, network, and so on. The sen-
cation2 algorithm with lightweight computation sor network does not have fixed infrastructure
and communication overhead to cope with and contains a very large number of entities
dynamic network topology in WSNs. It is shown with high density. A WSN is usually deployed
that, comparing with existing schemes, the randomly; therefore, designing a security
DDHC/HBT mechanism can remarkably reduce scheme should not assume exact deployment
both the computation and communication over- knowledge of nodes. Sensor nodes may be
head at the GKM and the nodes, and thus deployed in public and hostile locations, and
improve the scalability and the performance of consequently exposed to physical attacks by an
the key distribution scheme. Furthermore, the adversary, who may undetectably capture a sen-
performance of the proposed schemes under sor node and compromise the secret keys. Base
poor broadcast channel condition is discussed. It stations in WSNs are centralized, powerful, and
is concluded that the proposed schemes can tol- expensive. It is tempting to rely on them too
erate high channel loss rate, and hence can much in functions. This may attract attacks on
make a good trade-off between performance and the base station and limit application of the
security. security protocol. There are also some limita-
The rest of this article is organized as follows. tions and impairments in physical design of the
We discuss the general issues in key manage- sensor node and wireless network environment,
ment in WSNs and related work. We introduce such as the imperfect wireless channel and lim-
the group-wise key distribution scheme based on ited bandwidth, memory resources, and compu-
the DDHC and the HBT, respectively. The secu- tation capacity. Therefore, some special security
rity and the performance evaluations are pre- and performance requirements should be
sented, followed by the conclusion. focused on in WSNs:
• Resilience against node capture: An adversary
RELATED WORK can mount a physical attack on a sensor node
after deployment. It is required to estimate
WSNs are often deployed in open and hostile the fraction of total network communications
environments, and thus are subjected to great compromised by such captured nodes.
security risks. In order to protect confidentiality • Resilience against node replication: An attack-
and integrity of the information, the sensor er may insert additional hostile nodes into a
nodes should be securely associated with the WSN. This is a serious attack since even a sin-
neighbouring nodes and/or data sink via encrypt- gle compromised node might allow an adver- 2 Node revocation can be
ed data link. Therefore, key management plays a sary to populate the network with a clone of described as follows. Let
critical role in establishing secure communica- the captured node to such an extent that legit- U be the set of all possible
tions in WSNs. The key management usually imate nodes could be outnumbered, and the group nodes, and a subset
includes the following three key distribution adversary can thus gain full control of the net- of U, R, be the set of
methods: key distribution, key agreement, and key work. revoked nodes. The group
predistribution. Traditional key distribution • Node revocation or participation: A new sen- node revocation is
schemes require a trusted server to establish sor may be deployed dynamically in a WSN, required to offer a secure
shared session keys between nodes. The key and a detected misbehaving node should also way for the GKM to trans-
agreement scheme is usually based on asymmet- be able to be removed dynamically from the mit rekeying messages
ric cryptography algorithms, which is not feasible system. over a broadcast channel
for resource constrained sensors. Presently, the • Scalability: When the number of sensors grows, shared by all nodes so that
only practical scheme for key management in security may be weakened. It is necessary to any nodes in R cannot
large sensor networks may be key predistribu- explore the maximum supported network size decrypt it, even when,
tion, where key information is installed in each for a given deployment policy, since different more strictly, they collude
sensor node prior to deployment. key deployment policies will result in different with each other.
IEEE Wireless Communications • October 2007 39
3. Forward hash Seed
chain (fwd) Node n
Recursive hash operation
Backward hash Seed
chain (bwd)
I Figure 2. Structure of dual directional hash chains.
network scales, which significantly impacts the possible to use an existing pair-wise key struc-
scalability of key schemes. ture to establish group-wise keys.
In practice, it is difficult to deal with all these The rekeying mechanism is another critical
constraints perfectly. A trade-off is usually made security function for group communications in
according to the actual application or purpose of WSNs. Inefficient rekeying eventually causes WSNs
the sensor network. to not work as planned. In order to tackle the scala-
bility problem of rekeying operation with highly
STUDY OF GROUP-WISE dynamic network topology, a number of efficient
approaches have recently been proposed (LKH [9],
KEY DISTRIBUTION SCHEMES Subset Difference [10], etc.). Considering the inter-
Due to the dynamic nature of group communica- dependency of rekeying messages, a group key dis-
tions, the group key needs to be not only estab- tribution scheme with revocation can be classified
lished at the initial phase but also refreshed into two distinct classes: stateful or stateless. In a
from time to time. Typically, the additional secu- stateful scheme [9], a legal node’s state in the cur-
rity requirements for group-wise key distribution rent rekey affects its ability to decrypt future group
schemes include [4]: keys. A stateless scheme relies only on the current
• Group confidentiality: Nodes that are not part rekeying message and the node’s initial configura-
of the group should not have access to any tion [11]. A non-revoked node can decrypt the new
key that can decrypt any data broadcasted to TEK independent of previous rekeying messages
the group. without contacting the GKM, even if the node is
• Forward secrecy: Nodes that detach from the offline for certain sessions. This property makes a
group should not have access to any future stateless scheme more useful in scenarios where
keys, which ensures that a detached node can- some nodes are not constantly online or suffer from
not decrypt further data. burst packet losses.
• Backward secrecy: A new node that attaches to The scheme with stateless node revocation
the session should not have access to any old was first investigated in [11], which requires
key, which ensures that a node cannot decrypt O(tn 2 logt) storage keys and O(t 2 nlog 2 t) mes-
data sent before it attaches to the group. sages, and allows the GKM to revoke any num-
• Collusion freedom: Any set of fraudulent nodes ber of nodes, while at most t of them could
should not be able to deduce the current collude to obtain the TEK. Subsequently, two
active TEK. stateless revocation schemes, CS and SD, were
In addition, the lossy channel usually causes proposed in [12]. Given N nodes with logN keys,
scheme failure if nodes cannot communicate the CS scheme can revoke any R nodes with
with the GKM due to communication interrup- O(Rlog(N/R)) messages. The SD scheme reduces
tion. The dynamics of the network topology also the message number to O(R), while the node
increase service disruption probability, since storage overhead is increased to O(log2(N)) with
some nodes may lose connections temporarily. O(logN) cryptographic operations.
Hence, it is required to offer a reliable rekeying The lossy channel usually results in scheme
process with minimum number and size of rekey- failure if nodes cannot communicate with the
ing messages. The rekey scheme should also GKM. The dynamics of the network topology also
require neither a large number of storage keys increase service disruption probability, since some
nor high computation overhead at the GKM or nodes may lose connection temporarily. There-
the nodes in the group. fore, in addition to node revocation capacity, some
A straightforward approach to key establish- recent work also addressed self-healing issue so
ment is to use the key distribution method on that a group node could recover the missed ses-
top of a pre-installed key in the sensor nodes to sion keys from the latest rekeying message on its
establish group-wise keys. A lightweight key own. Based on two-dimensional t-degree polyno-
management system [5] considered a WSN mials, Staddon et al. [13] first presented a self-
where a group of sensor nodes are deployed in healing group key distribution scheme, which was
different phases, and proposed a group-wise key further improved by Liu and Ning [14].
distribution scheme through links secured with
pair-wise keys. Other approaches include using
secure but costly asymmetric cryptography. SELF-HEALING GROUP-WISE KEY
Burmester-Desmedt [6] and IKA2 [7] used a DISTRIBUTION SCHEMES WITH
Diffie-Hellman-based group key transport proto-
col. These two algorithms were further improved TIME-LIMITED NODE REVOCATION
3 Due to page limits, we by ID-STAR [8], which adopted identity-based We introduce two efficient self-healing group key
go through the major fea- cryptography where sensor nodes’ public keys schemes with time-limited node revocation based
tures of the two schemes. can be derived from their identities. It is also on the DDHC and HBT. 3 It is defined that a
40 IEEE Wireless Communications • October 2007
4. A non-revoked node
S (0,0) can decrypt the new
TEK independently
from previous
re-keying messages
S (1,0) S (1,1)
without contacting
the GKM, even if the
node is off-line for
certain sessions.
S (2,0) S (2,1) S (2,2) S (2,3)
S (3,0) S (3,1) S (3,2) S (3,3) S (3,4) S (3,5) S (3,6) S (3,7)
TEK0 TEK1 TEK2 TEK3 TEK4 TEK5 TEK6 TEK7
I Figure 3. Example of a hash binary tree with D = 3.
sender may transmit a broadcast message to backward hash chains with size z + 1, respec-
receivers (group members) directly or indirectly, tively
and the life cycle of a wireless network is divided • Repeatedly applying the same one-way func-
into time intervals called sessions of fixed duration. tion on each seed to generate two hash chains
of equal length
DUAL DIRECTIONAL HASH CHAIN AND
Hash Binary Tree — The generation of an HBT
BINARY HASH TREE requires two (left and right) hash functions. The
We first introduce the concept of a one-way HBT in the proposed group-wise key distribution
hash function, which is the foundation of the scheme is constructed from a hash function
DDHC. A hash function Hash(.) takes a binary Hash(.) by applying one of two cyclic bit shift
string of arbitrary length as input, and outputs a functions, LeftShift(.) and RightShift(.) before the
binary string of fixed length. A one-way function hash function, that is, Hash(LeftShift(.)) and
H satisfies the following two properties: Hash(RightShift(.)). As shown in Fig. 3, it is an
• Given x, it is easy to compute y such that y = HBT with depth equal to 3. S(1,0) generated by
Hash(x). computing Hash(LeftShift(S(0,0))), and S(1,1) is
• Given y, it is computationally infeasible to generated by computing Hash(RightShift(S(0,0))).
compute x such that y = Hash(x). All other elements are generated similarly.
The security features of the proposed group-
wise key distribution schemes are based on the DDHC BASED GROUP-WISE
one-way property of the hash function.
KEY DISTRIBUTION SCHEME
Dual Directional Hash Chain — A one-way hash Initial System Setup — At the initial phase, the
chain, as illustrated by forward or backward hash GKM first selects a secret seed as the end ele-
chains in Fig. 2, is formed by recursively hashing ment of the RK chain. Then the GKM generates
x and lining them up in sequence. Let us take a one-way hash chain and uses the last hash
the forward hash chain as an example. Due to value as the first element of the RK chain, as
the one-way property of the hash function, given shown in Fig. 4. The length of the RK chain is
any point node n in the chain, it is computation- sufficient to cover the session line of the life
ally infeasible to calculate the elements on its cycle of the multicast group. The rekeying mes-
left, but easy to compute those on its right. sage is broadcast within the sensor network from
A DDHC (Fig. 2) is composed of two one- time to time. Each legitimate node within the
way hash chains of equal length, a forward hash multicast group is able to compute TEK, which
chain and a backward hash chain. It can be encrypts and decrypts the multicast messages
derived as follows: from the received RK. The GKM generates a
• Generating two random key seed values, seed sufficiently long DDHC chain, as shown in the
(fwd) and seed (bwd), for the forward and figure.
IEEE Wireless Communications • October 2007 41
5. At the initial phase, Forward hash Seed NF
the GKM first selects chain (fwd) t
Backward hash
a secret seed as the chain NB
t
Seed
(bwd)
end element of the Rekeying RKt RK seed
RK chain. Then the
Group user 0 1 ...... t1-1 t1 t2 t1+1
...... ...... z
GKM generates a life cycle
Time
one way hash chain
I Figure 4. Time-limited node revocation based on DDHC.
and uses the last
hash value as the A main or master KEK is shared between the ing if its hash value equals the previous RK.
GKM and each node for InitGroupKey message Such implicit authentication notably decreases
first element of the encryption and authentication. In order to per- the message size.
RK chain. form self-healing recovery of a rekeying mes-
sage, a node has a small buffer that can store up
In the rekeying phases, all RKs are released
to all nodes by the GKM in reverse order (i.e.,
to l RKs. Assume a node is legitimate between RKo will be released for session 0, RK1 for ses-
time window [t1, t2]. In the initiation stage, the sion 1, …, RK n for session n, etc.). Therefore,
GKM sends each sensor node the element in the given current RK j in the hash chain, nodes can
forward hash chain at time t1, the element in the only compute previous keys recursively. Since
backward hash chain at time t2, and the lth RK, most sensor nodes work in wireless and likely
which are encrypted by the corresponding KEK hostile environments, it is possible that a sensor
associated with the sensor node. node does not receive the RKs all the time. A
self-healing rekeying mechanism offers equiva-
Time-Limited Node Revocation Scheme — The applica- lent reliable RK transmission over a lossy broad-
tion of the DDHC in the time-limited node cast channel.
revocation mechanism is shown in Fig. 4. The Consider that each rekeying message con-
TEK at time t is composed by the corresponding tains only one RK in the current session.
elements in the forward hash chain, backward Although rekeying messages may be lost during
hash chain, and rekeying chain, transmission, self-healing can be achieved. The
lost RKs in previous rekeying messages can be
TEKt = f(NtF, NtB, RKt),
recovered using the one-way hash function and
where f(.) is a one way function. the last received RK. Consequently, the TEK
Due to the one-way property of the DDHC, a can be successfully derived by each node. Thus,
sensor node can only access the TEKs between the proposed self-healing scheme can efficiently
t1 and t2, since computing the TEK requires both tolerate high packet loss or error up to the size
corresponding elements in forward and back- of the RK buffer. On the other hand, if the
ward hash chains. The sensor nodes can feasibly channel condition is good but the application of
obtain both values within the time window [t1, t2] the sensor network is not delay-sensitive, receiv-
from information sent by the GKM in the initia- ing or sending the rekeying message every time
tion stage. For any time out of the time window, is not necessary, and energy consumption can
the sensor node cannot compute both elements be reduced.
in the DDHC; therefore, it cannot achieve the
TEK. Thus, an implicit time-limited node revo- HBT-BASED GROUP-WISE KEY DISTRIBUTION
cation is achieved. Each sensor node can only Earlier, we proposed a DDHC-based self-heal-
access a predefined contiguous range of the ing group key distribution scheme with time-lim-
TEKs between [t1, t2]. ited node revocation. To further improve the
During the system life cycle, when a node security and performance with high computation
attaches to an active group, the GKM assigns efficiency (fewer hash operations), here we pro-
the pair of the element in the forward hash pose a second scheme in which the HBT is
chain at t1 and the element in the backward hash adopted to generate all pre-assigned seeds. Each
chain at t2 to the new node according to its pre- TEK is linked to a leaf node in the HBT, and all
arranged life cycle [t1, t2]. Due to the property of leaf nodes are derived using a hash algorithm on
the DDHC, once the node’s life cycle is expired, these seeds.
it is forced to detach from the multicast session
without need for direct intervention of the GKM. Initial System Setup — The GKM generates an
HBT with the scale according to the maximum
Self-Healing Rekeying Mechanism — The GKM number, or life cycle, of the multicast session.
broadcasts the RK, which is encapsulated in the Without loss of generality, we assume that the
rekeying (RefreshKey) message at a defined time maximum number of group sessions, or life cycle
interval so that the legitimate sensor nodes are time unit, is m. Correspondingly, the depth of
able to renew the TEK. Due to the one-way the HBT is D = log 2 m. Then the derivation
property of the RK sequence, the RefreshKey algorithm of the HBT can be illustrated in detail
message does not need message authentication as follows.
code since the receiver can verify if the received The GKM randomly generates an initial seed
RK belongs to the same key sequence by check- S(0,0) that is sufficiently large (e.g., 256 bits).
42 IEEE Wireless Communications • October 2007
6. The GKM generates two left and right interme-
diate seeds in the first level by applying the left
PERFORMANCE EVALUATION OF PROPOSED if the channel
and right hash functions to the initial seed S(0,0), GROUP-WISE KEY DISTRIBUTION SCHEMES condition is good,
respectively, as shown earlier, repeatedly execut-
ing and operations until all seed values in the SECURITY PERFORMANCE EVALUATION but the application
tree depth D = log 2 m are generated. Each
TEK is related to a leaf node in the HBT, as We evaluate the proposed schemes to see if they of the sensor
demonstrated in Fig. 3. That is, TEK1 is associat- satisfy the security requirements for secure
ed with S(D,0), TEK 2 with S(D,1), and so on. group communications described earlier. The network is not delay
The HBT in Fig. 3 can satisfy a group communi-
cation with maximum eight sessions. All leaf
confidentiality of the key distribution informa-
tion is protected by the preshared key between
sensitive, receiving
nodes in the HBT can be derived by applying a the sensor nodes and the KGM. A sensor node or sending the
hash algorithm on the root seed value S(0,0) in not belonging to the group cannot generate an
the HBT. effective TEK even with the broadcast RK. re-keying message
The group key distribution mechanism in the
Time-Limited Node Revocation Mechanism — In the proposed schemes can ensure the refreshment of every time is not
group-wise key distribution scheme based on the the TEK by periodic rekeying when a node
HBT, TEKt at time t is composed by the corre- attaches to or detaches from an active group ses- necessary, and
sponding element of the leaf node in the HBT
and current RK,
sion. In the DDHC-based scheme, as indicated
in Fig. 4, a sensor node is restricted to access the
energy consumption
TEKt = f(S(D, t – 1), RKt),
group communication in the shaded range. The can be reduced.
forward hash chain guarantees backward secrecy.
where f is a one-way function. Therefore, the A new node that participates in the group com-
accessibility of a TEK can be controlled by munication at time t1 cannot calculate the previ-
knowledge of the elements of the leaf nodes. ous hash keys before time t 1 because of the
When a sensor node attaches to an active group, property of a one-way hash function. Similarly,
the GKM distributes the elements of the leaf the backward hash chain guarantees forward
nodes to the sensor nodes corresponding to the secrecy. Once a node detaches from the group
allowable time window [t1, t2]. session at time t2, it cannot compute the subse-
However, the distribution of sending each quent hash keys after time t2. TEKt is computed
element is not efficient for storage and wire- as the combination of corresponding elements in
less bandwidth. Since any node down a branch the forward hash chain, backward hash chain,
node can feasibly be computed as shown earli- and RK chain at time t. In the HBT-based
er, subtrees for a node with an allowable time scheme, subroot nodes only are sent to the sen-
window [t1, t2] need to be found that can cover sor node to generate subtrees. TEKt is computed
all the leaf nodes in the time window [15]. as the combination of the elements in the leaf
The pre-assigned seed set includes the sub- node in the subtrees and RK chain at time t.
root nodes in all such subtrees. All the leaf Within the allowable time window, the sensor
node seeds in the range of [ t 1 , t 2 ] c an be node has all the required information to com-
derived by repeatedly applying the hash func- pute the TEK, and is able to send and receive
tion on such pre-assigned seeds. For instance, multicast messages. It is not feasible for the sen-
as shown in Fig. 3, for a node with allowable sor node to compute the undistributed elements
time window [3, 6], the GKM will assign seeds in forward or backward hash chains, or the ele-
{S(2,1), S(2,2)} to this node via a secure chan- ment in the leaf node, respectively, in the time
nel. The GKM does not need to assign seeds out of the time window. Take the example in
{S(3,2), S(3,3), S(3,4), S(3,5)} to the node Fig. 3 and assume the allowable time window is
directly, since it can calculate these seeds by between 3 and 6. Due to the property of the
applying hash functions on {S(2,1), S(2,2)}. one-way function, the sensor node is not able to
Therefore, the storage requirement for the know S(2,1) from S(3,3). Therefore, it cannot
group node is greatly reduced. Once a group compute TEK 2 at S(3,2). Thus, both proposed
node’s life cycle is expired, it autonomously schemes meet the security requirements for for-
exits the group session without the GKM’s ward and backward secrecy with time-limited
direct intervention. node revocation.
Compared to the group-wise key distribution
Self-Healing Rekeying Mechanism — As described scheme based on the DDHC, the group-wise key
earlier, the self-healing method for group rekey- distribution scheme based on the HBT offers
ing distribution is based on a one-way hash stronger collusion freedom. In the DDHC-based
chain. Each legitimate node can derive the allow- scheme, a sensor node is able to compute part of
able time window as TEKt = f(S(D, t – 1), RKt). the elements in either a forward or backward
S(D, t – 1) does not need to be transmitted at hash chain beyond the time window [t1, t2]. For
each rekeying. Each node can individually com- example, sensor node A is assigned elements at
pute them according to the pre-assigned seeds the far right of the DDHC in Fig. 4, and sensor
and the current time. RKt is encapsulated in the node B is assigned elements at the far left of the
rekeying message, which is periodically sent by same DDHC. If they exchange the information
the GKM to all users. With a similar mecha- of the elements in the DDHC, sensor node A is
nism, self-healing can be achieved since the lost able to compute the whole forward hash chain
in RKs previous rekeying messages can be recov- using the information held by B, and B is able to
ered using the hash function and the latest compute the whole backward hash chain using
received RK. The TEK will be successfully the information held by A. On the other hand,
derived by each node on its own. the sensor node cannot determine the position
IEEE Wireless Communications • October 2007 43
7. 4.5 Maximum Minimum Average
pl=0.1
pl=0.2
pl=0.3 DDHC 2(m – 1) 2 O(m)
4 pl=0.4
pl=0.5
HBT log2m 1 O(log2m)
3.5
I Table 1. Computation overhead of the proposed
Communication cost
group-wise key distribution schemes.
3
2.5 tions is 2(m–1). Assume that the lifecycle of
each group node is uniformly distributed in [1,
m]. On the average, the computation overhead is
2 m – 1, that is, O(m). Therefore, the HBT based
algorithm has higher computation efficiency.
Table 2 shows a concise comparison among
1.5
the proposed schemes and other similar two self-
healing key distribution methods [13, 14] in
1 terms of communication and storage overhead.
1 2 3 4 5 6 7 8 9 10 Our schemes behave similar to the scheme in
Buffer length [14], and better than the scheme in [13] in stor-
age overhead. The broadcast communication
I Figure 5. Normalized communication costs vs. key buffer length. cost of the two proposed schemes is O(tlogq),
while the cost of the scheme in [13] is O((mt2 +
mt)log q), and that for [14] is O((mt + m + t)log
of the elements it received in the DDHC easily. q), where q is related to the number of revoked
Serious bleach of the DDHC requires the exact nodes, k is related to the time window, and m is
ones of many sensor nodes that are holding the the life cycle (total session number) of the group
information at the very ends of the DDHC. communication. Obviously, the communication
Therefore, in rare cases it is possible that two performance in our scheme is improved to a
sensor nodes could combine the information large extent, since the size of broadcast packet is
they have and get access to TEKs outside of reduced to O(t log q). Especially, the communi-
their allowable time window. In the HBT-based cation cost is independent of session number m.
scheme, any two nodes of the same level in the Thus, the optimized outcome is more distinct,
HBT are isolated by the one-way property of the especially when m becomes larger. The unicast
hash function. Therefore, a sensor node can only communication overhead follows the same trend.
compute the elements in those leaf nodes that Table 2 indicates that the two proposed schemes
are derivable from the seeds the sensor has perform better in communication and storage
received. Sensor nodes are no longer able to overhead than the two schemes in [13, 14] do.
cooperate with each other to access TEKs Additionally, the proposed HBT-based
beyond the allowable time window. scheme reduces the communication and storage
overheads without sacrificing any security prop-
OVERHEAD PERFORMANCE EVALUATION erty. However, the HBT is a two-dimensional
Besides the security requirements, we discuss the data structure, so its implementation is expected
operation overhead in terms of storage, compu- to be a bit more complex than that of the
tation, and communication. The computation DDHC-based scheme.
overhead comparison is shown in Table 1. For The effectiveness of the self-healing mecha-
each group node in the HBT, the minimum nism is also evaluated. Since both schemes share
number of hash operations is 1, while the maxi- a similar concept, we focus on the scheme based
mum number of hash operations is log 2 m, on the DDHC. We first discuss the relationship
since the maximum depth of the HBT is log2m. between RK buffer size and communication
On average, the computation overhead is overhead between the GKM and nodes, as
O(log 2 m). Accordingly, for the DDHC based shown in Fig. 5 with packet loss rate varying
scheme, the minimum number of hash operation from 0.1 to 0.5. It can be seen that the key buffer
is 2, while the maximum number of hash opera- length in each node determines the communica-
Communication Communication overhead Implementation
Storage overhead
overhead (broadcast) (unicast) complexity
HBT Low Low Low Medium
DDHC Low Low Low Low
[13] High High High —
[14] Low Medium Low —
I Table 2. Storage/communication overhead and implementation complexity.
44 IEEE Wireless Communications • October 2007
8. tion cost. A larger RK buffer can significantly
reduce the communication overhead. Figure 6 1.8
pl=0.1
depicts the computation cost as a function of the pl=0.2
RK buffer length, where path loss pl varies from 1.7 pl=0.3
pl=0.4
0.1 to 0.5 for n = 500. It can be seen that the pl=0.5
computation cost of each node is low, since it
1.6
only computes less than two hash functions per
RK refreshment even in the worst case, pl = 0.5.
Computation cost
From Figs. 5 and 6, the desirable number of 1.5
RK buffers should be greater than 10 so that the
normalized communication or computation cost 1.4
is lower and in the range of 1~1.5, which indi-
cates that the proposed scheme is efficient in
1.3
terms of communication and computation over-
head, even in high packet loss or error rate envi-
ronments. 1.2
CONCLUSION 1.1
We have proposed two novel group-wise key dis- 1
tribution schemes based on the DDHC and HBT, 2 4 6 8 10 12 14 16 18
respectively, for secure group communications in Buffer length
WSNs. The proposed schemes offer self-healing
group key distribution, which features periodic
I Figure 6. Computation costs vs. key buffer length.
rekeying with implicit authentication and effi-
cient tolerance for lost rekeying messages; and
time-limited group node revocation so that for- [11] A. Fiat and M. Naor, “Broadcast Encryption,” Proc.
ward and backward secrecy can be ensured. Per- Advances in Cryptology ’93, vol. 773, 1994, pp. 480–91.
[12] D. Naor, M. Naor, and J. Lotspiech, “Revocation and Trac-
formance and security evaluations demonstrate ing Schemes for Stateless Receivers,” Proc. Advances in
that storage, computation, and communication Cryptology ’01), LNCS 2139, 2001, pp. 41–62.
overheads of the two proposed schemes are quite [13] J. Staddon et al., “Self-Healing Key Distribution with
low. The HBT-based key distribution scheme has Revocation,” Proc. IEEE Symp. Sec. and Privacy, 2002,
pp. 241–57.
stronger collusion resistance capability with a [14] D. Liu, P. Ning, and K. Sun, “Efficient Self-Healing
slight increase of implementation complexity as Group Key Distribution with Revocation Capability,”
the trade-off. Both group-wise key distribution Proc. 10th ACM CCS, 2003, pp. 231–40.
schemes are suitable for WSNs with frequent [15] Y. Jiang et al., “Hash-Binary-Tree Based Group Key Dis-
tribution with Time-Limited Node Revocation,” Tech.
dynamic network topology changes. rep., 2006.
ACKNOWLEDGMENT
This research has been supported in part by the
BIOGRAPHY
M INGHUI S HI (mshi@bbcr.uwaterloo.ca) received a B.S.
NSFC under contracts no.60573144, 60218003, degree (1996) from Shanghai Jiao Tong University, China,
60429202, 60673187, 60432030, and 90412012, and an MASc. degree (2002) and a Ph.D. degree (2006)
Intel IXA University Research Plan, and a grant from the University of Waterloo, Ontario, Canada, all in
electrical and computer engineering. He is currently with
from the Natural Sciences and Engineering McMaster University, Ontario, Canada as an NSERC post-
Research Council of Canada (NSERC) Postdoc- doctoral fellow and a research associate with the Centre
toral Fellowship. for Wireless Communications, University of Waterloo. His
current research interests include network security and
mobility management in wireless LAN/cellular network inte-
REFERENCES gration, vehicular communications networks, and delay-tol-
[1] I. F. Akyildiz et al., “A Survey on Sensor Networks,” IEEE erant networks.
Commun. Mag., vol. 40, 2002, pp. 102–14.
[2] H. Harney and C. Muckenhirn, “Group Key Manage- YIXIN JIANG (yxjiang@csnet1.cs.tsinghua.edu.cn) received a
ment Protocol (GKMP) Specification,” RFC 2093, 1997. Ph.D. degree (2006) from Tsinghua University, China. and
[3] H. Harney and C. Muckenhirn, “Group Key Manage- an M.E. degree (2002) from Huazhong University of Sci-
ment Protocol (GKMP) Architecture,” RFC 2094, 1997. ence and Technology, both in computer science. In 2005
[4] Y. Challal and H. Seba, “Group Key Management Proto- he was a visiting scholar with the Department of Computer
cols: A Novel Taxonomy,” Int’l. J. Info. Tech., vol. 2, Sciences, Hong Kong Baptist University. His current research
2005, pp. 105–19. interests include security and performance evaluation in
[5] B. Dutertre, S. Cheung, and J. Levy, “Lightweight Key wireless communication and mobile computing. He has
Management in Wireless Sensor Networks by Leverag- published more than 20 papers in research journals and
ing Initial Trust,” Tech. rep., vol. SRI-SDL-04-02, 2004. IEEE conference proceedings in these areas.
[6] M. Burmester and Y. Desmedt, “A Secure and Efficient Con-
ference Key Distribution System,” Eurocrypt ’94, 1994. XUEMIN (SHERMAN) SHEN (xshen@bbcr.uwaterloo.ca) received
[7] M. Steiner, G. Tsudik, and M. Waidner, “Key Agreement a B.Sc. (1982) degree from Dalian Maritime University,
in Dynamic Peer Groups,” IEEE Trans. Parallel and Dis- China, and M.Sc. (1987) and Ph.D. degrees (1990) from
trib. Sys., 2000. Rutgers University, New Jersey, all in electrical engineering.
[8] D. Carman, B. Matt, and G. Cirincione, “Energy-Efficient He is with the Department of Electrical and Computer
and Low-Latency Key Management for Sensor Net- Engineering, University of Waterloo, Canada, where he is a
works,” 23rd Army Sci. Conf., 2002. professor and the associate chair for graduate studies. His
[9] C. K. Wong, M. G. Gouda, and S. S. Lam, “Secure research focuses on mobility and resource management in
Group Communications Using Key Graphs,” IEEE/ACM interconnected wireless/wireline networks, UWB wireless
Trans. Net., vol. 8, 2000, pp. 16–30. communications systems, wireless security, and ad hoc and
[10] Y. Nakamura and H. Kikuchi, “Efficient Key Management sensor networks. He is a coauthor of two books, and has
Based on the Subset Difference Method for Secure Group published more than 200 papers and book chapters on
Communication,” Proc. 19th Int’l. Conf. Advanced Info. wireless communications and networks, control, and filter-
Net. and Apps., vol. 1, 2005, pp. 707–12. ing. He serves as Technical Program Committee Chair for
IEEE Wireless Communications • October 2007 45
9. IEEE GLOBECOM ’07, General Co-Chair for Chinacom ’07 CHUANG LIN [SM] (clin@csnet1.cs.tsinghua.edu.cn) is a pro-
and QShine ’06, and is Founding Chair of the IEEE Commu- fessor of the Department of Computer Science and Tech-
nications Society Technical Committee on P2P Communica- nology, Tsinghua University, Beijing, China. He received a
tions and Networking. He also serves as a Founding Area Ph.D. degree in computer science from Tsinghua University
Editor for IEEE Transactions on Wireless Communications; in 1994. His current research interests include computer
Editor-in-Chief for Peer-to-Peer Networking and networks, performance evaluation, network security analy-
Application; and as an Associate Editor for IEEE Transac- sis, and Petri net theory and its applications. He has pub-
tions on Vehicular Technology, KICS/IEEE Journal of Com- lished more than 260 papers in research journals and IEEE
munications and Networks (on computer networks); conference proceedings in these areas, and has published
ACM/Wireless Networks; and Wireless Communications and three books. He is the Chinese Delegate in TC6 of IFIP. He
Mobile Computing (Wiley). He has also served as Guest serves as Technical Program Vice Chair for the 10th IEEE
Editor for IEEE JSAC, IEEE Wireless Communications, and Workshop on Future Trends of Distributed Computing Sys-
IEEE Communications Magazine. He received the Excellent tems; General Chair, ACM SIGCOMM Asia Workshop 2005;
Graduate Supervision Award in 2006 and the Outstanding Associate Editor, IEEE Transactions on Vehicular
Performance Award in 2004 from the University of Water- Technology; Area Editor, Journal of Computer Networks,
loo, the Premier’s Research Excellence Award (PREA) in and Area Editor, Journal of Parallel and Distributed Com-
2003 from the Province of Ontario, Canada, and the Distin- puting.
guished Performance Award in 2002 from the Faculty of
Engineering, University of Waterloo. He is a registered Pro-
fessional Engineer of Ontario, Canada.
46 IEEE Wireless Communications • October 2007