Learn More
Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the <italic>directed diffusion</italic> paradigm for such coordination. Directed diffusion is(More)
Advances in processor, memory, and radio technology will enable small and cheap nodes capable of sensing, communication, and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the <i>directed-diffusion</i> paradigm for such coordination. Directed diffusion is data-centric(More)
In-network data aggregation is essential for wireless sensor networks where energy resources are limited. In a previously proposed data dissemination scheme (directed diffusion with opportunistic aggregation), data is oppor-tunistically aggregated at intermediate nodes on a low-latency tree. In this paper, we explore and evaluate greedy aggregation, a novel(More)
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 topological location. Rather, low-level communication is based on(More)
Experience with wired networks has provides guidance about what level of detail is appropriate for simulation-based protocol studies. Wireless simulations raise many new questions about approriate levels of detail in simulation models for radio propagation and energy consumption. This paper describes the trade-offs associated with adding detail to(More)
The first anycast routing protocol for ad hoc wireless sensor networks is presented and referred to here as the Sink-based Anycast Routing Protocol (SARP). Instead of sending a packet to a specific destination, the packet is delivered to the nearest sink. In some domains of applications, which sink obtains data is not crucial. Nearest-sink delivery consumes(More)
Spatial programming (SP) is a space-aware programming model for outdoor distributed embedded systems. Central to SP are the concepts of space and spatial reference, which provide applications with a virtual resource naming in networks of embedded systems. A network resource is referenced using its expected physical location and properties. Together with(More)
In recent years, efficient energy utilization becomes an essential requirement for data centers, especially in data centers of world-leading companies, where " Green Data Center " defines a new term for an environment-concerned data center. Solutions to change existing a data center to the green one may vary. In the big company, high-cost approaches(More)
Wireless sensor networks consist of a large number of sensor nodes with limited power and resource. To prolong network lifetime, the energy consumption must be somehow reduced. In this paper, we propose a localized density control algorithm for energy savings. The goals are to maintain a minimal number of active sensor nodes and to reduce radio-traffic(More)
Smart messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive computing environments using SMs is the ability to route SMs to nodes named by content. This paper describes the SM self-routing mechanism, which allows SMs to route themselves at(More)