Enabling Scope-Based Interactions in Sensor Network Macroprogramming

Mottola, Luca; Pathak, Animesh; Bakshi, Amol; Prasanna, Viktor K.; Picco, Gian Pietro

doi:10.1109/mobhoc.2007.4428655

Cited by 22 publications

(26 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This same protocol is used in ATaG when the span of the data pool is defined based on the locations of nodes assigned a given task. Alternatively, the data pool in ATaG can be shaped according to logical attributes of the nodes (e.g., their type) using the routing provided by Logical Neighborhoods [26].…”

Section: Discussionmentioning

confidence: 99%

“…This style of interaction is similar to tuple spaces for mobile networks when using reactive operations, as described in Section 1.2.2, although in ATaG this is limited to triggering notifications when other processes perform a write, and the data of interest is determined solely based on its type, rather than an arbitrary pattern. The ability to isolate different processing steps in different tasks makes ATaG suited to control applications requiring multi-stage processing, e.g., road traffic control [26]. FACTS.…”

Section: Representative Systemsmentioning

confidence: 99%

See 1 more Smart Citation

Tuple Space Middleware for Wireless Networks

Costa

Mottola

Murphy³

et al. 2009

Middleware for Network Eccentric and Mobile Applications

Self Cite

View full text Add to dashboard Cite

Wireless networks define a very challenging scenario for the application programmer. Indeed, the fluidity inherent in the wireless media cannot be entirely masked at the communication layer: issues such as disconnection and a continuously changing execution context most often must be dealt with according to the application logic. Appropriate abstractions, usually provided as part of a middleware, are therefore required to support and simplify the programming task.Coordination [1] is a programming paradigm whose goal is to separate the definition of the individual behavior of application components from the mechanics of their interaction. This goal is usually achieved by using either message passing or data sharing as a model for interaction. Publish-subscribe, described in Chapter ?? is an example of the former, where coordination occurs only through the exchange of messages (events) among publishers and subscribers. While message passing, in its pure form, is inherently stateless, data sharing enables coordination among components by manipulating the (distributed) state of the system. The tuple space abstraction, the subject of this chapter, is a typical example of a data sharing approach. The two models, publish-subscribe and tuple spaces, have sometimes crossed paths in the scientific literature: their expressive power has been compared on formal grounds in [2]; the limits of an implementation of a stateful tuple space on top of a stateless publish-subscribe layer has been investigated in [3]; some extensions of publish-subscribe with stateful features exist (e.g., the ability to query over past events as in [4]). A thorough discussion of the relationship between the two is outside the scope of this chapter, and hereafter we focus solely on tuple spaces.Linda [5] is generally credited with bringing the tuple space abstraction to the attention of the programming community. In Linda, components communicate through a shared tuple space, a globally accessible, persistent, content-addressable data structure containing elementary data structures called tuples. Each tuple is a sequence of typed fields, as in "foo", 9, 27.5 , containing the information being communicated. A tuple t is inserted in a tuple space through an out(t) oper-1

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Representative Systemsmentioning

confidence: 99%

Tuple Space Middleware for Wireless Networks

Costa

Mottola

Murphy³

et al. 2009

Middleware for Network Eccentric and Mobile Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…Another related field is macroprogramming of sensor networks [25][26][27][28]. For example, in [25] the authors provide an SQL-like interface where the entire network is abstracted as a relational database (table).…”

Section: Related Workmentioning

confidence: 99%

SDG-Pro: a programming framework for software-defined IoT cloud gateways

Nastić

Truong

Dustdar

2015

J Internet Serv Appl

View full text Add to dashboard Cite

Recently, emerging IoT cloud systems create numerous opportunities for a variety of stakeholders in terms of optimizing their existing business processes, as well as developing novel cross-organization and cross-domain applications. However, developers of such systems face a plethora of challenges, mainly due to complex dependencies between the application business logic and the underlying IoT cloud infrastructure, as well as difficulties to provision and govern vast, geographically distributed IoT cloud resources. In this paper, we introduce SDG-Pro -a novel programming framework for software-defined IoT cloud systems. The main features of our framework include programming abstractions: Software-Defined Gateways, Intents, Intent Scopes, and Data and Control Points, as well as provisioning and governance APIs that allow for programmatic management of software-defined gateways throughout their entire lifecycle. The SDG-Pro framework enables easier, efficient and more intuitive development of IoT cloud applications. It promotes the everything-as-code paradigm for IoT cloud applications in order to provide a uniform, programmatic view on the entire development process. To illustrate the feasibility of our framework to support development of IoT cloud applications, we evaluate it using a real-world case study on managing fleets of electric vehicles.

show abstract

“…But this method has never extended to entire route. This paper deals with the improvement of greedy forwarding (GF) technology in order, to solve the local minima problem (Mottola, Pathak, Bakshi, Prasanna, & Picco, 2007). The basis of our approach is the concept of a neighborhood (Eschenauer, & Gligor, 2002;Fekete, Kaufmann, Kröller, & Lehmann, 2005;Whitehouse, Sharp, Brewer, & Culler, 2004), which includes all neighboring nodes.…”

Section: Introductionmentioning

confidence: 99%

The Neighborhoods Method and Virtual Polar Coordinates in Wireless Sensor Networks

Sukhov¹,

Chemodanov²

2013

NCT

View full text Add to dashboard Cite

In this paper we propose the development of a neighborhoods method for finding the route with the least number of transitions. A double pass of neighborhoods allows the determination of the shortest routes, and also the solution to the local minima problem. The proposed algorithms are complemented by search algorithms for the central anchor of and rules for angle calculation, which automatically leads to the assignment of a virtual polar coordinate system. The problem of reconstruction maps for the sensors, on the basis of limited data about nodes and their immediate neighbors, is discussed. The possibility of generalizing the neighborhoods method for inter-domain routing is supposed.Keywords: neighborhoods method in sensor networks, double pass of neighborhoods, the local minima problem, virtual polar coordinates, inter-domain routing

show abstract

Enabling Scope-Based Interactions in Sensor Network Macroprogramming

Abstract: Abstract

Cited by 22 publications

References 18 publications

Tuple Space Middleware for Wireless Networks

Tuple Space Middleware for Wireless Networks

SDG-Pro: a programming framework for software-defined IoT cloud gateways

The Neighborhoods Method and Virtual Polar Coordinates in Wireless Sensor Networks

Contact Info

Product

Resources

About