Clustering-based Query Routing in Cooperative Semi-structured Peer to Peer Networks

We consider the problem of resource selection in clustered Peer-to-Peer Information Retrieval (P2P IR) networks with cooperative peers. The clustered P2P IR framework presents a significant departure from general P2P IR architectures by employing clustering to ensure content coherence between resources at the resource selection layer, without disturbing document allocation. We propose that such a property could be leveraged in resource selection by adapting well-studied and popular inverted lists for centralized document retrieval. Accordingly, we propose the Inverted PeerCluster Index (IPI), an approach that adapts the inverted lists, in a straightforward manner, for resource selection in clustered P2P IR. IPI also encompasses a strikingly simple peer-specific scoring mechanism that exploits the said index for resource selection. Through an extensive empirical analysis on P2P IR testbeds, we establish that IPI competes well with the sophisticated state-of-the-art methods in virtually every parameter of interest for the resource selection task, in the context of clustered P2P IR.

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy {\em churn} (i.e., nodes joining and leaving the network continuously over time). We assume that the churn is controlled by an adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a {\em constant} degree graph with {\em high expansion} even under {\em continuous high adversarial} churn. Our protocol can tolerate a churn rate of up to $O(n/\poly\log(n))$ per round (where $n$ is the stable network size). Our protocol is efficient, lightweight, and scalable, and it incurs only $O(\poly\log(n))$ overhead for topology maintenance: only polylogarithmic (in $n$) bits needs to be processed and sent by each node per round and any node's computation cost per round is also polylogarithmic. The given protocol is a fundamental ingredient that is needed for the design of efficient fully-distributed algorithms for solving fundamental distributed computing problems such as agreement, leader election, search, and storage in highly dynamic P2P networks and enables fast and scalable algorithms for these problems that can tolerate a large amount of churn.

Young People, Peer-to-Peer Grooming and Sexual Offending: Understanding and Responding to Harmful Sexual Behaviour within a Social Media Society

There is ample evidence that young people engage in grooming and harmful sexual behaviour (HSB) using social media with enough frequency to make those behaviours important con-cerns for both society and care providers. This article provides a critical overview of the con-ceptual and empirical foundations of peer-to-peer grooming and the use of social media with-in the context of HSB. Based on this learning, it ultimately introduces a new model of inter-vention and of professional practice, which provides the standards for micro-level decision-making about goals, methods and assessment tailored to this specific offending context.

Signal Reception Characteristics in the Proximity of Alice and Bob for Secure Indoor Peer-to-Peer Communications At 2.45 GHz

Mutual variation of the received signal which occurs as a consequence of the channel reciprocity property has recently been proposed as a viable method for secret key generation. However, this cannot be strictly maintained in practice as the property is applicable only in the absence of interference. To ensure the propagation defined key remains secret, one requirement is that there remain high degrees of uncertainty between the legitimate users channel response and that of any eavesdropper's. In this paper, we investigate whether such de-correlation occurs for an indoor point-to-point link at 2.45 GHz. This is achieved by computing the localized correlation coefficient between the simultaneous channel response measured by the legitimate users and that of multiple distributed eavesdroppers for static and dynamic scenarios.

Algorithms for Self-Healing Networks

Many modern networks are \emph{reconfigurable}, in the sense that the topology of the network can be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc networks are reconfigurable. More generally, many social networks, such as a company's organizational chart; infrastructure networks, such as an airline's transportation network; and biological networks, such as the human brain, are also reconfigurable. Modern reconfigurable networks have a complexity unprecedented in the history of engineering, resembling more a dynamic and evolving living animal rather than a structure of steel designed from a blueprint. Unfortunately, our mathematical and algorithmic tools have not yet developed enough to handle this complexity and fully exploit the flexibility of these networks. We believe that it is no longer possible to build networks that are scalable and never have node failures. Instead, these networks should be able to admit small, and maybe, periodic failures and still recover like skin heals from a cut. This process, where the network can recover itself by maintaining key invariants in response to attack by a powerful adversary is what we call \emph{self-healing}. Here, we present several fast and provably good distributed algorithms for self-healing in reconfigurable dynamic networks. Each of these algorithms have different properties, a different set of gaurantees and limitations. We also discuss future directions and theoretical questions we would like to answer. %in the final dissertation that this document is proposed to lead to.

Green Media: The Future of Wireless Multimedia Networks:Guest Editorial

By 2015, with the proliferation of wireless multimedia applications and services (e.g., mobile TV, video on demand, online video repositories, immersive video interaction, peer to peer video streaming, and interactive video gaming), and any-time anywhere communication, the number of smartphones and tablets will exceed 6.5 billion as the most common web access devices. Data volumes in wireless multimedia data-intensive applications and mobile web services are projected to increase by a factor of 10 every five years, associated with a 20 percent increase in energy consumption, 80 percent of which is multimedia traffic related. In turn, multimedia energy consumption is rising at 16 percent per year, doubling every six years. It is estimated that energy costs alone account for as much as half of the annual operating expenditure. This has prompted concerted efforts by major operators to drastically reduce carbon emissions by up to 50 percent over the next 10 years. Clearly, there is an urgent need for new disruptive paradigms of green media to bridge the gap between wireless technologies and multimedia applications.

Evaluating the effectiveness of community-based dementia care networks:The Dementia Care Networks' Study

Purpose: The Dementia Care Networks' Study examined the effectiveness of four community-based, not-for-profit dementia networks. The study involved assessing the relationship between the types of administrative and service-delivery exchanges that occurred among the networked agencies and the network members' perception of the effectiveness of these exchanges. Design and Methods: With the use of a case-study method, the evolution, structure, and processes of each network were documented. Social network analysis using a standardized questionnaire completed by member agencies identified patterns of administrative and clinical exchanges among networked agencies. Results: Differences were found between the four networks in terms of their perceptions of service-delivery effectiveness; perceptions of administrative effectiveness did not factor significantly. Exchanges between groups of agencies (cliques) within each of the four networks were found to be more critical than those between individual agencies within each network. Implications: Integration-measured by the types of exchanges within as opposed to across networks-differentiated the four networks studied. This research contributes to our understanding of the use of multiple measures to evaluate the inner workings of service delivery and their impact on elder health and elder health care. Copyright 2005 by The Gerontological Society of America.