Reliable and Secure Cooperative Communication for Wireless Sensor Networks Making Use of Cooperative Jamming with Physical Layer Security

Interference is generally considered as the redundant and unwanted occurrence in wireless communication. This research work proposes a novel cooperative jamming mechanism for scalable networks like wireless sensor networks which makes use of friendly interference to confuse the eavesdropper and increase its uncertainty about the source message. The communication link is built with the help of Information theoretic source and channel coding mechanisms. The whole idea is to make use of normally inactive relay nodes in the selective Decode and Forward cooperative communication and let them work as cooperative jamming sources to increase the equivocation of the eavesdropper. In this work, eavesdropper’s equivocation is compared with the main channel in terms of mutual information and secrecy capacity.     

Correction to: Proposed Model for Radio Wave Attenuation due to Rain (RWAR)

Wireless Personal Communications - A correction to this paper has been published: https://doi.org/10.1007/s11277-021-08370-x     

Data Standardization and Scaling Technique for the Implementation of Human Bond Communication

Wireless Personal Communications - In every walk of life communication plays a vital role. We use five sensory features namely optical, auditory, olfactory, gustatory, and tactile to communicate....     

A Novel Standard Strip and Scaling Technique for Transferring Taste

Human bond communication is termed as communicating the observed data by the five sensory organ from one side to the other via proper channel. We have already achieved success in transmission of two types of data which is observed by the two organs, i.e., eye and ear. Still we have not yet succeeded in the transfer of data detected by the rest three organs namely Nose, Tongue, and Touch. “A Novel Standard Strip And Scaling Technique For Transferring Taste” is a proposed novel method through which we can transfer our taste (gustatory) feeling to others.

     

On optimal call admission control in cellular networks

Two important Quality-of-Service (QoS) measures for current cellular networks are the fractions of new and handoff “calls” that are blocked due to unavailability of “channels” (radio and/or computing resources). Based on these QoS measures, we derive optimal admission control policies for three problems: minimizing a linear objective function of the new and handoff call blocking probabilities (MINOBJ), minimizing the new call blocking probability with a hard constraint on the handoff call blocking probability (MINBLOCK) and minimizing the number of channels with hard constraints on both of the blocking probabilities (MINC). We show that the well-known Guard Channel policy is optimal for the MINOBJ problem, while a new Fractional Guard Channel policy is optimal for the MINBLOCK and MINC problems. The Guard Channel policy reserves a set of channels for handoff calls while the Fractional Guard Channel policy effectively reserves a non-integral number of guard channels for handoff calls by rejecting new calls with some probability that depends on the current channel occupancy. It is also shown that the Fractional policy results in significant savings (20-50\%) in the new call blocking probability for the MINBLOCK problem and provides some, though small, gains over the Guard Channel policy for the MINC problem. Further, we also develop computationally inexpensive algorithms for the determination of the parameters for the optimal policies. This revised version was published online in July 2006 with corrections to the Cover Date.     

Random Mobility and Heterogeneity-Aware Hybrid Synchronization for Wireless Sensor Network

Random mobility of a node in wireless sensor networks (WSNs) causes the frequent changes in the network dynamics with increased cost in terms of energy and bandwidth. During data collections and transmission, they need the additional efforts to synchronize and schedule the activities of nodes. A key challenge is to maintain the global clock scale for synchronization of nodes at different levels to minimize the energy consumption and clock skew. It is also difficult to schedule the activities for effective utilization of slots allocated for aggregated data transmission. The paper proposes the Random Mobility and Heterogeneity-aware Hybrid Synchronization Algorithm (MHS) for WSN. The proposed algorithm uses the cluster-tree for efficient synchronization of CH and nodes in the cluster and network, level-by-level. The network consists of three nodes with random mobility and are heterogeneous regarding energy with static sink. All the nodes and CH are synchronized with the notion of the global timescale provided by the sink as a root node. With the random mobility of the node, the network structure frequently changes causing an increase in energy consumption. To mitigate this problem, MHS aggregate data with the notion of a global timescale throughout the network. Also, the hierarchical structure along with pair-wise synchronization reduces the clock skews hence energy consumption. In the second phase of MHS, the aggregated data packets are passed through the scheduled and synchronized slots using TDMA as basic MAC layer protocol to reduce the collision of packets. The results are extended by using the hybrid approach of scheduling and synchronization algorithm on the base protocol. The comparative results show that MHS is energy and bandwidth efficient, with increased throughput and reduced delay as compared with state-of-the-art solutions.     

A novel yeast expression/secretion system for the recombinant plant thiol endoprotease propapain

A new high-yield yeast expression/secretion system has beenadapted for the plant thiol endoprotease papain. The propapaingene, obtained from Carica papaya fruit, is expressed in theyeast Saccharomyces cerevisiae. The gene was cloned into a FLAGepitope-tagging expression vector downstream of the yeast alphamating factor (-factor) secretion signal sequence. Expressionof the heterologous propapain in yeast is controlled by theglucose-repressible alcohol dehydrogenase isoenzyme II promoter(ADH2). Glycosylated FLAG-tagged propapain is secreted by asocalled ‘super secretor’ strain, pmr1 (ssc1), intothe culture supernatant where it accumulates to {small tilde}1.7mg/1. The proregion contains three consensus N-linked glycosylationsites, whereas there are only two such sites in previously reportedcDNA sequences. Removal of this third N-linked glycosylationsite results in a drastic reduction in the level of proteaseactivity present in the culture supernatant. Two different typesof affinity chromatography were used to purify either propapainor papain. The propapain precursor is autoproteolytically activatedto mature papain (M_r = 24 kDa) using conditions reported previously.The kinetic parameters obtained agree well with the literaturevalues. The yields of active papain are 10-fold higher thanthose previously reported for propapain in other yeast or bacterialexpression systems. This, together with the ease with whichmutant proteins can be made, makes this yeast advantageous fora structure–function analysis of recombinant wild-typeand mutant papain, and possibly for other related cysteine proteasesas well.     

Editorial: Special Issue on “Sustainable Green Environment (SGE)”

Wireless Personal Communications -     

The Threats of Infrastructure Obsolescence to Smart Grid: A Case Study

Network convergence has vital importance due to limited network resources. Though it decreases network cost, it also reduces Quality of Service (QoS) as well. Due to the increase in real-time network applications, such as video conferencing and voice over IP calls, there is a need to achieve fairness in user's demand through QoS. QoS measurement tasks are more challenging and increased network losses in infrastructure less network. QoS is not yet implemented in Wireless Local Area Network (WLAN) using Software Defined Network (SDN). We have proposed a model to support QoS in WLAN using SDN architecture for real-time traffic. It is efficiently utilizing bandwidth and reducing flow starvation due to centralize control. We named it, an Adaptive QoS model. This model allocates queues dynamically to flows using real-time traffic analysis in SDN architecture. A specific queue is allocated to a specific type of traffic. Flows are dynamically switched based on the increase in traffic demand if other queues are under-use. We achieved handsome improvement in Adaptive QoS model rather than a standard QoS model in terms of throughput and losses.