Collision Resolution Algorithms for Networks with Spread- Spectrum Capture Capability.

dc.contributor.authorSoroushnejad, M.en_US
dc.contributor.authorGeraniotis, Evaggelos A.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:38:48Z
dc.date.available2007-05-23T09:38:48Z
dc.date.issued1987en_US
dc.description.abstractIn networks which employ spread-spectrum signaling, capture and correct reception of one out of several packets transmitted to a common receiver by contending users is possible. For the case in which all the contending users employ the same spread-spectrum code, the probability of acquiring and retaining capture is evaluated via accurate approximations and tight bounds for direct-sequence, and frequency-hopped spread-spectrum signaling formats. From this probabilistic capture model, a (deterministic) threshold capture model is also derived. Both these models of capture are then incorporated into the binary tree collision resolution algorithm which takes advantage of the capture capability provided by the spread-spectrum signaling. Stable throughputs are evaluated for two types of feedback: (i) feedback with capture (4-ary), in which case the receiver can distinguish between capture and success slots (as well as between idle slots and collision slots as in the ternary feedback non-capture case), and (ii) feedback without capture (ternary) in which case the receiver can not distinguish between capture and success slots.en_US
dc.format.extent911436 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4658
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1987-150en_US
dc.titleCollision Resolution Algorithms for Networks with Spread- Spectrum Capture Capability.en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR_87-150.pdf
Size:
890.07 KB
Format:
Adobe Portable Document Format