Simple Low-cost Planar Antenna for Indoor Communication under the Bluetooth Protocol

A single-feed rectangular-ring microstrip antenna is proposed for indoor communication under the Bluetooth protocol. The dimensions of the antenna together with the location of the feed point are optimized through field simulations in order to cover the Bluetooth bandwidth and to avoid linear polarization. The performance and the efficiency of the antenna are illustrated in a real indoor environment

Mobility Metric based LEACH-Mobile Protocol

Cluster based protocols like LEACH were found best suited for routing in wireless sensor networks. In mobility centric environments some improvements were suggested in the basic scheme. LEACH-Mobile is one such protocol. The basic LEACH protocol is improved in the mobile scenario by ensuring whether a sensor node is able to communicate with its cluster head. Since all the nodes, including cluster head is moving it will be better to elect a node as cluster head which is having less mobility related to its neighbours. In this paper, LEACH-Mobile protocol has been enhanced based on a mobility metric “remoteness” for cluster head election. This ensures high success rate in data transfer between the cluster head and the collector nodes even though nodes are moving. We have simulated and compared our LEACH-Mobile-Enhanced protocol with LEACHMobile. Results show that inclusion of neighbouring node information improves the routing protocol.

Routing protocol enhancement for handling node mobility in wireless sensor networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

A location aided cooperative caching protocol for mobile ad hoc networks

Cooperative caching is an attractive solution for reducing bandwidth demands and network latency in mobile ad hoc networks. Deploying caches in mobile nodes can reduce the overall traffic considerably. Cache hits eliminate the need to contact the data source frequently, which avoids additional network overhead. In this paper we propose a data discovery and cache management policy for cooperative caching, which reduces the caching overhead and delay by reducing the number of control messages flooded in to the network. A cache discovery process based on location of neighboring nodes is developed for this. The cache replacement policy we propose aims at increasing the cache hit ratio. The simulation results gives a promising result based on the metrics of studies

Channel Adaptive MAC Protocol with Traffic-Aware Distributed Power Management in Wireless Sensor Networks-Some Performance Issues

In Wireless Sensor Networks (WSN), neglecting the effects of varying channel quality can lead to an unnecessary wastage of precious battery resources and in turn can result in the rapid depletion of sensor energy and the partitioning of the network. Fairness is a critical issue when accessing a shared wireless channel and fair scheduling must be employed to provide the proper flow of information in a WSN. In this paper, we develop a channel adaptive MAC protocol with a traffic-aware dynamic power management algorithm for efficient packet scheduling and queuing in a sensor network, with time varying characteristics of the wireless channel also taken into consideration. The proposed protocol calculates a combined weight value based on the channel state and link quality. Then transmission is allowed only for those nodes with weights greater than a minimum quality threshold and nodes attempting to access the wireless medium with a low weight will be allowed to transmit only when their weight becomes high. This results in many poor quality nodes being deprived of transmission for a considerable amount of time. To avoid the buffer overflow and to achieve fairness for the poor quality nodes, we design a Load prediction algorithm. We also design a traffic aware dynamic power management scheme to minimize the energy consumption by continuously turning off the radio interface of all the unnecessary nodes that are not included in the routing path. By Simulation results, we show that our proposed protocol achieves a higher throughput and fairness besides reducing the delay

Energy Optimized Secure Routing Protocol for Wireless Sensor Networks

The evolution of wireless sensor network technology has enabled us to develop advanced systems for real time monitoring. In the present scenario wireless sensor networks are increasingly being used for precision agriculture. The advantages of using wireless sensor networks in agriculture are distributed data collection and monitoring, monitor and control of climate, irrigation and nutrient supply. Hence decreasing the cost of production and increasing the efficiency of production. This paper describes the security issues related to wireless sensor networks and suggests some techniques for achieving system security. This paper also discusses a protocol that can be adopted for increasing the security of the transmitted data

Mobility Metric based LEACH-Mobile Protocol

Cluster based protocols like LEACH were found best suited for routing in wireless sensor networks. In mobility centric environments some improvements were suggested in the basic scheme. LEACH-Mobile is one such protocol. The basic LEACH protocol is improved in the mobile scenario by ensuring whether a sensor node is able to communicate with its cluster head. Since all the nodes, including cluster head is moving it will be better to elect a node as cluster head which is having less mobility related to its neighbours. In this paper, LEACH-Mobile protocol has been enhanced based on a mobility metric “remoteness” for cluster head election. This ensures high success rate in data transfer between the cluster head and the collector nodes even though nodes are moving. We have simulated and compared our LEACH-Mobile-Enhanced protocol with LEACHMobile. Results show that inclusion of neighbouring node information improves the routing protocol.

Routing Protocol Enhancement for handling Node Mobility in Wireless Sensor Networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

RMAC-M: Extending the R-MAC Protocol for an Energy Efficient, Delay Tolerant Underwater Acoustic Sensor Network application with a mobile data mule node

One of the major applications of underwater acoustic sensor networks (UWASN) is ocean environment monitoring. Employing data mules is an energy efficient way of data collection from the underwater sensor nodes in such a network. A data mule node such as an autonomous underwater vehicle (AUV) periodically visits the stationary nodes to download data. By conserving the power required for data transmission over long distances to a remote data sink, this approach extends the network life time. In this paper we propose a new MAC protocol to support a single mobile data mule node to collect the data sensed by the sensor nodes in periodic runs through the network. In this approach, the nodes need to perform only short distance, single hop transmission to the data mule. The protocol design discussed in this paper is motivated to support such an application. The proposed protocol is a hybrid protocol, which employs a combination of schedule based access among the stationary nodes along with handshake based access to support mobile data mules. The new protocol, RMAC-M is developed as an extension to the energy efficient MAC protocol R-MAC by extending the slot time of R-MAC to include a contention part for a hand shake based data transfer. The mobile node makes use of a beacon to signal its presence to all the nearby nodes, which can then hand-shake with the mobile node for data transfer. Simulation results show that the new protocol provides efficient support for a mobile data mule node while preserving the advantages of R-MAC such as energy efficiency and fairness.

Energy Aware Cluster-based Multihop Routing Protocol for Sensor Networks

Clustering combined with multihop communication is a promising solution to cope with the energy requirements of large scale Wireless Sensor Networks. In this work, a new cluster based routing protocol referred to as Energy Aware Cluster-based Multihop (EACM) Routing Protocol is introduced, with multihop communication between cluster heads for transmitting messages to the base station and direct communication within clusters. We propose EACM with both static and dynamic clustering. The network is partitioned into near optimal load balanced clusters by using a voting technique, which ensures that the suitability of a node to become a cluster head is determined by all its neighbors. Results show that the new protocol performs better than LEACH on network lifetime and energy dissipation

Routing Protocol Enhancement for handling Node Mobility in Wireless Sensor Networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

Unveiling the components of the signaling pathway between endosomes and the phagocytic uptake machinery in Dictyostelium discoideum

The soil amoebae Dictyostelium discoideum take up particles from their environment in order to obtain nutrition. The particle transits through the cell within a phagosome that fuses with organelles of different molecular compositions, undergoing a gradual degradation by different sets of hydrolytic enzymes. Griffiths’ concept of “phagosome individuality” predicts signaling from phagosomes into the cytoplasm, which might regulate many aspects of cell physiology. The finding that Dictyostelium cells depleted of the lysozyme AlyA or over-expressing the esterase Gp70 exhibit increased uptake of food particles, led to the postulation of a signaling cascade between endocytic compartments and the cytoskeletal uptake machinery at the plasma membrane. Assuming that Gp70 acts downstream of AlyA, gene-expression profiling of both mutants revealed different and overlapping sets of misregulated genes that might participate in this signaling cascade. Based on these results, we analyzed the effects of the artificial misregulation of six candidate genes by over-expression or negative genetic interference, in order to reconstruct at least part of the signaling pathway. SSB420 and SSL793 were chosen as candidates for the first signaling step, as they were up-regulated in AlyA-null cells and remained unaltered in the Gp70 over-expressing cells. The over-expression of SSB420 enhanced phagocytosis and raised the expression levels of Gp70, supporting its involvement in the signaling pathway between AlyA and Gp70 as a positive regulator of phagocytosis. However, this was not the case of cells over-expressing SSL793, as this mutation had no effects on phagocytosis. For the signaling downstream of Gp70, we studied four commonly misregulated genes in AlyA-depleted and Gp70 over-expressing cells. The expression levels of SLB350, SSB389 and TipD were lower in both mutants and therefore these were assumed as possible candidates for the negative regulation of phagocytosis. Cells depleted of SLB350 exhibited an increased phagocytic activity and no effect on Gp70 expression, proving its participation in the signaling pathway downstream of Gp70. Unlike SLB350, the disruption of the genes coding for SSB389 and TipD had no effects on particle uptake, excluding them from the pathway. The fourth candidate was Yipf1, the only gene that was commonly up-regulated in both mutants. Yet, the artificial over-expression of this protein had no effects on phagocytosis, so this candidate is also not included in the signaling pathway. Furthermore, localizing the products of the candidate genes within the cell helped unveiling several cellular organelles that receive signals from the phagosome and transduce them towards the uptake machinery.

Loss of wobble uridine modification in tRNA anticodons interferes with TOR pathway signaling

Previous work in yeast has suggested that modification of tRNAs, in particular uridine bases in the anticodon wobble position (U34), is linked to TOR (target of rapamycin) signaling. Hence, U34 modification mutants were found to be hypersensitive to TOR inhibition by rapamycin. To study whether this involves inappropriate TOR signaling, we examined interaction between mutations in TOR pathway genes (tip41Δ, sap190Δ, ppm1Δ, rrd1Δ) and U34 modification defects (elp3Δ, kti12Δ, urm1Δ, ncs2Δ) and found the rapamycin hypersensitivity in the latter is epistatic to drug resistance of the former. Epistasis, however, is abolished in tandem with a gln3Δ deletion, which inactivates transcription factor Gln3 required for TOR-sensitive activation of NCR (nitrogen catabolite repression) genes. In line with nuclear import of Gln3 being under control of TOR and dephosphorylation by the Sit4 phosphatase, we identify novel TOR-sensitive sit4 mutations that confer rapamycin resistance and importantly, mislocalise Gln3 when TOR is inhibited. This is similar to gln3Δ cells, which abolish the rapamycin hypersensitivity of U34 modification mutants, and suggests TOR deregulation due to tRNA undermodification operates through Gln3. In line with this, loss of U34 modifications (elp3Δ, urm1Δ) enhances nuclear import of and NCR gene activation (MEP2, GAP1) by Gln3 when TOR activity is low. Strikingly, this stimulatory effect onto Gln3 is suppressed by overexpression of tRNAs that usually carry the U34 modifications. Collectively, our data suggest that proper TOR signaling requires intact tRNA modifications and that loss of U34 modifications impinges on the TORsensitive NCR branch via Gln3 misregulation.

Signaling of Pigment-Dispersing Factor (PDF) in the Madeira Cockroach Rhyparobia maderae

The insect neuropeptide pigment-dispersing factor (PDF) is a functional ortholog of vasoactive intestinal polypeptide, the coupling factor of the mammalian circadian pacemaker. Despite of PDF's importance for synchronized circadian locomotor activity rhythms its signaling is not well understood. We studied PDF signaling in primary cell cultures of the accessory medulla, the circadian pacemaker of the Madeira cockroach. In Ca2+ imaging studies four types of PDF-responses were distinguished. In regularly bursting type 1 pacemakers PDF application resulted in dose-dependent long-lasting increases in Ca2+ baseline concentration and frequency of oscillating Ca2+ transients. Adenylyl cyclase antagonists prevented PDF-responses in type 1 cells, indicating that PDF signaled via elevation of intracellular cAMP levels. In contrast, in type 2 pacemakers PDF transiently raised intracellular Ca2+ levels even after blocking adenylyl cyclase activity. In patch clamp experiments the previously characterized types 1–4 could not be identified. Instead, PDF-responses were categorized according to ion channels affected. Application of PDF inhibited outward potassium or inward sodium currents, sometimes in the same neuron. In a comparison of Ca2+ imaging and patch clamp experiments we hypothesized that in type 1 cells PDF-dependent rises in cAMP concentrations block primarily outward K+ currents. Possibly, this PDF-dependent depolarization underlies PDF-dependent phase advances of pacemakers. Finally, we propose that PDF-dependent concomitant modulation of K+ and Na+ channels in coupled pacemakers causes ultradian membrane potential oscillations as prerequisite to efficient synchronization via resonance.

A Hierarchical Cache Coherent Protocol

As the number of processors in distributed-memory multiprocessors grows, efficiently supporting a shared-memory programming model becomes difficult. We have designed the Protocol for Hierarchical Directories (PHD) to allow shared-memory support for systems containing massive numbers of processors. PHD eliminates bandwidth problems by using a scalable network, decreases hot-spots by not relying on a single point to distribute blocks, and uses a scalable amount of space for its directories. PHD provides a shared-memory model by synthesizing a global shared memory from the local memories of processors. PHD supports sequentially consistent read, write, and test- and-set operations. This thesis also introduces a method of describing locality for hierarchical protocols and employs this method in the derivation of an abstract model of the protocol behavior. An embedded model, based on the work of Johnson[ISCA19], describes the protocol behavior when mapped to a k-ary n-cube. The thesis uses these two models to study the average height in the hierarchy that operations reach, the longest path messages travel, the number of messages that operations generate, the inter-transaction issue time, and the protocol overhead for different locality parameters, degrees of multithreading, and machine sizes. We determine that multithreading is only useful for approximately two to four threads; any additional interleaving does not decrease the overall latency. For small machines and high locality applications, this limitation is due mainly to the length of the running threads. For large machines with medium to low locality, this limitation is due mainly to the protocol overhead being too large. Our study using the embedded model shows that in situations where the run length between references to shared memory is at least an order of magnitude longer than the time to process a single state transition in the protocol, applications exhibit good performance. If separate controllers for processing protocol requests are included, the protocol scales to 32k processor machines as long as the application exhibits hierarchical locality: at least 22% of the global references must be able to be satisfied locally; at most 35% of the global references are allowed to reach the top level of the hierarchy.