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.

Four-gene expression model predictive of lymph node metastases in oral squamous cell carcinoma

Background. Previous knowledge of cervical lymph node compromise may be crucial to choose the best treatment strategy in oral squamous cell carcinoma (OSCC). Here we propose a set four genes, whose mRNA expression in the primary tumor predicts nodal status in OSCC, excluding tongue. Material and methods. We identified differentially expressed genes in OSCC with and without compromised lymph nodes using Differential Display RT-PCR. Known genes were chosen to be validated by means of Northern blotting or real time RT-PCR (qRT-PCR). Thereafter we constructed a Nodal Index (NI) using discriminant analysis in a learning set of 35 patients, which was further validated in a second independent group of 20 patients. Results. Of the 63 differentially expressed known genes identified comparing three lymph node positive (pN+) and three negative (pN0) primary tumors, 23 were analyzed by Northern analysis or RT-PCR in 49 primary tumors. Six genes confirmed as differentially expressed were used to construct a NI, as the best set predictive of lymph nodal status, with the final result including four genes. The NI was able to correctly classify 32 of 35 patients comprising the learning group (88.6%; p = 0.009). Casein kinase 1alpha1 and scavenger receptor class B, member 2 were found to be up regulated in pN + group in contrast to small proline-rich protein 2B and Ras-GTPase activating protein SH3 domain-binding protein 2 which were upregulated in the pN0 group. We validated further our NI in an independent set of 20 primary tumors, 11 of them pN0 and nine pN+ with an accuracy of 80.0% (p = 0.012). Conclusions. The NI was an independent predictor of compromised lymph nodes, taking into the consideration tumor size and histological grade. The genes identified here that integrate our "Nodal Index" model are predictive of lymph node metastasis in OSCC.

Oral Mucosal Melanoma of the Mandibular Gingiva: A Case Report

Orla mucosal melanoma is rare and is reported to be more aggressive than cutaneous melanoma. The incidence of oral mucosal melanoma peaks at 41 to 60 years of age and the male to female ratio is 2 to 1. Preferred sites in the oral mucosa include the hard palate and maxillary alveolar crests. Risk factors have not been clearly identified, but melanotic pigmentation is present in one-third of patients prior to the diagnosis of melanoma. We report an unusual case of oral mucosal melanoma of the mandibular gingiva with the main characteristics of an in situ lesion and areas of superficial invasion in a 45-year-old woman. The patient was treated with surgical resection of the lesion and a 54-month follow-up shows no evidence of recurrence. Oral mucosal melanomas are aggressive neoplasms that may arise from prior pigmented lesions in the oral mucosa. Classification of these tumors is not well-established and the main prognostic factor appears to be lymph node compromise. The main treatment modality is surgical resection. Cutis. 2010;86:89-93.

RiSeG: a ring based secure group communication protocol for resource-constrained wireless sensor networks

Securing group communication in wireless sensor networks has recently been extensively investigated. Many works have addressed this issue, and they have considered the grouping concept differently. In this paper, we consider a group as being a set of nodes sensing the same data type, and we alternatively propose an efficient secure group communication scheme guaranteeing secure group management and secure group key distribution. The proposed scheme (RiSeG) is based on a logical ring architecture, which permits to alleviate the group controller’s task in updating the group key. The proposed scheme also provides backward and forward secrecy, addresses the node compromise attack, and gives a solution to detect and eliminate the compromised nodes. The security analysis and performance evaluation show that the proposed scheme is secure, highly efficient, and lightweight. A comparison with the logical key hierarchy is preformed to prove the rekeying process efficiency of RiSeG. Finally, we present the implementation details of RiSeG on top of TelosB sensor nodes to demonstrate its feasibility.

Estudo da expressão da proteína BCL-2 em mulheres com carcinoma ductal invasivo de mama. Correlação anatomopatólogica e da sobrevida

Pós-graduação em Ginecologia, Obstetrícia e Mastologia - FMB

SCA security verification on wireless sensor network node

Side Channel Attack (SCA) differs from traditional mathematic attacks. It gets around of the exhaustive mathematic calculation and precisely pin to certain points in the cryptographic algorithm to reveal confidential information from the running crypto-devices. Since the introduction of SCA by Paul Kocher et al [1], it has been considered to be one of the most critical threats to the resource restricted but security demanding applications, such as wireless sensor networks. In this paper, we focus our work on the SCA-concerned security verification on WSN (wireless sensor network). A detailed setup of the platform and an analysis of the results of DPA (power attack) and EMA (electromagnetic attack) is presented. The setup follows the way of low-cost setup to make effective SCAs. Meanwhile, surveying the weaknesses of WSNs in resisting SCA attacks, especially for the EM attack. Finally, SCA-Prevention suggestions based on Differential Security Strategy for the FPGA hardware implementation in WSN will be given, helping to get an improved compromise between security and cost.

Value Of Sentinel Lymph Node Biopsy In Papillary Thyroid Cancer: Initial Results Of A Prospective Trial.

The objectives of the study were to evaluate the performance of sentinel lymph node biopsy (SLNB) in detecting occult metastases in papillary thyroid carcinoma (PTC) and to correlate their presence to tumor and patient characteristics. Twenty-three clinically node-negative PTC patients (21 females, mean age 48.4 years) were prospectively enrolled. Patients were submitted to sentinel lymph node (SLN) lymphoscintigraphy prior to total thyroidectomy. Ultrasound-guided peritumoral injections of (99m)Tc-phytate (7.4 MBq) were performed. Cervical single-photon emission computed tomography and computed tomography (SPECT/CT) images were acquired 15 min after radiotracer injection and 2 h prior to surgery. Intra-operatively, SLNs were located with a gamma probe and removed along with non-SLNs located in the same neck compartment. Papillary thyroid carcinoma, SLNs and non-SLNs were submitted to histopathology analysis. Sentinel lymph nodes were located in levels: II in 34.7 % of patients; III in 26 %; IV in 30.4 %; V in 4.3 %; VI in 82.6 % and VII in 4.3 %. Metastases in the SLN were noted in seven patients (30.4 %), in non-SLN in three patients (13.1 %), and in the lateral compartments in 20 % of patients. There were significant associations between lymph node (LN) metastases and the presence of angio-lymphatic invasion (p = 0.04), extra-thyroid extension (p = 0.03) and tumor size (p = 0.003). No correlations were noted among LN metastases and patient age, gender, stimulated thyroglobulin levels, positive surgical margins, aggressive histology and multifocal lesions. Sentinel lymph node biopsy can detect occult metastases in PTC. The risk of a metastatic SLN was associated with extra-thyroid extension, larger tumors and angio-lymphatic invasion. This may help guide future neck dissection, patient surveillance and radioiodine therapy doses.

Correlation Between Vascular Endothelial Growth Factor Expression And Presence Of Lymph Node Metastasis In Advanced Squamous Cell Carcinoma Of The Larynx.

Squamous cell carcinoma is the most common neoplasm of the larynx, and its evolution depends on tumor staging. Vascular endothelial growth factor is a marker of angiogenesis, and its expression may be related to increased tumor aggressiveness, as evidenced by the presence of cervical lymphatic metastases. To evaluate the expression of the vascular endothelial growth factor marker in non-glottic advanced squamous cell carcinoma of the larynx (T3/T4) and correlate it with the presence of cervical lymph node metastases. Retrospective clinical study and immunohistochemical analysis of vascular endothelial growth factor through the German scale of immunoreactivity in products of non-glottic squamous cell carcinomas. This study analyzed 15 cases of advanced non-glottic laryngeal tumors (T3/T4), four of which exhibited cervical lymphatic metastases. There was no correlation between vascular endothelial growth factor expression and the presence of cervical metastases. Although vascular endothelial growth factor was expressed in a few cases, there was no correlation with the spread of cervical lymph metastases.

Menopausal status: a possible predictive factor for recurrence in women with cancer of the uterine cervix without pelvic lymph node metastasis

Abstract Objectives to evaluate risk factors for recurrence of carcinoma of the uterine cervix among women who had undergone radical hysterectomy without pelvic lymph node metastasis, while taking into consideration not only the classical histopathological factors but also sociodemographic, clinical and treatment-related factors. Study desin This was an exploratory analysis on 233 women with carcinoma of the uterine cervix (stages IB and IIA) who were treated by means of radical hysterectomy and pelvic lymphadenectomy, with free surgical margins and without lymph node metastases on conventional histopathological examination. Women with histologically normal lymph nodes but with micrometastases in the immunohistochemical analysis (AE1/AE3) were excluded. Disease-free survival for sociodemographic, clinical and histopathological variables was calculated using the Kaplan-Meier method. The Cox proportional hazards model was used to identify the independent risk factors for recurrence. Twenty-seven recurrences were recorded (11.6%), of which 18 were pelvic, four were distant, four were pelvic + distant and one was of unknown location. The five-year disease-free survival rate among the study population was 88.4%. The independent risk factors for recurrence in the multivariate analysis were: postmenopausal status (HR 14.1; 95% CI: 3.7-53.6; P < 0.001), absence of or slight inflammatory reaction (HR 7.9; 95% CI: 1.7-36.5; P = 0.008) and invasion of the deepest third of the cervix (HR 6.1; 95% CI: 1.3-29.1; P = 0.021). Postoperative radiotherapy was identified as a protective factor against recurrence (HR 0.02; 95% CI: 0.001-0.25; P = 0.003). (To continue) Postmenopausal status is a possible independent risk factor for recurrence even when adjusted for classical prognostic factors (such as tumour size, depth of tumour invasion, capillary embolisation) and treatment-related factors (period of treatment and postoperative radiotherapy status)

Lack of Galectin-3 Disturbs Mesenteric Lymph Node Homeostasis and B Cell Niches in the Course of Schistosoma mansoni Infection

Galectin-3 is a beta-galactoside-binding protein that has been shown to regulate pathophysiological processes, including cellular activation, differentiation and apoptosis. Recently, we showed that galectin-3 acts as a potent inhibitor of B cell differentiation into plasma cells. Here, we have investigated whether galectin-3 interferes with the lymphoid organization of B cell compartments in mesenteric lymph nodes (MLNs) during chronic schistosomiasis, using WT and galectin-3(-/-) mice. Schistosoma mansoni synthesizes GalNAc beta 1-4(Fuc alpha 1-3) GlcNAc(Lac-DiNAc) structures (N-acetylgalactosamine beta 1-4 N-acetylglucosamine), which are known to interact with galectin-3 and elicit an intense humoral response. Antigens derived from the eggs and adult worms are continuously drained to MLNs and induce a polyclonal B cell activation. In the present work, we observed that chronically-infected galectin-3(-/-) mice exhibited a significant reduced amount of macrophages and B lymphocytes followed by drastic histological changes in B lymphocyte and plasma cell niches in the MLNs. The lack of galectin-3 favored an increase in the lymphoid follicle number, but made follicular cells more susceptible to apoptotic stimuli. There were an excessive quantity of apoptotic bodies, higher number of annexin V(+)/PI(-) cells, and reduced clearance of follicular apoptotic cells in the course of schistosomiasis. Here, we observed that galectin-3 was expressed in nonlymphoid follicular cells and its absence was associated with severe damage to tissue architecture. Thus, we convey new information on the role of galectin-3 in regulation of histological events associated with B lymphocyte and plasma cell niches, apoptosis, phagocytosis and cell cycle properties in the MLNs of mice challenged with S. mansoni.

Automatic Network Fingerprinting through Single-Node Motifs

Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs-a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks.

Stability region bifurcations of nonlinear autonomous dynamical systems: Type-zero saddle-node bifurcations

The behavior of stability regions of nonlinear autonomous dynamical systems subjected to parameter variation is studied in this paper. In particular, the behavior of stability regions and stability boundaries when the system undergoes a type-zero sadle-node bifurcation on the stability boundary is investigated in this paper. It is shown that the stability regions suffer drastic changes with parameter variation if type-zero saddle-node bifurcations occur on the stability boundary. A complete characterization of these changes in the neighborhood of a type-zero saddle-node bifurcation value is presented in this paper. Copyright (C) 2010 John Wiley & Sons, Ltd.

Node-Depth Encoding and Multiobjective Evolutionary Algorithm Applied to Large-Scale Distribution System Reconfiguration

The power loss reduction in distribution systems (DSs) is a nonlinear and multiobjective problem. Service restoration in DSs is even computationally hard since it additionally requires a solution in real-time. Both DS problems are computationally complex. For large-scale networks, the usual problem formulation has thousands of constraint equations. The node-depth encoding (NDE) enables a modeling of DSs problems that eliminates several constraint equations from the usual formulation, making the problem solution simpler. On the other hand, a multiobjective evolutionary algorithm (EA) based on subpopulation tables adequately models several objectives and constraints, enabling a better exploration of the search space. The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks. Simulation results have shown the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s. Moreover, the MEAN has shown a sublinear running time in function of the system size. Tests with networks ranging from 632 to 5166 switches indicate that the MEAN can find network configurations corresponding to a power loss reduction of 27.64% for very large networks requiring relatively low running time.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.