Transmission control protocol (TCP) employs acknowledgement (TCP-ACK) for every transmitted packets to ensure reliable transmission. As a result, it sends the next window after receiving TCP-ACK packet of previous window. This means that earlier arrives, faster TCP transmission and better performances. To do so, there should be special treatment fasten paper proposes collision probability reduc...

This paper provides an updated efficiency analysis of the LightForce space debris collision avoidance scheme. LightForce aims to prevent collisions on warning by utilizing photon pressure from ground based, commercial off the shelf lasers. Past research has shown that a few ground-based systems consisting of 10 kW class lasers directed by 1.5 m telescopes with adaptive optics could lower the ex...

We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functions into strongly collision-resistant ones in the standard model of computation. We measure the level of collision resistance by the maximum probability, over the choice of the key, for which an efficient adversary can ...

The collision between the active American Iridium 33 satellite and the retired Russian Cosmos 2251 satellite on 10 February 2009, is the first on-orbit collision between satellites. As of 1 December 2009, the U.S. space tracking system catalogued 1,632 fragments from the collision, many of which will stay in orbit for decades. This paper estimates the total number, size, area-to-mass ratio, and...

The collision probability tester, introduced by Goldreich and Ron (ECCC, TR00-020, 2000), distinguishes the uniform distribution over [n] from any distribution that is ǫ-far from this distribution using poly(1/ǫ) ·√n samples. While the original analysis established only an upper bound of O(1/ǫ) · √n on the sample complexity, a recent analysis of Diakonikolas, Gouleakis, Peebles, and Price (ECCC...

The method of stable random projections is popular for efficiently computing the lα distances in high dimension (where 0 < α ≤ 2), using small space. Because it adopts nonadaptive linear projections, this method is naturally suitable when the data are collected in a dynamic streaming fashion (i.e., turnstile data streams). In this paper, we propose to use only the signs of the projected data an...

The distributed coordination function (DCF) is the most widely deployed medium access control (MAC) protocol for IEEE 802.11 WLANs. It is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme which employs a binary exponential backoff (BEB) algorithm to reduce the collision probability. In this paper we propose a novel backoff algorithm, collision-aware backoff mechanism (CA...

Intelligent speed adaption (ISA) is one type of vehicle-based intelligent transportation systems (ITS), which warns and regulates driving speed according to the speed limits of the roads. Early field studies showed that ISA could reduce general mean speed levels and their variances in different road environments. This paper studies the effects of various ISA penetration grades on pedestrian saf...