Joanna Kulik

Bio: Joanna Kulik is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topic(s): Communications protocol & The Internet. The author has an hindex of 4, co-authored 5 publication(s) receiving 3682 citation(s).

Adaptive protocols for information dissemination in wireless sensor networks

Abstract: In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminates information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them. This allows the sensors to efficiently distribute data given a limited energy supply. We simulate and analyze the performance of two specific SPIN protocols, comparing them to other possible approaches and a theoretically optimal protocol. We find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches. We also find that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.

Negotiation-based protocols for disseminating information in wireless sensor networks

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 using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them. This allows the sensors to efficiently distribute data given a limited energy supply. We simulate and analyze the performance of four specific SPIN protocols: SPIN-PP and SPIN-EC, which are optimized for a point-to-point network, and SPIN-BC and SPIN-RL, which are optimized for a broadcast network. Comparing the SPIN protocols to other possible approaches, we find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches in a point-to-point network and 80% more data for a given amount of energy in a broadcast network. We also find that, in terms of dissemination rate and energy usage, the SPIN protocols perform close to the theoretical optimum in both point-to-point and broadcast networks.

Future Generation Network Architecture (New Arch)

Abstract: : This report describes an effort to understand how the Internet might be designed today if we could make a fresh start. The goal is to understand the current set of requirements that drive the Internet, and to offer long-term directions to help guide the evolution of the Internet in response to these requirements.

High speed subscribe-and-alert service using content graphs

Abstract: Described are techniques used in connection with subscribe and alert services as may be embodied in a subscription system. The subscription system uses a preprocessor for preprocessing subscription and notification messages prior to submission to the subscription/publication server. The preprocessor outputs a preprocessed message including one or more identifiers categorizing an input subscription or notification message. The preprocessor uses a content graph to produce the preprocessed message. The subscription system uses a content based routing system with a tree-like topology to process preprocessed subscriptions and notifications using content graphs maintained at each node in the system. Also described is a loss detection technique using sequence numbers.

The design of a fast and flexible internet subscription system using content graphs

Abstract: This dissertation describes the design and evaluation of the Fast, Flexible Forwarding system (F3), a distributed system for disseminating information to networked subscribers. It examines existing subscription approaches, proposes F3 as an alternative to these approaches, and presents results from comparisons of F3 and other subscription approaches. Four studies compared performance of F3 and competing subscription systems. In the four studies, subscription systems handled such tasks as disseminating baseball scores, distributing traffic alerts, and disseminating generic subscriptions formatted as attribute-value pairs. The four studies examined system performance in both simulated network environments and on a working router. Performance characteristics examined in the studies included size of forwarding tables and processing speeds at routers. Results from these experiments showed that F3 does not overproduce messages, as do unicast systems. F3 also outperformed single-identifier multicast systems in such areas as message production, table size, and subscription overhead. The most significant finding of the studies, however, was that F3 processing speed surpassed the speed of a state-of-the-art content-based system by orders of magnitude in scenarios with large numbers of subscribers. Overall, these results suggest that F3 is a promising development in the area of Internet subscription systems. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.) (Abstract shortened by UMI.)