Search results for "Network packet"
showing 10 items of 160 documents
Acoustic Detection of Moving Vehicles
2018
This chapter outlines a robust algorithm to detect the arrival of a vehicle of arbitrary type when other noises are present. It is done via analysis of its acoustic signature against an existing database of recorded and processed acoustic signals. To achieve it with minimum number of false alarms, a construction of a training database of acoustic signatures of signals emitted by vehicles using the distribution of the energies among blocks of wavelet packet coefficients (waveband spectra, see Sect. 4.6) is combined with a procedure of random search for a near-optimal footprint (RSNOFP). The number of false alarms in the detection is minimized even under severe conditions such as: signals emi…
Efficient Hybrid Emergency Aware MAC Protocol for Wireless Body Sensor Networks
2018
International audience; In Body Sensor Networks (BSNs), two types of events should be addressed: periodic and emergency events. Traffic rate is usually low during periodic observation, and becomes very high upon emergency. One of the main and challenging requirements of BSNs is to design Medium Access Control (MAC) protocols that guarantee immediate and reliable transmission of data in emergency situations, while maintaining high energy efficiency in non-emergency conditions. In this paper, we propose a new emergency aware hybrid DTDMA/DS-CDMA protocol that can accommodate BSN traffic variations by addressing emergency and periodic traffic requirements. It takes advantage of the high delay …
The Two-Criteria Topological Design Problem in WAN with Delay Constraint: An Algorithm and Computational Results
2003
The problem is concerned with designing of wide area networks (WAN). The problem consists in selection of flow routes, channel capacities and wide area network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to delay constraint. The problem is NP complete. Then, the branch and bound method is used to construct the exact algorithm. Lower bound of the criterion function is proposed. Computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.
PCP: An End-to end Measurement Based Call Admission Control for Real-Time Services Over IP Networks
2000
Distributed end-to-end measurement based connection admission control mechanisms have been recently proposed. The goal of these schemes is to provide tight QoScon trol on a per connection basis by means of measurements taken by the edge nodes and priority based forwarding procedure at internal nodes. Since the additional flows handling procedures are implemented at the border routers and the forwarding mechanisms are for flows aggregates only, the approach is fully scalable and compatible with the IETF Differentiated Service proposal. The aim of this paper is to propose specific schemes and to investigate the advantages and limits of the approach by analyzing the basic mechanisms and evalua…
Per-flow signalling extension across DiffServ domains
2003
This paper describes a framework devised to extend per-flow admission control operation across Differentiated Services domains. Although the specific case of interoperability with RSVP is under discussion, our proposal can be easily adapted to other hop-by-hop signalling protocols. In our framework, DiffSery border routers accomplish three tasks. First, during the set-up phase, flows are mapped onto PHB groups on the basis of their QoS and traffic specifications. Second, signalling packets are tunnelled into IP packets marked as “probes”, where the “probe” marking is a DCSP value associated to the considered PHB Group. Third, when the flow set-up is complete, flow data packets are marked as…
Deadline-based QoS Algorithms for High-performance Networks
2007
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes them impractical for high-performance networks. In this paper, we explore how to adapt efficiently the earliest deadline first family of algorithms to the high-speed networks environments. The results show excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today's technology.
Control for Networked Control Systems with Time Delays and Packet Dropouts
2013
This paper is concerned with the control issue for a class of networked control systems (NCSs) with packet dropouts and time-varying delays. Firstly, the addressed NCS is modeled as a Markovian discrete-time switched system with two subsystems; by using the average dwell time method, a sufficient condition is obtained for the mean square exponential stability of the closed-loop NCS with a desired disturbance attenuation level. Then, the desired controller is obtained by solving a set of linear matrix inequalities (LMIs). Finally, a numerical example is given to illustrate the effectiveness of the proposed method.
A cooperative lifetime extension MAC protocol in duty cycle enabled wireless sensor networks
2011
To reduce energy consumption in wireless sensor networks, the concept of duty cycle is used in many MAC protocols. Although these protocols provide efficient energy-conservation solutions, they cannot resolve the energy hole problem in a multi-hop network, where a few nodes near the sink must relay the packets from the rest of the network, and consequently exhaust their batteries earlier. The previously proposed REACT forwarding protocol triggers the cooperation of several nodes to extend transmission range and hop over the highly burdened node, thereby allowing it to save its energy and extend the lifetime of the network. However, the previous work lacked a MAC protocol with a duty cycle. …
Optimizing the MAC Protocol in Localization Systems Based on IEEE 802.15.4 Networks
2017
Radio frequency signals are commonly used in the development of indoor localization systems. The infrastructure of these systems includes some beacons placed at known positions that exchange radio packets with users to be located. When the system is implemented using wireless sensor networks, the wireless transceivers integrated in the network motes are usually based on the IEEE 802.15.4 standard. But, the CSMA-CA, which is the basis for the medium access protocols in this category of communication systems, is not suitable when several users want to exchange bursts of radio packets with the same beacon to acquire the radio signal strength indicator (RSSI) values needed in the location proce…
Packet loss recovery in an indoor Free Space Optics link using rateless codes
2014
Free Space Optics (FSO) systems present some important advantages if compared to Radio Frequency links, but they can be affected by several impairments that degrade the link quality and availability. In particular, due to temporary interruptions of the line-of-sight condition between the transmitter and the receiver, packet loss can occur during data transmission. In this work, we present an indoor Free Space Optics link, in which we have systematically generated interruptions of the beam. We demonstrate how the application of the most recent rateless codes, i.e., RaptorQ codes, can strongly improve the link quality by reducing packet loss. In particular, results show that the Packet Error …