Results 1 - 10 of 686

Tor: The secondgeneration onion router,”

by Roger Dingledine - in 13th USENIX Security Symposium. Usenix, , 2004
"... Abstract We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, an ..."
Abstract - Cited by 1229 (33 self) - Add to MetaCart
Abstract We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies

A Methodology for Implementing Highly Concurrent Data Objects

by Maurice Herlihy , 1993
"... A concurrent object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on critical sections: ensuring that only one process at a time can operate on the object. Nevertheless, critical sections are poorly suited for asynchro ..."
Abstract - Cited by 350 (10 self) - Add to MetaCart
A concurrent object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on critical sections: ensuring that only one process at a time can operate on the object. Nevertheless, critical sections are poorly suited

Cartel: a distributed mobile sensor computing system

by Bret Hull, Vladimir Bychkovsky, Yang Zhang, Kevin Chen, Michel Goraczko, Allen Miu, Eugene Shih, Hari Balakrishnan, Samuel Madden - In 4th ACM SenSys , 2006
"... CarTel is a mobile sensor computing system designed to collect, process, deliver, and visualize data from sensors located on mobile units such as automobiles. A CarTel node is a mobile embedded computer coupled to a set of sensors. Each node gathers and processes sensor readings locally before deliv ..."
Abstract - Cited by 327 (30 self) - Add to MetaCart
of heterogeneous data from sensors, and handles intermittent and variable network connectivity. CarTel nodes rely primarily on opportunistic wireless (e.g., Wi-Fi, Bluetooth) connectivity—to the Internet, or to “data mules ” such as other CarTel nodes, mobile phone flash memories, or USB keys—to communicate

Attribute-Based Routing in Clustered SNETs

by Wang Ke, Thomas D. C. Little , 2005
"... We posit that SNETs are, like early embedded computing systems, hardwired using minimalist techniques to save energy and minimize system cost and thus lack flexibility and reconfigurability more typical of modern computer system design (hardware and software). While the desire to economize energy co ..."
Abstract - Add to MetaCart
SNET communications. Our proposal relies on the use of attributed data sourced from individual sensor nodes and the use of attribute-based routing via a set of elected and rotated clusterheads. By understanding the mission requirements of the SNET application we can configure routing pathways

Building Efficient Wireless Sensor Networks with Low-Level Naming

by John Heidemann, Fabio Silva, Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin, Deepak Ganesan , 2001
"... In most distributed systems, naming of nodes for low-level communication leverages topological location (such as node addresses) and is independent of any application. In this paper, we investigate an emerging class of distributed systems where low-level communication does not rely on network topol ..."
Abstract - Cited by 257 (17 self) - Add to MetaCart
In most distributed systems, naming of nodes for low-level communication leverages topological location (such as node addresses) and is independent of any application. In this paper, we investigate an emerging class of distributed systems where low-level communication does not rely on network

On efficiently transferring the linear secret-sharing scheme matrix in ciphertext-policy attribute-based encryption

by Zhen Liu, Zhenfu Cao - IACR Cryptology ePrint Archive, 374, 2010. 16 + 10
"... Abstract. Ciphertext-Policy Attribute-Based Encryption(CP-ABE) is a system for realizing complex access control on encrypted data, in which attributes are used to describe a user’s credentials and a party encrypting data determines a policy over attributes for who can decrypt. In CP-ABE schemes, acc ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
Abstract. Ciphertext-Policy Attribute-Based Encryption(CP-ABE) is a system for realizing complex access control on encrypted data, in which attributes are used to describe a user’s credentials and a party encrypting data determines a policy over attributes for who can decrypt. In CP-ABE schemes

A Survey of Collective Communication in Wormhole-Routed Massively Parallel Computers

by Philip K. McKinley, Yih-jia Tsai, David F. Robinson - IEEE COMPUTER , 1994
"... Massively parallel computers (MPC) are characterized by the distribution of memory among an ensemble of nodes. Since memory is physically distributed, MPC nodes communicate by sending data through a network. In order to program an MPC, the user may directly invoke low-level message passing primitive ..."
Abstract - Cited by 110 (6 self) - Add to MetaCart
primitives, may use a higher-level communications library, or may write the program in a data parallel language and rely on the compiler to translate language constructs into communication operations. Whichever method is used, the performance of communication operations directly affects the total computation

Energy-latency tradeoffs for data gathering in wireless sensor networks

by Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasanna - In IEEE Infocom , 2004
"... Abstract — We study the problem of scheduling packet transmissions for data gathering in wireless sensor networks. The focus is to explore the energy-latency tradeoffs in wireless communication using techniques such as modulation scaling. The data aggregation tree – a multiple-source single-sink com ..."
Abstract - Cited by 116 (4 self) - Add to MetaCart
to the latency constraint. For the off-line problem, we propose (a) a numerical algorithm for the optimal solution, and (b) a pseudo-polynomial time approximation algorithm based on dynamic programming. We also discuss techniques for handling interference among the sensor nodes. Simulations have been conducted

Materials for an exploratory theory of the network society.

by Manuel Castells , Anthony Giddens , Alain Touraine , Anthony Smith , Benjamin Barber , Peter Hall , Roger-Pol Droit , Sophie Watson , Frank Webster , Krishan Kumar , David Lyon , Craig Calhoun , Jeffrey Henderson , Ramon Ramos , Jose E Rodrigues-Ibanez , Jose F Tezanos , Mary Kaldor , Stephen Jones , Christopher Freeman - The British Journal of Sociology , 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
/consumption, experience, and power, as expressed in meaningful interaction framed by culture. By Information Age I refer to a historical period in which human societies perform their activities in a technological paradigm constituted around microelectronics-based information/communication technologies, and genetic

Indicators for Social and Economic Coping Capacity - Moving Toward a Working Definition of Adaptive Capacity”, Wesleyan-CMU Working Paper.

by Gary Yohe , Richard S J Tol , Gary Yohe , 2001
"... Abstract This paper offers a practically motivated method for evaluating systems' abilities to handle external stress. The method is designed to assess the potential contributions of various adaptation options to improving systems' coping capacities by focusing attention directly on the u ..."
Abstract - Cited by 109 (14 self) - Add to MetaCart
be attributed to global climate change and other sources of external stress. As such, it holds the potential of being a point of departure for the construction of practical indices of vulnerability that could sustain comparable analyses of the relative vulnerabilities of different systems located across
Results 1 - 10 of 686