Efficient Path Key Establishment For Wireless Sensor Networks

Key pre-distribution schemes have been proposed as means to overcome Wireless Sensor Networks constraints such as limited communication and processing power. Two sensor nodes can establish a secure link with some probability based on the information stored in their memories though it is not always possible that two sensor nodes may set up a secure link. In this paper, we propose a new approach that elects trusted common nodes called ”Proxies” which reside on an existing secure path linking two sensor nodes. These sensor nodes are used to send the generated key which will be divided into parts (nuggets) according to the number of elected proxies. Our approach has been assessed against previously developed algorithms and the results show that our algorithm discovers proxies more quickly which are closer to both end nodes, thus producing shorter path lengths. We have also assessed the impact of our algorithm on the average time to establish a secure link when the transmitter and receiver of the sensor nodes are ”ON”. The results show the superiority of our algorithm in this regard. Overall, the proposed algorithm is well suited for Wireless Sensor Networks.

Mineralogy of selected geological deposits from the United Kingdom and the Republic of Ireland as possible capping materials for low-level radioactive waste disposal facilities

Solid low-level radioactive waste (LLW) is currently being disposed at a number of facilities in the United Kingdom (UK). The safety of these facilities relies to some extent on the use of engineered barriers, such as a cap, to isolate the waste and protect the environment. Generally, the material used as the barrier layer within such a cap should be of low permeability and it should retain this property over long timescales (beyond a few decades normally required for facilities containing non-radioactive wastes). The objective of this research is to determine the mineralogy of selected geological deposits from the UK and Ireland as part of a larger project to examine their suitability as a capping material, particularly on LLW sites. Mineral transformations, as a result of future climate change, may impact on the long-term performance of the cap and even the disposal facility. X-ray diffraction (XRD) was carried-out on the sand, silt and clay fractions of the London Clay, Belfast Upper Boulder Clay, Irish Glacial Till, Belfast Sleech, and Ampthill Clay geological deposits. Minerals were present that could pose both positive and negative effects on the long-term performance of the cap. Smectite, which has a high shrink swell potential, may produce cracks in London Clay, Belfast Upper Boulder Clay and Ampthill Clay capping material during dry, hotter periods as a possible consequence of future climate change; thus, resulting in higher permeability. Ampthill Clay and Belfast Sleech had elevated amounts of organic matter (OM) at 5.93% and 5.88%, respectively, which may also contribute to cracking. Over time, this OM may decompose and result in increased permeability. Gypsum (CaSO4) in the silt and sand fractions of Ampthill Clay may reduce the impact of erosion during wetter periods if it is incorporated into the upper portion of the cap. There are potential negative effects from the acidity created by the weathering of pyrite (FeS2) present in the silt and sand fractions of Belfast Sleech and Ampthill Clay that could impede the growth of grasses used to stabilize the surface of the capping material if this material is used as part of the vegetative soil layer. Additionally, acidic waters generated from pyrite weathering could negatively impact the lower lying capping layers and the disposal facility in general. However, the calcium carbonate (CaCO3) present in the silt and sand fractions of these deposits, and dolomite (CaMg(CO3)2) in Belfast Sleech, may counter act the acidity.

It's Better to Stick to your own Kind: Teenagers' Views on Cross-community marriages in Northern Ireland

This article presents the attitudes of 80 teenagers-growing up in one of the most contested localities in Northern Ireland-to cross-community marriages, i.e. those between Catholics and Protestants. Research suggests that adults in interface areas continue to exhibit ethno-sectarian prejudices despite wider political developments such as the Good Friday Agreement. The teenagers perceived that their families would be largely unsupportive of cross-community unions but felt that their own views were much less prejudiced than those of their parents. However, while the majority of teenagers had no objections in principle to marrying outside their religious group, they outlined a number of practical difficulties which couples from cross-community unions would face. These included deciding where to live, in which religion, if any, to bring children up and where to send children to school. Most of the teenagers suggested that these potential problems would work against them marrying outside their own religious group. These practical dilemmas provide a more nuanced set of reasons for marrying within one's own community than dilemmas based on traditional prejudices and stereotypes and suggest that teenagers living in sectarian enclaves are more receptive to cross-community marriages than their parents.

Large Scale Verification of MPI Programs Using Lamport Clocks with Lazy Update

We propose a dynamic verification approach for large-scale message passing programs to locate correctness bugs caused by unforeseen nondeterministic interactions. This approach hinges on an efficient protocol to track the causality between nondeterministic message receive operations and potentially matching send operations. We show that causality tracking protocols that rely solely on logical clocks fail to capture all nuances of MPI program behavior, including the variety of ways in which nonblocking calls can complete. Our approach is hinged on formally defining the matches-before relation underlying the MPI standard, and devising lazy update logical clock based algorithms that can correctly discover all potential outcomes of nondeterministic receives in practice. can achieve the same coverage as a vector clock based algorithm while maintaining good scalability. LLCP allows us to analyze realistic MPI programs involving a thousand MPI processes, incurring only modest overheads in terms of communication bandwidth, latency, and memory consumption. © 2011 IEEE.

Responding to crisis: When the telephone fails

The world is changing. Advances in telecommunications have meant that the world is shrinking – data can be moved across continents in the time it takes to send an email or access the cloud. Although developments such as these highlight the extent of scientific and technological evolution, in terms of legal liability, questions must be asked as to the capacity of our legal structures to evolve accordingly.

This article looks at how emergency telephone provision and any shift to VoIP systems might fit with existing tort liability and associated duty implications. It does so by analysing the technology through the principles that signpost UK tort law. This article recognises that as an emerging area, the legal liability implications have not yet been discussed in any great detail. The aim of this article therefore is to introduce the area, encourage debate and consider the issues that may become increasingly relevant as these types of technologies become industrial standards.

Optimizing antibiotics in residents of nursing homes:protocol of a randomized trial.

BACKGROUND: Antibiotics are frequently prescribed for older adults who reside in long-term care facilities. A substantial proportion of antibiotic use in this setting is inappropriate. Antibiotics are often prescribed for asymptomatic bacteriuria, a condition for which randomized trials of antibiotic therapy indicate no benefit and in fact harm. This proposal describes a randomized trial of diagnostic and therapeutic algorithms to reduce the use of antibiotics in residents of long-term care facilities. METHODS: In this on-going study, 22 nursing homes have been randomized to either use of algorithms (11 nursing homes) or to usual practise (11 nursing homes). The algorithms describe signs and symptoms for which it would be appropriate to send urine cultures or to prescribe antibiotics. The algorithms are introduced by inservicing nursing staff and by conducting one-on-one sessions for physicians using case-scenarios. The primary outcome of the study is courses of antibiotics per 1000 resident days. Secondary outcomes include urine cultures sent and antibiotic courses for urinary indications. Focus groups and semi-structured interviews with key informants will be used to assess the process of implementation and to identify key factors for sustainability.

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information

We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the adversary is malicious, controls a constant fraction of processors, and can view all messages in a round before sending out its own messages for that round. Furthermore, each bad processor may send an unlimited number of messages. The only constraint on the adversary is that it must choose its corrupt processors at the start, without knowledge of the processors’ private random bits.

A good quorum is a set of O(logn) processors, which contains a majority of good processors. In this paper, we give a synchronous algorithm which uses polylogarithmic time and Õ(vn) bits of communication per processor to bring all processors to agreement on a collection of n good quorums, solving Byzantine agreement as well. The collection is balanced in that no processor is in more than O(logn) quorums. This yields the first solution to Byzantine agreement which is both scalable and load-balanced in the full information model.

The technique which involves going from situation where slightly more than 1/2 fraction of processors are good and and agree on a short string with a constant fraction of random bits to a situation where all good processors agree on n good quorums can be done in a fully asynchronous model as well, providing an approach for extending the Byzantine agreement result to this model.

The forgiving tree: a self-healing distributed data structure

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up to n rounds where n is the total number of nodes initially in the network: the adversary deletesan arbitrary node from the network, then the network responds by quickly adding a small number of new edges.

We present a distributed data structure that ensures two key properties. First, the diameter of the network is never more than O(log Delta) times its original diameter, where Delta is the maximum degree of the network initially. We note that for many peer-to-peer systems, Delta is polylogarithmic, so the diameter increase would be a O(loglog n) multiplicative factor. Second, the degree of any node never increases by more than 3 over its original degree. Our data structure is fully distributed, has O(1) latency per round and requires each node to send and receive O(1) messages per round. The data structure requires an initial setup phase that has latency equal to the diameter of the original network, and requires, with high probability, each node v to send O(log n) messages along every edge incident to v. Our approach is orthogonal and complementary to traditional topology-based approaches to defending against attack.

Local versus nonlocal cloning in a noisy environment

We address the distribution of quantum information among many parties in the presence of noise. In particular, we consider how to optimally send to m receivers the information encoded into an unknown coherent state. On one hand, a local strategy is considered, consisting in a local cloning process followed by direct transmission. On the other hand, a telecloning protocol based on nonlocal quantum correlations is analysed. Both the strategies are optimized to minimize the detrimental effects due to losses and thermal noise during the propagation. The comparison between the local and the nonlocal protocol shows that telecloning is more effective than local cloning for a wide range of noise parameters. Our results indicate that nonlocal strategies can be more robust against noise than local ones, thus being suitable candidates for playing a major role in quantum information networks.

Plain English: Applying Principles to Home School Written Communication Considering Diverse Families

Schools attempting to engage with the families of all learners, including those with culturally and linguistically diverse backgrounds recognize the importance of effective oral and written communication. The aim of this study is to determine if school generated written communication created by an urban school district serving a culturally and linguistically diverse population in the Northeast of the US adhered to the principles of plain English. This exploratory research examined exemplar pieces of written school generated communication, using different forms of linguistic analysis to determine whether the communication contained elements recognized to facilitate or impede the comprehensibility of each piece of communication. Additionally, a text assessment tool which can help schools to analyze the written text communication they send to families was developed and refined.

Time Efficient Assessment and Feedback Methods for Large Computer-Aided-Design Cohorts

Timely and individualized feedback on coursework is desirable from a student perspective as it facilitates formative development and encourages reflective learning practice. Faculty however are faced with a significant and potentially time consuming challenge when teaching larger cohorts if they are to provide feedback which is timely, individualized and detailed. Additionally, for subjects which assess non-traditional submissions, such as Computer-Aided-Design (CAD), the methods for assessment and feedback tend not to be so well developed or optimized. Issues can also arise over the consistency of the feedback provided. Evaluations of Computer-Assisted feedback in other disciplines (Denton et al, 2008), (Croft et al, 2001) have shown students prefer this method of feedback to traditional “red pen” marking and also that such methods can be more time efficient for faculty.
Herein, approaches are described which make use of technology and additional software tools to speed up, simplify and automate assessment and the provision of feedback for large cohorts of first and second year engineering students studying modules where CAD files are submitted electronically. A range of automated methods are described and compared with more “manual” approaches. Specifically one method uses an application programming interface (API) to interrogate SolidWorks models and extract information into an Excel spreadsheet, which is then used to automatically send feedback emails. Another method describes the use of audio recordings made during model interrogation which reduces the amount of time while increasing the level of detail provided as feedback.
Limitations found with these methods and problems encountered are discussed along with a quantified assessment of time saving efficiencies made.

Reconstructing ethical conduct within financial firms

This chapter explores whether ethical cultures can be created within a financial market context. Ongoing regulatory and legal actions, and press coverage of these, suggest that a definition of ethical problems in terms of ‘rogue traders’ and ‘bad apples’ would be inadequate, since entire business areas have been resorting to collusive illegal behaviour. The concept of ‘bad barrels’ seems to capture the situation rather better: the culture of firms fails to discourage transgression and indeed supports it. Unpacking the links between regulatory objectives and the cultural settings of firms and their employees, this chapter questions the chances of success of measures such as enhanced controls on individuals and restructured reward mechanisms. Financial firms typically have very flat, nodal structures, within which traders conceptualise themselves as an elite, in contrast to back office staff and also in contrast to managers. Traders’ functions and their occupational mobility mean that their linkages and attachments may be much stronger with others outside ‘their’ firm than their firm and those within it. Performance, camaraderie and their linkages are important in all work situations, yet all the more so for traders in financial markets. Thus, whether regulators and senior management combine to send a clear and consistent message to traders – or whether the logic of the financial marketplace leads some firms to continue send conflicting or ambivalent messages to them – misconduct is likely to continue to be a tough nut to crack.

Fast Byzantine Leader Election in Dynamic Networks

We study the fundamental Byzantine leader election problem in dynamic networks where the topology can change from round to round and nodes can also experience heavy {\em churn} (i.e., nodes can join and leave the network continuously over time). We assume the full information model where the Byzantine nodes have complete knowledge about the entire state of the network at every round (including random choices made by all the nodes), have unbounded computational power and can deviate arbitrarily from the protocol. The churn is controlled by an adversary that has complete knowledge and control over which nodes join and leave and at what times and also may rewire the topology in every round and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is an $O(\log^3 n)$ round algorithm that achieves Byzantine leader election under the presence of up to $O({n}^{1/2 - \epsilon})$ Byzantine nodes (for a small constant $\epsilon > 0$) and a churn of up to \\$O(\sqrt{n}/\poly\log(n))$ nodes per round (where $n$ is the stable network size).The algorithm elects a leader with probability at least $1-n^{-\Omega(1)}$ and guarantees that it is an honest node with probability at least $1-n^{-\Omega(1)}$; assuming the algorithm succeeds, the leader's identity will be known to a $1-o(1)$ fraction of the honest nodes. Our algorithm is fully-distributed, lightweight, and is simple to implement. It is also scalable, as it runs in polylogarithmic (in $n$) time and requires nodes to send and receive messages of only polylogarithmic size per round.To the best of our knowledge, our algorithm is the first scalable solution for Byzantine leader election in a dynamic network with a high rate of churn; our protocol can also be used to solve Byzantine agreement in a straightforward way.We also show how to implement an (almost-everywhere) public coin with constant bias in a dynamic network with Byzantine nodes and provide a mechanism for enabling honest nodes to store information reliably in the network, which might be of independent interest.