On the Limits of Spatial Reuse and Cooperative Communication for Dense Wireless Networks

We consider a dense ad hoc wireless network comprising n nodes confined to a given two dimensional region of fixed area. For the Gupta-Kumar random traffic model and a realistic interference and path loss model (i.e., the channel power gains are bounded above, and are bounded below by a strictly positive number), we study the scaling of the aggregate end-to-end throughput with respect to the network average power constraint, P macr, and the number of nodes, n. The network power constraint P macr is related to the per node power constraint, P macr, as P macr = np. For large P, we show that the throughput saturates as Theta(log(P macr)), irrespective of the number of nodes in the network. For moderate P, which can accommodate spatial reuse to improve end-to-end throughput, we observe that the amount of spatial reuse feasible in the network is limited by the diameter of the network. In fact, we observe that the end-to-end path loss in the network and the amount of spatial reuse feasible in the network are inversely proportional. This puts a restriction on the gains achievable using the cooperative communication techniques studied in and, as these rely on direct long distance communication over the network.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays.

On four-group ML decodable distributed space time codes for cooperative communication

A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF) protocol of Rajan et al. The salient feature of the proposed DSTCs is that they satisfy the extra constraints imposed by the protocols and are also four-group ML decodable which leads to significant reduction in ML decoding complexity compared to all existing DSTC constructions. Moreover these codes have uniform distribution of power among the relays as well as in time. Also, simulations results indicate that these codes perform better in comparison with the only known DSTC with the same rate and decoding complexity, namely the Coordinate Interleaved Orthogonal Design (CIOD). Furthermore, they perform very close to DSTCs from field extensions which have same rate but higher decoding complexity.

Access Control in Communication Systems

Access control is an important component in the security of communication systems. While cryptography has rightfully been a significant component in the design of large scale communication systems, its relation to access control, especially its complementarity, has not often been brought out in full. With the wide availability of SELinux, a comprehensive model of access control has all the more become important. In many large scale systems, access control and trust management have become important components in the design. In survivable systems, models of group communication systems may have to be integrated with access control models. In this paper, we discuss the problem of integrating various formalisms often encountered in large scale communication systems, especially in connection with dynamic access control policies as well as trust management

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.

Allosteric Communication in Cysteinyl tRNA Synthetase A NETWORK OF DIRECT AND INDIRECT READOUT

Protein structure networks are constructed for the identification of long-range signaling pathways in cysteinyl tRNA synthetase (CysRS). Molecular dynamics simulation trajectory of CysRS-ligand complexes were used to determine conformational ensembles in order to gain insight into the allosteric signaling paths. Communication paths between the anticodon binding region and the aminoacylation region have been identified. Extensive interaction between the helix bundle domain and the anticodon binding domain, resulting in structural rigidity in the presence of tRNA, has been detected. Based on the predicted model, six residues along the communication paths have been examined by mutations (single and double) and shown to mediate a coordinated coupling between anticodon recognition and activation of amino acid at the active site. This study on CysRS clearly shows that specific key residues, which are involved in communication between distal sites in allosteric proteins but may be elusive in direct structure analysis, can be identified from dynamics of protein structure networks.

Information-theoretic and communication-theoretic optimal power allocation for fading channels

In this paper we review the most peculiar and interesting information-theoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus on the information theory of fading channels, by emphasizing capacity as the most important performance measure. Both single-user and multiuser transmission are examined. Further, we describe how the structure of fading channels impacts code design, and finally overview equalization of fading multipath channels.

Algebraic Approaches to Space-Time Code Construction for Multiple-Antenna Communication

A major challenge in wireless communications is overcoming the deleterious effects of fading, a phenomenon largely responsible for the seemingly inevitable dropped call. Multiple-antennas communication systems, commonly referred to as MIMO systems, employ multiple antennas at both transmitter and receiver, thereby creating a multitude of signalling pathways between transmitter and receiver. These multiple pathways give the signal a diversity advantage with which to combat fading. Apart from helping overcome the effects of fading, MIMO systems can also be shown to provide a manyfold increase in the amount of information that can be transmitted from transmitter to receiver. Not surprisingly,MIMO has played, and continues to play, a key role in the advancement of wireless communication.Space-time codes are a reference to a signalling format in which information about the message is dispersed across both the spatial (or antenna) and time dimension. Algebraic techniques drawing from algebraic structures such as rings, fields and algebras, have been extensively employed in the construction of optimal space-time codes that enable the potential of MIMO communication to be realized, some of which have found their way into the IEEE wireless communication standards. In this tutorial article, reflecting the authors’interests in this area, we survey some of these techniques.

An Efficient Distributed Scheme for Source Routing Protocol in Communication Networks

In this paper, we propose an efficient source routing algorithm for unicast flows, which addresses the scalability problem associated with the basic source routing technique. Simulation results indicate that the proposed algorithm indeed helps in reducing the message overhead considerably, and at the same time it gives comparable performance in terms of resource utilization across a wide range of workloads.

Pre-emptive queue processing scheme for handovers in mobile cellular communication systems

A new scheme for minimizing handover failure probability in mobile cellular communication systems is presented. The scheme involves a reassignment of priorities for handover requests enqueued in adjacent cells to release a channel for a handover request which is about to fail. Performance evaluation of the new scheme carried out by computer simulation of a four-cell highway cellular system has shown a considerable reduction in handover failure probability

Activation of TGF-beta Pathway by Areca Nut Constituents: A Possible Cause of Oral Submucous Fibrosis

Oral submucous fibrosis (OSF) is a chronic inflammatory disease characterized by the accumulation of excess collagen, and areca nut chewing has been proposed as an important etiological factor for disease manifestation. Activation of transforming growth factor-beta signaling has been postulated as the main causative event for increased collagen production in OSF. Oral epithelium plays important roles in OSF, and arecoline has been shown to induce TGF-beta in epithelial cells. In an attempt to understand the role of areca nut constituents in the manifestation of OSF, we studied the global gene expression profile in epithelial cells (HaCaT) following treatment with areca nut water extract or TGF-beta. Interestingly, 64% of the differentially regulated genes by areca nut water extract matches with the TGF-beta induced gene expression profile. Out of these, expression of 57% of genes was compromised in the presence of ALK5 (T beta RI) inhibitor and 7% were independently induced by areca nut, highlighting the importance of TGF-beta in areca nut actions. Areca nut water extract treatment induced p-SMAD2 and TGF-beta downstream targets in HaCaT cells but not in human gingival fibroblast cells (hGF), suggesting epithelial cells could be the source of TGF-beta in promoting OSF. Water extract of areca nut consists of polyphenols and alkaloids. Both polyphenol and alkaloid fractions of areca nut were able to induce TGF-beta signaling and its downstream targets. Also, SMAD-2 was phosphorylated following treatment of HaCaT cells by Catechin, Tannin and alkaloids namely Arecoline, Arecaidine and Guvacine. Moreover, both polyphenols and alkaloids induced TGF-beta 2 and THBS1 (activator of latent TGF-beta) in HaCaT cells suggesting areca nut mediated activation of p-SMAD2 involves up-regulation and activation of TGF-beta. These data suggest a major causative role for TGF-beta that is induced by areca nut in OSF progression.

Oncogenic MicroRNA-155 Down-regulates Tumor Suppressor CDC73 and Promotes Oral Squamous Cell Carcinoma Cell Proliferation IMPLICATIONS FOR CANCER THERAPEUTICS

The CDC73 gene is mutationally inactivated in hereditary and sporadic parathyroid tumors. It negatively regulates beta-catenin, cyclin D1, and c-MYC. Down-regulation of CDC73 has been reported in breast, renal, and gastric carcinomas. However, the reports regarding the role of CDC73 in oral squamous cell carcinoma (OSCC) are lacking. In this study we show that CDC73 is down-regulated in a majority of OSCC samples. We further show that oncogenic microRNA-155 (miR-155) negatively regulates CDC73 expression. Our experiments show that the dramatic up-regulation of miR-155 is an exclusive mechanism for down-regulation of CDC73 in a panel of human cell lines and a subset of OSCC patient samples in the absence of loss of heterozygosity, mutations, and promoter methylation. Ectopic expression of miR-155 in HEK293 cells dramatically reduced CDC73 levels, enhanced cell viability, and decreased apoptosis. Conversely, the delivery of a miR-155 antagonist (antagomir-155) to KB cells overexpressing miR-155 resulted in increased CDC73 levels, decreased cell viability, increased apoptosis, and marked regression of xenografts in nude mice. Cotransfection of miR-155 with CDC73 in HEK293 cells abrogated its pro-oncogenic effect. Reduced cell proliferation and increased apoptosis of KB cells were dependent on the presence or absence of the 3'-UTR in CDC73. In summary, knockdown of CDC73 expression due to overexpression of miR-155 not only adds a novelty to the list of mechanisms responsible for its down-regulation in different tumors, but the restoration of CDC73 levels by the use of antagomir-155 may also have an important role in therapeutic intervention of cancers, including OSCC.