Sensor Network Security Research Papers (original) (raw)

A threat analysis framework and methodology was developed by the authors to catalogue threats, vulnerabilities, attacks and countermeasures for smart cards (contact and contactless) and wireless sensor network node technologies. The goal of this research was to determine "Security Lessons" learned from the world of smart cards that may be applied to wireless sensor network nodes and vice versa.

- by Keith Mayes
- •
- Sensor Network Security, Comparative Analysis, Smart Card, Lessons Learned
- by Sri Rejeki
- •
- Computer Science, Distributed Computing, Computer Networks, Wireless Sensor Networks

Wireless Sensor Network (WSN) is an emerging technology that shows great assure for various futuristic applications both for public and military. Many researchers tried to develop further cost and energy efficient computing devices and algorithms for WSN but the most challenging is to fit the security of WSN into that strained environment. However, security is crucial to the success of applying WSN. So it becomes essential to be familiar with the security aspects of WSN before designing WSN system. When sensor networks are deployed in an aggressive terrain, security becomes extremely important, as they are prone to different types of despite attacks. The intent of this paper is to investigate security problems and various security requirements. We identify the attacks at all the layers of WSN network architecture and also tried to find their possible solution.

- by Ioannis Krontiris
- •
- Wireless Sensor Networks, Sensor Network Security

Wireless Sensor Network (WSN) is an emerging technology that shows great promise for various futuristic applications both for mass public and military. The sensing technology combined with processing power and wireless communication makes it lucrative for being exploited in abundance in future. The inclusion of wireless communication technology also incurs various types of security threats. The intent of this paper is to investigate the security related issues and challenges in wireless sensor networks. We identify the security threats, review proposed security mechanisms for wireless sensor networks. We also discuss the holistic view of security for ensuring layered and robust security in wireless sensor networks.

- by Yeddula ravindra Reddy
- •
- Distributed Computing, Physics, Security, Sensor Network Security

Wireless sensor networks (WSNs) have attracted a lot of interest over the last decade in wireless and mobile computing research community. Applications of WSNs are numerous and growing, which range from indoor deployment scenarios in the home and office to outdoor deployment in adversary’s territory in a tactical battleground. However, due to distributed nature and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their performance. This problem is more critical if the network is deployed for some mission-critical applications such as in a tactical battlefield. Random failure of nodes is also very likely in real-life deployment scenarios. Due to resource constraints in the sensor nodes, traditional security mechanisms with large overhead of computation and communication are infeasible in WSNs. Design and implementation of secure WSNs is, therefore, a particularly challenging task. This chapter provides a comprehensive discussion on the state of the art in security technologies for WSNs. It identifies various possible attacks at different layers of the communication protocol stack in a typical WSN and presents their possible countermeasures. A brief discussion on the future direction of research in WSN security is also included.

- by Jaydip Sen
- •
- Distributed Computing, Security, Wireless Sensor Networks, Sensor Network Security

The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications .The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.

Jamming represents the most serious security threat in the field of Wireless Sensor Networks (WSNs), as it can easily put out of order even WSNs that utilize strong highlayer security mechanisms, simply because it is often ignored in the initial WSN design. The objective of this article is to provide a general overview of the critical issue of jamming in WSNs and cover all the relevant work, providing the interested researcher pointers for open research issues in this field. We provide a brief overview of the communication protocols typically used in WSN deployments and highlight the characteristics of contemporary WSNs, that make them susceptible to jamming attacks, along with the various types of jamming which can be exercised against WSNs. Common jamming techniques and an overview of various types of jammers are reviewed and typical countermeasures against jamming are also analyzed. The key ideas of existing security mechanisms against jamming attacks in WSNs are presented and open research issues, with respect to the defense against jamming attacks are highlighted.

- by Damianos Gavalas and +1
- •
- Wireless Communications, Network Security, Wireless Sensor Networks, Wireless security

After a few years of intense research, Wireless Sensor Networks (WSNs) still demand new secure and cryptographic schemes. On the other hand, the advent of cryptography from pairings has enabled a wide range of novel cryptosystems. In this work we present TinyTate, the first known implementation of pairings for sensor nodes based on the 8bit/7.3828-MHz ATmega128L microcontroller (e.g., MICA2 and MICAz motes). We then conclude that cryptography from pairings is indeed viable in resource-constrained nodes.

- by leonardo oliveira
- •
- Sensor Network Security, Tate pairing, NCA, Sensor nodes

Nodes in a sensor network may be lost due to power exhaustion or malicious attacks. To extend the lifetime of the sensor network, new node deployment is necessary. In military scenarios, adversaries may directly deploy malicious nodes or manipulate existing nodes to introduce malicious ''new'' nodes through many kinds of attacks. To prevent malicious nodes from joining the sensor network, access control is required in the design of sensor network protocols. In this paper, we propose an access control protocol based on Elliptic Curve Cryptography (ECC) for sensor networks. Our access control protocol accomplishes node authentication and key establishment for new nodes. Different from conventional authentication methods based on the node identity, our access control protocol includes both the node identity and the node bootstrapping time into the authentication procedure. Hence our access control protocol cannot only identify the identity of each node but also differentiate between old nodes and new nodes. In addition, each new node can establish shared keys with its neighbors during the node authentication procedure. Compared with conventional sensor network security solutions, our access control protocol can defend against most well-recognized attacks in sensor networks, and achieve better computation and communication performance due to the more efficient algorithms based on ECC than those based on RSA.

- by Yun Zhou
- •
- Distributed Computing, Access Control, Sensor Network Security, Ad Hoc Networks

In future smart environments, ad hoc sensor networks will play a key role in sensing, collecting, and disseminating information about environmental phenomena. As sensor networks come to be wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis has been placed on security. This paper analyzes security challenges in wireless sensor networks and summarizes key issues that need be solved for achieving security in an ad hoc network. It gives an overview of the current state of solutions on such key issues as secure routing, prevention of denial-of-service, and key management service.

- by neeraj sharma
- •
- Distributed Computing, Sensor Network Security, Ad Hoc Networks, Sensor networks

We introduce TinySec, the first fully-implemented link layer security architecture for wireless sensor networks. In our design, we leverage recent lessons learned from design vulnerabilities in security protocols for other wireless networks such as 802.11b and GSM. Conventional security protocols tend to be conservative in their security guarantees, typically adding 16-32 bytes of overhead. With small memories, weak processors, limited energy, and 30 byte packets, sensor networks cannot afford this luxury. TinySec addresses these extreme resource constraints with careful design; we explore the tradeoffs among different cryptographic primitives and use the inherent sensor network limitations to our advantage when choosing parameters to find a sweet spot for security, packet overhead, and resource requirements. TinySec is portable to a variety of hardware and radio platforms. Our experimental results on a 36 node distributed sensor network application clearly demonstrate that software based link layer protocols are feasible and efficient, adding less than 10% energy, latency, and bandwidth overhead.

CATATAN: * Potong yang tidak berkenaan * * Jika tesis ini SULIT atau TERHAD, sila lampirkan surat daripada pihak berkuasa/organisasi berkenaan dengan menyatakan sekali sebab dan tempoh tesis perlu dikelaskan sebagai SULIT atau TERHAD. Tesis dimaksudkan sebagai tesis bagi Ijazah Doktor Falsafah dan Sarjana secara penyelidikan, atau disertasi bagi pengajian secara kerja kursus dan penyelidikan, atau Laporan Projek Sarjana Muda (PSM)

- by Mohd Amri Bin Md Yunus
- •
- Sensors and Sensing, Sensor, Sensor Network Security, Optical Tomography

Clustered sensor networks have recently been shown to increase system throughput, decrease system delay, and save energy while performing data aggregation. Whereas those with rotating cluster heads, such as LEACH (low-energy adaptive clustering hierarchy), have also advantages in terms of security, the dynamic nature of their communication makes most existing security solutions inadequate for them. In this paper, we investigate the problem of adding security to hierarchical (cluster-based) sensor networks where clusters are formed dynamically and periodically, such as LEACH. For this purpose, we show how random key predistribution, widely studied in the context of flat networks, and μTESLAμTESLA, a building block from SPINS, can be both used to secure communications in this type of network. We present our solution, and provide a detailed analysis of how different values for the various parameters in such a system impact a hierarchical network in terms of security and energy efficiency. To the best of our knowledge, ours is the first that investigates security in hierarchical WSNs with dynamic cluster formation.

- by Leonardo Oliveira
- •
- Engineering, Technology, Signal Processing, Sensor Network Security

This is a position paper on our views on security aspects of Wireless Multimedia Sensor Networks (Secure WMSNs). It is meant to serve as a brief survey. But, more importantly, it gives a perspective on how we foresee the future of this research area, its main challenges, and its future trends. We believe that this paper will spur new discussions and research ideas among the researchers from both the industry and the academic world.

- by Ruken Zilan and +1
- •
- Distributed Computing, Sensor Network Security, Telecommunication, Sensor Network

This paper presents a routing protocol architecture based on recursive group algorithm. This algorithm apply Group Verification Tree approach which makes the sensor network secure and make it safer from malicious intrusions and illegitimate users. The proposed approach will give a new dimension to the fast and secure routing in the sensor networks with less energy to be consumed. Based on the analysis and simulation the proposed strategies yield better results than the existing results.

- by Naveed Khan
- •
- Energy Conservation, Sensor Network Security, Sensor Network, Routing Protocol

Distributed measurement and monitoring systems are vital to the functioning of many critical systems and are due to be ever more important as systems grow in size and complexity. This raises questions regarding the trustworthiness of the... more

- by Benedikt Kristinsson
- •
- Information Security, Sensor Network Security, Cryptography, Arduino

- by Bulent Tavli
- •
- Distributed Computing, Sensor Network Security, Telecommunication, Sensor Network

In many Wireless Sensor Networks (WSNs), providing end to end secure communications between sensors and the sink is important for secure network management. While there have been many works devoted to hop by hop secure communications, the issue of end to end secure communications is largely ignored. In this paper, we design an end to end secure communication protocol in randomly deployed WSNs. Specifically, our protocol is based on a methodology called differentiated key pre-distribution. The core idea is to distribute different number of keys to different sensors to enhance the resilience of certain links. This feature is leveraged during routing, where nodes route through those links with higher resilience. Using rigorous theoretical analysis, we derive an expression for the quality of end to end secure communications, and use it to determine optimum protocol parameters. Extensive performance evaluation illustrates that our solutions can provide highly secure communications between sensor nodes and the sink in randomly deployed WSNs. We also provide detailed discussion on a potential attack (i.e. biased node capturing attack) to our solutions, and propose several countermeasures to this attack.

Location information is of essential importance in sensor networks deployed for generating location-specific event reports. When such networks operate in hostile environments, it becomes imperative to guarantee the correctness of event location claims. In this paper we address the problem of assessing location claims of un-trusted (potentially compromised) nodes. The mechanisms introduced here prevent a compromised node from generating illicit event reports for locations other than its own. This is important because by compromising "easy target" sensors (say, sensors on the perimeter of the field that's easier to access), the adversary should not be able to impact data flows associated with other ("premium target") regions of the network.

- by Jie Gao
- •
- Sensor Network Security, Sensor Network

According to popular perception, public-key cryptography is beyond the capabilities of highly constrained, "mote"-like, embedded devices. We show that elliptic curve cryptography not only makes public-key cryptography feasible on these devices, it allows one to create a complete secure web server stack that runs efficiently within very tight resource constraints. Our smallfootprint HTTPS stack, nicknamed Sizzle, has been implemented on multiple generations of the Berkeley/Crossbow motes where it runs in less than 4 KB of RAM, completes a full SSL handshake in 1 s (session reuse takes 0.5 s) and transfers 1 KB of application data over SSL in 0.4 s. Sizzle is the world's smallest secure web server and can be embedded inside home appliances, personal medical devices, etc., allowing them to be monitored and controlled remotely via a web browser without sacrificing end-to-end security.

We consider routing security in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in sensor networks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensor networks, introduce two classes of novel attacks against sensor networks-sinkholes and HELLO floods, and analyze the security of all the major sensor network routing protocols. We describe crippling attacks against all of them and suggest countermeasures and design considerations. This is the first such analysis of secure routing in sensor networks.

- by Mohammad ILYAS
- •
- Distributed Computing, Sensor Network Security, Ad Hoc Networks, Sensor Network

A Mobile Ad hoc Network (MANET) is a collection of mobile stations with wireless interfaces which form a temporary network without using any central administration. MANETs are more vulnerable to attacks because they have some specific characteristics as complexity of wireless communication and lack of infrastructure. Hence security is an important requirement in mobile ad hoc networks. One of the attacks against network integrity in MANETs is the Black Hole Attack. In this type of attack all data packets are absorbed by malicious node, hence data loss occurs. In this paper we investigated the impacts of Black Hole attacks on the network performance. We have simulated black hole attacks using Network Simulator 2 (NS-2) and have measured the packet loss in the network without and with a black hole attacks. Also, we measured the packet loss when the number of black hole attacks increases.

We provide in this paper three algorithms that enable the sensor nodes of a Wireless Sensor Network (WSN) to determine their location in presence of neighbor sensors that may lie about their position. Our algorithms minimize the number of trusted nodes required by regular nodes to complete their process of localization. The algorithms always work for a given number of neighbors provided that the number of liars is below a certain threshold value, which is also determined.

- by IDRIS ABDULKARIM
- •
- Energy Conservation, Sensor Network Security, Sensor Network, Routing Protocol

presented. Finally, a framework of cluster based layered countermeasure for Insomnia Detection has been proposed for heterogeneous wireless sensor network (HWSNET) to efficiently detect sleep deprivation attack. Simulation results on... more

Today's Internet and enterprise networks are so popular as they can easily provide multimedia and e-commerce services to millions of users over the Internet in our daily lives. Since then, security has been a challenging problem in the Internet's world. That issue is called Cyberwar, in which attackers can aim or raise Distributed Denial of Service (DDoS) to others to take down the operation of enterprises Intranet. Therefore, the need of applying an Intrusion Detection System (IDS) is very important to enterprise networks. In this paper, we propose a smarter solution to detect network anomalies in Cyberwar using Stacking techniques in which we apply three popular machine learning models: k-nearest neighbor algorithm (KNN), Adaptive Boosting (AdaBoost), and Random Decision Forests (RandomForest). Our proposed scheme uses the Logistic Regression method to automatically search for better parameters to the Stacking model. We do the performance evaluation of our proposed scheme on the latest data set NSL-KDD 2019 dataset. We also compare the achieved results with individual machine learning models to show that our proposed model achieves much higher accuracy than previous works.

Wireless Sensor Networks (WSNs) have proven to be useful in many applications, such as military surveillance and environment monitoring. To meet the severe energy constraints in WSNs, some researchers have proposed to use the in-network data aggregation technique (i.e., combining partial results at intermediate nodes during message routing), which significantly reduces the communication overhead. Given the lack of hardware support for tamper resistance and the unattended nature of sensor nodes, sensor network protocols need to be designed with security in mind. Recently, researchers proposed algorithms for securely computing a few aggregates, such as Sum (the sum of the sensed values), Count (number of nodes) and Average. However, to the best of our knowledge, there is no prior work which securely computes the Median, although the Median is considered to be an important aggregate. The contribution of this paper is twofold. We first propose a protocol to compute an approximate Median and verify if it has been falsified by an adversary. Then, we design an attack-resilient algorithm to compute the Median even in the presence of a few compromised nodes. We evaluate the performance and cost of our approach via both analysis and simulation. Our results show that our approach is scalable and efficient.

- by Mauro Conti
- •
- Sensor Network Security, Sensor Network, Wireless Sensor, Data Aggregation

Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a sensor network. However, because individual sensor readings are lost in the perhop aggregation process, compromised nodes in the network may forge false values as the aggregation results of other nodes, tricking the base station into accepting spurious aggregation results. Here a fundamental challenge is: how can the base station obtain a good approximation of the fusion result when a fraction of sensor nodes are compromised?

- by hop hop
- •
- Information Systems, Evolutionary Biology, Sensor Network Security, Computer Software

With a widespread growth in the potential applications of Wireless Sensor Networks (WSN), the need for reliable security mechanisms for them has increased manifold. Security protocols in WSNs, unlike the traditional mechanisms, need special efforts and issues to be addressed. This is attributed to the inherent computational and communicational constraints in these tiny embedded system devices. Another reason which distinguishes them from traditional network security mechanisms, is their usage in extremely hostile and unattended environments. The sensitivity of the data sensed by these devices also pose everincreasing challenges. We present a layer based classification of WSN security threats and defenses proposed in the literature, with special focus on physical, link and network layer issues.

- by Mohammed Obaidat
- •
- Sensor Network Security, Security and Privacy, Partial Information, Real Time

A recent research thread focused on Unattended Wireless Sensor Networks (UWSNs), that are characterized by the intermittent presence of the sink. An adversary can take advantage of this behavior trying to erase a piece of information sensed by the network before the sink collects it. Therefore, without a mechanism in place to assure data availability, the sink will not ever know that a datum has been compromised. In this paper, we adopt data replication to assure data survivability in UWSNs. In particular, we revisit an epidemic model and show that, even if the data replication process can be modelled as the spreading of a disease in a finite population, new problems that have not been discovered before arise: optimal parameters choice for the model do not assure the intended data survivability. The problem is complicated by the fact that it is driven by two conflicting parameters: On the one hand the flooding of the datum has to be avoided-due to the sensor resource constraints-, while on the other hand data survivability depends on the data replication rate. Using advanced probabilistic tools we achieve a theoretically sound result that assures at the same time: Data survivability, an optimal usage of sensors resources, and a fast and predictable collecting time. These results have been achieved in both the full visibility and the geometrical model. Finally, extensive simulation results support our findings.

- by Michel Barbeau
- •
- Computer Science, Network Security, Wireless Sensor Networks, Wireless security

Abstract:-Wireless Sensor Network (WSN) is an emerging technology that shows great assure for various futuristic applications both for public and military. Many researchers tried to develop further cost and energy efficient computing devices and algorithms for WSN but the most challenging is to fit the security of WSN into that strained environment. However, security is crucial to the success of applying WSN. So it becomes essential to be familiar with the security aspects of WSN before designing WSN system. When sensor networks are deployed in an aggressive terrain, security becomes extremely important, as they are prone to different types of despite attacks. The intent of this paper is to investigate security problems and various security requirements. We identify the attacks at all the layers of WSN network architecture and also tried to find their possible solution. Keywords:-Sensor, security, attack. makeup, vehicular movement, noise levels, lighting conditions, the presence or...

Security and efficiency are the two conflicting requirements for all key management schemes operating in the sensor environment. Symmetric key cryptography based schemes adequately use available resources but secure key distribution is a major problem. Public key cryptography based schemes require enormous resource consumption for making the system effectively secure. This work focuses on presenting public key cryptography based key management scheme as an efficient as well as a secure solution for sensors. A cluster based architecture is used where the base station serves as the key distribution center maintaining public keys for all the nodes in the network. The private keys are to be pre-deployed in all nodes whereas the remaining public key exchanges are achieved via minimal broadcasts. Elliptic curve cryptography is the algorithm used which is light on node resources. Each node stores a minimal number of keys while encryption/decryption operations are also ensured to be cost effective. The approach shows that public key cryptography can match up to the efficiency of symmetric key schemes while providing betterment in security at the same time.

Sometimes the information, which is transferred during the communication in between sensor node, is very much confidential which is needed to be secure. Since sensor nodes are resource constrained and run on battery, energy consumption should be low to make it operate for many days. For securing the information various symmetric key encryption algorithms like DES, BLOWFISH, RC4 etc., are used. Our aim in this paper is to apply security in sensor network in such a way that it provide confidentiality with authentication using Stream cipher modes of operation, so that the energy consumption will minimizes at the sensor node and the life time of sensor node will increase.

- by Shish Ahmad
- •
- Wireless Sensor Networks, Energy Consumption, Sensor Network Security, Cryptography

A technique to transmit bulk amount of data in the form of QR code (Quick Response Code) and to make secure transmission of QRC containing the information is proposed. Since last few years, two-dimensional (2D) codes have gained the attention of the people from the industrial backgrounds and gradually replaced one-dimensional bar codes in many applications due to their higher information storage capacity. Quick response (QR) codes, defined by the ISO/IEC18004 standard, are one of the most popular types of 2D codes. So,initially, the bulk information to be transmitted is put into a QR container. Considering the very dark side of the unsecure QR codes, we enhance security by chunking the actual QR to be transmitted and then encrypt individual chunk using the CHAOS BASED FEEDBACK STREAM CIPHER (CBFSC) mechanism. Using this technique, the chunked QR code is encrypted pixel by pixel considering the values of previously encrypted pixels, in each iteration. After this, each encrypted chunk is transmitted over the network as packets At the receiving end, the chunks are decrypted individually. Finally, they are clustered to get the original QR code that can be read using secure QR reader, thus fighting against cryptanalytic attacks. Thus a QR code containing the information to be transmitted is encrypted using the above said The advantage is that any changes in the plain image are cascaded forward throughout the cipher image, which means that two almost identical plain images will encrypt to completely different cipher images. Notably, all the QR images are almost identical and so is the reason we use the said technique. As the QR codes stand as data containers that provide more security when encrypted, from the viewpoint of data hiding researches, they shall then be regarded as the visible watermarks helping us to transmit bulk data.

- by IAEME Publication
- •
- Phase Transformations, Sensor Network Security, Mobile Applications, Big Data

Wireless sensor networks (WSNs) have proven to be useful in many applications, such as military surveillance and environment monitoring. To meet the severe energy constraints in WSNs, several researchers have proposed to use the in-network data aggregation technique (i.e., combining partial results at intermediate nodes during message routing), which significantly reduces the communication overhead. Given the lack of hardware support for tamper-resistance and the unattended nature of sensor nodes, sensor network protocols need to be designed with security in mind. Recently, researchers proposed algorithms for securely computing a few aggregates, such as Sum (the sum of the sensed values), Count (number of nodes) and Average. However, to the best of our knowledge, there is no prior work which securely computes the Median, although the Median is considered to be an important aggregate. The contribution of this paper is twofold. We first propose a protocol to compute an approximate Median and verify if it has been falsified by an adversary. Then, we design an attack-resilient algorithm to compute the Median even in the presence of a few compromised nodes. We evaluate the performance and cost of our approach via both analysis and simulation. Our results show that our approach is scalable and efficient. j o u r n a l h o m e p a g e : w w w . e l s e v i e r . c o m / l o c a t e / a d h o c

- by Mauro Conti
- •
- Distributed Computing, Sensor Network Security, Ad Hoc Networks, Sensor Network

In many Wireless Sensor Networks (WSNs), providing end to end secure communications between sensors and the sink is important for secure network management. While there have been many works devoted to hop by hop secure communications, the issue of end to end secure communications is largely ignored. In this paper, we design an end to end secure communication protocol in randomly deployed WSNs. Specifically, our protocol is based on a methodology called differentiated key pre-distribution. The core idea is to distribute different number of keys to different sensors to enhance the resilience of certain links. This feature is leveraged during routing, where nodes route through those links with higher resilience. Using rigorous theoretical analysis, we derive an expression for the quality of end to end secure communications, and use it to determine optimum protocol parameters. Extensive performance evaluation illustrates
that our solutions can provide highly secure communications between sensor nodes and the sink in randomly deployed WSNs. We also provide detailed discussion on a potential attack (i.e. biased node capturing attack) to our solutions, and propose several countermeasures to this attack.

- by Neelanjana Dutta
- •
- Distributed Computing, Resilience, Routing, Wireless Sensor Networks

We consider routing security in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in sensor networks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensor networks, introduce two classes of novel attacks against sensor networks--sinkholes and HELLO floods, and analyze the security of all the major sensor network routing protocols. We describe crippling attacks against all of them and suggest countermeasures and design considerations. This is the first such analysis of secure routing in sensor networks.

We present a novel cross-layer design for improving energy efficiency in a wireless sensor network that utilizes a multi-channel non-persistent CSMA MAC protocol with adaptive MQAM modulation at the physical layer. Cross-layer interactions are achieved through joint, traffic-dependent adaptation of the backoff probability at the MAC layer and the modulation order at the physical layer. The joint optimization of the backoff probability and the modulation order is conducted subject to a constraint on the packet retransmission delay. Such an optimization is shown to produce a significant improvement in the per-bit energy requirement for successful packet delivery. Our analytical findings are verified through numerical results and computer simulations.

- by vipul gupta
- •
- Cognitive Science, Distributed Computing, Embedded Systems, Sensor Network Security

Pairwise key distribution among the sensor nodes is an essential problem for providing security in Wireless Sensor Networks (WSNs). The common approach for this problem is random key predistribution, which suffers from resiliency issues in case of node captures by adversaries. In the literature, the resiliency problem is addressed by zone-based deployment models that use prior deployment knowledge. Another remedy in the literature, which is for multiphase WSNs, aims to provide self-healing property via periodic deployments of sensor nodes with fresh keys over the sensor field. However, to the best of our knowledge, these two approaches have never been combined before in the literature. In this paper, we propose a zone-based key predistribution approach for multiphase WSNs. Our approach combines the best parts of these approaches and provides self-healing property with up to 6-fold more resiliency as compared to an existing scheme. Moreover, our scheme ensures almost 100% secure connectivity, which means a sensor node shares at least one key with almost all of its neighbors.

- by Kubra Kalkan
- •
- Sensor Network Security, Resiliency, Key Predistribution, Sensor Network

We have developed a self-healing key distribution scheme for secure multicast group communications for wireless sensor network environment. We present a strategy for securely distributing rekeying messages and specify techniques for joining and leaving a group. Access control in multicast system is usually achieved by encrypting the content using an encryption key, known as the group key (session key) that is only known by the group controller and all legitimate group members. In our scheme, all rekeying messages, except for unicast of an individual key, are transmitted without any encryption using one-way hash function and XOR operation. In our proposed scheme, nodes are capable of recovering lost session keys on their own, without requesting additional transmission from the group controller. The proposed scheme provides both backward and forward secrecy. We analyze the proposed scheme to verify that it satisfies the security and performance requirements for secure group communication.

- by Ashraf Masood
- •
- Access Control, Sensor Network Security, Group communication, Sensor networks