A Security Framework for Wireless Sensor Networks Utilizing a Unique Session Key

Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Many key management protocols have been specifically designed for wireless sensor networks. However, most of the key management protocols focus on the establishment of the required keys or the removal of the compromised keys. The design of these key management protocols does not consider the support of higher level security applications. When the applications are integrated later in sensor networks, new mechanisms must be designed. In this paper, we propose a security framework, uKeying, for wireless sensor networks. This framework can be easily extended to support many security applications. It includes three components: a security mechanism to provide secrecy for communications in sensor networks, an efficient session key distribution scheme, and a centralized key revocation scheme. The proposed framework does not depend on a specific key distribution scheme and can be used to support many security applications, such as secure group communications. Our analysis shows that the framework is secure, efficient, and extensible. The simulation and results also reveal for the first time that a centralized key revocation scheme can also attain a high efficiency.

KeyRev: An Efficient Key Revocation Scheme for Wireless Sensor Networks

Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Key distribution has been extensively studied in the context of sensor networks. However, key revocation has received relatively little attention. Existing key revocation schemes can be divided into two categories: centralized key revocation scheme and distributed key revocation scheme. In this paper, we first summarize the current key revocation schemes for sensor networks. Then, we propose an efficient centralized key revocation scheme, KeyRev, for wireless sensor networks. Unlike most proposed key revocation schemes focusing on removing the compromised keys, we propose to use key updating techniques to obsolesce the keys owned by the compromised sensor nodes and thus remove the nodes from the network. Our analyses show that the KeyRev scheme is secure inspite of not removing the pre-distributed key materials at compromised sensor nodes. Simulation results also indicate that the KeyRev scheme is scalable and performs very well in wireless sensor networks.

A Key Management Protocol for Wireless Sensor Networks with Multiple Base Stations

Most of the proposed key management protocols for wireless sensor networks (WSNs) in the literature assume that a single base station is used and that the base station is trustworthy. However, there are applications in which multiple base stations are used and the security of the base stations must be considered. This paper investigates a key management protocol in wireless sensor networks which include multiple base stations. We consider the situations in which both the base stations and the sensor nodes can be compromised. The proposed key management protocol, mKeying, includes two schemes, a key distribution scheme, mKeyDist, supporting multiple base stations in the network, and a key revocation scheme, mKeyRev, used to efficiently remove the compromised nodes from the network. Our analyses show that the proposed protocol is efficient and secure against the compromise of the base stations and the sensor nodes.

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.

Cetaceans of Southeast Alaska: Distribution and Seasonal Occurrence

Aim To assess the distribution, group size, seasonal occurrence and annual trends of cetaceans. Location The study area included all major inland waters of Southeast Alaska. Methods Between 1991 and 2007, cetacean surveys were conducted by observers who kept a constant watch when the vessel was underway and recorded all cetaceans encountered. For each species, we examined distributional patterns, group size, seasonal occurrence and annual trends. Analysis of variance (anova F) was used to test for differences in group sizes between multiple means, and Student’s t-test was used to detect differences between pairwise means. Cetacean seasonal occurrence and annual trends were investigated using a generalized linear model framework. Results Humpback whales (Megaptera novaeangliae) were seen throughout the region, with numbers lowest in spring and highest in the fall. Fin whale (Balaenoptera physalus) and minke whale (Balaenoptera acutorostrata) distributions were more restricted than that reported for humpback whales, and the low number of sightings precluded evaluating seasonal trends. Three killer whale (Orcinus orca) eco-types were documented with distributions occurring throughout inland waters. Seasonal patterns were not detected or could not be evaluated for resident and offshore killer whales, respectively; however, the transient eco-type was more abundant in the summer. Dall’s porpoise (Phocoenoides dalli) were distributed throughout the region, with more sightings in spring and summer than in fall. Harbour porpoise (Phocoena phocoena) distribution was clumped, with concentrations occurring in the Icy Strait/Glacier Bay and Wrangell areas and with no evidence of seasonality. Pacific white-sided dolphins (Lagenorhynchus obliquidens) were observed only occasionally, with more sightings in the spring. For most species, group size varied on both an annual and seasonal basis. Main conclusions Seven cetacean species occupy the inland waters of Southeast Alaska, with distribution, group size, seasonal occurrence and annual trends varying by species. Future studies that compare spatial and temporal patterns with other features (e.g. oceanography, prey resources) may help in identifying the key factors that support the high density and biodiversity of cetaceans found in this region. An increased understanding of the region’s marine ecology is an essential step towards ensuring the long-term conservation of cetaceans in Southeast Alaska.