Knowledge Deployment & Distributions

Continuous advances in the areas of sensor networks have made wireless sensor networks (WSNs) attractive for a wide variety of applications, with vastly varying requirements and characteristics. As the data sensed by nodes usually contain sensitive information, adherence to data protection requirements is vital in WSNs.This paper introduces a new and robust key pre-distribution key management scheme using random polynomial functions and a matrix. The proposed mechanism significantly increases storage efficiency and enhances network resilience against node capture. The effectiveness of the mechanism is demonstrated by security analysis and comparisontothe existing schemes.

The Wireless Sensor Network (WSN) is one of the core technologies to form the future networks. As WSN consisting of several sink nodes and sensor nodes, while it have many advantages, such as the compact size and the low cost, corresponding constraints on resources can result. The greatest challenge among all is that distinguishing and revoking compromised sensors. Traditional techniques are used for keys pre-distributed among the sinks and sensors for pair wise key establishment and authentication. But this is not that much effective to provide authentication and due to this reason nodes are compromised. To overcome above mentioned problem, new framework was designed. The basic work in it is that to allow a three-tier general framework, use of any pair wise key pre-distribution scheme. The scheme requires two separate polynomial pools: the mobile polynomial pool and the static polynomial pool. Keys from this pool are used to strengthened the authentication mechanism between sink and node. For enhancing this, one way chain applied on pre-distributed password. This process has low computational cost and will increase the network resilience. In this process, there is possibility of actual data compromise and sink will not get requested data. Thereby employed, message digests to achieve data integrity by applying complex math on data to ensure that this data has not been tampered with on route to its final destination. Through detailed analysis, we will show that integrity of whole framework improves and assures

With the increasing use of sensor nodes in several stationary and mobile devices in today's Internet-connected life, providing security is a challenging issue. Ensuring security in wireless sensor networks is a popular subject which has been studied for almost a decade on static networks. However, due to the new trend to use sensor nodes in mobile applications, considering dynamicity is important in providing secure communication between sensor nodes. In particular, providing efficient key management schemes for mobile networks, due to its potential limitations is essential. In this paper, we provide a survey on existing key management schemes proposed for dynamic wireless sensor networks. We also provide a comparison between these schemes in terms of different security and efficiency metrics.

Due to high restrictions in wireless sensor networks, where the resources are limited, clustering protocols for routing organization have been proposed in much research for increasing system throughput, decreasing system delay and saving energy. Even these algorithms have proposed some levels of security, but because of their dynamic nature of communication, most of their security solutions are not suitable. In this paper we focus on how to achieve the highest possible level of security by applying new key management technique that can be used during wireless sensor networks communications. For our proposal to be more effective and applicable to a large number of wireless sensor networks applications, we work on a special kind of architecture that have been proposed to cluster hierarchy of wireless sensor networks and we pick one of the most interesting protocols that have been proposed for this kind of architecture, which is LEACH. This proposal is a module of a complete solution that we are developing to cover all the aspects of wireless sensor networks communication which is labeled Secure Object Oriented Architecture for Wireless Sensor Networks (SOOAWSN) .

With the increasing use of sensor nodes in several stationary and mobile devices in today's Internet-connected life, providing security is a challenging issue. Ensuring security in wireless sensor networks is a popular subject which has been studied for almost a decade on static networks. However, due to the new trend to use sensor nodes in mobile applications, considering dynamicity is important in providing secure communication between sensor nodes. In particular, providing efficient key management schemes for mobile networks, due to its potential limitations is essential. In this paper, we provide a survey on existing key management schemes proposed for dynamic wireless sensor networks. We also provide a comparison between these schemes in terms of different security and efficiency metrics.

Wireless sensor networks (WSNs) have gained wide attention from researchers in the last few years because it has a vital role in countless applications. The main function of WSN is to process extracted data and to transmit it to remote locations. A large number of sensor nodes are deployed in the monitoring area. Therefore, deploying the minimum number of nodes that maintain full coverage and connectivity is of immense importance for research. Hence, coverage and connectivity issues, besides maximizing the network lifetime, represented the main concern to be considered in this paper. The key point of this paper is to classify different coverage techniques in WSNs into three main parts: coverage based on classical deployment techniques, coverage based on meta-heuristic techniques, and coverage based on self-scheduling techniques. Moreover, multiple comparisons among these techniques are provided considering their advantages and disadvantages. Additionally, performance metrics that must be considered in WSNs and comparison among different WSNs simulators are provided. Finally, open research issues, as well as recommendations for researchers, are discussed. INDEX TERMS Coverage, connectivity, deployment techniques, power consumption, wireless sensor network (WSN).

Wireless sensor networks (WSNs) have gained wide attention from researchers in the last few years because it has a vital role in countless applications. The main function of WSN is to process extracted data and to transmit it to remote locations. A large number of sensor nodes are deployed in the monitoring area. Therefore, deploying the minimum number of nodes that maintain full coverage and connectivity is of immense importance for research. Hence, coverage and connectivity issues, besides maximizing the network lifetime, represented the main concern to be considered in this paper. The key point of this paper is to classify different coverage techniques in WSNs into three main parts: coverage based on classical deployment techniques, coverage based on meta-heuristic techniques, and coverage based on self-scheduling techniques. Moreover, multiple comparisons among these techniques are provided considering their advantages and disadvantages. Additionally, performance metrics that must be considered in WSNs and comparison among different WSNs simulators are provided. Finally, open research issues, as well as recommendations for researchers, are discussed. INDEX TERMS Coverage, connectivity, deployment techniques, power consumption, wireless sensor network (WSN).

Wireless sensor networks (WSNs) have gained wide attention from researchers in the last few years because it has a vital role in countless applications. The main function of WSN is to process extracted data and to transmit it to remote locations. A large number of sensor nodes are deployed in the monitoring area. Therefore, deploying the minimum number of nodes that maintain full coverage and connectivity is of immense importance for research. Hence, coverage and connectivity issues, besides maximizing the network lifetime, represented the main concern to be considered in this paper. The key point of this paper is to classify different coverage techniques in WSNs into three main parts: coverage based on classical deployment techniques, coverage based on meta-heuristic techniques, and coverage based on self-scheduling techniques. Moreover, multiple comparisons among these techniques are provided considering their advantages and disadvantages. Additionally, performance metrics that must be considered in WSNs and comparison among different WSNs simulators are provided. Finally, open research issues, as well as recommendations for researchers, are discussed. INDEX TERMS Coverage, connectivity, deployment techniques, power consumption, wireless sensor network (WSN).

To improve communication and fault tolerance in randomly deployed WSNs, generally more sensors are deployed than needed. In other words, since the communication range of sensor nodes is usually much smaller than their sensing ranges, redundant sensor nodes are deployed in the network. This implies that there can be many nodes in a network which may be sensing and providing the same readings. Estimating appropriate amount and deployment positions of nodes to avoid redundant data transmissions can be a complex task. This task gets further complex if we have an environment of heterogeneous sensed data collected from the same region. On the other hand, collecting data from all of the sensor nodes creates unnecessary data flow and consumes unnecessary energy of the network. Many researchers have proposed grid-cluster based WSNs that have resolved this problem to some extent. But the question arises about which should be the most efficient size and shape of the grid. In this paper we have analysed these features of grid-cluster on the basis of communication and sensing ranges of sensor nodes. We have given the comparative analysis of different sized and shaped grid-clusters in terms of energy efficiency, connectivity and number of nodes in WSN.

In this paper, we enhance and extend the quantitative theory of knowledge [1] that emphasizes the truism that academic knowledge is acquired over a time by process of learning from faculty and staff at the colleges and universities. A formal model of student environment from high schools to various levels of universities granting doctoral degrees training is assumed in this research. In this paper we also include the effects of learning in post secondary schools and in post-doctoral institutions. The net effect is that most human beings continue to learn but to varying degrees depending on the characteristic of the student/employee, the faculty attitude to teaching/job environment and the duration of such interactive process. The proposed model allows for desirable growth of individuals who reward the society in a beneficial way. This is the primary reason for the development of the model. However, the same model is also applicable for those who live to hurt and destroy social value...

Wireless Sensor Networks (WSN) is currently receiving a significant attention due to their potential impact into several real life applications such as military and home automation technology. The work in this study is a complementary part of what's discussed. In this study, we propose a software tool to simulate and evaluate the six evaluation metrics presented for non-deterministic wireless sensor network in which are: Scalability, Key Connectivity, Memory complexity, Communication complexity, Power Consumption and Confidentiality. The evaluation metrics were simulated as well as evaluated to help the network designer choosing the best probabilistic security key management algorithm for certain randomly distributed sensory network.

Wireless sensor networks are envisaged in military, commercial and healthcare applications, where data security is an important aspect. Security of the data in the network is based on the cryptographic technique and the way in which encryption and decryption keys are established among the nodes. Managing the keys in the network includes node authentication, key agreement and key update phases which poses an additional overhead on network resources. Both Symmetric and Asymmetric key techniques when applied separately in WSN fails to provide a scheme suitable for wide range of applications. Hybrid key management scheme is scalable alternative to match security requirements of WSN with minimum overhead on available resources. Heterogeneous WSN is considered in which ID based key establishment and polynomial based key pre-distribution scheme are proposed for higher and lower level of hierarchy respectively. The results of the proposed hybrid key management scheme indicate reduced resource overhead and improved security level.

Given the growing number of group applications in many existing and evolving domains much recent attention has been focused on secure multicasting over the Internet. When such systems are required to manage large groups that undergo frequent fluctuations in group membership, the need for efficient encryption key management becomes critical. This paper presents a new key management framework based on a combinatorial formulation of the group multicast key management problem that is applicable to the general problem of managing keys for any type of trusted group communication, regardless of the underlying transmission method between group participants. Specifically, we describe Exclusion Basis Systems and show exactly when they exist. In addition, the framework separates key management from encrypted message transmission resulting in a more efficient implementation of key management.

Inherent to the wireless sensor networks are the two major problems of the broadcasting vulnerability, the limited computational capability and power budget. Even though security is a must in most applications, current sophisticated security protocols are not amenable to the primitiveness of the sensors. In this paper, we introduce a novel security protocol for wireless network of sensors that is very secure, yet simple and efficient. At the core of our security protocol is a simple and fast stream cipher cryptosystem that utilizes permutation vectors as encryption keys, forcing an intruder to a brute-force time complexity of Ω(2 n). In addition, our mechanism alleviates the effect of sensor capture, via its synchronized re-keying feature. In addition to the encryption efficiency, our system utilizes the group deployment of newly joining sensors for sensors power budgeting considerations. Experimental results show very promising future of our system in the wireless networks domain, excelling over other peers of modern cryptosystems (AES, DES, TripleDES), especially in the power budget arena.

Balanced utilization of energy of wireless sensor nodes is a challenge while designing wireless sensor network (WSN). This energy of sensor node is a limited resource and measure for the lifespan of WSN. Communication process consumes most of the energy of sensor node hence; energy of sensor node becomes a major design issue for WSN. Clustering is preferred while designing routing protocols for WSN for its many to one traffic pattern. In our minimum distance based routing protocol for lifetime improvement in WSN (MDBRP) clusters are formed once in a lifetime and their heads are selected rotationally based on minimum communication distance between nodes and their next hop. MDBRP considers minimum energy consumption which aims to increase the overall lifespan of WSN.

Wireless Sensor Network (WSN) applications are growing tremendously in many areas that ranges from environmental and habitant monitoring to health care, agriculture, military, defense, control and tracking applications. Despite of huge growth in applications, these networks are prone to security attacks. Again, deployment of these networks in a hostile and unattended environment along with the limited resources make the design/deployment issue more critical than any other networks. Recently, many research publications discuss on the security issues and challenge involved in WSN why because the limited source of nodes can't provide a desired level of security by itself. Even though many studies discuss many potential issues of WSN security, most of these are discussed in isolation of each other. Keeping this in mind, trying to provide a clear picture of this vast area, attempt has been made to present the major security issues that consider the probable attacks and how it can be detected prior to the attack and various detection mechanisms are discussed in this paper. A brief taxonomy of WSN constraints and different types of attacks and detection mechanisms are presented this paper.

Recently, the security issue has gained a noticeable interest in the field of networks especially in wireless sensor networks(WSNs). Selecting a certain security approach in order to be applied in a WSN is a decision that usually depends on many factors. In this paper, we have evaluated the performance of four probabilistic key management approaches using two metrics: communication complexity and power Consumption. These approaches are: Random key pre-distribution, Q-composite key scheme, Multi-Path Reinforcement Scheme, and Random Pair-Wise Keys Scheme. The results have shown that the random key pre-distribution approach can be applied over a small sensor network with a large key pool size, while Qcomposite scheme has an improvement over the basic scheme for small scale network attack. On the other hand, it was shown by simulation that the random multipath scheme will give a great level of security if it is used with average size of networks; however, it will consume much power in transmission. Finally, the pairwise key scheme, which does most of its job before distribution, is shown to give the best results which makes it the best applicable approach especially if it is used in large networks.

We present a group-based key predistribution scheme, GKE, which enables any pair of neighboring sensors to establish a unique pairwise key, regardless of sensor density or distribution. Since pairwise keys are unique, security in GKE degrades gracefully as the number of compromised nodes increases. In addition, GKE is very efficient since it requires only localized communication to establish pairwise keys, thus significantly reducing the communication overhead. Our security analysis and performance evaluation illustrate the superiority of GKE in terms of resilience, connectivity, communication overhead and memory requirement.

Nowadays Wireless sensor networks (WSNs) being applied in many different civilian applications like vehicle tracking, habitat monitoring, forest surveillance, earthquake observation, biomedical or health care requests and building surveillance. To a large extent the efficiency of WSNs depends on the coverage provided by the deployment scheme. Different deployment demands and optimization goals are required in different environment. This study keep focus on coverage, connectivity and energy efficiency which have great impact on the performance of WSNs. Node deployment is a fundamental problem to be solved in WSNs. An appropriate node deployment scheme can reduce the issues in WSNs. Further it can extend the lifetime of WSNs by minimizing energy consumption. This paper investigated some deployment schemes, analysed and identifying their requirement.

Given the growing number of group applications in many existing and evolving domains recent attention has been focused on secure multicasting over the Internet. When such systems are required to manage large groups that undergo frequent fluctuations in group membership, the need for efficient encryption key management becomes critical. This paper presents a new key management framework based on a combinatorial formulation of the group multicast key management problem that is applicable to the general problem of managing keys for any type of trusted group communication, regardless of the underlying transmission method between group participants. Specifically, we describe Exclusion Basis Systems and show exactly when they exist. In addition, the framework separates key management from encrypted message transmission, resulting in a more efficient implementation of key management.

The demand for the compact and small-sized electronics device is increasing in present days, and many of the organizations and researchers have adopted these demand and have succeeded too. Wireless sensor devices are made with more compact and small sized and also the large scale Wireless Sensor Networks (LSWSNs), which are also developed with more number of sensor nodes. These LSWSNs means the WSNs were having high density or of the large area of the network. Mainly a WSNs are composed of Sensor Nodes (SNs) which are placed in a pattern, by which more data can be gathered and transferred to the base station (BS) or also known as Sink. The path determining process from source to destination for data transmission is generally known as routing. In most WSNs routing of incoming data can be determined by the network layer. The SNs at the source cannot reach the sink node directly in multi-hop networks, hence intermediate SNs need to relay their respective packets. Mainly the routing path of every packet is helpful in understanding the network performance. The analysis of routing path is necessary to route path reconstruction. There have been many efforts made to address the per-packet path reconstruction problem in WSNs. In this project we propose a novel Pathfinder scheme. The evaluation will be done using Matlab tool.

The sharing and distribution of knowledge within an organisation is a vital precondition for turning isolated information or experiences into knowledge that the whole organisation can use. The challenge, as I have seen, in trying to manage and create and knowledge is to develop the processes and infrastructures that enable dynamic, value-added interaction between seekers and holders of knowledge, through (a) collection, using the Intranet, Extranet and Internet to give people access to databases, hard information people can be confident in, and allow people to acquire sets of leads for further research, and (b) connection, a set of contacts to pursue for further information, connecting with other people with similar interests or on similar projects – people networks, making explicit mental models and the subconscious of individuals, foster relationships and enabling cultures. Over the years, I have been asked, by many, the question: “Given that I am convinced of the power of KM, what processes do I begin with in my own organization.

Due to high restrictions in sensor network, where the resources are limited, clustering protocols for routing organization have been proposed in much research for increasing system throughput, decreasing system delay and saving energy. Even these algorithms have proposed some levels of security, but because of their dynamic nature of communication, most of their security solutions are not suitable. In this paper we focus on how to apply the highest possible level of security to sensor networks and at the same time increase the performance of these networks by changing the way that sensors communicate with each other.

Wireless Sensor Network is a group of sensors it will collect the information from the environment and it will forward through relay communication. Where each node is equipped with a sensor to detect physical phenomena such as light, heat, pressure. WSN is chiefly of greatly sized number of sensor network points. To instrument safely during the sending of facts from one network point to another network point, different safety techniques are used. Authentication is an essential thing needed in sensor network going after safety. But the wireless sensor networks are very hard to safe needing payment to its forceful and ad-hoc nature. To get at details of safety issues that get up do one's best to get answer to by getting mixed together wireless sensor networks with the readily moved network and can put to use the has at need powers of both networks. To refers the hard question of authentication in WSNs this paper presents make an offer a good at producing an effect and safe framework which make secure authentication. To improving the energy we establish a secure certified network. We introduce roaming nodes which provides Virtual Certificate Authority (VCA) to all the nodes in a periodic manner. This new data gathering apparatus for great scale wireless sensor networks by putting into use for first time readiness to move into the network. An M-collector (readily moved facts one keeping examples) starts the data gathering journey taking place at regular times from the noise in back knowledge for computers sink, polls each sensor while traversing its sending (power and so on) range, then directly collects facts from the sensor in single hop making connections, and finally transports the facts to the static sink. It specially designed for distributed wireless sensor network. Security is involved by both authentication and symmetric key cryptosystem.

Mobile Ad hoc Networks (MANETs) is a continuously self-configuring, infrastructure-less network of mobile devices connected without wires and also it is an open network environment where nodes can join and leave the network freely. Hence, the dynamic natures of MANETs is not secure than the wired networks. To overcome this issue, the Cluster-based Certificate Revocation with Vindication Capability (CCRVC) scheme is proposed. In the meanwhile nodes forms a cluster consists of a Cluster Head with some Cluster Members (CMs) situated within the transmission range of their cluster Head. Each node should have to acquire valid certificates from the Certification Authority (CA) before it can join the network that is responsible for distribution and management of certificates to all nodes and also CA is responsible for updating two lists, Warning list and Black list. Both the lists are used to hold the accusing and accused nodes information, respectively. Experimental results show that the proposed CCRVC scheme is effective and efficient to provide efficient and secure communication.

The scope of this survey is to examine and thor- oughly evaluate the cluster-based Group Key Agreement (GKA) protocols for Wireless Sensor Networks (WSNs). Towards this goal, we have grouped the WSNs application environments into two major categories (i.e., infrastructure-based and infrastruc- tureless) and have examined: a) which of the cluster-based Group Key Agreement (GKA) protocols that appear in the

In Wireless Sensor Networks (WSN) sensor nodes with similar readings can be grouped such that, it is enough to report a single reading from the entire group. A representative node is selected from each cluster to do the reporting job. This helps to increase the battery life of sensor nodes. However, efficiently identifying sensor groups and their representative nodes is a challenging task. In this paper, a distributed algorithm is proposed to determine a set of representative nodes which exploits the tradeoff between data quality and energy consumption. In this paper, we group the sensor nodes based on their inherent spatial and data correlation in WSN. The proposed clustering algorithm is applied for uniform and random topology of sensor network. The results based on different metrics such as average number of clusters formed, energy consumption and average variation in cluster size are compared for both topologies.

In this paper, we address key management in cluster-based mobile ad hoc networks (MANETs). We present a fully-distributed IDbased multiple secrets key management scheme (IMKM). This scheme is implemented via a combination of ID-based multiple secrets and threshold cryptography. Ensuring secure communication in an ad hoc network is extremely challenging because of the dynamic nature of the network and the lack of centralized management. Our proposed analysis includes the effect of packet generation model, random deployment of sensors, dynamic cluster head assignment, data compression, and energy consumption model at the sensors. a new protocol called Equalized Cluster Head Election Routing Protocol (ECHERP), which pursues energy conservation through balanced clustering, is proposed. Performance evaluation of ECHERP is carried out through simulation tests. We also present a novel key predistribution scheme that uses deployment knowledge to divide deployment regions into overlapping clusters, each of which has its own distinct key space. Through careful construction of these clusters, network resilience is improved, we focus on the management of encryption keys in large-scale clustered WSNs. We propose a novel distributed key management scheme based on Exclusion Basis Systems (EBS); a combinatorial formulation of the group key management problem. Initially, clusters are formed in the network and the cluster heads are selected based on the energy cost, coverage and processing capacity. The sink assigns cluster key to every cluster and an EBS key set to every cluster head. The EBS key set contains the pairwise keys for intra-cluster and inter-cluster communication. During data transmission towards the sink, the data is made to pass through two phases of encryption thus ensuring security in the network. Our results include performance evaluation in terms of security metrics in clustered WSN and a detailed analysis of resource utilization.

Wireless sensor networks have many applications, vary in size, and are deployed in a wide variety of areas. They are often deployed in potentially adverse or even hostile environment so that there are concerns on security issues in these networks. Sensor nodes used to form these networks are resource-constrained, which make security applications a challenging problem. Efficient key distribution and management mechanisms are needed besides lightweight ciphers. Many key establishment techniques have been designed to address the tradeoff between limited memory and security, but which scheme is the most effective is still debatable. In this paper, we provide a survey of key management schemes in wireless sensor networks. We notice that no key distribution technique is ideal to all the scenarios where sensor networks are used; therefore the techniques employed must depend upon the requirements of target applications and resources of each individual sensor network.