Search

Intrusion and prevention technologies perform reliably in harsh conditions by fortifying many of the world's highest security sites with few defects in high performance. This paper aims to contribute by designing an intrusion/preventive system using a window-based convolutional neural network (CNN), an integrated recurrent neural network (RNN), and autoencoders (AutoE) to detect and test the performance of the intrusion detection system. The data packets were converted to images where the pixels were used as input. The CNN architecture shows a three-layer model with high predictive performance. The result shows high performance on CNN as compared to both RNN and AutoE; CNN seems to resist overfitting more than the rest of the models. The future perspective would be to test the model on other standard methods such as support vector machine (SVM) and dynamic control systems. [ABSTRACT FROM AUTHOR]

The most essential part of any IoT (Internet of Things) model is the wireless network sensors (WSN). The application of these networks combined with the latest technologies relating to IoT provides fast, economical as well as flexible applications. Wireless sensor networks have various applications for IoT where devices combined with the sensors are used for data collection from various environments as well as monitoring of these environments. These networks are highly prone to attacks considering their characteristic nature, which includes self-organization, a topology that is dynamic, large-scale, and constrained on resources. Various models have been proposed for the detection of attacks in these Wireless sensor networks. Although, the recent survey studies on the attacks in this network aims at the methodologies for detecting only one to two kinds of attacks as well as have the absence of performance analysis in detail. This research work proposes a CSAD (consensus-based novel anomaly detection) approach in three steps; first step; each step includes a novel algorithm. A novel distributed algorithm is proposed to classify the anomaly and normal data packets. In the second step level based approach is used for decision implementation to identify the anomaly; also it is responsible for efficient packet transmission. The third step includes discarding the anomaly Moreover, the proposed model is evaluated by inducing the different malicious nodes, and an anomaly detected is observed. Further comparison with the existing model is carried out based on the classified and misclassified packet; through the comparative analysis, it is observed that the Consensus-AD (Anomaly Detection) approach simply outperforms the existing model. A comparative analysis is carried out considering the throughput for model efficiency. Moreover, comparative analysis shows that the proposed model outperforms the existing anomaly detection protocol. The existing model observes a throughput of 80.99% whereas the CSAD model observes a throughput of 81.81%. [ABSTRACT FROM AUTHOR]

Transportation is a cornerstone of every nation's economy. Unfortunately, traffic accidents cause various problems to the government. The significant drivers of fatal accidents, serious injuries, and fatalities are diverse. The type of roads, track structure, climatic conditions, and driver behavior are some of the relevant factors studied, and the report identified. There are nine explanatory variables identified from the data file suitable for analysis, like weather conditions, driver behavior, vehicle type, age of the vehicle, road type, road structure and location of the crash, timings of impact, and month vice categorization impacts. The median of the predictor variables is calculated to understand the collision configuration. The type of roads, track structure, climatic conditions, and driver behavior are some of the relevant factors that are investigated and the relationship identified. This paper examines the leading causes of accidents from road accident registers. It provides an enhanced AODV routing protocol to provide a secure route to transmit the data packets from the vehicular node source to the destination. [ABSTRACT FROM AUTHOR]

When transmitting information in modern networks of automated air traffic control systems, various methods of data exchange control are used, which is caused by the need to ensure the delivery time and the acceptable value of the equivalent error probability. In order to guarantee the delivery of messages, the reliability of the transmitted data is controlled, which is realized by using noise-immune encoding in detection or error correction modes with verification at each of the intermediate switching nodes or directly by the recipient. Thus, to study the probability-time characteristics of data exchange control methods in data exchange networks, it is necessary to analyze the process of packet transmission in the specified modes, taking into account the effect of intermediate switching nodes. In this case, in general, one should take into account both the presence of several data streams from other sources, and the possibility of failures in service at each of the switching nodes. The article describes a mathematical model of data transmission in the receiver error detection mode that allows to investigate the main probabilistic and temporal characteristics of the data transmission process in the networks of automated air traffic control systems in the mode of error detection taking into account additional information flows from other sources and possible failures at the switching nodes.

Copyright of Law / Teise is the property of Vilnius University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Location information plays a pivotal role in geographic routing protocols for packet routing. Network based services provide the location-based services with location information maintained in a distributed manner. In spite of their intimate association, location services and routing need to be considered separately. Hence, in the evaluation of the overheads of geographic routing, the resultant overhead of the location-based service is not reckoned. The projected purpose here is to integrate the protocols of routing and the services based on location, to minimize the routing overhead and latency in communication. Our chief contribution is the reduction of location overhead. We are proposed Geographic Routing Protocol is combined with the Grid Location Service. Instead of placing a request for exact position, the packet is sent to the earlier destination position. As the packet nears the former position, then the exact location is requested. Simulation results satisfactorily establish the complexity of the analysis and positive output regarding latency, the ratio of packet delivery and the overhead of control message. [ABSTRACT FROM AUTHOR]

We consider a wireless sensor node that gathers energy through harvesting and reaps data through sensing. The node has a wireless transmitter that sends out a data packet whenever there is at least one “energy packet” and one “data packet”, where an energy packet represents the amount of accumulated energy at the node that can allow the transmission of a data packet. We show that such a system is unstable when both the energy storage space and the data backlog buffer approach infinity, and we obtain the stable stationary solution when both buffers are finite. We then show that if a single energy packet is not sufficient to transmit a data packet, there are conditions under which the system is stable, and we provide the explicit expression for the joint probability distribution of the number of energy and data packets in the system. Since the two flows of energy and data can be viewed as flows that are instantaneously synchronised, this paper also provides a mathematical analysis of a fundamental problem in computer science related to the stability of the “join” synchronisation primitive.

More and more Internet of Things (IoT) wireless devices have been providing ubiquitous services over the recent years. Since most of these devices are powered by batteries, a fundamental trade-off to be addressed is the depleted energy and the achieved data throughput in wireless data transmission. By exploiting the rate-adaptive capacities of wireless devices, most existing works on energy-efficient data transmission try to design rate-adaptive transmission policies to maximize the amount of transmitted data bits under the energy constraints of devices. Such solutions, however, cannot apply to scenarios where data packets have respective deadlines and only integrally transmitted data packets contribute. Thus, this paper introduces a notion of weighted throughput, which measures how much total value of data packets are successfully and integrally transmitted before their own deadlines. By designing efficient rate-adaptive transmission policies, this paper aims to make the best use of the energy and maximize the weighted throughput. What is more challenging but with practical significance, we consider the fading effect of wireless channels in both offline and online scenarios. In the offline scenario, we develop an optimal algorithm that computes the optimal solution in pseudo-polynomial time, which is the best possible solution as the problem undertaken is NP-hard. In the online scenario, we propose an efficient heuristic algorithm based on optimal properties derived for the optimal offline solution. Simulation results validate the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

According to the characteristics of pipeline structure and multi-core processor structure for packet processing in network detection applications, the horizontal-based parallel architecture model and tree-based parallel architecture model are proposed for packet processing of Snort application. The principle of a tree-based parallel architecture model is to use pipelining and flow-pinning technology to design a processor that is specifically used to capture data packets, and other processors are responsible for other stages of parallel processing of the data packets. The experimental comparison and analysis show that the tree-based parallel architecture model has higher performance on the second-level cache hit ratio, throughput, CPU utilization, and inter-core load balancing compared to the horizontalbased parallel architecture model for packet processing of Snort application. [ABSTRACT FROM AUTHOR]

This paper surveys research on mathematical models that predict the performance of digital devices that operate with intermittent energy sources. The approach taken in this work is based on the “Energy Packet Network” paradigm where the arrival of data to be processed or transmitted, and the energy to operate the system, are modeled as discrete random processes. Our assumption is that these devices will capture energy from intermittent ambient sources such as vibrations, heat or light, and capture it onto electrical energy that may be stored in batteries or capacitors. The devices consume this energy intermittently for processing and for wired or wireless transmission. Thus, both the arrival of energy to the device, and the devices workload, are modeled as random processes. Based on these assumptions, we discuss probability models based on Markov chains that can be used to predict the effective rates at which such devices operate. We also survey related work that models networks of such systems. [ABSTRACT FROM PUBLISHER]

This study is concerned with the linear estimation problem for networked systems with one‐step random delay and multiple packet dropouts. At each moment, the estimator may receive one or two data packets or nothing. The predictor of sensor measurement at the current instant is used as a compensator if the current measurement does not arrive at the estimator. Based on the developed compensation model, the optimal linear estimators including filter, predictor and smoother are proposed by the innovation analysis approach. Compared with the estimators based on the compensation of using the latest measurement previously received in the existing literatures, the proposed estimators have higher estimation accuracy and smaller computational burden. Simulation results show the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

This study addresses the problem of distributed event‐triggered set‐membership filtering for a class of discrete time‐varying systems in the presence of unknown‐but‐bounded noises. First, an event‐triggered mechanism is introduced to choose those necessary data packets to be transmitted. Second, a partial information transmission scheme is proposed, by which, once an event is triggered, not all the information of the data packet, but parts of them are released to the communication network. As a result, communication network resources can be saved significantly. Third, some sufficient conditions on distributed networked set‐membership filtering are derived using a time‐varying convex optimisation approach. Moreover, based on an intersection method, a novel global estimation is proposed to integrate the local estimations by locating the intersection of all the local estimations within a volume‐minimal external ellipsoid. Finally, simulation results demonstrate the feasibility and effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of robust filtering for networked linear time‐varying systems with norm‐bounded modelling uncertainties. Delay and dropout of measurement data in the transmission from sensor to filter are both modelled by a Bernoulli distributed random sequence. Finite‐horizon two‐stage Kalman filters are introduced whether or not the data packets in the network are time stamped. The parameters of robust Kalman filters are determined such that the covariances of the estimation errors are bounded and these upper bounds are guaranteed to be minimal. Novel augmented state vectors are used to extract procedures for computation of filters' parameters. Lastly, simulation results are presented to demonstrate the superior performance of the proposed approach compared the existing methods in the literature. [ABSTRACT FROM AUTHOR]

We consider a wireless sensor node that gathers energy through harvesting and reaps data through sensing. The node has a wireless transmitter that sends out a data packet whenever there is at least one "energy packet" and one "data packet", where an energy packet represents the amount of accumulated energy at the node that can allow the transmission of a data packet. We show that such a system is unstable when both the energy storage space and the data backlog buffer approach infinity, and we obtain the stable stationary solution when both buffers are finite. We then show that if a single energy packet is not sufficient to transmit a data packet, there are conditions under which the system is stable, and we provide the explicit expression for the joint probability distribution of the number of energy and data packets in the system. Since the two flows of energy and data can be viewed as flows that are instantaneously synchronised, this paper also provides a mathematical analysis of a fundamental problem in computer science related to the stability of the "join" synchronisation primitive. [ABSTRACT FROM AUTHOR]

Over the last couple of decades, clustering‐based protocols are believed to be the best for heterogeneous wireless sensor networks (WSNs) because they work on the principle of divide and conquer. In this study, the authors propose and evaluate two new clustering‐based protocols for heterogeneous WSNs, which are called single‐hop energy‐efficient clustering protocol (S‐EECP) and multi‐hop energy‐efficient clustering protocol (M‐EECP). In S‐EECP, the cluster heads (CHs) are elected by a weighted probability based on the ratio between residual energy of each node and average energy of the network. The nodes with high initial energy and residual energy will have more chances to be elected as CHs than nodes with low energy whereas in M‐EECP, the elected CHs communicate the data packets to the base station via multi‐hop communication approach. To analyse the lifetime of the network, the authors assume three types of sensor nodes equipped with different battery energy. Finally, simulation results indicate that the authors protocols prolong network lifetime, and achieve load balance among the CHs better than the existing clustering protocols. [ABSTRACT FROM AUTHOR]

Mobile ad hoc network is a group of nodes that communicate via wireless links in the absence of a fixed infrastructure. The features of MANETs itself pose a number of opportunities and challenges to achieve the security goals that are authenticity, integrity, confidentiality, non-repudiation and availability. Security is an essential component in achieving basic network functions such as packet forwarding, routing and network management. This factor makes security the foremost concern of mobile ad hoc networks. Once it is ensured, only then these networks will gain confidence in the eyes of the commoners. The most effective way to obtain security is via a layered architecture. A layered architecture can provide such advantages as modularity, simplicity, flexibility, and standardization of protocols. Since the layers should be protected from the malicious attacks occurring due to the malicious nodes therefore these nodes must be identified and stopped from acting as authorized nodes or routers. The identification of these nodes is a tedious task since they portray themselves as valid nodes and does not provide any clue to recognize them. The malicious nodes are capable of providing false routing information and can drop some or all the data packets that pass through them. This paper provides the necessity of a layered architecture for security along with the overview of the mobile ad hoc network classification, advantages and disadvantages, vulnerabilities, challenges, applications, security goals and issues, attacks taking place in various layers. [ABSTRACT FROM AUTHOR]

One way to improve the throughput of a wireless ad hoc network at the media access (MAC) layer is to allow as much as possible concurrent transmissions among neighboring nodes. In this paper, we present a novel high-throughput MAC protocol, called Concurrent Transmission MAC(CTMAC), which supports concurrent transmission while allowing the network to have a simple design with a single channel, single transceiver, and single transmission power architecture. CTMAC inserts additional control gap between the transmission of control packets (RTS/CTS) and data packets (DATA/ACK), which allows a series of RTS/CTS exchanges to take place between the nodes in the vicinity of the transmitting or receiving node to schedule possible multiple, concurrent data transmissions. To safeguard the concurrent data transmission, collision avoidance information is included in the control packets and used by the neighboring nodes to determine whether they should begin their transmissions. Also, to isolate the possible interference between DATA packets and ACK packets, a new ACK sequence mechanism is proposed. Simulation results show that a significant gain in throughput can be obtained by the CTMAC protocol compared with the existing work including the IEEE 802.11 MAC protocol. [ABSTRACT FROM PUBLISHER]

In this paper, we present two different strategies of slot synchronization in wavelength-division-multiplexing (WDM) packet-switched slotted-ring networks. Emphasis is given to the architecture behind the WDM optical network demonstrator over rings (WONDER) project, which is based on tunable transmitters and fixed receivers. The WONDER experimental prototype is currently being developed at the laboratories of Politecnico di Torino. In the former strategy, a slot-synchronization signal is transmitted by the master station on a dedicated control wavelength; in the latter, slave nodes achieve slot synchronization aligning on data packets that are received from the master. The performance of both synchronization strategies, particularly in terms of packet-collision probability, was evaluated by simulation. The technique based on transmitting a timing signal on a dedicated control wavelength achieves better performance, although it is more expensive due to the need for an additional wavelength. However, the technique based on aligning data packets that are received from the master, despite attaining lower timing stability, still deserves further study, particularly if limiting the number of wavelengths and receivers is a major requirement. Some experimental results, which were measured on the WONDER prototype, are also shown. Measurement results, together with theoretical findings, demonstrate the good synchronization performance of the prototype. [ABSTRACT FROM PUBLISHER]

Energy conservation is important for ad hoc networks. However, little effort has been made to carefully study the energy cost metrics upon which the design of various energy efficient algorithms is based. More specifically, most existing energy consumption models only considered energy cost of exchanging data packets, although common wireless protocols also need control packets (e.g., ACK) for reliable data transmissions. Without considering the energy cost of exchanging control packets, these existing models tend to underestimate the actual energy consumption, and thus leading to suboptimal energy efficient designs. In this paper, we develop energy consumption models that take into account energy consumption due to data packets, control packets and retransmission. We verify by simulations that our models match the actual energy consumption much better than existing models. In addition, we show that a minimum energy routing protocol based on an accurate model of ours performs much better than those based on existing models [ABSTRACT FROM PUBLISHER]

Abstract: In this paper the process of data transmission in star coupled optical communication networks is modelled as a shop-type scheduling problem, where channels (wavelengths) are treated as machines. We formulate an Open Block problem with the minimum makespan objective () in which a relation of a new type between the operations of each job is introduced: any two operations of a job have identical processing times and may be processed either simultaneously (in a common block) or, alternatively, at disjoint time intervals. We show that the problem is polynomially solvable for 4 machines, NP-hard for 6 machines and strongly NP-hard for a variable number of machines. For the case of a variable number of machines we present a polynomial time -approximation algorithm and prove that there is no polynomial time -approximation algorithm with , unless P=NP. For the case when the number of machines is fixed, we show that the problem admits a linear time PTAS. In addition, we show that the two-machine problem with release dates is NP-hard in the strong sense. [Copyright &y& Elsevier]

In this paper we address the issue of optimizing the performance of data-link and transport protocols running on a system including multiple transmit and receive antennas with a V-BLAST architecture. More specifically, we explore the possibility of adaptively selecting which transmit antennas and which per antenna rates to use as well as the antenna transmit powers in order to maximize the rate of data packets successfully delivered through the system. This is a novel approach with respect to the recent literature which is generally focused on channel capacity optimization. We show that the use of this rate/power adaptation technique, when a data transmission protocol is running over the link, may lead to significant throughput improvements especially at small signal-to-noise ratios. [ABSTRACT FROM PUBLISHER]

The switching speeds of electronics cannot keep up with the transmission capacity offered by optics. All-optical switch fabrics play a central role in the effort to migrate the switching functions to the optical layer. Optical packet switching provides an almost arbitrary fine granularity but faces significant challenges in the processing and buffering of bits at high speeds. Generalized multiprotocol label switching seeks to eliminate the asynchronous transfer mode and synchronous optical network layers, thus implementing Internet protocol over wavelength-division multiplexing. Optical burst switching attempts to minimize the need for processing and buffering by aggregating flows of data packets into bursts. In this paper, we present an extensive overview of the current technologies and techniques concerning optical switching. [ABSTRACT FROM PUBLISHER]

We present a 1 × 2 all-optical packet switch. All the processing of the header information is carried out in the optical domain. The optical headers are recognized by employing the two-pulse correlation principle in a semiconductor laser amplifier in loop optical mirror (SLALOM) configuration. The processed header information is stored in an optical flip-flop memory that is based on a symmetric configuration of two coupled lasers. The optical flip-flop memory drives a wavelength routing switch that is based on cross-gain modulation in a semiconductor optical amplifier. We also present an alternative optical packet routing concept that can be used for all-optical buffering of data packets. In this case, an optical threshold function that is based on a asymmetric configuration of two coupled lasers is used to drive a wavelength routing switch. Experimental results are presented for both the 1 × 2 optical packet switch and the optical buffer switch. [ABSTRACT FROM PUBLISHER]

We present a new flow and congestion control scheme, PLUS (Probe-Loss Utilization Streaming protocol), for distributed multimedia presentation systems. This scheme utilizes probing of the network situation and an effective adjustment mechanism to data loss to support multimedia presentations. The proposed scheme is also designed to scale with increasing number of PLUS-based streaming traffic and to live in harmony with TCP-based traffic. The novelty of the PLUS protocol is that it utilizes the knowledge of its future bottleneck bandwidth in probing the current network situation. This can be achieved by a priori knowledge of the multimedia data before a presentation is requested by a client. Compression schemes like MPEG introduce dependencies on media units. I frames are needed to successfully decode P and B frames, and P frames are needed to decode B frames. A loss of an I or P frame automatically eliminates dependent media units. Our probing scheme increases the successful transmission of critical I and P packets without the overhead of error-correction-schemes. Probing is done using B-frame packets. The advantage is that we use data packets as probe packets. With the PLUS protocol we address the need to avoid congestion rather than react to it. Experiments demonstrate the effectiveness of the approach in utilizing network resources and decreasing loss ratios. [ABSTRACT FROM PUBLISHER]

We present experimental and numerical studies of a novel packet-switch architecture, the data vortex, designed for large-scale photonic interconnections. The selfrouting multihop packet switch efficiently scales to large port counts (>10 k) while maintaining low latencies, a narrow latency distribution, and high throughput. To facilitate optical implementation, the data-vortex architecture employs a novel hierarchical topology, traffic control, and synchronous timing that act to reduce the necessary routing logic operations and buffering. As a result of this architecture, all routing decisions for the data packets are based on a single logic operation at each node. The routing is further simplified by the employment of wavelength division multiplexing (WDM)-encoded header bits, which enable packet-header processing by simple wavelength filtering. The packet payload remains in the optical domain as it propagates through the data-vortex switch fabric, exploiting the transparency and high bandwidths achievable in fiber optic transmission. In this paper, we discuss numerical simulations of the data-vortex performance and report results from an experimental investigation of multihop WDM packet routing in a recirculating test bed [ABSTRACT FROM PUBLISHER]

We propose and demonstrate a new structure of a Data Vortex switch node for all-optical routing of wavelength-division-multiplexing (WDM) 10-Gb/s optical packets. The proposed node consists of two Mach-Zehnder interferometers with integrated semiconductor optical amplifier: an optical and gate and a high-speed optical switch. In the experiment, WDM 10-Gb/s data packets are successfully routed with 1-dB power penalty at a bit-error rate of 10-9. [ABSTRACT FROM PUBLISHER]

We propose a simple all-optical clock recovery technique for short data packets at 160 Gb/s, and beyond, which is based on the concept of using a Fabry-Peacuterot filter (FPF). The novel feature of the technique is the use of a highly nonlinear fiber followed by an optical bandpass filter, centered at the initial carrier wavelength, which acts as an ultrafast power limiter, removing drastically the amplitude modulation of the FPF's output and providing the clock signal [ABSTRACT FROM PUBLISHER]

We demonstrate an all-optical label/payload separation circuit implemented with hybridly integrated semiconductor-optical-amplifier-based Mach-Zehnder switches. It is shown to operate error-free with 40-Gb/s variable length data packets containing 27-1 pseudorandom bit sequence and short guardbands between them. The circuit requires only the data packets as input and its complexity does not increase with label length [ABSTRACT FROM PUBLISHER]

The popularity of wireless ad hoc networks has significantly increased over the past years. As a result, a great scientific effort has been made to develop and implement efficient routing protocols, able to cope with the stochastically varying topology of such networks. We present an efficient routing protocol that combines source routing, caching of routes, and the use of sequence numbers to alleviate the routing load and at the same time increase the successful delivery of data packets. [ABSTRACT FROM PUBLISHER]

In this letter, we demonstrate clock extraction from 10-Gb/s asynchronous short data packets. Successful clock acquisition is achieved from data packets arriving at time intervals of only 1.5 ns, irrespective of their precise phase relation. The clock recovery circuit used consists of a Fabry-Perot filter and an ultrafast nonlinear interferometer gate and requires very short time for synchronization. [ABSTRACT FROM PUBLISHER]

The main focus of this letter is on the non-real-time service where the so-called best effort type of resource management is applicable. Given an amount of data packets to each user, the problem of minimizing the time span to send all the packets is investigated. In particular, the problem is elaborated in the CDMA contest. With Bellman's (1957) principle of optimality, we derive an optimal scheduling, in which users transmit data through a hybrid of CDMA and TDMA. Numerical results show that by having optimal scheduling, we can significantly reduce the transmission time span, and thereby increase the radio network capacity [ABSTRACT FROM PUBLISHER]

We present a power budget analysis for wavelength-division-multiplexed (WDM) optical networks employing subcarrier multiplexing (SCM) for control packets. In packets such networks, the receiver in each node employs two parallel arms for receiving control and data packets. In order to ensure identical transmission quality for both control and data packets, packets we propose to have same packet-error rate (PER) for both of them. This requires a judicious power sharing between the control-arm and the data-arm in a receiver. We present an analytical model to capture this aspect in optical multi-access WDM-SCM networks and examine the relevant power budget issues [ABSTRACT FROM PUBLISHER]

We demonstrate a wavelength-to-time technique for control monitoring bits, data packets, and channel powers in a wavelength-division-multiplexed network. We recover the routing header bits across parallel wavelengths as well as determine the existence of data packets for switching purposes. We show results for a routing-bit monitor of multiple channels with a speed of 2.5 Gb/s and a packet/frame monitor for multiple channels with a speed of 100 MHz [ABSTRACT FROM PUBLISHER]

Respiration rate is an important measure for assessing a patient's health and is typically measured using obtrusive devices. A non‐obtrusive method of estimating respiration rate by taking advantage of data packets being sent from sensor nodes in a wireless body area network is proposed and investigated. In contradistinction to other methods, the proposed method does not require dedicated hardware and does not impose overheads on transmission power and throughput. Instead, it makes use of data packets already being sent to support some other physiological monitoring applications such as cardiac, temperature or motion monitoring. The method is demonstrated on a single subject and results are presented from a study including 40 measurements taken from eight subjects. The mean estimation error in the study was 0.58 breaths per minute. The proposed method can be used to augment wireless body monitoring applications with important respiration rate measurements without imposing overheads on the compact sensor nodes. [ABSTRACT FROM AUTHOR]

Several high‐quality methods for compressing LiDAR data stored in the LAS format have evolved in recent years. They offer good compression for large datasets, but are less efficient on small data packets, which are needed in web applications. This problem is focused on by analysing two state‐of‐the‐art implementations for large LAS datasets and then proposing improvements suitable for small data packets. [ABSTRACT FROM AUTHOR]