Defense against node compromise in sensor network security

Recent advances in electronic and computer technologies lead to wide-spread deployment of wireless sensor networks (WSNs). WSNs have wide range applications, including military sensing and tracking, environment monitoring, smart environments, etc. Many WSNs have mission-critical tasks, such as military applications. Thus, the security issues in WSNs are kept in the foreground among research areas. Compared with other wireless networks, such as ad hoc, and cellular networks, security in WSNs is more complicated due to the constrained capabilities of sensor nodes and the properties of the deployment, such as large scale, hostile environment, etc. Security issues mainly come from attacks. In general, the attacks in WSNs can be classified as external attacks and internal attacks. In an external attack, the attacking node is not an authorized participant of the sensor network. Cryptography and other security methods can prevent some of external attacks. However, node compromise, the major and unique problem that leads to internal attacks, will eliminate all the efforts to prevent attacks. Knowing the probability of node compromise will help systems to detect and defend against it. Although there are some approaches that can be used to detect and defend against node compromise, few of them have the ability to estimate the probability of node compromise. Hence, we develop basic uniform, basic gradient, intelligent uniform and intelligent gradient models for node compromise distribution in order to adapt to different application environments by using probability theory. These models allow systems to estimate the probability of node compromise. Applying these models in system security designs can improve system security and decrease the overheads nearly in every security area. Moreover, based on these models, we design a novel secure routing algorithm to defend against the routing security issue that comes from the nodes that have already been compromised but have not been detected by the node compromise detecting mechanism. The routing paths in our algorithm detour those nodes which have already been detected as compromised nodes or have larger probabilities of being compromised. Simulation results show that our algorithm is effective to protect routing paths from node compromise whether detected or not.

Defense Against Node Compromise in Sensor Network Security

Recent advances in electronic and computer technologies lead to wide-spread deployment of wireless sensor networks (WSNs). WSNs have wide range applications, including military sensing and tracking, environment monitoring, smart environments, etc. Many WSNs have mission-critical tasks, such as military applications. Thus, the security issues in WSNs are kept in the foreground among research areas. Compared with other wireless networks, such as ad hoc, and cellular networks, security in WSNs is more complicated due to the constrained capabilities of sensor nodes and the properties of the deployment, such as large scale, hostile environment, etc. Security issues mainly come from attacks. In general, the attacks in WSNs can be classified as external attacks and internal attacks. In an external attack, the attacking node is not an authorized participant of the sensor network. Cryptography and other security methods can prevent some of external attacks. However, node compromise, the major and unique problem that leads to internal attacks, will eliminate all the efforts to prevent attacks. Knowing the probability of node compromise will help systems to detect and defend against it. Although there are some approaches that can be used to detect and defend against node compromise, few of them have the ability to estimate the probability of node compromise. Hence, we develop basic uniform, basic gradient, intelligent uniform and intelligent gradient models for node compromise distribution in order to adapt to different application environments by using probability theory. These models allow systems to estimate the probability of node compromise. Applying these models in system security designs can improve system security and decrease the overheads nearly in every security area. Moreover, based on these models, we design a novel secure routing algorithm to defend against the routing security issue that comes from the nodes that have already been compromised but have not been detected by the node compromise detecting mechanism. The routing paths in our algorithm detour those nodes which have already been detected as compromised nodes or have larger probabilities of being compromised. Simulation results show that our algorithm is effective to protect routing paths from node compromise whether detected or not.

Prognostic value of lymph node ratio and extramural vascular invasion on survival for patients undergoing curative colon cancer resection

Peer reviewed

Cascade failure analysis of power grid using new load distribution law and node removal rule

The work is supported in part by NSFC (Grant no. 61172070), IRT of Shaanxi Province (2013KCT-04), EPSRC (Grant no.Ep/1032606/1).

Cascade failure analysis of power grid using new load distribution law and node removal rule

The work is supported in part by NSFC (Grant no. 61172070), IRT of Shaanxi Province (2013KCT-04), EPSRC (Grant no.Ep/1032606/1).

Bifurcation and dynamic response analysis of a rotating blade excited by upstream vortices

Acknowledgements The authors acknowledge the projects supported by the National Basic Research Program of China (973 Project)(No. 2015CB057405) and the National Natural Science Foundation of China (No. 11372082) and the State Scholarship Fund of CSC. DW thanks for the hospitality of the University of Aberdeen.

Étude du diagramme de bifurcation d'un système prédateur-proie

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Étude du diagramme de bifurcation d'un système prédateur-proie

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

A Survey on Mobile Anchor Node Assisted Localization in Wireless Sensor Networks

Localization is one of the key technologies in Wireless Sensor Networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints on cost and power consumption make it infeasible to equip each sensor node in the network with a Global Position System (GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use mobile anchor nodes (MANs), which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. A considerable body of research has addressed the Mobile Anchor Node Assisted Localization (MANAL) problem. However to the best of our knowledge, no updated surveys on MAAL reflecting recent advances in the field have been presented in the past few years. This survey presents a review of the most successful MANAL algorithms, focusing on the achievements made in the past decade, and aims to become a starting point for researchers who are initiating their endeavors in MANAL research field. In addition, we seek to present a comprehensive review of the recent breakthroughs in the field, providing links to the most interesting and successful advances in this research field.

The Coxian Phase-type distribution with a Hidden Node

Healthcare providers are under increased pressure to ensure that the quality
of care delivered to patients are off the highest standard. Modelling quality of
care is difficult due to the many ways of defining it. This paper introduces a potential
model which could be used to take quality of care into account when modelling
length of stay. The Coxian phase-type distribution is used to model length of stay
and quality of care incorporated into this using a Hidden Markov model. This model
is then applied to

Network Connectivity under Node Failure

We examine a non-cooperative model of network formation where players may stop functioning with a given probability. When this happens all the links associated with this player are no longer available in the network. In the model, players receive benefits from connecting directly and indirectly to other agents in the network through costly links. We identify conditions under which a Nash network will remain connected after the loss of k nodes by introducing the notion of k-Node Super Connectivity network. We identify similar conditions for efficient networks as well.

Puzzle game online running on a bidirectional communication framework based on Node.js and Socket.io

Máster Universitario en Ingeniería Informática (Escuela Universitaria de Informática)

Has the time come for genomic tests to guide the use of adjuvant chemotherapy in node-positive breast cancer?

SCOPUS: ed.j

Identification of 1-methyloctyl butanoate as the major sex pheromone component from females of the saddle gall midge, Haplodiplosis marginata (Diptera: Cecidomyiidae)

The saddle gall midge, Haplodiplosis marginata (von Roser) (Diptera: Cecidomyiidae), has undergone a resurgence recently as a pest of cereals in Belgium and other European countries. An effective monitoring tool of saddle gall midge flights is needed to understand the enigmatic population dynamics of this pest, and to design an integrated management strategy. Therefore, volatile compounds emitted by females (alkan-2-ols and alk-2-yl butanoates) were identified, and the chirality of the emitted esters was determined to be the R absolute configuration. In field-trapping experiments, racemic non-2-yl butanoate attracted substantial numbers of H.marginata males. Thus, this compound will be useful in baited traps for monitoring seasonal flight patterns, and improving integrated management of the saddle gall midge in agricultural systems.