Efficient scheduling of sensor activity for information coverage in wireless sensor networks

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain Disjoint Set of Information Covers (DSIC), which achieves longer network life compared to the set of covers obtained using an Exhaustive-Greedy-Equalized Heuristic (EGEH) algorithm proposed recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

The application of islanded photovoltaic cells and battery storage on the reliability of distribution networks

Renewable energy resources, in particularly PV and battery storage are increasingly becoming part of residential and agriculture premises to manage their electricity consumption. This thesis addresses the tremendous technical, financial and planning challenges for utilities created by these increases, by offering techniques to examine the significance of various renewable resources in electricity network planning. The outcome of this research should assist utilities and customers for adequate planning that can be financially effective.

Dielectric properties of Poly(vinylidene fluoride)/CaCu3Ti4O12 composites

The possibility of obtaining relatively high dielectric constant polymer-ceramic composite by incorporating the giant dielectric constant material, CaCu3Ti4O12 (CCTO) in a Poly(vinylidene fluoride) (PVDF) polymer matrix by melt mixing and hot pressing process was demonstrated. The structure, morphology and dielectric properties of the composites were characterized using X-ray diffraction, Thermal analysis. scanning electron microscope, and impedance analyzer. The effective dielectric constant a(epsilon(eff)) of the composite increased with increase in the volume fraction of CCTO at all the frequencies(100 Hz-1 MHz) under study. The dielectric loss did not show any variation up to 40% loading of CCTO, but showed an increasing trend beyond 40%. The room temperature dielectric constant as high as 95 at 100 Hz has been realized for the composite with 55 vol.% of CCTO, which has increased to about 190 at 150 degrees C. Theoretical models like Maxwell's, Clausius-Mossotti, Effective medium theory, logarithmic law and Yamada were employed to rationalize the dielectric behaviour of the composite and discussed. (C) 2010 Published by Elsevier Ltd.

Development of a new flexor tendon repair technique performed with bioabsorbable poly-L/D-lactide (PLDLA) suture

Sormen koukistajajännevamman korjauksen jälkeisen aktiivisen mobilisaation on todettu johtavan parempaan toiminnalliseen lopputulokseen kuin nykyisin yleisesti käytetyn dynaamisen mobilisaation. Aktiivisen mobilisaation ongelma on jännekorjauksen pettämisriskin lisääntyminen nykyisten ommeltekniikoiden riittämättömän vahvuuden vuoksi. Jännekorjauksen lujuutta on parannettu kehittämällä monisäieommeltekniikoita, joissa jänteeseen tehdään useita rinnakkaisia ydinompeleita. Niiden kliinistä käyttöä rajoittaa kuitenkin monimutkainen ja aikaa vievä tekninen suoritus. Käden koukistajajännekorjauksessa käytetään yleisesti sulamattomia ommelmateriaaleja. Nykyiset käytössä olevat biohajoavat langat heikkenevät liian nopeasti jänteen paranemiseen nähden. Biohajoavan laktidistereokopolymeeri (PLDLA) 96/4 – langan vetolujuuden puoliintumisajan sekä kudosominaisuuksien on aiemmin todettu soveltuvan koukistajajännekorjaukseen. Tutkimuksen tavoitteena oli kehittää välittömän aktiivisen mobilisaation kestävä ja toteutukseltaan yksinkertainen käden koukistajajännekorjausmenetelmä biohajoavaa PLDLA 96/4 –materiaalia käyttäen. Tutkimuksessa analysoitiin viiden eri yleisesti käytetyn koukistajajänneompeleen biomekaanisia ominaisuuksia staattisessa vetolujuustestauksessa ydinompeleen rakenteellisten ominaisuuksien – 1) säikeiden (lankojen) lukumäärän, 2) langan paksuuden ja 3) ompeleen konfiguraation – vaikutuksen selvittämiseksi jännekorjauksen pettämiseen ja vahvuuteen. Jännekorjausten näkyvän avautumisen todettiin alkavan perifeerisen ompeleen pettäessä voima-venymäkäyrän myötöpisteessä. Ydinompeleen lankojen lukumäärän lisääminen paransi ompeleen pitokykyä jänteessä ja suurensi korjauksen myötövoimaa. Sen sijaan paksumman (vahvemman) langan käyttäminen tai ompeleen konfiguraatio eivät vaikuttaneet myötövoimaan. Tulosten perusteella tutkittiin mahdollisuuksia lisätä ompeleen pitokykyä jänteestä yksinkertaisella monisäieompeleella, jossa ydinommel tehtiin kolmen säikeen polyesterilangalla tai nauhamaisen rakenteen omaavalla kolmen säikeen polyesterilangalla. Nauhamainen rakenne lisäsi merkitsevästi ompeleen pitokykyä jänteessä parantaen myötövoimaa sekä maksimivoimaa. Korjauksen vahvuus ylitti aktiivisen mobilisaation jännekorjaukseen kohdistaman kuormitustason. PLDLA 96/4 –langan soveltuvuutta koukistajajännekorjaukseen selvitettiin tutkimalla langan biomekaanisia ominaisuuksia ja solmujen pito-ominaisuuksia staattisessa vetolujuustestauksessa verrattuna yleisimmin jännekorjauksessa käytettävään punottuun polyesterilankaan (Ticron®). PLDLA –langan todettiin soveltuvan hyvin koukistajajännekorjaukseen, sillä se on polyesterilankaa venymättömämpi ja solmujen pitävyys on parempi. Viimeisessä vaiheessa tutkittiin PLDLA 96/4 –langasta valmistetulla kolmisäikeisellä, nauhamaisella jännekorjausvälineellä tehdyn jännekorjauksen kestävyyttä staattisessa vetolujuustestauksessa sekä syklisessä kuormituksessa, joka simuloi staattista testausta paremmin mobilisaation toistuvaa kuormitusta. PLDLA-korjauksen vahvuus ylitti sekä staattisessa että syklisessä kuormituksessa aktiivisen mobilisaation edellyttämän vahvuuden. Nauhamaista litteää ommelmateriaalia ei aiemmin ole tutkittu tai käytetty käden koukistajajännekorjauksessa. Tässä tutkimuksessa ommelmateriaalin nauhamainen rakenne paransi merkitsevästi jännekorjauksen vahvuutta, minkä arvioidaan johtuvan lisääntyneestä kontaktipinnasta jänteen ja ommelmateriaalin välillä estäen ompeleen läpileikkautumista jänteessä. Tutkimuksessa biohajoavasta PLDLA –materiaalista valmistetulla rakenteeltaan nauhamaisella kolmisäikeisellä langalla tehdyn jännekorjauksen vahvuus saavutti aktiivisen mobilisaation edellyttämän tason. Lisäksi uusi menetelmä on helppokäyttöinen ja sillä vältetään perinteisten monisäieompeleiden tekniseen suoritukseen liittyvät ongelmat.

High-rate, Single-Symbol Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of an the channels and the relays have only the phase information of the source-to-relay channels. In our earlier work, we had derived a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC. Using these conditions, in this paper we show that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from 2/N when the relays do not have CSI to 1/2, which is independent of N. We also show that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property. Using this property we are able to construct codes that are SSD and have higher rate than 2/N but giving full diversity only for signal constellations satisfying certain conditions.

OFDM Based Distributed Space Time Coding for Asynchronous Relay Networks

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This transmission scheme is amazingly simple and achieves a diversity order of two for any number of relays. Motivated by its simplicity, this scheme is extended to a more general transmission scheme that can achieve full cooperative diversity for any number of relays. The conditions on the distributed space time block code (DSTBC) structure that admit its application in the proposed transmission scheme are identified and it is pointed out that the recently proposed full diversity four group decodable DST-BCs from precoded co-ordinate interleaved orthogonal designs and extended Clifford algebras satisfy these conditions. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Finally, four group decodable distributed differential space time block codes applicable in this new transmission scheme for power of two number of relays are also provided.

OFDM-MAC algorithms and their impact on TCP performance in next generation mobile networks

Next generation wireless systems employ Orthogonal frequency division multiplexing (OFDM) physical layer owing to the high data rate transmissions that are possible without increase in bandwidth. While TCP performance has been extensively studied for interaction with link layer ARQ, little attention has been given to the interaction of TCP with MAC layer. In this work, we explore cross-layer interactions in an OFDM based wireless system, specifically focusing on channel-aware resource allocation strategies at the MAC layer and its impact on TCP congestion control. Both efficiency and fairness oriented MAC resource allocation strategies were designed for evaluating the performance of TCP. The former schemes try to exploit the channel diversity to maximize the system throughput, while the latter schemes try to provide a fair resource allocation over sufficiently long time duration. From a TCP goodput standpoint, we show that the class of MAC algorithms that incorporate a fairness metric and consider the backlog outperform the channel diversity exploiting schemes.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.

Optimal sleep-wake scheduling for quickest intrusion detection using sensor networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices, we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: (1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, (2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which (3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time), based on the sensor observations obtained until time slot k. Our results show that an optimum closed loop control on Mk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

Noncoherent low-decoding-complexity space-time codes for wireless relay networks

The differential encoding/decoding setup introduced by Kiran et at, Oggier et al and Jing et al for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices. For such codebooks to be used in the Jing-Hassibi protocol for cooperative diversity, the conditions that need to be satisfied by the relay matrices and the codebook are identified. A class of previously known rate one, full diversity, four-group encodable and four-group decodable Differential Space-Time Codes (DSTCs) is proposed for use as Distributed DSTCs (DDSTCs) in the proposed set up. To the best of our knowledge, this is the first known low decoding complexity DDSTC scheme for cooperative wireless networks.

Uplink Power Control and Base Station Association in Multichannel Cellular Networks

A combined base station association and power control problem is studied for the uplink of multichannel multicell cellular networks, in which each channel is used by exactly one cell (i.e., base station). A distributed association and power update algorithm is proposed and shown to converge to a Nash equilibrium of a noncooperative game. We consider network models with discrete mobiles (yielding an atomic congestion game), as well as a continuum of mobiles (yielding a population game). We find that the equilibria need not be Pareto efficient, nor need they be system optimal. To address the lack of system optimality, we propose pricing mechanisms. It is shown that these mechanisms can be implemented in a distributed fashion.

Privacy architectures in social networks’ state-of-the-art survey

The use of social networking has exploded, with millions of people using various web- and mobile-based services around the world. This increase in social networking use has led to user anxiety related to privacy and the unauthorised exposure of personal information. Large-scale sharing in virtual spaces means that researchers, designers and developers now need to re-consider the issues and challenges of maintaining privacy when using social networking services. This paper provides a comprehensive survey of the current state-of-the-art privacy in social networks for both desktop and mobile uses and devices from various architectural vantage points. The survey will assist researchers and analysts in academia and industry to move towards mitigating many of the privacy issues in social networks.

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.

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.