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.

Layered Clustering Communication Protocol for Wireless Sensor Networks

In this paper, we propose a Layered Clustering Hierarchy (LCH) communication protocol for Wireless Sensor Networks (WSNs). The design of LCH has two goals: scalability and energy-efficiency. In LCH, the sensor nodes are organized as a layered clustering structure. Each layer runs a distributed clustering protocol. By randomizing the rotation of cluster heads in each layer, the energy load is distributed evenly across sensors in the network. Our simulations show that LCH is effective in densely deployed sensor networks. On average, 70% of live sensor nodes are involved directly in the clustering communication hierarchy. Moreover, the simulations also show that the energy load and dead nodes are distributed evenly over the network. As studies prove that the performance of LCH depends mainly on the distributed clustering protocol, the location of cluster heads and cluster size are two critical factors in the design of LCH.

Group Rekeying Schemes for Secure Group Communication in Wireless Sensor Networks

Wireless sensor networks are promising solutions for many applications. However, wireless sensor nodes suffer from many constraints such as low computation capability, small memory, limited energy resources, and so on. Grouping is an important technique to localize computation and reduce communication overhead in wireless sensor networks. In this paper, we use grouping to refer to the process of combining a set of sensor nodes with similar properties. We propose two centralized group rekeying (CGK) schemes for secure group communication in sensor networks. The lifetime of a group is divided into three phases, i.e., group formation, group maintenance, and group dissolution. We demonstrate how to set up the group and establish the group key in each phase. Our analysis shows that the proposed two schemes are computationally efficient and secure.

Providing Reliable Data Transport for Dynamic Event Sensing in Wireless Sensor Networks

In this paper, we propose a Loss Tolerant Reliable (LTR) data transport mechanism for dynamic Event Sensing (LTRES) in WSNs. In LTRES, a reliable event sensing requirement at the transport layer is dynamically determined by the sink. A distributed source rate adaptation mechanism is designed, incorporating a loss rate based lightweight congestion control mechanism, to regulate the data traffic injected into the network so that the reliability requirement can be satisfied. An equation based fair rate control algorithm is used to improve the fairness among the LTRES flows sharing the congestion path. The performance evaluations show that LTRES can provide LTR data transport service for multiple events with short convergence time, low lost rate and high overall bandwidth utilization.

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.

Availability and Use of Audiovisual and Electronic Resources by Distance Learning Students in Nigerian Universities: a Case Study of National Open University of Nigeria (NOUN), Ibadan Study Centre

This study investigated the availability and use of audiovisual and electronic resources by distance learning students at the National Open University of Nigeria (NOUN). A questionnaire was administered tothe distance learning students selected across the various departments of the NOUN. The findings revealed that even though NOUN made provision for audiovisual and electronic resources for students' use, a majority of the audiovisual and electronic resources are available through personal provision by the students.The study also revealed regular use of audiovisual and electronic resources by the distance learning students. Constraints on use include poor power supply, poor infrastructure, lack of adequate skill, and high cost of access.

Improving Student Engagement and Verbal Behavior Through Cooperative Learning

In this action research study of my classroom of 10th grade Algebra II students, I investigated three related areas. First, I looked at how heterogeneous cooperative groups, where students in the group are responsible to present material, increase the number of students on task and the time on task when compared to individual practice. I noticed that their time on task might have been about the same, but they were communicating with each other mathematically. The second area I examined was the effect heterogeneous cooperative groups had on the teacher’s and the students’ verbal and nonverbal problem solving skills and understanding when compared to individual practice. At the end of the action research, students were questioning each other, and the instructor was answering questions only when the entire group had a question. The third area of data collection focused on what effect heterogeneous cooperative groups had on students’ listening skills when compared to individual practice. In the research I implemented individual quizzes and individual presentations. Both of these had a positive effect on listing in the groups. As a result of this research, I plan to continue implementing the round robin style of in- class practice with heterogeneous grouping and randomly selected individual presentations. For individual accountability I will continue the practice of individual quizzes one to two times a week.

Improving Student Engagement and Verbal Behavior Through Cooperative Learning

In this action research study of my classroom of 10th grade Algebra II students, I investigated three related areas. First, I looked at how heterogeneous cooperative groups, where students in the group are responsible to present material, increase the number of students on task and the time on task when compared to individual practice. I noticed that their time on task might have been about the same, but they were communicating with each other mathematically. The second area I examined was the effect heterogeneous cooperative groups had on the teacher’s and the students’ verbal and nonverbal problem solving skills and understanding when compared to individual practice. At the end of the action research, students were questioning each other, and the instructor was answering questions only when the entire group had a question. The third area of data collection focused on what effect heterogeneous cooperative groups had on students’ listening skills when compared to individual practice. In the research I implemented individual quizzes and individual presentations. Both of these had a positive effect on listing in the groups. As a result of this research, I plan to continue implementing the round robin style of in- class practice with heterogeneous grouping and randomly selected individual presentations. For individual accountability I will continue the practice of individual quizzes one to two times a week.

Cross-Layer Packet Size Optimization for Wireless Terrestrial, Underwater, and Underground Sensor Networks

In this paper, a cross-layer solution for packet size optimization in wireless sensor networks (WSN) is introduced such that the effects of multi-hop routing, the broadcast nature of the physical wireless channel, and the effects of error control techniques are captured. A key result of this paper is that contrary to the conventional wireless networks, in wireless sensor networks, longer packets reduce the collision probability. Consequently, an optimization solution is formalized by using three different objective functions, i.e., packet throughput, energy consumption, and resource utilization. Furthermore, the effects of end-to-end latency and reliability constraints are investigated that may be required by a particular application. As a result, a generic, cross-layer optimization framework is developed to determine the optimal packet size in WSN. This framework is further extended to determine the optimal packet size in underwater and underground sensor networks. From this framework, the optimal packet sizes under various network parameters are determined.

Design of a Wireless Vision Sensor for Object Tracking in Wireless Vision Sensor Networks

The integration of CMOS cameras with embedded processors and wireless communication devices has enabled the development of distributed wireless vision systems. Wireless Vision Sensor Networks (WVSNs), which consist of wirelessly connected embedded systems with vision and sensing capabilities, provide wide variety of application areas that have not been possible to realize with the wall-powered vision systems with wired links or scalar-data based wireless sensor networks. In this paper, the design of a middleware for a wireless vision sensor node is presented for the realization of WVSNs. The implemented wireless vision sensor node is tested through a simple vision application to study and analyze its capabilities, and determine the challenges in distributed vision applications through a wireless network of low-power embedded devices. The results of this paper highlight the practical concerns for the development of efficient image processing and communication solutions for WVSNs and emphasize the need for cross-layer solutions that unify these two so-far-independent research areas.