{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/30471"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/30471","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Fundamentals of the Simplex Communication Channel With Retransmissions","abstract":"The need for multiple access strategies arises whenever a number of users have to share a communication resource, since it is usually either cost prohibitive or impractical to dedicate a communication channel to a particular user. A need for such algorithms arises in many instances, particularly in applications utilizing wireless systems where all users access a common channel or medium. Such random access techniques as ALOHA and slotted ALOHA have been successfully implemented in a number of wireless applications. One of the major drawbacks of these algorithms is the necessity of a return path from the central station to each system user, which makes their use both inefficient and expensive for applications where one-way communication would suffice. For such applications, a need remained for a random access algorithm which can maximize the probability of successful message transmission in a one-way communication environment. A random access technique that addresses the above-mentioned need is developed. With this technique, each user sends an original message of predetermined length to a central receiver. The user then retransmits the message a specified number of times in a predetermined interval reserved for the retransmission process. The time interval between each successive retransmission of a given message is random. Assuming total annihilation of all colliding messages, the expression for the probability of successful transmission of a given message in terms of the major channel parameters is theoretically formulated. This technique offers a significant improvement, compared to a single transmission, in ensuring that a message is successfully received. The actual message collision dynamics in this system are experimentally studied using two different types of direct-sequence spread spectrum receivers, one employing a sliding correlator and the other using a matched filter. The spreading code in such systems offers extra protection for messages against possible interferers. The results indicate that it is often possible to properly receive a given message in the presence of co-channel interferers, thus significantly improving the overall system performance. These results are subsequently incorporated with the propagation data for several different types of microcells to arrive at a more precise theory of the link.","abstract_html":"The need for multiple access strategies arises whenever a number of users have to share a communication resource, since it is usually either cost prohibitive or impractical to dedicate a communication channel to a particular user. A need for such algorithms arises in many instances, particularly in applications utilizing wireless systems where all users access a common channel or medium. Such random access techniques as ALOHA and slotted ALOHA have been successfully implemented in a number of wireless applications. One of the major drawbacks of these algorithms is the necessity of a return path from the central station to each system user, which makes their use both inefficient and expensive for applications where one-way communication would suffice. For such applications, a need remained for a random access algorithm which can maximize the probability of successful message transmission in a one-way communication environment. A random access technique that addresses the above-mentioned need is developed. With this technique, each user sends an original message of predetermined length to a central receiver. The user then retransmits the message a specified number of times in a predetermined interval reserved for the retransmission process. The time interval between each successive retransmission of a given message is random. Assuming total annihilation of all colliding messages, the expression for the probability of successful transmission of a given message in terms of the major channel parameters is theoretically formulated. This technique offers a significant improvement, compared to a single transmission, in ensuring that a message is successfully received. The actual message collision dynamics in this system are experimentally studied using two different types of direct-sequence spread spectrum receivers, one employing a sliding correlator and the other using a matched filter. The spreading code in such systems offers extra protection for messages against possible interferers. The results indicate that it is often possible to properly receive a given message in the presence of co-channel interferers, thus significantly improving the overall system performance. These results are subsequently incorporated with the propagation data for several different types of microcells to arrive at a more precise theory of the link.","abstract_has_math":false,"creators":["Davidson, Boris"],"institution":"Virginia Tech","degree_name":"Ph. D.","degree_level":"doctoral","degree_discipline":"Electrical and Computer Engineering","degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":[],"committee_chairs":["Bostian, Charles W."],"committee_members":["Davis, Nathaniel J. IV","Midkiff, Scott F.","Stutzman, Warren L.","Kohler, Werner E."],"year":1997,"date_issued":"1997-04-14","date_published":"1997-04-14","updated_at":"2026-07-22T22:18:58Z","subjects":["direct-sequence spread spectrum","simplex channel","message collisions","multiple access"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-332122139711101"],"render_values":[{"text":"etd-332122139711101","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/30471","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Bostian, Charles W."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Davis, Nathaniel J. IV","Midkiff, Scott F.","Stutzman, Warren L.","Kohler, Werner E."]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["Davidson, Boris"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T20:21:49Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T20:21:49Z","1998-04-14"]},{"key":"dc:date.issued","label":"Date","values":["1997-04-14"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["direct-sequence spread spectrum","simplex channel","message collisions","multiple access"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-332122139711101"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/30471"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The need for multiple access strategies arises whenever a number of users have to share a communication resource, since it is usually either cost prohibitive or impractical to dedicate a communication channel to a particular user. A need for such algorithms arises in many instances, particularly in applications utilizing wireless systems where all users access a common channel or medium. Such random access techniques as ALOHA and slotted ALOHA have been successfully implemented in a number of wireless applications. One of the major drawbacks of these algorithms is the necessity of a return path from the central station to each system user, which makes their use both inefficient and expensive for applications where one-way communication would suffice. For such applications, a need remained for a random access algorithm which can maximize the probability of successful message transmission in a one-way communication environment. A random access technique that addresses the above-mentioned need is developed. With this technique, each user sends an original message of predetermined length to a central receiver. The user then retransmits the message a specified number of times in a predetermined interval reserved for the retransmission process. The time interval between each successive retransmission of a given message is random. Assuming total annihilation of all colliding messages, the expression for the probability of successful transmission of a given message in terms of the major channel parameters is theoretically formulated. This technique offers a significant improvement, compared to a single transmission, in ensuring that a message is successfully received. The actual message collision dynamics in this system are experimentally studied using two different types of direct-sequence spread spectrum receivers, one employing a sliding correlator and the other using a matched filter. The spreading code in such systems offers extra protection for messages against possible interferers. The results indicate that it is often possible to properly receive a given message in the presence of co-channel interferers, thus significantly improving the overall system performance. These results are subsequently incorporated with the propagation data for several different types of microcells to arrive at a more precise theory of the link."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:title","label":"Title","values":["Fundamentals of the Simplex Communication Channel With Retransmissions"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Bostian, Charles W."],"dc:contributor.committeemember":["Davis, Nathaniel J. IV","Midkiff, Scott F.","Stutzman, Warren L.","Kohler, Werner E."],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["Davidson, Boris"],"dc:date.accessioned":["2014-03-14T20:21:49Z"],"dc:date.available":["2014-03-14T20:21:49Z","1998-04-14"],"dc:date.issued":["1997-04-14"],"dc:description.abstract":["The need for multiple access strategies arises whenever a number of users have to share a communication resource, since it is usually either cost prohibitive or impractical to dedicate a communication channel to a particular user. A need for such algorithms arises in many instances, particularly in applications utilizing wireless systems where all users access a common channel or medium. Such random access techniques as ALOHA and slotted ALOHA have been successfully implemented in a number of wireless applications. One of the major drawbacks of these algorithms is the necessity of a return path from the central station to each system user, which makes their use both inefficient and expensive for applications where one-way communication would suffice. For such applications, a need remained for a random access algorithm which can maximize the probability of successful message transmission in a one-way communication environment. A random access technique that addresses the above-mentioned need is developed. With this technique, each user sends an original message of predetermined length to a central receiver. The user then retransmits the message a specified number of times in a predetermined interval reserved for the retransmission process. The time interval between each successive retransmission of a given message is random. Assuming total annihilation of all colliding messages, the expression for the probability of successful transmission of a given message in terms of the major channel parameters is theoretically formulated. This technique offers a significant improvement, compared to a single transmission, in ensuring that a message is successfully received. The actual message collision dynamics in this system are experimentally studied using two different types of direct-sequence spread spectrum receivers, one employing a sliding correlator and the other using a matched filter. The spreading code in such systems offers extra protection for messages against possible interferers. The results indicate that it is often possible to properly receive a given message in the presence of co-channel interferers, thus significantly improving the overall system performance. These results are subsequently incorporated with the propagation data for several different types of microcells to arrive at a more precise theory of the link."],"dc:description.degree":["Ph. D."],"dc:identifier.other":["etd-332122139711101"],"dc:identifier.uri":["http://hdl.handle.net/10919/30471"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["direct-sequence spread spectrum","simplex channel","message collisions","multiple access"],"dc:title":["Fundamentals of the Simplex Communication Channel With Retransmissions"],"dc:type":["Dissertation"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Ph. D."],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:18:58Z"}