Abstract: A method is provided for combining corrupted messages received in a wireless network which comprises the following steps: (a) receiving a first message transmitted from one of a plurality of communication devices, wherein that first message is received as a corrupted message; (b) following the receipt of the first corrupted message, receiving a first plurality of messages, wherein the first plurality of messages are received as corrupted messages and wherein at least one of the first plurality of corrupted messages is essentially identical to the first message; (c) combining the first corrupted message with the at least one of the first plurality of corrupted messages that is essentially identical to that first message to form a combined message; and (d) deriving from the combined message information which was transmitted within the first message.

Abstract: A method is provided for combining corrupted messages received in a wireless network which comprises the following steps: (a) receiving a first message transmitted from one of a plurality of communication devices, wherein that first message is received as a corrupted message; (b) following the receipt of the first corrupted message, receiving a first plurality of messages, wherein the first plurality of messages are received as corrupted messages and wherein at least one of the first plurality of corrupted messages is essentially identical to the first message; (c) combining the first corrupted message with the at least one of the first plurality of corrupted messages that is essentially identical to that first message to form a combined message; and (d) deriving from the combined message information which was transmitted within the first message.

Abstract: A method is provided for combining corrupted messages received in a wireless network which comprises the following steps: (a) receiving a first message transmitted from one of a plurality of communication devices, wherein that first message is received as a corrupted message; (b) following the receipt of the first corrupted message, receiving a first plurality of messages, wherein the first plurality of messages are received as corrupted messages and wherein at least one of the first plurality of corrupted messages is essentially identical to the first message; (c) combining the first corrupted message with the at least one of the first plurality of corrupted messages that is essentially identical to that first message to form a combined message; and (d) deriving from the combined message information which was transmitted within the first message.

Abstract: A novel and useful distributed synchronization mechanism. The synchronization loop of each station on the shared media based network considers only synchronization signals received having a time phase earlier than the time phase of its internal clock. From among the plurality of synchronization signals received by a given station having a time phase earlier than that of its internal clock, only the earliest of the received synchronization signals is considered. This allows the use of a second order synchronization tracking loop wherein both the phase and rate of the internal clock are tracked and adjusted. The station with the fastest internal clock effectively functions as an ad-hoc synchronization master for all stations in a given maximum connected group.

Abstract: A novel and useful distributed synchronization mechanism. The synchronization loop of each station on the shared media based network considers only synchronization signals received having a time phase earlier than the time phase of its internal clock. From among the plurality of synchronization signals received by a given station having a time phase earlier than that of its internal clock, only the earliest of the received synchronization signals is considered. This allows the use of a second order synchronization tracking loop wherein both the phase and rate of the internal clock are tracked and adjusted. The station with the fastest internal clock effectively functions as an ad-hoc synchronization master for all stations in a given maximum connected group.