963 resultados para malicious node detection
Resumo:
The current day networks use Proactive networks for adaption to the dynamic scenarios. The use of cognition technique based on the Observe, Orient, Decide and Act loop (OODA) is proposed to construct proactive networks. The network performance degradation in knowledge acquisition and malicious node presence is a problem that exists. The use of continuous time dynamic neural network is considered to achieve cognition. The variance in service rates of user nodes is used to detect malicious activity in heterogeneous networks. The improved malicious node detection rates are proved through the experimental results presented in this paper. (C) 2015 The Authors. Published by Elsevier B.V.
Resumo:
Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.
Resumo:
Objectives. The aim of this study was to investigate the feasibility of sentinel lymph node (SLN) identification using radioisotopic lymphatic mapping with technetium-99 m-labeled phytate in patients undergoing radical hysterectomy with pelvic lymphadenectomy for treatment of early cervical cancer.Methods. Between July 2001 and February 2003, 56 patients with cervical cancer 1160 stage I (it 53) or stage 11 (it 3) underwent sentinel lymph node detection with preoperative lymphoscintigraphy (Te-99m-labeled phytate injected into the uterine cervix, at 3, 6, 9, and 12 o'clock, at a dose of 55-74 MBq in a volume of 0.8 ml) and intratoperative lymphatic mapping with a handheld gamma probe, Radical hysterectomy was aborted in three cases because parametrial invasion was found intraoperatively and we performed only sentinel node resection. The remaining 53 patients underwent radical hysterectomy with complete pelvic lymphadenectomy, Sentinel nodes were detected using a handheld gamma-probe and removed for pathological assessment during the abdominal radical hysterectomy and pelvic lymphadenectomy.Results. One or more sentinel nodes were detected in 52 out of 56 eligible patients (92.8%). A total of 120 SLNs were detected by lymphoscintigraphy (mean 2.27 nodes per patient) and intraoperatively by gamma probe, Forty-four percent of SLNs were found in the external iliac area, 39% in the obturator region, 8.3% in interiliae region, and 6.7),) in the common iliac area. Unilateral sentinel nodes were found in thirty-one patients (59%). The remaining 21 patients (4100 had bilateral sentinel nodes, Microscopic nodal metastases were confirmed in 17 (32%) cases. In 10 of these patients, only SLNs had metastases. The 98 sentinel node.,, that were negative on hematoxylin and eosin were submitted to cytokeratin immunohistochemical analysis. Five (5.1%) micrometastases were identified with this technique. The sensitivity of the sentinel node was 82.3% (CI 95% - 56.6-96.2) and the negative predictive value was 92.1% (CI 95% 78.6 98.3) the accuracy of sentinel node in predicting the lymph node status was 94.2%,Conclusion. Preoperative lymphoscintigraphy and intraoperative lymphatic mapping with Tc-99-labeled phytate are effective in identifying sentinel nodes in patients undergoing radical hysterectomy and to select women in whom lymph node dissection call be avoided. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
Malignant melanoma has become an increasing interdisciplinary public health challenge worldwide. Sentinel lymph node excision (SLNE) is considered the most sensitive and specific staging test for the detection of micrometastatic melanoma in regional lymph nodes.
Resumo:
Sentinel lymph node (SLN) detection techniques have the potential to change the standard of surgical care for patients with prostate cancer. We performed a lymphatic mapping study and determined the value of fluorescence SLN detection with indocyanine green (ICG) for the detection of lymph node metastases in intermediate- and high-risk patients undergoing radical prostatectomy and extended pelvic lymph node dissection. A total of 42 patients received systematic or specific ICG injections into the prostate base, the midportion, the apex, the left lobe, or the right lobe. We found (1) that external and internal iliac regions encompass the majority of SLNs, (2) that common iliac regions contain up to 22% of all SLNs, (3) that a prostatic lobe can drain into the contralateral group of pelvic lymph nodes, and (4) that the fossa of Marcille also receives significant drainage. Among the 12 patients who received systematic ICG injections, 5 (42%) had a total of 29 lymph node metastases. Of these, 16 nodes were ICG positive, yielding 55% sensitivity. The complex drainage pattern of the prostate and the low sensitivity of ICG for the detection of lymph node metastases reported in our study highlight the difficulties related to the implementation of SNL techniques in prostate cancer. PATIENT SUMMARY There is controversy about how extensive lymph node dissection (LND) should be during prostatectomy. We investigated the lymphatic drainage of the prostate and whether sentinel node fluorescence techniques would be useful to detect node metastases. We found that the drainage pattern is complex and that the sentinel node technique is not able to replace extended pelvic LND.
Resumo:
The ad hoc networks are vulnerable to attacks due to distributed nature and lack of infrastructure. Intrusion detection systems (IDS) provide audit and monitoring capabilities that offer the local security to a node and help to perceive the specific trust level of other nodes. The clustering protocols can be taken as an additional advantage in these processing constrained networks to collaboratively detect intrusions with less power usage and minimal overhead. Existing clustering protocols are not suitable for intrusion detection purposes, because they are linked with the routes. The route establishment and route renewal affects the clusters and as a consequence, the processing and traffic overhead increases due to instability of clusters. The ad hoc networks are battery and power constraint, and therefore a trusted monitoring node should be available to detect and respond against intrusions in time. This can be achieved only if the clusters are stable for a long period of time. If the clusters are regularly changed due to routes, the intrusion detection will not prove to be effective. Therefore, a generalized clustering algorithm has been proposed that can run on top of any routing protocol and can monitor the intrusions constantly irrespective of the routes. The proposed simplified clustering scheme has been used to detect intrusions, resulting in high detection rates and low processing and memory overhead irrespective of the routes, connections, traffic types and mobility of nodes in the network. Clustering is also useful to detect intrusions collaboratively since an individual node can neither detect the malicious node alone nor it can take action against that node on its own.
Resumo:
The possibility of reducing morbidity associated with surgical dissection while maintaining accurate tumor staging is one of the greatest advantages of the sentinel node approach in surgical oncology. The sentinel node mapping has already proven to be useful in melanoma, breast cancer, and vulvar cancer. We report the first case of sentinel node detection by technetium-labeled radiocolloid in a pregnant woman with cervical cancer. The histologic analysis of the operative specimen showed a poorly differentiated squamous carcinoma with metastasis in the sentinel node and a neoplasic embolus in a blood vessel of the placental bed. The lymphatic mapping and sentinel lymph node detection are feasible during pregnancy.
Resumo:
Herein is presented a technique for minimally invasive sentinel node mapping. The patient had apparently early stage endometrial cancer. Sentinel node mapping was performed using a hysteroscopic injection of indocyanine green followed by laparoscopic sentinel node detection via near-infrared fluorescence. This technique ensures delineation of lymphatic drainage from the tumor area, thus achieving accurate detection of sentinel nodes.
Resumo:
Wireless sensor networks are emerging as effective tools in the gathering and dissemination of data. They can be applied in many fields including health, environmental monitoring, home automation and the military. Like all other computing systems it is necessary to include security features, so that security sensitive data traversing the network is protected. However, traditional security techniques cannot be applied to wireless sensor networks. This is due to the constraints of battery power, memory, and the computational capacities of the miniature wireless sensor nodes. Therefore, to address this need, it becomes necessary to develop new lightweight security protocols. This dissertation focuses on designing a suite of lightweight trust-based security mechanisms and a cooperation enforcement protocol for wireless sensor networks. This dissertation presents a trust-based cluster head election mechanism used to elect new cluster heads. This solution prevents a major security breach against the routing protocol, namely, the election of malicious or compromised cluster heads. This dissertation also describes a location-aware, trust-based, compromise node detection, and isolation mechanism. Both of these mechanisms rely on the ability of a node to monitor its neighbors. Using neighbor monitoring techniques, the nodes are able to determine their neighbors’ reputation and trust level through probabilistic modeling. The mechanisms were designed to mitigate internal attacks within wireless sensor networks. The feasibility of the approach is demonstrated through extensive simulations. The dissertation also addresses non-cooperation problems in multi-user wireless sensor networks. A scalable lightweight enforcement algorithm using evolutionary game theory is also designed. The effectiveness of this cooperation enforcement algorithm is validated through mathematical analysis and simulation. This research has advanced the knowledge of wireless sensor network security and cooperation by developing new techniques based on mathematical models. By doing this, we have enabled others to build on our work towards the creation of highly trusted wireless sensor networks. This would facilitate its full utilization in many fields ranging from civilian to military applications.
Resumo:
Wireless sensor networks are emerging as effective tools in the gathering and dissemination of data. They can be applied in many fields including health, environmental monitoring, home automation and the military. Like all other computing systems it is necessary to include security features, so that security sensitive data traversing the network is protected. However, traditional security techniques cannot be applied to wireless sensor networks. This is due to the constraints of battery power, memory, and the computational capacities of the miniature wireless sensor nodes. Therefore, to address this need, it becomes necessary to develop new lightweight security protocols. This dissertation focuses on designing a suite of lightweight trust-based security mechanisms and a cooperation enforcement protocol for wireless sensor networks. This dissertation presents a trust-based cluster head election mechanism used to elect new cluster heads. This solution prevents a major security breach against the routing protocol, namely, the election of malicious or compromised cluster heads. This dissertation also describes a location-aware, trust-based, compromise node detection, and isolation mechanism. Both of these mechanisms rely on the ability of a node to monitor its neighbors. Using neighbor monitoring techniques, the nodes are able to determine their neighbors’ reputation and trust level through probabilistic modeling. The mechanisms were designed to mitigate internal attacks within wireless sensor networks. The feasibility of the approach is demonstrated through extensive simulations. The dissertation also addresses non-cooperation problems in multi-user wireless sensor networks. A scalable lightweight enforcement algorithm using evolutionary game theory is also designed. The effectiveness of this cooperation enforcement algorithm is validated through mathematical analysis and simulation. This research has advanced the knowledge of wireless sensor network security and cooperation by developing new techniques based on mathematical models. By doing this, we have enabled others to build on our work towards the creation of highly trusted wireless sensor networks. This would facilitate its full utilization in many fields ranging from civilian to military applications.
Resumo:
A Delay Tolerant Network (DTN) is one where nodes can be highly mobile, with long message delay times forming dynamic and fragmented networks. Traditional centralised network security is difficult to implement in such a network, therefore distributed security solutions are more desirable in DTN implementations. Establishing effective trust in distributed systems with no centralised Public Key Infrastructure (PKI) such as the Pretty Good Privacy (PGP) scheme usually requires human intervention. Our aim is to build and compare different de- centralised trust systems for implementation in autonomous DTN systems. In this paper, we utilise a key distribution model based on the Web of Trust principle, and employ a simple leverage of common friends trust system to establish initial trust in autonomous DTN’s. We compare this system with two other methods of autonomously establishing initial trust by introducing a malicious node and measuring the distribution of malicious and fake keys. Our results show that the new trust system not only mitigates the distribution of fake malicious keys by 40% at the end of the simulation, but it also improved key distribution between nodes. This paper contributes a comparison of three de-centralised trust systems that can be employed in autonomous DTN systems.
Resumo:
Network coding is a method for achieving channel capacity in networks. The key idea is to allow network routers to linearly mix packets as they traverse the network so that recipients receive linear combinations of packets. Network coded systems are vulnerable to pollution attacks where a single malicious node floods the network with bad packets and prevents the receiver from decoding correctly. Cryptographic defenses to these problems are based on homomorphic signatures and MACs. These proposals, however, cannot handle mixing of packets from multiple sources, which is needed to achieve the full benefits of network coding. In this paper we address integrity of multi-source mixing. We propose a security model for this setting and provide a generic construction.
Resumo:
Spurious oscillations are one of the principal issues faced by microwave and RF circuit designers. The rigorous detection of instabilities or the characterization of measured spurious oscillations is still an ongoing challenge. This project aims to create a new stability analysis CAD program that tackles this chal- lenge. Multiple Input Multiple Output (MIMO) pole-zero identification analysis is introduced on the program as a way to create new methods to automate the stability analysis process and to help designers comprehend the obtained results and prevent incorrect interpretations. The MIMO nature of the analysis contributes to eliminate possible controllability and observability losses and helps differentiate mathematical and physical quasi-cancellations, products of overmodeling. The created program reads Single Input Single Output (SISO) or MIMO frequency response data, and determines the corresponding continuous transfer functions with Vector Fitting. Once the transfer function is calculated, the corresponding pole/zero diagram is mapped enabling the designers to analyze the stability of an amplifier. Three data processing methods are introduced, two of which consist of pole/zero elimina- tions and the latter one on determining the critical nodes of an amplifier. The first pole/zero elimination method is based on eliminating non resonant poles, whilst the second method eliminates the poles with small residue by assuming that their effect on the dynamics of a system is small or non-existent. The critical node detection is also based on the residues; the node at which the effect of a pole on the dynamics is highest is defined as the critical node. In order to evaluate and check the efficiency of the created program, it is compared via examples with another existing commercial stability analysis tool (STAN tool). In this report, the newly created tool is proved to be as rigorous as STAN for detecting instabilities. Additionally, it is determined that the MIMO analysis is a very profitable addition to stability analysis, since it helps to eliminate possible problems of loss of controllability, observability and overmodeling.
Resumo:
Cloud computing is a technological advancementthat provide resources through internet on pay-as-you-go basis.Cloud computing uses virtualisation technology to enhance theefficiency and effectiveness of its advantages. Virtualisation isthe key to consolidate the computing resources to run multiple instances on each hardware, increasing the utilization rate of every resource, thus reduces the number of resources needed to buy, rack, power, cool, and manage. Cloud computing has very appealing features, however, lots of enterprises and users are still reluctant to move into cloud due to serious security concerns related to virtualisation layer. Thus, it is foremost important to secure the virtual environment.In this paper, we present an elastic framework to secure virtualised environment for trusted cloud computing called Server Virtualisation Security System (SVSS). SVSS provide security solutions located on hyper visor for Virtual Machines by deploying malicious activity detection techniques, network traffic analysis techniques, and system resource utilization analysis techniques.SVSS consists of four modules: Anti-Virus Control Module,Traffic Behavior Monitoring Module, Malicious Activity Detection Module and Virtualisation Security Management Module.A SVSS prototype has been deployed to validate its feasibility,efficiency and accuracy on Xen virtualised environment.
Resumo:
Objetivo: determinar a viabilidade da identificação do linfonodo-sentinela em pacientes com câncer invasor de colo uterino estádio Ib1. Material e Métodos: 16 pacientes consecutivas com câncer de colo uterino agendadas para histerectomia radical com linfadenectomia pélvica bilateral realizaram estudo para detecção de linfonodo-sentinela. Onze pacientes injetaram 1 mCi de tecnécio 99 (99Tc) em quatro pontos do estroma superficial do colo uterino ao redor do tumor, às 12, 3, 6 e 9 h ( 16 horas antes da cirurgia ). No dia da cirurgia, as pacientes foram submetidas ao mapeamento linfático com gamma-probe e azul patente injetado nos mesmos pontos que o 99Tc.Cinco pacientes realizaram a detecção apenas com azul patente. Resultados: foi detectado pelo menos um (1 a 3 por paciente) linfonodo-sentinela em cada uma das 15 pacientes (93,7 %) que realizaram a técnica combinada.Foi detectado pelo menos 1 linfonodo-sentinela em 4 pacientes ( 80% )com azul patente apenas. A maioria dos linfonodos-sentinela foi localizada nas regiões: obturadora (37 %), ilíaca externa (22,2 %) e inter-ilíacas (18,5 %). Seis pacientes (40 %) tiveram linfonodos-sentinela bilaterais. Dos 27 linfonodos-sentinela detectados, 11 (40,7 %) foram detectados pelo corante, 9 (33,3%) pela radioatividade e 7 (26 %) pela radioatividade e corante. O índice de detecção intra-operatória com o gamma-probe foi de 90,9 % ( 11 pacientes ). Destes, 7 linfonodos foram azul e quente (31,8 %), 6 linfonodos foram apenas azuis (27,2 %) e 9 linfonodos foram apenas quentes (40,9 %). A sensibilidade, especificidade e valor preditivo negativo para a detecção do linfonodo-sentinela foram 100%, 85,7 % e 100 % respectivamente. Conclusão: A combinação do radiofármaco 99Tc e azul patente é efetiva na detecção do linfonodosentinela em câncer de colo uterino inicial.