Related items
Showing items related by title, author, creator and subject.
-
Feasibility Design of a Continuous Insulin Sensor from Lessons Learned using Glucose Sensors, and Point of Care Insulin Sensorsabstract: Glucose sensors have had many paradigm shifts, beginning with using urine, to point of care blood, now being approved for implant. This review covers various aspects of the sensors, ranging from the types of surface chemistry, and electron transduction. All the way to the algorithms, and filters used to alter and understand the signal being transduced. Focus is given to Dr. Hellerâ’s work using redox mediators, as well as Dr. Sode in his advances for direct electron transfer. Simple process of designing sensors are described, as well as the possible errors that may come with glucose sensor use. Finally, a small window into the future trends of glucose sensors is described both from a device view point, as well as organic viewpoint. Using this history the initial point of care sensor for insulin published through LaBelle’s lab is reevaluated critically. In addition, the modeling of the possibility of continuously measuring insulin is researched. To better understand the design for a continuous glucose sensor, the basic kinetic model is set up, and ran through a design of experiments to then optimized what the binding kinetics for an ideal insulin molecular recognition element would be. In addition, the phenomena of two electrochemical impedance spectroscopy peaks is analyzed, and two theories are suggests, and demonstrated to a modest level.
-
UDSN 1550-1329 1550-1477 International Journal of Distributed Sensor Networks, Vol. 3, No. 2, February 2007: pp. 1–27 International Journal of Distributed Sensor Networks Energy-Efficient Group Key Management Protocols for Hierarchical Sensor NetworksIn this paper, we describe a group key management protocol for hierarchical sensor networks where instead of using pre-deployed keys, each sensor node generates a partial key dynamically using a function. The function takes partial keys of its children as arguments. The design of the protocol is motivated by the fact that traditional cryptographic techniques are impractical in sensor networks because of associated high energy and computational overheads. The group key management protocol supports the establishment of two types of group keys; one for the nodes within a group (intra-cluster), and the other among a group of cluster heads (inter-cluster). The protocol handles freshness of the group key dynamically, and eliminates the involvement of a trusted third party (TTP). We have experimentally analyzed the time and energy consumption in broadcasting partial keys and the group key under two sensor routing protocols (Tiny-AODV and Tiny-Diffusion) by varying the number of nodes and key sizes. The performance study provides the optimum number of partial keys needed for computing the group key to balance the key size for security requirements and the power consumption. The experimental study also concludes that the energy consumption of SPIN [9]increases rapidly as the number of group members increases in comparison to our protocol. Similarly the pre-deployed key approach requires more communication time in comparison with this protocol. We have implemented this protocol using MICA2 motes and repeated most of the experiments which are done in simulation and we found out that the obtained results are very close to the observations made using the simulator.
-
UDSN 1550-1329 1550-1477 International Journal of Distributed Sensor Networks, Vol. 3, No. 2, February 2007: pp. 1–27 International Journal of Distributed Sensor Networks Energy-Efficient Group Key Management Protocols for Hierarchical Sensor NetworksIn this paper, we describe a group key management protocol for hierarchical sensor networks where instead of using pre-deployed keys, each sensor node generates a partial key dynamically using a function. The function takes partial keys of its children as arguments. The design of the protocol is motivated by the fact that traditional cryptographic techniques are impractical in sensor networks because of associated high energy and computational overheads. The group key management protocol supports the establishment of two types of group keys; one for the nodes within a group (intra-cluster), and the other among a group of cluster heads (inter-cluster). The protocol handles freshness of the group key dynamically, and eliminates the involvement of a trusted third party (TTP). We have experimentally analyzed the time and energy consumption in broadcasting partial keys and the group key under two sensor routing protocols (Tiny-AODV and Tiny-Diffusion) by varying the number of nodes and key sizes. The performance study provides the optimum number of partial keys needed for computing the group key to balance the key size for security requirements and the power consumption. The experimental study also concludes that the energy consumption of SPIN [9] increases rapidly as the number of group members increases in comparison to our protocol. Similarly the pre-deployed key approach requires more communication time in comparison with this protocol. We have implemented this protocol using MICA2 motes and repeated most of the experiments which are done in simulation and we found out that the obtained results are very close to the observations made using the simulator