Protecting agents against malicious host attacks

The introduction of agent technology raises several security issues that are beyond conventional security mechanisms capability and considerations, but research in protecting the agent from malicious host attack is evolving. This research proposes two approaches to protecting an agent from being attacked by a malicious host. The first approach consists of an obfuscation algorithm that is able to protect the confidentiality of an agent and make it more difficult for a malicious host to spy on the agent. The algorithm uses multiple polynomial functions with multiple random inputs to convert an agent's critical data to a value that is meaningless to the malicious host. The effectiveness of the obfuscation algorithm is enhanced by addition of noise code. The second approach consists of a mechanism that is able to protect the integrity of the agent using state information, recorded during the agent execution process in a remote host environment, to detect a manipulation attack by a malicious host. Both approaches are implemented using a master-slave agent architecture that operates on a distributed migration pattern. Two sets of experimental test were conducted. The first set of experiments measures the migration and migration+computation overheads of the itinerary and distributed migration patterns. The second set of experiments is used to measure the security overhead of the proposed approaches. The protection of the agent is assessed by analysis of its effectiveness under known attacks. Finally, an agent-based application, known as Secure Flight Finder Agent-based System (SecureFAS) is developed, in order to prove the function of the proposed approaches.

Molecular and genetic evidence for abnormalities in the nodes of Ranvier in schizophrenia

Context: Genetic, neuroimaging, and molecular neurobiological evidence support the hypothesis that the disconnectivity syndrome in schizophrenia (SZ) could arise from failures of saltatory conduction and abnormalities at the nodes of Ranvier (NOR) interface where myelin and axons interact. Objective: To identify abnormalities in the expression of oligodendroglial genes and proteins that participate in the formation, maintenance, and integrity of the NOR in SZ. Design: The messenger RNA (mRNA) expression levels of multiple NOR genes were quantified in 2 independent postmortem brain cohorts of individuals with SZ, and generalizability to protein expression was confirmed. The effect of the ANK3 genotype on the mRNA expression level was tested in postmortem human brain. Case-control analysis tested the association of the ANK3 genotype with SZ. The ANK3 genotype's influence on cognitive task performance and functional magnetic resonance imaging activation was tested in 2 independent cohorts of healthy individuals. Setting: Research hospital. Patients: Postmortem samples from patients with SZ and healthy controls were used for the brain expression study (n=46) and the case-control analysis (n=272). Healthy white men and women participated in the cognitive (n=513) and neuroimaging (n=52) studies. Main Outcome Measures: The mRNA and protein levels in postmortem brain samples, genetic association with schizophrenia, cognitive performance, and blood oxygenation level-dependent functional magnetic resonance imaging. Results: The mRNA expression of multiple NOR genes was decreased in schizophrenia. The ANK3 rs9804190 C allele was associated with lower ANK3 mRNA expression levels, higher risk for SZ in the case-control cohort, and poorer working memory and executive function performance and increased prefrontal activation during a working memory task in healthy individuals. Conclusions: These results point to abnormalities in the expression of genes and protein associated with the integrity of the NOR and suggest them as substrates for the disconnectivity syndrome in SZ. The association of ANK3 with lower brain mRNA expression levels implicates a molecular mechanism for its genetic, clinical, and cognitive associations with SZ. ©2012 American Medical Association. All rights reserved.

Ensuring efficiency and robustness in MANET

This paper introduces a joint load balancing and hotspot mitigation protocol for mobile ad-hoc network (MANET) termed by us as 'load_energy balance + hotspot mitigation protocol (LEB+HM)'. We argue that although ad-hoc wireless networks have limited network resources - bandwidth and power, prone to frequent link/node failures and have high security risk; existing ad hoc routing protocols do not put emphasis on maintaining robust link/node, efficient use of network resources and on maintaining the security of the network. Typical route selection metrics used by existing ad hoc routing protocols are shortest hop, shortest delay, and loop avoidance. These routing philosophy have the tendency to cause traffic concentration on certain regions or nodes, leading to heavy contention, congestion and resource exhaustion which in turn may result in increased end-to-end delay, packet loss and faster battery power depletion, degrading the overall performance of the network. Also in most existing on-demand ad hoc routing protocols intermediate nodes are allowed to send route reply RREP to source in response to a route request RREQ. In such situation a malicious node can send a false optimal route to the source so that data packets sent will be directed to or through it, and tamper with them as wish. It is therefore desirable to adopt routing schemes which can dynamically disperse traffic load, able to detect and remove any possible bottlenecks and provide some form of security to the network. In this paper we propose a combine adaptive load_energy balancing and hotspot mitigation scheme that aims at evenly distributing network traffic load and energy, mitigate against any possible occurrence of hotspot and provide some form of security to the network. This combine approach is expected to yield high reliability, availability and robustness, that best suits any dynamic and scalable ad hoc network environment. Dynamic source routing (DSR) was use as our underlying protocol for the implementation of our algorithm. Simulation comparison of our protocol to that of original DSR shows that our protocol has reduced node/link failure, even distribution of battery energy, and better network service efficiency.

Determining the number of nodes for wireless sensor networks

The number of nodes has large impact on the performance, lifetime and cost of wireless sensor network (WSN). It is difficult to determine, because it depends on many factors, such as the network protocols, the collaborative signal processing (CSP) algorithms, etc. A mathematical model is proposed in this paper to calculate the number based on the required working time. It can be used in the general situation by treating these factors as the parameters of energy consumption. © 2004 IEEE.

On the k-anonymization of time-varying and multi-layer social graphs

The popularity of online social media platforms provides an unprecedented opportunity to study real-world complex networks of interactions. However, releasing this data to researchers and the public comes at the cost of potentially exposing private and sensitive user information. It has been shown that a naive anonymization of a network by removing the identity of the nodes is not sufficient to preserve users’ privacy. In order to deal with malicious attacks, k -anonymity solutions have been proposed to partially obfuscate topological information that can be used to infer nodes’ identity. In this paper, we study the problem of ensuring k anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and multi-layer graphs, i.e., graphs with multiple types of links. More specifically, we examine the case in which the attacker has access to the degree of the nodes. The goal is to generate a new graph where, given the degree of a node in each (temporal) layer of the graph, such a node remains indistinguishable from other k-1 nodes in the graph. In order to achieve this, we find the optimal partitioning of the graph nodes such that the cost of anonymizing the degree information within each group is minimum. We show that this reduces to a special case of a Generalized Assignment Problem, and we propose a simple yet effective algorithm to solve it. Finally, we introduce an iterated linear programming approach to enforce the realizability of the anonymized degree sequences. The efficacy of the method is assessed through an extensive set of experiments on synthetic and real-world graphs.