Results 1 - 10 of 1,813

Adaptive Protocols for Information Dissemination in Wireless Sensor Networks

by Wendi Rabiner Heinzelman, Joanna Kulik, Hari Balakrishnan , 1999
"... In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation) , that eciently disseminates information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-lev ..."
Abstract - Cited by 671 (10 self) - Add to MetaCart
In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation) , that eciently disseminates information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high

Hypertext Transfer Protocol - HTTP/1.1

by R. Fielding, H. Frystyk, Tim Berners-Lee, J. Gettys, J. C. Mogul , 1996
"... The Hypertext Transfer Protocol (HTTP) is an application-level protocol for distributed, collaborative, hypermedia information systems. It is a generic, stateless, object-oriented protocol which can be used for many tasks, such as name servers and distributed object management systems, through exten ..."
Abstract - Cited by 908 (27 self) - Add to MetaCart
extension of its request methods. A feature of HTTP is the typing and negotiation of data representation, allowing systems to be built independently of the data being transferred. HTTP has been in use by the World-Wide Web global information initiative since 1990. This specification defines the protocol

Routing Techniques in Wireless Sensor Networks: A Survey

by Jamal N. Al-karaki, Ahmed E. Kamal - IEEE WIRELESS COMMUNICATIONS , 2004
"... Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, howeve ..."
Abstract - Cited by 741 (2 self) - Add to MetaCart
survey of different routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flat, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, Qo

Consensus Problems in Networks of Agents with Switching Topology and Time-Delays

by Reza Olfati Saber, Richard M. Murray , 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract - Cited by 1112 (21 self) - Add to MetaCart
.e. algebraic connectivity of the network) and the negotiation speed (or performance) of the corresponding agreement protocol. It turns out that balanced digraphs play an important role in addressing average-consensus problems. We introduce disagreement functions that play the role of Lyapunov functions

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
in the circuit and force them to decrypt it. Rather than using a single multiply encrypted data structure (an onion) to lay each circuit, Tor now uses an incremental or telescoping path-building design, where the initiator negotiates session keys with each successive hop in the circuit. Once these keys

Propositionallogic approach to one-shot multi issue bilateral negotiation

by Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciascio, Politecnico Di Bari, Francesco M. Donini, Università Della Tuscia - ACM SIGecom Exchanges
"... Semantic-based e-marketplaces have emerged in recent years, to ease the initial phase of transaction in e-marketplaces, where demand/supply descriptions can be complex and expressive. With the- long term- aim of building an e-marketplace fully exploiting rich semantic descriptions in all stages of a ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
of a transaction, in this paper we propose a semantic-oriented approach to multi issue bilateral negotiation, which exploits a simple propositional logic. We present the theoretical setting, the negotiation protocol, whose outcome is Pareto-efficient, and illustrate the behavior with a simple example.

Extending Propositional Logic with Concrete Domains in Multi-issue Bilateral Negotiation

by Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini
"... Abstract. We present a novel approach to knowledge-based automated one-shot multi-issue bilateral negotiation handling, in a homogeneous setting, both numerical features and non-numerical ones. The framework makes possible to formally represent typical situations in real e-marketplaces such as “if I ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
possible to assign a utility value also to a bundle of issues, which is obviously more realistic than the trivial sum of utilities assigned to single elements in the bundle itself. We illustrate the theoretical framework, the logical language, the one-shot negotiation protocol we adopt, and show we

Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces

by Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciascio, Francesco M. Donini - JOURNAL , 2008
"... We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among agents, and optimization techniques in order to find Pareto-efficient agreements. We introduce P(N), a propositional logic exten ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
the theoretical framework, the logical language, the one-shot negotiation protocol we adopt, and show we are able to compute Pareto-efficient outcomes, using a mediator to solve an optimization problem. We prove the computational adequacy of our method by studying the complexity of the problem of finding Pareto

Negotiation-based Protocols for Disseminating Information in Wireless Sensor Networks

by Joanna Kulik, Wendi Heinzelman - Wireless Networks , 2002
"... Abstract. In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminate information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data usi ..."
Abstract - Cited by 275 (3 self) - Add to MetaCart
Abstract. In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminate information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data

Hypertext Transfer Protocol - HTTP/1.0

by T. Berners-Lee, R. T. Fielding, H. Frystyk Nielsen , 1994
"... The Hypertext Transfer Protocol (HTTP) is an application-level protocol with the lightness and speed necessary for distributed, collaborative, hypermedia information systems. It is a generic, stateless, object-oriented protocol which can be used for many tasks, such as name servers and distributed o ..."
Abstract - Cited by 310 (13 self) - Add to MetaCart
The Hypertext Transfer Protocol (HTTP) is an application-level protocol with the lightness and speed necessary for distributed, collaborative, hypermedia information systems. It is a generic, stateless, object-oriented protocol which can be used for many tasks, such as name servers and distributed
Results 1 - 10 of 1,813