Reversible Swelling/Deswelling Characteristics of Ethylene Glycol Dimethacrylate Cross-Linked Poly(acrylic acid-co-sodium acrylate-co-acrylamide) Superabsorbents

Poly(acrylic acid-co-sodium acrylate-co-acrylamide) superabsorbent polymers (SAPs) cross-linked with ethylene glycol dimethacrylate (EGDMA) were synthesized by inverse suspension polymerization. The SAPs were swollen in DI water, and it was found that the equilibrium swelling capacities varied with the acrylamide content. The SAPs were subjected to reversible swelling/deswelling cycles in DI water and aqueous NaCl solution, respectively. The effect of the addition of an electrolyte on the swelling of the SAP was explored. The equilibrium swelling capacity of the SAPs was found to decrease with increasing concentration of added electrolyte in the swelling medium. The effect of the particle size of the dry SAPs on the swelling properties was also investigated. A first order model was used to describe the kinetics of swelling/deswelling, and the equilibrium swelling capacity, limiting swelling capacity, and swelling/deswelling rate coefficients were determined.

Synthesis, Characterization, and Degradation of Biodegradable Poly(mannitol citric dicarboxylate) Copolyesters

Three groups of poly(mannitol citric dicarboxylate) [p(MCD)] copolyesters were synthesized by catalyst-free melt condensation of mannitol with acids. The resulting copolyesters were designated as poly(mannitol citric succinate) [p(MCSu)], poly(mannitol citric adipate) [p(MCA)], poly(mannitol citric sebacate) [p(MCS)]. The polymers were characterized by FTIR, (1)H NMR, and DSC analysis. The synthesized p(MCD) polymers exhibit glass transition temperatures ranging from 16.5 to 58.58 degrees C. The mechanical, degradation properties, and the drug-releasing characteristics of these polymers were investigated. It was observed that the mechanical properties of the p(MCD) polymers cover a wide range with Young's modulus of the polymer varying from 12.25 to 660 MPa. Hydrolytic degradation of all polymers was investigated by incubating polymer discs in PBS and the hydrolytic degradation of p(MCD) polymers followed the order, p(MCSu) > p(MCA) > p(MCS). This was attributed to the number of -CH(2)(units in the dicarboxylic monomers. The release of model drug compounds from the p(MCD) polymer discs was also studied. POLYM. ENG. SCI., 51:2035-2043, 2011. (C) 2011 Society of Plastics Engineers

Training-Symbol Embedded, High-Rate, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks

Distributed space-time block codes (DSTBCs) from complex orthogonal designs (CODs) (both square and nonsquare), coordinate interleaved orthogonal designs (CIODs), and Clifford unitary weight designs (CUWDs) are known to lose their single-symbol ML decodable (SSD) property when used in two-hop wireless relay networks using amplify and forward protocol. For such networks, in this paper, three new classes of high rate, training-symbol embedded (TSE) SSD DSTBCs are constructed: TSE-CODs, TSE-CIODs, and TSE-CUWDs. The proposed codes include the training symbols inside the structure of the code which is shown to be the key point to obtain the SSD property along with the channel estimation capability. TSE-CODs are shown to offer full-diversity for arbitrary complex constellations and the constellations for which TSE-CIODs and TSE-CUWDs offer full-diversity are characterized. It is shown that DSTBCs from nonsquare TSE-CODs provide better rates (in symbols per channel use) when compared to the known SSD DSTBCs for relay networks. Important from the practical point of view, the proposed DSTBCs do not contain any zeros in their codewords and as a result, antennas of the relay nodes do not undergo a sequence of switch on/off transitions within every codeword, and, thus, avoid the antenna switching problem.

An algorithm for dynamic optimal bandwidth allocation in communication networks

We study the problem of optimal bandwidth allocation in communication networks. We consider a queueing model with two queues to which traffic from different competing flows arrive. The queue length at the buffers is observed every T instants of time, on the basis of which a decision on the amount of bandwidth to be allocated to each buffer for the next T instants is made. We consider a class of closed-loop feedback policies for the system and use a twotimescale simultaneous perturbation stochastic approximation(SPSA) algorithm to find an optimal policy within the prescribed class. We study the performance of the proposed algorithm on a numerical setting. Our algorithm is found to exhibit good performance.

Optimal Parameterized Policies for Resource Allocation in Communication Networks

The problem of finding optimal parameterized feedback policies for dynamic bandwidth allocation in communication networks is studied. We consider a queueing model with two queues to which traffic from different competing flows arrive. The queue length at the buffers is observed every T instants of time, on the basis of which a decision on the amount of bandwidth to be allocated to each buffer for the next T instants is made. We consider two different classes of multilevel closed-loop feedback policies for the system and use a two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm to find optimal policies within each prescribed class. We study the performance of the proposed algorithm on a numerical setting and show performance comparisons of the two optimal multilevel closedloop policies with optimal open loop policies. We observe that closed loop policies of Class B that tune parameters for both the queues and do not have the constraint that the entire bandwidth be used at each instant exhibit the best results overall as they offer greater flexibility in parameter tuning. Index Terms — Resource allocation, dynamic bandwidth allocation in communication networks, two-timescale SPSA algorithm, optimal parameterized policies. I.

Optimizing Delay in Sequential Change Detection on Ad Hoc Wireless Sensor Networks

We consider the classical problem of sequential detection of change in a distribution (from hypothesis 0 to hypothesis 1), where the fusion centre receives vectors of periodic measurements, with the measurements being i.i.d. over time and across the vector components, under each of the two hypotheses. In our problem, the sensor devices ("motes") that generate the measurements constitute an ad hoc wireless network. The motes contend using a random access protocol (such as CSMA/CA) to transmit their measurement packets to the fusion centre. The fusion centre waits for vectors of measurements to accumulate before taking decisions. We formulate the optimal detection problem, taking into account the network delay experienced by the vectors of measurements, and find that, under periodic sampling, the detection delay decouples into network delay and decision delay. We obtain a lower bound on the network delay, and propose a censoring scheme, where lagging sensors drop their delayed observations in order to mitigate network delay. We show that this scheme can achieve the lower bound. This approach is explored via simulation. We also use numerical evaluation and simulation to study issues such as: the optimal sampling rate for a given number of sensors, and the optimal number of sensors for a given measurement rate

Asymptotically optimal cooperative wireless networks without constellation expansion

In this work, we construct a unified family of cooperative diversity coding schemes for implementing the orthogonal amplify-and-forward and the orthogonal selection-decode-and-forward strategies in cooperative wireless networks. We show that, as the number of users increases, these schemes meet the corresponding optimal high-SNR outage region, and do so with minimal order of signaling complexity. This is an improvement over all outage-optimal schemes which impose exponential increases in signaling complexity for every new network user. Our schemes, which are based on commutative algebras of normal matrices, satisfy the outage-related information theoretic criteria, the duplex-related coding criteria, and maintain reduced signaling, encoding and decoding complexities

Evolving Random Geometric Graph Models for Mobile Wireless Networks

We consider evolving exponential RGGs in one dimension and characterize the time dependent behavior of some of their topological properties. We consider two evolution models and study one of them detail while providing a summary of the results for the other. In the first model, the inter-nodal gaps evolve according to an exponential AR(1) process that makes the stationary distribution of the node locations exponential. For this model we obtain the one-step conditional connectivity probabilities and extend it to the k-step case. Finite and asymptotic analysis are given. We then obtain the k-step connectivity probability conditioned on the network being disconnected. We also derive the pmf of the first passage time for a connected network to become disconnected. We then describe a random birth-death model where at each instant, the node locations evolve according to an AR(1) process. In addition, a random node is allowed to die while giving birth to a node at another location. We derive properties similar to those above.