bluuebunny/crossref_metadata_2025_split huggingface dataset:
Ant-Based Reliable Multi-Constrained Anycast Routing for Sensor Networks
Authors: Yu Jianping , Lin Yaping , Wang Yong 
Published: January 2009

Wireless sensor networks (WSNs) are task-specific where the tasks are specified by the users or applications. Energy and delay constraints have had a great impact on the design and operation of the WSNs. As routing plays an important role in data-centric WSNs, there are numerous energy aware routing protocols proposed for WSNs with single sink, generally using multi-hop paths to use the energy more efficiently. But most of them do not consider the communication delay carefully. As many applications of WSNs require real-time communication, the end-to-end delivery delay is another point to be considered, especially for urgent events. When considering the multiple QoS constraints such as the delivery delay and the minimal energy required, the multi-constrained routing is NP-hard. Moreover, WSNs also suffer from a scalability problem as the total number of nodes can reach hundreds or thousands. Thus, sensors located near the sink consume large amounts of energy. The sink is then isolated once they deplete their batteries, and the network fails to function. To cope with the scalability problem, multi-sink configuration is adopted for large-scale WSNs. How to select the optimum sink for packets with different delay and energy constraints in large-scale WSNs is the main problem to be resolved in this paper, which is called the multi-constrained anycast (MCA) problem. Obviously, it is NP-hard. We investigate the MCA problem in resource-constrained WSNs with multiple sinks and two-tier architecture, where the source cluster-heads send collected data to only one optimum sink. To reduce the energy consumption and shorten the delivery delay, a distributed anycast algorithm ARMCA inspired by swarm intelligence of ants is proposed, which can also achieve reliable data gathering during the deployment period. The scheme takes advantage of beneficial clustering and routing emerging in a self-organized way from the positive interaction of ants. The idea of the ACO-based routing is adopted to achieve the good performance of energy-efficiency and delivery delay. Meanwhile, the ant-based clustering is utilized to ensure the reliability. By the combination of the ant-based routing and clustering models, the ARMCA protocol can solve the MCA problem efficiently and flexibly. The simulation results demonstrated that the proposed algorithm can reliably deliver collected events to the optimum sinks efficiently, and has self-recovery capabilities to deal with failures of sensors including the sinks. Not only is the energy cost reduced, but also the delivery delay is shortened significantly when transmitting packets of the named events to the sinks.
The Modeling and the Sensor Fault Diagnosis of a Continuous Stirred Tank Reactor with a Takagi-Sugeno Recurrent Fuzzy Neural Network
Authors: Shi Li , Wang Lijia , Wang Zhizhong 
Published: January 2009

In this paper, a novel Takagi-Sugeno recurrent fuzzy neural network (TSRFNN) is constructed for modeling and sensor fault diagnosis of a Continuous Stirred Tank Reactor (CSTR), a nonlinear dynamic system. The TSRFNN is composed of 9 layers, including premise network and consequence network. The temporal information is embedded in the TSRFNN by adding the feedback connections between the output layer and the input layer of the fuzzy neural network (FNN). It is assumed that the inputs are Gaussian membership functions; the product operation is utilized for the premise and implication, and the weighted center-average method is adopted for defuzzification. The network is a Fuzzy Basis Function(FBF). The general approximation characteristic of the network was proven by the theory reasoning. The identification of the TSRFNN consists of two steps: structure identification and parameter identification. Unsupervised clustering is used to determine the structure of the fuzzy system, the number of fuzzy rules, and the membership functions of the premise using the input-output data of a system. Then in the parameter identification, the Dynamic Backpropagation (DBP) is adopted to determine the membership functions of the conclusion of the fuzzy system. Then the network is applied to the modeling and diagnosis of a CSTR system. The network is applied to set up the sensors models of a CSTR system, including the models of the temperature sensor faults and the models of concentration sensor faults. To set up a high performance diagnosis model, a persistent signal was chosen to sufficiently activate the plant. Finally an Adaptive Threshold Algorithm based on statistics is used to fault diagnose. If there are sensor faults in the CSTR, the bias between the actual output of the plant and the output of the network surpasses the threshold and the faults are detected on-line according to it. The effectiveness of the modeling and diagnosis approach proposed was verified by the simulation results with Matlab. Therefore, the proposed network and the fault diagnosis approach can be employed to a CSTR system successfully and be extended to the modeling and fault detection of other nonlinear systems.
A RM-Based Static Deployment System for Cluster
Authors: Wu Weiguo , Zhang Leiqiang , Wang Lei , Xue Zhenghua 
Published: January 2009

In this paper, a Reliable-Multicast (RM) based static deployment system for cluster is designed which can be functionally divided into three parts: image capture, image transference, and node configuration. Image capture takes the snapshot of the operating system in the source node. Image transference distributes the captured image to target nodes. Node configuration mainly finishes the configuration of some identified information to target nodes. Applying the technology of Image-Based Installation [ 1 ] and an idea of separating the operating system image from service software, this system solves the tedious problems involved when the large-scale cluster is divided into a number of functional pools; using the network transmit model of RM, this system reduces the cost of network bandwidth and significantly improves the efficiency in deployment; combining WOL [ 2 ] and PXE [ 3 ], the system provides the function of single control point and lightens the workload of the system administrator. So this system can solve the problems of current cluster deployment mechanisms, such as inefficiency, imperfection of automated node configuration, and only supporting the Linux-based operating system deployment, etc. The deployment system consists of the deployment server, image servers, and target nodes. The deployment server is the core of the entire deployment system, which provides DHCP and TFTP service to ensure that the deployment control program can finish the deployment of target nodes after the cluster nodes start up from the NIC. Image servers mainly store the images and applications which can be accessed by the deployment server or target nodes by the NFS service. Target nodes are the nodes which need to be deployed in the cluster. Before the deployment process, the image of the source node and the service environment of the deployment server and image server should be prepared. During the deployment, the target node communicates with the deployment server by using PXE and WOL, and then the deployment server deploys the corresponding image and application service to the target nodes through the RM method. Finally, the target nodes finish their configurations. In the same experimental environment, some experiments respectively for this system, clonesys, and a deployment system identified by X have been built. As proved in experiments, this system can build a cluster more quickly and efficiently.
Constructing a Large Scale Wireless Sensors Network and Resources Scheduling among Multiple Personal Area Networks
Authors: Cheng Xiaoliang , Deng Zhidong 
Published: January 2009

Constructing a Large Scale Wireless Sensors NetworkA real challenge of wireless sensors network applications is how to expand it to a larger scale. We proposed the idea of “One Zone Multi-PAN (Personal Area Network)” to build a Large-Scale Wireless Sensors Network (LS-WSN). Its key points include: the elementary component of LS-WSN is PAN; different PANs work on different channels; different PANs use customized policies and execute different tasks; every PAN covers and surveillances the same area, but senses different circumstance information. Based on the idea, we proposed a two-level distributed LS-WSN model. The first level is the PAN-level, which works in a distributed mode. On this level, the up to 16 PANs bridged by a specially designed gateway coexist like a multi-layer sandwich. This gateway is a common children node of different PANs; therefore it can join in different PANs in a time-sharing mode. The second level is the inner-PAN-level, whose work mode is determined by the specific manufacturer. The size of this model can be expanded up to 16 times of the size of a single PAN. Furthermore, QoS of LS-WSN can be guaranteed, data fusion and data management can be simplified and improved. Using Zigbee stack, we set up a prototype system of LS-WSN, whose performances are validated by our experiments. Resources Scheduling among PANsFor executing resource reconfiguration in LS-WSN, we proposed an application framework of resources scheduling (RSAF). Its key principles include: radio channels, superframe time-slots, and energy resources are named as “Common Resources;” “the whole network is more important than a single PAN” in LS-WSN; keep the key PANs alive; the lifespan of a LS-WSN is determined by that of key PANs. RSAF can be comprehended as a collaboration mechanism at PAN level. It includes three components: superframe time-slots scheduling, radio channel scheduling, and energy scheduling. Their algorithms are different. Especially, a typical working cycle of energy scheduling contains four steps. First, the coordinators of different PANs gather different PANs' state information in a piggyback mode. Then the gateway periodically evaluates different PANs' states and makes the decisions of resources scheduling. After that, the specified coordinators send the control messages to certain nodes. Finally, the specified nodes will join and reinforce the key PAN in danger due to certain reasons (e.g., out of energy). Our experimental results validate the feasibility of RSAF in our prototype system.
A Hybrid Collision Resolution Protocol for Passive RFID Tag Identification
Authors: Xin-Qing Yan , Zhou-Ping Yin , You-Lun Xiong 
Published: January 2009

Wireless communication channel collision of RFID system is a key issue that affects the pervasive application of the system, especially for passive RFID system due to the constrained communication ability and energy supply of tags. The collision resolution protocols suggested can be categorized into deterministic tree based protocols and probabilistic frame slot ALOHA based protocols. A hybrid protocol, which combines the query tree protocol and dynamic framed slotted ALOHA protocol, is presented here. In this protocol, at the beginning of each identification frame, the reader broadcasts a query command message which contains a suffix string and integer to indicate a frame size used in this frame to all tags in its vicinity, and every tag whose data match the specified suffix string randomly selects a slot in the frame to transmit its data to the reader. After each round, based on the different occupying situation of slots, the reader re-estimates the number of tags in its range, and according to the identification accuracy required, decides whether to split the group of tags to be identified into sub-groups or not, and adjust the suffix string and select a suitable frame size for the command messages of the following frames. Through this repeated identification and division process, the RFID tags can be identified within a number of frames. Some key factors that influence the efficiency of the identification are also discussed based on binomial distribution model. Three methods for the tag population estimation are examined and their accuracies are compared, and the optimum frame size for the identification of different number of tags is given in consideration of the throughput and efficiency. To verify the performance of the hybrid protocol, a numeric simulation is performed, in which 100 groups of SGTIN-96 encoded tags are generated randomly. Simulation shows that this hybrid protocol outperforms other frame slot ALOHA based collision resolution protocols, especially when there are a large number of RFID tags to be identified. The overall throughput of the hybrid protocol is kept around 34.8% when there are more than 40 tags, near the theoretical maximum value 36.8%. A linear relationship between the number of tags and the total frames and slots required is also observed in the numeric simulation.
READ: Reliability-Guaranteed Data Forwarding Protocol of Correlated Data in Wireless Sensor Networks
Authors: Zhang Zengjun , Luo Hong 
Published: January 2009

Advances in microelectronic mechanical systems (MEMS) and wireless communication technologies have enabled wireless sensor networks (WSNs) to do a wide range of tasks, such as environmental detection, traffic monitoring, and control. WSNs are composed of hundreds or even thousands of sensor nodes. They are designed and implemented for monitoring the physical world, gathering sensed information, and transmitting the generated data packets to interested end users. In emergent event reporting applications, such as forest fire detection and toxic gas leak detection, sensor nodes detect events or phenomena respectively and report sensed data to sink node as soon as possible. WSNs are aiming at gathering integrated information rather than collecting individual data packets. Although each sensor node may seem to be lacking in capability and reliability, a collective effort of the sensor nodes may provide sensing capabilities that satisfy the end users' needs. Since generated data packets at nodes are not independent, data correlation should be taken into consideration. Instead of reporting the raw data at 100% probability, sensor nodes in READ utilize their processing abilities to carry out simple computations locally and report it at the minimal probability. It uses combined methods of multi-point coverage and multi-path forwarding but not doing in-network data aggregation. READ uses ReInforM for multi-path data packets forwarding and controls the number of copies by exploiting the data correlation among neighbor nodes with Data Correlation Processing (DCP) algorithm. To suppress data transmission, READ subtracts redundancy from data packets only using local knowledge of neighbor information and topology. Such suppression of data packets transmissions enables information gathering with the lowest traffic without compromising on the integrated information. Our simulation witnessed the fact that READ ensured the integrated information in event area was gathered and transferred to sink node at a desired level of reliability. The total data transmissions were tremendously cut down and the power consumption was dramatically economized compared with protocols not using DCP (N-DCP).
Packet-Level FEC Research over Wireless Networks
Authors: Liu Lin , Zhang Yunyi , Dong Xiaoshe 
Published: January 2009

Over wireless networks, interference caused by external sources, multipath fading due to terrestrial obstruction, and the mobility of transmitters or receivers will result in bursty errors of transmitted packets. To deal with the problem, a packet-level XOR-FEC (forward error control), which improves an FEC scheme what Nachum Shacham and Paul McKenney proposed in an IEEE conference paper in 1990 named Packet recovery in high-speed networks using coding and buffer management, is proposed. The improved scheme, under certain conditions, can recover packets of both corruption and erasure. Because its main operation only involves the use of exclusive-or (XOR), it is low complexity. The scheme has been simulated and can be implemented with software. Simulation experiment results show that the improved scheme could decrease the number of redundant packets, so that the amount of computing to encode and decode can be saved and under certain conditions the XOR-FEC scheme could decrease the PER (packet error rate) without increasing the redundant rate. From the scheme that Nachum Shacham and Paul McKenney proposed, it can be seen that: The scheme does not provide a method to check errors in a packet, so only lost packets can be recovered but corrupted packets can not be corrected Using both row and column parity packets increases the number of redundant packets While receivers gain packets and correct errors in every batch of packets, there is much delay among batches To improve the scheme of Nachum Shacham and Paul McKenney: Using checksum field in every packet to distinguish damaged packets Only add to each column of the array of data packets a parity packet To recover packets in multimedia data transport, a double-window scheme is proposed to decrease the delay among batches of packets and to smooth the jitter among packets in receivers. Experiments show that by adjusting sending windows, under almost the same PER and redundant rate, improved scheme could recover more packets than a packet-level software FEC scheme based on the Reed-Solomon code. Besides, in an experiment, using the improved XOR-FEC, the packet error rate was reduced from about 5.7% to 0.7% and only around 33.3% of redundant packets were injected
Nosocomial Outbreak of Infection With Pan–Drug-ResistantAcinetobacter baumanniiin a Tertiary Care University Hospital
Authors: Valencia Raquel , Arroyo Luis A. , Conde Manuel , Aldana Josefa M. , Torres María-José , Fernández-Cuenca Felipe , Garnacho-Montero José , Cisneros José M. , Ortiz Carlos , Pachón Jerónimo , Aznar Javier 
Published: January 2009

Objective.TO describe what is, to our knowledge, the first nosocomial outbreak of infection with pan–drug-resistant (including colistin-resistant)Acinetobacter baumannii,to determine the risk factors associated with these types of infections, and to determine their clinical impact.Design.Nested case-control cohort study and a clinical-microbiological study.Setting.A 1,521-bed tertiary care university hospital in Seville, Spain.Patients.Case patients were inpatients who had a pan-drug-resistantA. baumanniiisolate recovered from a clinical or surveillance sample obtained at least 48 hours after admission to an intensive care unit (ICU) during the time of the epidemic outbreak. Control patients were patients who were admitted to any of the “boxes” (ie, rooms that partition off a distinct area for a patient's bed and the equipment needed to care for the patient) of an ICU for at least 48 hours during the time of the epidemic outbreak.Results.All the clinical isolates had similar antibiotic susceptibility patterns (ie, they were resistant to all the antibiotics tested, including Colistin), and, on the basis of repetitive extragenic palindromic-polymerase chain reaction, it was determined that all of them were of the same clone. The previous use of quinolones and glycopeptides and an ICU stay were associated with the acquisition of infection or colonization with pan-drug-resistant A.baumannii.To control this outbreak, we implemented the following multicomponent intervention program: the performance of environmental decontamination of the ICUs involved, an environmental survey, a revision of cleaning protocols, active surveillance for colonization with pan-drug-resistantA. baumannii,educational programs for the staff, and the display of posters that illustrate contact isolation measures and antimicrobial use recommendations.Conclusions.We were not able to identify the common source for these cases of infection, but the adopted measures have proven to be effective at controlling the outbreak.
Serial dilution curve: a new method for analysis of reverse phase protein array data
Authors: Zhang Li , Wei Qingyi , Mao Li , Liu Wenbin , Mills Gordon B. , Coombes Kevin 
Published: January 2009

AbstractReverse phase protein arrays (RPPAs) are a powerful high-throughput tool for measuring protein concentrations in a large number of samples. In RPPA technology, the original samples are often diluted successively multiple times, forming dilution series to extend the dynamic range of the measurements and to increase confidence in quantitation. An RPPA experiment is equivalent to running multiple ELISA assays concurrently except that there is usually no known protein concentration from which one can construct a standard response curve. Here, we describe a new method called ‘serial dilution curve for RPPA data analysis’. Compared with the existing methods, the new method has the advantage of using fewer parameters and offering a simple way of visualizing the raw data. We showed how the method can be used to examine data quality and to obtain robust quantification of protein concentrations.Availability: A computer program in R for using serial dilution curve for RPPA data analysis is freely available at http://odin.mdacc.tmc.edu/~zhangli/RPPA.Contact: lzhangli@mdanderson.org
A novel meta-analysis method exploiting consistency of high-throughput experiments
Authors: Rajaram Satwik 
Published: January 2009

Abstract
Motivation: Large-scale biological experiments provide snapshots into the huge number of processes running in parallel within the organism. These processes depend on a large number of (hidden) (epi)genetic, social, environmental and other factors that are out of experimentalists' control. This makes it extremely difficult to identify the dominant processes and the elements involved in them based on a single experiment. It is therefore desirable to use multiple sets of experiments targeting the same phenomena while differing in some experimental parameters (hidden or controllable). Although such datasets are becoming increasingly common, their analysis is complicated by the fact that the various biological elements could be influenced by different sets of factors.
Results: The central hypothesis of this article is that biologically related elements and processes are affected by changes in similar ways while unrelated ones are affected differently. Thus, the relations between related elements are more consistent across experiments. The method outlined here looks for groups of elements with robust intra-group relationships in the expectation that they are related. The major groups of elements may be identified in this way. The strengths of relationships per se are not valued, just their consistency. This represents a completely novel and unutilized source of information. In the analysis of time course microarray experiments, I found cell cycle- and ribosome-related genes to be the major groups. Despite not looking for these groups in particular, the identification of these genes rivals that of methods designed specifically for this purpose.
Availability: A C++ implementation is available at http://www.rinst.org/ICS/ICS_Programs.tar.gz.
Contact: srajaram@uiuc.edu
Supplementary information: Supplementary data are available at Bioinformatics online.