Mining closed patterns in multi-sequence time-series databases

In this paper, we propose an efficient algorithm, called CMP-Miner, to mine closed patterns in a time-series database where each record in the database, also called a transaction, contains multiple time-series sequences. Our proposed algorithm consists of three phases. First, we transform each time-series sequence in a transaction into a symbolic sequence. Second, we scan the transformed database to find frequent patterns of length one. Third, for each frequent pattern found in the second phase, we recursively enumerate frequent patterns by a frequent pattern tree in a depth-first search manner. During the process of enumeration, we apply several efficient pruning strategies to remove frequent but non-closed patterns. Thus, the CMP-Miner algorithm can efficiently mine the closed patterns from a time-series database. The experimental results show that our proposed algorithm outperforms the modified Apriori and BIDE algorithms.     

Design and evaluation of an LQI-based beaconless routing protocol for a heterogeneous MSN

Wireless Networks - In a mobile sensor network with a mobile sink, choosing the next hop depends on the current location of the sink. This necessitates a frequent update of routing paths within the...     

On security of wireless sensor networks: a data authentication protocol using digital signature

Guaranteeing end-to-end data security in wireless sensor networks (WSNs) is important and has drawn much attention of researchers over past years. Because an attacker may take control of compromised sensor nodes to inject bogus reports into WSNs, enhancing data authenticity becomes a necessary issue in WSNs. Unlike PCREF (Yang et al. in IEEE Trans Comput 64(1):4–18, 2015) (LEDS, Ren et al. in IEEE Trans Mobile Comput 7(5):585–598, 2008), digital signature rather than message authentication polynomials (message authentication codes) is adopted by our protocol in en-route filtering. Keeping the advantages of clusters in PCREF and overcoming the drawbacks in LEDS, an enhanced and efficient cluster-based security protocol is proposed in this paper. The proposed protocol can guarantee end-to-end data authentication with the aid of digital signature and exhibits its effectiveness and efficiency through security analysis and performance analysis. Our analytical results show that the proposed protocol significantly outperforms the closely related protocols in the literature in term of security strength and protocol overhead.     

Design of Predictive and Dynamic Energy-Efficient Mechanisms for IEEE 802.16e

Three predictive and dynamic sleep time planning (PDSTP) energy-efficient mechanisms are proposed in this paper to simultaneously improve energy efficiency and packet delay for IEEE 802.16e. To estimate the time instant when a mobile station (MS) should wake up for receiving downlink packets, a prediction method is designed. With the predicted time instant, an MS is then allowed to sleep as much as possible using multiple maximum sleep intervals followed by a smaller sleep interval before the predicted time instant. After the predicted time instant, a few smaller sleep intervals with a trend of constant level (CL), exponential decrease (ED), or linear decrease (LD) can be further arranged. To react to the outlier of prediction, exponential increase for sleep intervals can be extended. The combination of the aforementioned designs then forms our three proposed mechanisms, namely, PDSTP-CL, PDSTP-ED, and PDSTP-LD. Via simulations, we show that PDSTP-CL not only performs better than PDSTP-ED and PDSTP-LD under general situations but also outperforms the standard sleep mode operation of the type-I power saving class (PSC-I) in IEEE 802.16e and the exponential sleep time backoff mechanism (ESTBM) in the literature in terms of energy efficiency and packet delay.     

Modeling the IEEE 802.11e HCCA mode

It was shown that the hybrid coordination function control channel access (HCCA) is capable of guaranteeing quality of service in wireless local area networks. However, there is still no comprehensive analytical model for HCCA. Therefore, novel modeling of pure HCCA based on the cyclic-service queueing system is provided in this paper. Our model is general enough to accept a wide range of schedulers and various types of traffic under the finite buffer policy. Via comparisons with simulations, high accuracy of the analytical model is exhibited. Furthermore, some valuable insights and recommendations on how to improve the HCCA performance are revealed by investigating the HCCA mode through the proposed model.     

Long-term settlement behavior of soft grounds and secondary compression

Abstract

Settlement–time behaviors in the last stage of consolidation are studied both in the laboratory and in the field. It is shown that the long-term settlement–time curves observed in the field are linear with the logarithm of time and the rate of the long-term settlement are analogous to the rate of secondary compression measured in a laboratory. The finite difference consolidation analyses for cohesive soils exhibiting large amounts of secondary compression during primary consolidation provide fairly good predictions of the settlement–time curves observed in the laboratory and in the field. In this paper, the applicability of the secondary compression model established in the laboratory is examined in in situ conditions. The initial rate of secondary compression used in this paper has a predominant influence on the settlement–time curve with different drainage distances. It is emphasized that the assumption for unknown secondary compression behaviors during the primary consolidation has a predominant influence on the settlement–time curve.     

Designing a fair scheduling mechanism for IEEE 802.11 wireless LANs

A fair scheduling mechanism called distributed elastic round robin (DERR) is proposed in this letter for IEEE 802.11 wireless LANs operated in a distributed manner. To quantify the fairness, we not only derive its fairness bound, but also observe the fairness through ratios of throughput and weight using a simulation approach. By numerical comparisons among DERR, distributed deficit round robin (DDRR), and IEEE 802.11e, we demonstrate that DERR outperforms the other two mechanisms in performance and fairness.     

Exploitation of a microfluidic device capable of generating size-tunable droplets for gene delivery

This study presents a new microfluidic chip that generates micro-scale emulsion droplets for gene delivery applications. Compared with conventional methods of droplet formation, the proposed chip can create uniform droplets (size variation <7.1%) and hence enhance the efficiency of the subsequent gene delivery. A new microfluidic chip was developed in this study, which used a new design with a pneumatic membrane chamber integrated into a T-junction microchannel. Traditionally, the size of droplets was controlled by the flow rate ratio of the continuous and disperse phase flows, which can be controlled by syringe pumps. In this study, a pneumatic chamber near the intersection of the T-junction channel was designed to locally change the flow velocity and the shear force. When the upper air chamber was filled with compressed air, the membrane was deflected and then the droplet size could be fine-tuned accordingly. Experimental data showed that using the new design, the higher the air pressure applied to the active tunable membrane, the smaller the droplet size. Finally, droplets were used as carriers for DNA to be transfected into the Cos-7 cells. It was also experimentally found that the size of the emulsion droplets plays an important role on the efficiency of the gene delivery. The preliminary results of this paper have been presented at the 2007 IEEE International Conference of Nano/Molecular Medicine and Engineering (IEEE NANOMED 2007), Macau, China, 6–9 August, 2007.     

Fair round robin binary countdown to achieve QoS guarantee and fairness in WLANs

How to guarantee both quality of service (QoS) and fairness in wireless local area networks (WLANs) is a challenging issue. To touch this issue, a fair medium access control (MAC) scheme called fair round robin binary countdown (FRRBC) adopting the eminent concepts of allowance and binary countdown is proposed in this paper. FRRBC can guarantee QoS for both audio and video with the aid of adaptive adjustment on system parameters and some extra rules designed according to delay bounds. Using multiple mapping functions from allowances to fixed-bit binary numbers to indicate different priorities, FRRBC not only provides guaranteed system performance but also achieves good fairness. Finally, we demonstrate that FRRBC can significantly outperform the enhanced distributed channel access (EDCA) (IEEE 802.11 WG in IEEE Standard for Information technology—Telecommunications and information exchange between systems—Local and metropolitan area networks—Specific requirements—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. Amendment 8: Medium Access Control (MAC) Quality of Service Enhancements, 2005) and the synchronized medium access control (SYN-MAC) (Wu HY et al. in Mobile Netw Appl 11:627–637, 2005) because of its superiority to offer guaranteed QoS for both audio and video, low delay jitter, low blocking ratio, and good fairness. Of course, FRRBC can be illustrated to be a better choice than the enhanced distributed elastic round robin (EDERR) (Ferng HW, Liau HY in IEEE Trans Mobile Comput 8(7):880–894, 2009).