Middleware for Mobile Sensing Applications in Urban Environments

Sensor networks represent an attractive tool to observe the physical world. Networks of tiny sensors can be used to detect a fire in a forest, to monitor the level of pollution in a river, or to check on the structural integrity of a bridge. Application-specific deployments of static-sensor networks have been widely investigated. Commonly, these networks involve a centralized data-collection point and no sharing of data outside the organization that owns it. Although this approach can accommodate many application scenarios, it significantly deviates from the pervasive computing vision of ubiquitous sensing where user applications seamlessly access anytime, anywhere data produced by sensors embedded in the surroundings. With the ubiquity and ever-increasing capabilities of mobile devices, urban environments can help give substance to the ubiquitous sensing vision through Urbanets, spontaneously created urban networks. Urbanets consist of mobile multi-sensor devices, such as smart phones and vehicular systems, public sensor networks deployed by municipalities, and individual sensors incorporated in buildings, roads, or daily artifacts. My thesis is that "multi-sensor mobile devices can be successfully programmed to become the underpinning elements of an open, infrastructure-less, distributed sensing platform that can bring sensor data out of their traditional close-loop networks into everyday urban applications". Urbanets can support a variety of services ranging from emergency and surveillance to tourist guidance and entertainment. For instance, cars can be used to provide traffic information services to alert drivers to upcoming traffic jams, and phones to provide shopping recommender services to inform users of special offers at the mall. Urbanets cannot be programmed using traditional distributed computing models, which assume underlying networks with functionally homogeneous nodes, stable configurations, and known delays. Conversely, Urbanets have functionally heterogeneous nodes, volatile configurations, and unknown delays. Instead, solutions developed for sensor networks and mobile ad hoc networks can be leveraged to provide novel architectures that address Urbanet-specific requirements, while providing useful abstractions that hide the network complexity from the programmer. This dissertation presents two middleware architectures that can support mobile sensing applications in Urbanets. Contory offers a declarative programming model that views Urbanets as a distributed sensor database and exposes an SQL-like interface to developers. Context-aware Migratory Services provides a client-server paradigm, where services are capable of migrating to different nodes in the network in order to maintain a continuous and semantically correct interaction with clients. Compared to previous approaches to supporting mobile sensing urban applications, our architectures are entirely distributed and do not assume constant availability of Internet connectivity. In addition, they allow on-demand collection of sensor data with the accuracy and at the frequency required by every application. These architectures have been implemented in Java and tested on smart phones. They have proved successful in supporting several prototype applications and experimental results obtained in ad hoc networks of phones have demonstrated their feasibility with reasonable performance in terms of latency, memory, and energy consumption.

Syntheses and Self-Assembling Characteristics of Amphiphilic Star Diblock Copolymers

Uusien polymeeripohjaisten teknologioiden ja materiaalien myötä räätälöityjen polymeerien tarve on kasvanut. Viime vuosituhannen lopussa kehitetyt kontrolloidut polymerointimenetelmät ovat avanneet uusia mahdollisuuksia paitsi monimutkaisten polymeerien synteesiin, myös itsejärjestyvyyteen perustuvien funktionaalisten nanorakenteiden suunnitteluun ja valmistukseen. Nämä voivat jäljitellä luonnossa esiintyviä rakenteita, joita muodostavat esimerkiksi lipidit ja proteiinit. Itsejärjestyvät molekyylit ovat usein amfifiilisiä eli ne koostuvat hydrofiilisistä ja hydrofobisista osista ja polymeereissä nämä osat voivat olla omina lohkoinaan, jolloin puhutaan amfifiilisistä lohko- tai blokkikopolymeereistä. Riippuen järjestyneiden rakenteiden koostumuksesta ja muodosta, amfifiilisiä blokkikopolymeerejä on tutkittu tai jo käytetty nanoteknologiassa, elastomeereissä, voiteluaineissa, pinta-aktiivisina aineina, lääkkeenannostelussa, maaleissa, sekä elektroniikka-, kosmetiikka- ja elintarviketeollisuudessa. Tavallisimmin käytetyt amfifiiliset blokkikopolymeerit ovat olleet lineaarisia, mutta viime aikoina tutkimus on suuntautunut kohti monimutkaisempia rakenteita. Tällaisia ovat esimerkiksi tähtipolymeerit. Tähtimäisissä polymeereissä miselleille tyypillinen ydin-kuori-rakenne säilyy hyvin alhaisissakin polymeerikonsentraatioissa, koska polymeeriketjut ovat kiinni toisissaan yhdessä pisteessä. Siten ne ovat erityisen kiinnostavia tutkimuskohteita erilaisten hydrofobisten orgaanisten yhdisteiden sitomiseksi ja vapauttamiseksi. Tässä työssä on tarkasteltu amfifiilisten tähtipolymeerien itsejärjestymistä vesiliuoksissa sekä kokeellisesti ja tietokonesimulaatioin. Työ koostuu kahdesta osasta: tähtipolymeerien synteesistä makrosyklisillä initiaattoreilla ja amfifiilisten tähtimäisten blokkikopolymeerien ominaisuuksien tutkimisesta.

Organized Nanostructures of Thermoresponsive Poly(N-isopropylacrylamide) Block Copolymers Obtained Through Controlled RAFT Polymerization

Kontrolloidut radikaalipolymerointimenetelmät, kuten RAFT-polymerointi, ovat moderni tapa valmistaa polymeerejä säädellysti. RAFT-polymeroinnilla polymeerien ketjunpituutta, moolimassajakaumaa, mikrorakennetta (taktisuus, järjestys), koostumusta ja funktionaalisuutta kyetään hallitsemaan. Siten menetelmällä voidaan valmistaa uudenlaisia polymeeriarkkitektuureja, kuten blokki- ja tähtipolymeerejä, sekä hybridimateriaaleja ja biokonjugaatteja. Polymeeristen rakennuspalikoiden itsejärjestyminen, missä huolellisesti syntetisoidut polymeerit järjestyvät halutulla tavalla nanoskaalassa, on suosittu tutkimuskohde materiaalitieteessä. On huomattava, että blokkipolymeerien itsejärjestyminen on vielä suhteellisen nuori tutkimusaihe. Tämän hetkiset polymeeriset nanomateriaalit ovat suhteellisen yksinkertaisia luonnon luomuksiin verrattuina, tarjoten jatkuvasti uusia mahdollisuuksia seuraavan sukupolven polymeereille. Tässä työssä RAFT-polymeroinnilla syntetisoitiin amfifiilisiä di- ja triblokkikopolymeerejä sekä tutkittiin niiden järjestymistä nanorakenteiksi. Kaikissa blokkikopolymeereissä käytettiin lämpöherkkää poly(N-isopropyyliakryyliamidia). Siten polymeerit ja tutkitut materiaalit reagoivat lämpötilanmuutokseen ympäristössä eli ovat ns. ympäristöherkkiä. Työssä tutkittiin taktisuuden kontrollointia N-isopropyyliakryyliamidin RAFT-polymeroinnissa. Polymeerin taktisuutta sekä ketjunpituutta ja blokkijärjestystä säätämällä voitiin hallita polymeerin itsejärjestymistä vesiliuoksessa. Amfifiiliset polymeerit järjestyivät laimeissa vesiliuoksissa erilaisiksi misellirakenteiksi, muodostaen ns. mikrosäiliöitä. Tällaisilla polymeereillä odotetaan olevan sovelluksia esim. lääkeainevapautuksessa. Amfifiilejä käytetään myös esimerkiksi apuaineina pinnoitteissa ja kosmetiikassa. Kiinteässä tilassa tutkitut triblokkikopolymeerit muodostivat teoreettisesti ennustettuja morfologioita. Lämpöherkän materiaalin hydrogeelit toimivat suodatinmembraanina nanokokoluokassa. RAFT-polymeroinnilla syntetisoituja polymeereja voidaan sellaisenaan käyttää kultananopartikkeleiden päällystämiseen. Kultananopartikkelit ovat erittäin kiinostavia mm. niiden stabiilisuuden ja ainutlaatuisten pintaominaisuuksien vuoksi. Kun amfifiilisiä polymeerejä kiinnitettiin kultapartikkelin pinnalle, sen liuos- ja optisia ominaisuuksia voitiin säädellä pH:n ja lämpötilan avulla. Tällaisilla kultananopartikkeleilla on sovelluksia mm. diagnostiikassa, sensoreina ja solukuvauksessa.

IP Mobility in Wireless Operator Networks

Wireless network access is gaining increased heterogeneity in terms of the types of IP capable access technologies. The access network heterogeneity is an outcome of incremental and evolutionary approach of building new infrastructure. The recent success of multi-radio terminals drives both building a new infrastructure and implicit deployment of heterogeneous access networks. Typically there is no economical reason to replace the existing infrastructure when building a new one. The gradual migration phase usually takes several years. IP-based mobility across different access networks may involve both horizontal and vertical handovers. Depending on the networking environment, the mobile terminal may be attached to the network through multiple access technologies. Consequently, the terminal may send and receive packets through multiple networks simultaneously. This dissertation addresses the introduction of IP Mobility paradigm into the existing mobile operator network infrastructure that have not originally been designed for multi-access and IP Mobility. We propose a model for the future wireless networking and roaming architecture that does not require revolutionary technology changes and can be deployed without unnecessary complexity. The model proposes a clear separation of operator roles: (i) access operator, (ii) service operator, and (iii) inter-connection and roaming provider. The separation allows each type of an operator to have their own development path and business models without artificial bindings with each other. We also propose minimum requirements for the new model. We present the state of the art of IP Mobility. We also present results of standardization efforts in IP-based wireless architectures. Finally, we present experimentation results of IP-level mobility in various wireless operator deployments.

Offloading content routing cost from routers

The publish/subscribe paradigm has lately received much attention. In publish/subscribe systems, a specialized event-based middleware delivers notifications of events created by producers (publishers) to consumers (subscribers) interested in that particular event. It is considered a good approach for implementing Internet-wide distributed systems as it provides full decoupling of the communicating parties in time, space and synchronization. One flavor of the paradigm is content-based publish/subscribe which allows the subscribers to express their interests very accurately. In order to implement a content-based publish/subscribe middleware in way suitable for Internet scale, its underlying architecture must be organized as a peer-to-peer network of content-based routers that take care of forwarding the event notifications to all interested subscribers. A communication infrastructure that provides such service is called a content-based network. A content-based network is an application-level overlay network. Unfortunately, the expressiveness of the content-based interaction scheme comes with a price - compiling and maintaining the content-based forwarding and routing tables is very expensive when the amount of nodes in the network is large. The routing tables are usually partially-ordered set (poset) -based data structures. In this work, we present an algorithm that aims to improve scalability in content-based networks by reducing the workload of content-based routers by offloading some of their content routing cost to clients. We also provide experimental results of the performance of the algorithm. Additionally, we give an introduction to the publish/subscribe paradigm and content-based networking and discuss alternative ways of improving scalability in content-based networks. ACM Computing Classification System (CCS): C.2.4 [Computer-Communication Networks]: Distributed Systems - Distributed applications

Service Composition on a Mobile Phone

With the recent increase in interest in service-oriented architectures (SOA) and Web services, developing applications with the Web services paradigm has become feasible. Web services are self-describing, platform-independent computational elements. New applications can be assembled from a set of previously created Web services, which are composed together to make a service that uses its components to perform a certain task. This is the idea of service composition. To bring service composition to a mobile phone, I have created Interactive Service Composer for mobile phones. With Interactive Service Composer, the user is able to build service compositions on his mobile phone, consisting of Web services or services that are available from the mobile phone itself. The service compositions are reusable and can be saved in the phone's memory. Previously saved compositions can also be used in new compositions. While developing applications for mobile phones has been possible for some time, the usability of the solutions is not the same as when developing for desktop computers. When developing for mobile phones, the developer has to more carefully consider the decisions he is going to make with the program he is developing. With the lack of processing power and memory, the applications cannot function as well as on desktop PCs. On the other hand, this does not remove the appeal of developing applications for mobile devices.

From trading to eCommunity management

"The increasing pressure for enterprises to join into agile business networks is changing the requirements on the enterprise computing systems. The supporting infrastructure is increasingly required to provide common facilities and societal infrastructure services to support the lifecycle of loosely-coupled, eContract-governed business networks. The required facilities include selection of those autonomously administered business services that the enterprises are prepared to provide and use, contract negotiations, and furthermore, monitoring of the contracted behaviour with potential for breach management. The essential change is in the requirement of a clear mapping between business-level concepts and the automation support for them. Our work has focused on developing B2B middleware to address the above challenges; however, the architecture is not feasible without management facilities for trust-aware decisions for entering business networks and interacting within them. This paper discusses how trust-based decisions are supported and positioned in the B2B middleware."

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.

An optimal local approximation algorithm for max-min linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.