Human Motion Tracking With Wireless Wearable Sensor Network: Experience and Lessons

( Jianxin Chen ),( Liang Zhou ),( Yun Zhang ),( David Fondo Ferreiro ) 한국인터넷정보학회 2013 KSII Transactions on Internet and Information Syst Vol.7 No.5

Wireless wearable sensor networks have emerged as a promising technique for human motion tracking due to the flexibility and scalability. In such system several wireless sensor nodes being attached to human limb construct a wearable sensor network, where each sensor node including MEMS sensors (such as 3-axis accelerometer, 3-axis magnetometer and 3-axis gyroscope) monitors the limb orientation and transmits these information to the base station for reconstruction via low-power wireless communication technique. Due to the energy constraint, the high fidelity requirement for real time rendering of human motion and tiny operating system embedded in each sensor node adds more challenges for the system implementation. In this paper, we discuss such challenges and experiences in detail during the implementation of such system with wireless wearable sensor network which includes COTS wireless sensor nodes (Imote 2) and uses TinyOS 1.x in each sensor node. Since our system uses the COTS sensor nodes and popular tiny operating system, it might be helpful for further exploration in such field.

Conflicts in Overlay Environments: Inefficient Equilibrium and Incentive Mechanism

( Jianxin Liao ),( Jun Gong ),( Shan Jiang ),( Tonghong Li ),( Jingyu Wang ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.5

Overlay networks have been widely deployed upon the Internet by Service Providers (SPs) to provide improved network services. However, the interaction between each overlay and traffic engineering (TE) as well as the interaction among co-existing overlays may occur. In this paper, we adopt both non-cooperative and cooperative game theory to analyze these interactions, which are collectively called hybrid interaction. Firstly, we model a situation of the hybrid interaction as an n+1-player non-cooperative game, in which overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE) for this game. Secondly, we model another situation of the hybrid interaction as a 1-leader-n-follower Stackelberg-Nash game, in which TE is the leader and co-existing overlays are followers, and prove that the cost at Stackelberg-Nash equilibrium (SNE) is at least as good as that at NE for TE. Thirdly, we propose a cooperative coalition mechanism based on Shapley value to overcome the inherent inefficiency of NE and SNE, in which players can improve their performance and form stable coalitions. Finally, we apply distinct genetic algorithms (GA) to calculate the values for NE, SNE and the assigned cost for each player in each coalition, respectively. Analytical results are confirmed by the simulation on complex network topologies.

Topology-aware Virtual Network Embedding Using Multiple Characteristics

( Jianxin Liao ),( Min Feng ),( Tonghong Li ),( Jingyu Wang ),( Sude Qing ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.1

Network virtualization provides a promising tool to allow multiple heterogeneous virtual networks to run on a shared substrate network simultaneously. A long-standing challenge in network virtualization is the Virtual Network Embedding (VNE) problem: how to embed virtual networks onto specific physical nodes and links in the substrate network effectively. Recent research presents several heuristic algorithms that only consider single topological attribute of networks, which may lead to decreased utilization of resources. In this paper, we introduce six complementary characteristics that reflect different topological attributes, and propose three topology-aware VNE algorithms by leveraging the respective advantages of different characteristics. In addition, a new KS-core decomposition algorithm based on two characteristics is devised to better disentangle the hierarchical topological structure of virtual networks. Due to the overall consideration of topological attributes of substrate and virtual networks by using multiple characteristics, our study better coordinates node and link embedding. Extensive simulations demonstrate that our proposed algorithms improve the long-term average revenue, acceptance ratio, and revenue/cost ratio compared to previous algorithms.

Comparative transcriptome analysis of differentially expressed genes between the curly and normal leaves of Cymbidium goeringii var. longibracteatum

Jianxin Fu,Huijuan Ning,Chao Zhang,Yirong Fan 한국유전학회 2016 Genes & Genomics Vol.38 No.10

Normal and the spontaneous spirally rolled leaves of Cymbidium goeringii var. longibracteatum were used for RNA sequencing analyses using the Illumina paired-end sequencing technique to figure out the differently- expressed genes in two samples. About 5.65 and 4.82 Gb sequencing data of raw reads were obtained from 2 cDNA libraries of normal and the spirally rolled leaves respectively. After data filtering, quality checks and de novo assembly, a total of 48,935 unigenes with an average sequence length of 820 nt were generated. In addition, the transcriptome change in normal and the spirally rolled leaves was investigated. With non-redundant annotation, 219 differentially expressed genes (DEGs) are identified, with 147 up-regulated genes and 72 down-regulated genes. Out of these DEGs, 21 DEGs (9.59 %) were involved in cell wall modeling enzymes, such as expansin, xyloglucan endo-transglycosylase, pectate lyase, cell wall-associated hydrolase. Besides, other DEGs were predominantly classified as genes involved in transcription factor and signal sense and transduction signaling. This study presents the first comprehensive characterization of the leave transcriptomes of Cymbidium goeringii var. longibracteatum. This study not only gave us valuable sequence resources of this species, but also provided theoretical foundation for cultivar breeding of leaf mutation in C. goeringii var. longibracteatum.

Robust Design of Coordinated Set Planning with the Non-Ideal Channel

( Jianxin Dai ),( Shuai Liu ),( Ming Chen ),( Jun Zhou ),( Jie Qi ),( Jingwei Liang ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.5

In practical wireless systems, the erroneous channel state information (CSI) sometimes deteriorates the performance drastically. This paper focuses on robust design of coordinated set planning of coordinated multi-point (CoMP) transmission, with respect to the feedback delay and link error. The non-ideal channel models involving various uncertainty conditions are given. After defining a penalty factor, the robust net ergodic capacity optimization problem is derived, whose variables to be optimized are the number of coordinated base stations (BSs) and the divided area`s radius. By the maximum minimum criterion, upper and lower bounds of the robust capacity are investigated. A practical scheme is proposed to determine the optimal number of cooperative BSs. The simulation results indicate that the robust design based on maxmin principle is better than other precoding schemes. The gap between two bounds gets smaller as transmission power increases. Besides, as the large scale fading is higher or the channel is less reliable, the number of the cooperated BSs shall be greater.

A Data Gathering Approach for Wireless Sensor Network with Quadrotor-based Mobile Sink Node

( Jianxin Chen ),( Yuanyuan Chen ),( Liang Zhou ),( Yuelin Du ) 한국인터넷정보학회 2012 KSII Transactions on Internet and Information Syst Vol.6 No.10

In this paper, we use a quadrotor-based mobile sink to gather sensor data from the terrestrial deployed wireless sensor network. By analyzing the flight features of the mobile sink node, we theoretically study the flight constraints of height, velocity, and trajectory of the mobile sink node so as to communicate with the terrestrial wireless sensor network. Moreover, we analyze the data amount which the mobile sink can send when it satisfies these flight constraints. Based on these analysis results, we propose a data acquisition approach for the mobile sink node, which is discussed detailed in terms of network performance such as the transmission delay, packet loss rate, sojourning time and mobile trajectory when given the flying speed and height of the mobile sink node. Extensive simulation results validate the efficiency of the proposed scheme.

Load-Balanced One-hop Overlay Multipath Routing with Path Diversity

( Jianxin Liao ),( Shengwen Tian ),( Jingyu Wang ),( Tonghong Li ),( Qi Qi ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.2

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.

Identification of floral aromatic volatile compounds in 29 cultivars from four groups of Osmanthus fragrans by gas chromatography–mass spectrometry

Jianxin Fu,Dan Hou,Yiguang Wang,Chao Zhang,Zhiyi Bao,Hongbo Zhao,Shaoqing Hu 한국원예학회 2019 Horticulture, Environment, and Biotechnology Vol.60 No.4

Osmanthus fragrans Lour. is a popular aromatic ornamental plant and its fl owers are used to enhance the color and fragrance of food. In this study, we analyzed the volatiles of 29 cultivars from all four groups of O. fragrans using a solid-phase microextraction (SPME) technique and gas chromatography–mass spectrometry (GC–MS). We identifi ed 41 volatile organic components that were distributed over fi ve diff erent compound classes, with the majority of the volatile components being dominated by alcohols, ketones, and terpenes, which accounted for 56.6–95.06% of the total volatiles in all tested materials except ‘Zao Yingui’. In ‘Zao Yingui’, alcohols, ketones, and terpenes accounted for only 48.19% of the total volatiles. The diversity of the volatile compounds and their relative contents varied among the four groups and cultivars within each group. The major volatile compounds were α-ionone, β-ionone, 2H-β-ionone, linalool, trans -linalool oxide, cis -linalool oxide, epoxy linalool, geraniol ( Z )-ocimene, and γ-decalactone in all tested cultivars, while nerol and ( Z )-3-hexenyl butanoic acid ester were abundant in several cultivars. The 29 cultivars were classifi ed into fi ve clusters in a hierarchical cluster analysis based on their fl oral volatile compounds. The cultivars of diff erent sexes (male vs. hermaphrodite) had no signifi cant diff erences in the relative contents of the major volatile compounds. This study provides valuable information for understanding the chemical composition of the volatile compounds of O. fragrans fl owers as well as a theoretical basis for the origin, development, and application of modern cultivars of O. fragrans.

Polymer/Carbon Nanomaterial Composites and Energy Storage Technologies

Jianxin Geng 한국고분자학회 2018 한국고분자학회 학술대회 연구논문 초록집 Vol.43 No.2

An Efficient Markerless Deletion System Suitable for the Industrial Strains of Streptomyces

( Jianxin Dong ),( Jiaxiu Wei ),( Han Li ),( Shiyao Zhao ),( Wenjun Guan ) 한국미생물 · 생명공학회 2021 Journal of microbiology and biotechnology Vol.31 No.12

The genus Streptomyces is intensively studied due to its excellent ability to produce secondary metabolites with diverse bioactivities. In particular, adequate precursors of secondary metabolites as well as sophisticated post modification systems make some high-yield industrial strains of Streptomyces the promising chassis for the heterologous production of natural products. However, lack of efficient genetic tools for the manipulation of industrial strains, especially the episomal vector independent tools suitable for large DNA fragment deletion, makes it difficult to remold the metabolic pathways and streamline the genomes in these strains. In this respect, we developed an efficient deletion system independent of the episomal vector for large DNA fragment deletion. Based on this system, four large segments of DNA, ranging in length from 10 kb to 200 kb, were knocked out successfully from three industrial Streptomyces strains without any marker left. Notably, compared to the classical deletion system used in Streptomyces, this deletion system takes about 25% less time in our cases. This work provides a very effective tool for further genetic engineering of the industrial Streptomyces.