Date Added: Mar 2011
A fundamental unresolved problem in wireless networks is that of distinguishing packet errors that are caused by deteriorated link conditions and noise, from errors that occur due to packet collisions. In this paper, the authors develop advanced algorithms based on Cyclic Redundancy Check (CRC) that solve this problem. Specifically, their innovation is that they form multiple CRCs, each of which is responsible for a different segment in a packet. The CRCs are appended after each segment. In this way, they can essentially visualize the pattern of errors across the packet. If the number of successive erroneous segments exceeds a thresh-old, they decide in favor of a collision.