PROBESYNC: Platform Based Synchronization for Enhanced Life of Large Scale Wireless Sensor Networks

Optimization in energy consumption of the existing synchronization mechanisms can lead to substantial gains in terms of network life in Wireless Sensor Networks (WSNs). In this paper, we analyze ERBS and TPSN, two existing synchronization algorithms for WSNs which use widely different approach, and compare their performance in large scale WSNs each of which consists of different type of platform and has varying node density. We, then, propose a novel algorithm, PROBESYNC, which takes advantage of differences in power required to transmit and receive a message on ERBS and TPSN and leverages the shortcomings of each of these algorithms. This leads to considerable improvement in energy conservation and enhanced life of large scale WSNs.

Providing QoS to Real and Data Applications in WiMAX Mesh Networks

We consider the problem of centralized routing and scheduling for IEEE 802.16 mesh networks so as to provide Quality of Service (QoS) to individual real and interactive data applications. We first obtain an optimal and fair routing and scheduling policy for aggregate demands for different source- destination pairs. We then present scheduling algorithms which provide per flow QoS guarantees while utilizing the network resources efficiently. Our algorithms are also scalable: they do not require per flow processing and queueing and the computational requirements are modest. We have verified our algorithms via extensive simulations.

PVA-PSSA Membrane with Interpenetrating Networks and its Methanol Crossover Mitigating Effect in DMFCs

A membrane with interpenetrating networks between poly(vinyl alcohol) (PVA) and poly(styrene sulfonic acid) (PSSA) coupled with a high proton conductivity is realized and evaluated as a proton exchange membrane electrolyte for a direct methanol fuel cell (DMFC). Its reduced methanol permeability and improved performance in DMFCs suggest the new blend as an alternative membrane to Nafion membranes. The membrane has been characterized by powder X-ray diffraction, scanning electron microscopy, time-modulated differential scanning calorimetry, and thermogravimetric analysis in conjunction with its mechanical strength. The maximum proton conductivity of 3.3×10−2 S/cm for the PVA–PSSA blend membrane is observed at 373 K. From nuclear magnetic resonance imaging and volume localized spectroscopy experiments, the PVA–PSSA membrane has been found to exhibit a promising methanol impermeability, in DMFCs. On evaluating its utility in a DMFC, it has been found that a peak power density of 90 mW/cm2 at a load current density of 320 mA/cm2 is achieved with the PVA–PSSA membrane compared to a peak power density of 75 mW/cm2 at a load current density of 250 mA/cm2 achievable for a DMFC employing Nafion membrane electrolyte while operating under identical conditions; this is attributed primarily to the methanol crossover mitigating property of the PVA–PSSA membrane.

Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks

Single-symbol maximum likelihood (ML) decodable distributed orthogonal space-time block codes (DOST- BCs) have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of distributed space-time block codes (DSTBCs) called semi-orthogonal precoded distributed single-symbol decodable space-time block codes (Semi-SSD-PDSTBCs) wherein, the source performs preceding on the information symbols before transmitting it to all the relays. A set of necessary and sufficient conditions on the relay matrices for the existence of semi-SSD- PDSTBCs is proved. It is shown that the DOSTBCs are a special case of semi-SSD-PDSTBCs. A subset of semi-SSD-PDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of Semi- SSD-PDSTBCs is presented when the number of relays K ges 4 and the constructed codes are shown to have higher rates than that of DOSTBCs.

Three-dimensional hybrid networks based on aspartic acid

Three-dimensional achiral coordination polymers of the general formula M2(D, l-NHCH (COO)CH2COO)2·C4H4N2 where M = Ni and Co and pyrazine acts as the linker molecule have been prepared under hydrothermal conditions starting with [M(L-NHCH(COO)CH2COO)·3H2O] possessing a helical chain structure. A three-dimensional hybrid compound of the formula Pb2.5[N{CH(COO) CH2COO}22H2O] has also been prepared hydrothermally starting with aspartic acid and Pb(NO3)2. In this lead compound, where a secondary amine formed by the dimerisation of aspartic acid acts as the ligand, there is two-dimensional inorganic connectivity and one-dimensional organic connectivity.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

The core and shapley value analysis for cooperative formation of procurement networks

Formation of high value procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions, where suppliers are intelligent and rational agents who act strategically. In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged We model the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a stable and fair manner We first investigate the stability of such networks by examining the conditions under which the core of the game is non-empty. We then present a protocol, based on the extensive form game realization of the core, for forming such networks so that the resulting network is stable. We also mention a key result when the Shapley value is applied as a solution concept.

Understanding data flow and security requirements in wireless Body Area Networks for healthcare

The Body Area Network (BAN) is an emerging technology that focuses on monitoring physiological data in, on and around the human body. BAN technology permits wearable and implanted sensors to collect vital data about the human body and transmit it to other nodes via low-energy communication. In this paper, we investigate interactions in terms of data flows between parties involved in BANs under four different scenarios targeting outdoor and indoor medical environments: hospital, home, emergency and open areas. Based on these scenarios, we identify data flow requirements between BAN elements such as sensors and control units (CUs) and parties involved in BANs such as the patient, doctors, nurses and relatives. Identified requirements are used to generate BAN data flow models. Petri Nets (PNs) are used as the formal modelling language. We check the validity of the models and compare them with the existing related work. Finally, using the models, we identify communication and security requirements based on the most common active and passive attack scenarios.

Growing Up Vietnamese in Finland - Looking Back 12 Years Later : The Well-Being and Sociocultural Adaptation of Vietnamese as Children or Adolescents and as Young Adults

Varttuminen vietnamilaisena Suomessa: 12 vuoden seurantajakso – Vietnamilaisten hyvinvointi ja sosiokulttuurinen sopeutuminen lapsena/nuorena sekä nuorena aikuisena Tämä tutkimus oli määrällinen pitkittäistutkimus lapsena tai nuorena vuosina 1979-1991 Suomeen saapuneiden vietnamilaisten akkulturaatiosta (kulttuurin muutoksista), psyykkisestä hyvinvoinnista ja sosiokulttuurisesta sopeutumisesta. Tutkimukseen osallistui ensimmäisessä vaiheessa (vuonna 1992) 97 satunnaisesti valittua vietnamilaista peruskoululaista ympäri maata, joita verrattin suomalaisiin luokkatovereihin. Seurantavaiheeseen (vuonna 2004) osallistui 59 ensimmäisessä vaiheessa mukana ollutta vietnamilaista, nyt iältään 20 – 31 -vuotiaita. Tutkimuksen tavoitteena oli selvittää mitkä tekijät ennustivat akkulturaation lopputuloksia, samalla huomioiden iän ja ympäristön (kontekstin) vaikutukset psyykkiseen hyvinvointiin ja sosiokulttuuriseen sopeutumiseen. Yksittäiset akkulturaatiodimensiot (kieli, arvot ja identiteetti) osoittautuivat tärkeämmiksi psyykkiselle hyvinvoinnille ja sosiokulttuuriselle sopeutumiselle kuin etniset, kansalliset tai kaksikulttuuriset profiilit, joissa yhdistyivät ao. kieli, arvot ja identiteetti. Identiteettimuutosta tapahtui (etniseen) vietnamilaiseen suuntaan ajan kuluessa, kun taas arvomuutosta tapahtui (kansalliseen) suomalaiseen suuntaan. Sekä suomen että vietnamin kielen taito lisääntyivät ajan myötä, millä oli myönteisiä vaikutuksia sekä psyykkiseen hyvinvointiin että sosiokulttuuriseen sopeutumiseen. Lähtötilanteen psyykkinen hyvinvointi ennusti hyvinvointia (masennuksen puutetta ja itsetuntoa) aikuisena, mutta sosiokulttuurinen sopeutuminen (koulumenestys) lapsena tai nuorena ei ennustanut kouluttautumista aikuisena. Parempi suomen kielen taito ja vähemmän identifioitumista suomalaiseksi aikuisena sekä masentuneisuuden puute ja vähemmän koettua syrjintää lapsena tai nuorena erottelivat psyykkisesti paremmin voivat aikuiset (ei-masentuneet) heistä, jotka olivat masentuneita. Parempaa kouluttautumista aikuisena ennustivat toisaalta vähemmän koettua syrjintää lapsena tai nuorena ja toisaalta aikuisena parempi suomen kielen taito, suurempi kansallisten (suomalaisten) itsenäisyysarvojen kannattaminen, mutta kuitenkin vähemmän identifioitumista suomalaisiin. Koetun syrjinnän merkitys psyykkiselle hyvinvoinnille, erityisesti lapsena tai nuorena, sekä sen pitkäaikaisvaikutukset psyykkiselle hyvinvoinnille ja sosiokulttuuriselle sopeutumiselle aikuisena osoittavat tarpeen puuttua varhain psyykkisiin ongelmiin sekä parantaa etnisten ryhmien välisiä suhteita. Avainsanat: akkulturaatio, psyykkinen hyvinvointi, sosiokultuurinen sopeutuminen, kieli, arvot, identiteetti, vietnamilainen, Suomi, lapset, nuoret, nuoret aikuiset

Lähellä, mutta niin kaukana : Tutkimus naisten muuttoliikkeestä Suomen ja uudelleen itsenäistyneen Viron välillä

Immigration is one of the most topical international issues of our time. Worldwide, the number of immigrants has doubled over the last twenty years, and migration patterns have become so diversified that they now constitute a kind of “chaos”. The number and significance of women as migrants has also increased, which is earning women growing attention among scholars. This study looks at the migration of women, in particular mothers of small children, in both directions between Finland and Estonia, following the latter’s re- independence. The data consists of in-depth interviews conducted in 2005 with 24 Finnish and 24 Estonian immigrant women. The focus was on the women’s expectations and experiences of their new country of residence, acculturation – i.e. adjusting to a new environment, social networks in the country of origin and the new country, and models of motherhood following immigration. The primary research question was formulated as follows: Which factors have influenced the formation of female immigrants’ social ties, thus contributing to the formation of motherhood strategies and afecting internal family dynamics in the new country? The research consists of four previously published independent articles as well as a summary chapter. The study’s findings indicate that Finnish and Estonian women migrated for diferent reasons and at diferent times, and that their migration patterns also difered. Estonian migration occurred mainly in the 1990s, and most immigrants intended to return later to their country of origin. Regardless of the reason for migrating that they gave to immigration officials, other key reasons often included the desire for a more stable living environment and better income. Only four of the Estonian women had immigrated together with an Estonian husband, while two- thirds came because of marriage to a Finnish man. Most of the Finnish women, on the other hand, migrated after 2000 and either came with their family as a result of a spouse’s job transfer, or came by themselves to further their studies. In most cases, the migration was a temporary solution intended to promote one’s own or one’s spouse’s career advancement. Because the reasons for migrating were diferent between Finnish and Estonian women, their expectations of the new country and their status in it were also diferent. In terms of both social and economic standing, the position of Finnish immigrants was categorically better. The reason for migrating had an impact on one’s orientation toward the receiving society. Estonian women and Finns who migrated for marriage or edu cational reasons became immediately active in forming institutional and social ties in the new society. Conversely, the women had migrated because of work had little contact with Estonian society, and their social networks consisted of other Finnish immigrants. Furthermore, they maintained strong institutional and social ties to Finland and therefore felt no need to anchor themselves to Estonian society. The Finnish and Estonian women who were better integrated into the receiving country also maintained strong social ties to their country of origin. Women who became integrated into the receiving country as a result of giving birth to children utilized various services directed at families with children. In part, such services conveyed to the women the conceptions that were prevalent in the surrounding society concerning the treatment of children and the expectations on mothers, both of which difer to some extent in Finland and Estonia. had an impact on strategies of motherhood, internal family dynamics, and gender Regardless of the reason for migrating, or the country of origin, immigration equality. Most Estonian women had to do without the child-care help provided by relatives; before immigrating, some women had even had daily child-care assistance from family members. However, Estonian women who were married to Finns did receive help from the spouse and sometimes also the spouse’s relatives. Conversely, Finnish women who had immigrated because of a spouse’s job transfer were faced with the opposite situation, in which they bore the main responsibility for domestic work and child care. They were, however, in a position to pay for domestic help. Hence, the women who had integrated into a new society had to construct their own perceptions of motherhood by reconciling the motherhood models of both the cause of a spouse’s job transfer found that being a stay-at-home mother challenged previously self-evident behaviors. Receiving country and the country of origin, whereas women who had migrated because of a spouse’s job transfer found that being a stay-at-home mother challenged previously self-evident behaviors.

Social networks and use of social supports of minority elders in East Harlem

Considerable empirical research substantiates the importance of social networks on health and well-being in later life. A study of ethnic minority elders living in two low income public housing buildings in East Harlem was undertaken to gain an understanding of the relationship between their health status and social networks. Findings demonstrate that elders with supportive housing had better psychological outcomes and used significantly more informal supports when in need. However, elders with serious health problems had poorer outcomes regardless of their level of social support. This study highlights the potential of supportive living environments to foster social integration and to optimise formal and informal networks.

An analytical approach to the study of cooperation in wireless ad hoc networks

In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios (complete cooperation and complete noncooperation) are inimical to the interests of a user. In this paper, we address the issue of user cooperation in ad hoc networks. We assume that nodes are rational, i.e., their actions are strictly determined by self interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we are able to determine the optimal share of service that each node should receive. We define this to be the rational Pareto optimal operating point. We then propose a distributed and scalable acceptance algorithm called Generous TIT-FOR-TAT (GTFT). The acceptance algorithm is used by the nodes to decide whether to accept or reject a relay request. We show that GTFT results in a Nash equilibrium and prove that the system converges to the rational and optimal operating point.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Quality of support for multicasting over mobile ad-hoc networks

An ad hoc network is composed of mobile nodes without any infrastructure. Recent trends in applications of mobile ad hoc networks rely on increased group oriented services. Hence multicast support is critical for ad hoc networks. We also need to provide service differentiation schemes for different group of users. An efficient application layer multicast (APPMULTICAST) solution suitable for low mobility applications in MANET environment has been proposed in [10]. In this paper, we present an improved application layer multicast solution suitable for medium mobility applications in MANET environment. We define multicast groups with low priority and high priority and incorporate a two level service differentiation scheme. We use network layer support to build the overlay topology closer to the actual network topology. We try to maximize Packet Delivery Ratio. Through simulations we show that the control overhead for our algorithm is within acceptable limit and it achieves acceptable Packet Delivery Ratio for medium mobility applications.