KR101812147B1 - Fairness-based message transmission in a wireless network - Google Patents

Abstract

Methods, devices, and systems for enabling fair message transmission and reducing the maximum power consumption of stations in a wireless network are described. For example, a first station in a wireless network may send a message containing one neighbor list to a second station in the wireless network. The first neighbor list may identify one or more stations within a particular range of the first station. The second station may selectively transmit a copy of the message containing the second neighbor list to another station of the wireless network based on the comparison and the random countdown between the first neighbor list and the second neighbor list. The second neighbor list may identify one or more stations within a particular range of the second station.

Description

[0001] FAIRNESS-BASED MESSAGE TRANSMISSION IN A WIRELESS NETWORK IN A WIRELESS NETWORK [0002]

[0001] The present application claims priority to U.S. Provisional Patent Application No. 61 / 949,842, filed March 7, 2014, and U.S. Patent Application No. 14 / 638,815, filed March 4, 2015, , The contents of which are expressly incorporated by reference in their entirety.

[0002] This disclosure relates generally to fairness-based message transmission within a wireless network.

[0003] Advances in technology have resulted in smaller and more powerful computing devices. There are a variety of portable personal computing devices, including, for example, wireless computing devices, such as portable wireless telephones, personal digital assistants (PDAs), and paging devices that are small, lightweight and easily carried by a user. More specifically, portable wireless telephones, such as cellular telephones and Internet Protocol (IP) telephones, are capable of communicating voice and data packets over wireless networks. Also, many such wireless telephones include other types of devices included therein. For example, a cordless telephone may also include a digital still camera, a digital video camera, a digital recorder, and an audio file player. In addition, such wireless telephones can process executable instructions, including software application programs, such as web browser applications, which can be used to access the Internet. As such, these wireless telephones may include significant computing capabilities.

[0004] A wireless mesh network may be formed by wireless phones and other wireless devices that communicate data between wireless devices without management by a central node (eg, an access point) or server. For example, the Institute of Electrical and Electronics Engineers (IEEE) 802.11s is a standardized set of wireless mesh network communication protocols. In 802.11s, stations (e.g., wireless devices) in a wireless mesh network may receive messages addressed to multiple stations, such as multicast messages and broadcast messages. Each station receives and transmits (e. G., Forwarding) messages to neighboring stations (e. G., Stations within a one-hop range) to propagate messages across the wireless mesh network. Forwarding messages at each station adds traffic and overhead to the wireless mesh network. One proposed alternative includes a topology-based transmission scheme and a probability forwarding scheme. However, if the location of any station is changed, maintaining the topology awareness results in additional overhead because the network topology is updated. In addition, probability forwarding reduces the reliability of message reception. Also, the proposed alternatives do not take into account the relative power consumption of each of the stations. For example, in some topologies, other stations may consume less power to livecast a smaller percentage of messages, while a particular station may be responsible for ribbroadcasting a larger percentage of messages, A large power consumption may occur.

[0005] The present disclosure improves fairness associated with power consumption and reduces power consumption associated with message propagation at each station in a wireless network, as compared to conventional IEEE 802.11s wireless mesh networks. Instead of each station transmitting (e.g., forwarding) a received message, such as a multicast transmission or a broadcast transmission, each station determines whether to send a message based on analyzes of station-specific neighbor lists do. For example, a source (e.g., a first station) of a message may be associated with a message and neighboring stations of a first station, such as a station that identifies one or more stations within a one- 1 Send the neighbor list. If the message is a multicast transmission, the neighbor list may be a multicast-specific neighbor list. A multicast-specific neighbor list of a station may include fewer neighbors than all of its neighbors. When the second station receives the message and the first neighbor list, the second station compares the first neighbor list to its own neighbor list (e.g., the second neighbor list) Neighboring stations (e.g., one or more stations within the one-hop range of the second station). The second station may identify at least one station for which the second neighbor list is not identified by the first neighbor list (e.g., at least one station is outside the range of the first station but within the range of the second station , The second station transmits the message and the second neighbor list. Each station identified by the first neighbor list is also identified by the second neighbor list (e.g., each station within the one-hop range of the second station is also within the one-hop range of the first station , The transmission of the message at the second station is suppressed. In this manner, the second terminal does not consume power to transmit a message if each of its neighboring stations is identified by the first neighbor list received in the message. The second station can save power because each neighbor station must receive a message from the first station, as shown by the first neighbor list.

[0006] Fairness associated with power consumption can be facilitated through the use of random countdowns before message transmission. For example, the second station and the third station may receive the message and the first neighbor list from the first station. Each of the second and third stations may initiate a countdown from a station-specific randomly selected countdown value in response to a determination to send a message (e.g., based on a neighbor list analysis). If the countdown is to be completed at the second station before the third station, the second station sends (e. G., Forwarding or ribbroadcasting) the message and the second neighbor list . For example, the second station may ribcrod the message with the second neighbor list instead of the first neighbor list. The third station may receive the message and the second neighbor list from the second station before the countdown is completed at the third station. The third station may suppress the transmission of the message based on the comparison between the third neighbor list and the second neighbor list generated by the third station. For example, the third station may stop the countdown if each station identified by the third neighbor list is also identified by the second neighbor list and no other messages are pending transmission / forwarding . Each station can randomly select or pseudo-randomly select a station-specific countdown value, allowing each station to send a random (e.g., For example, fair) opportunities.

[0007] Additionally, the second station may monitor a plurality of messages (and neighbor lists) received from a particular station (e.g., a third station) for a particular time period. The number of messages received from the third station may represent the level of contribution of the third station to message propagation within the wireless network and may be determined from the number of messages sent from the wireless network to the third station (e.g., Can be the basis for removal. For example, the second station may determine whether to transmit the network key to a particular station based on the number of messages. By inhibiting the transmission of the network key, if the particular station does not contribute sufficiently to the propagation of the message (e.g., as indicated by the number of messages received at the second station The second station can efficiently remove (e.g., evict) a particular station from the wireless network because it will not be able to decrypt the received messages.

[0008] In a particular aspect, a method includes generating a first neighbor list at a first station of a wireless network. The neighbor list may identify one or more stations within a specific range of the first station. The method includes transmitting a first message comprising a first neighbor list to a second station of a wireless network.

[0009] In another particular aspect, an apparatus includes a processor and a memory coupled to the processor. The memory stores instructions executable by the processor to perform operations including generating a first neighbor list at a first station of the wireless network. The first neighbor list identifies one or more stations within a particular range of the first station. The operations further comprise transmitting a first message comprising a neighbor list to a second station of the wireless network.

[0010] In another particular aspect, the apparatus comprises means for generating a first neighbor list at a first station of the wireless network. The first neighbor list identifies one or more stations within a particular range of the first station. The apparatus further comprises means for transmitting a first message comprising a first neighbor list to a second station of the wireless network.

[0011] Other specific aspects, non-volatile computer readable media include instructions that, when executed by a processor, cause the processor to generate a neighbor list at a first station of the wireless network. The neighbor list identifies one or more stations within a particular range of the first station. The instructions further cause the processor to send a message containing a neighbor list to a second station of the wireless network.

[0012] One advantage offered by at least one of the disclosed implementations is a reduction in power consumption associated with message propagation of stations in the wireless network as compared to wireless mesh networks operating in accordance with the IEEE 802.11s standard. For example, selective transmission (e.g., forwarding) of a received message based on neighbor list analysis may allow stations to suppress transmission of the message (e.g., if neighboring stations have already received the message) So that each station reduces power consumption at one or more stations as compared to forwarding a particular message at wireless mesh networks. Additionally, the fairness associated with power consumption can be facilitated through the use of countdowns from selected random values or pseudo-random values in each of the stations, thereby allowing each station to make a "fair " "I can get a chance. Other aspects, advantages, and features of the disclosure will become apparent after review of the following sections, including a brief description of the drawings, a detailed description, and the appended claims.

[0013] FIG. 1 is a diagram of a particular aspect of a system that includes a wireless network that supports selective transmission of messages and station-specific neighbor lists.
[0014] FIG. 2 is a diagram illustrating additional transmission of message and station-specific neighbor lists in the system of FIG. 1;
[0015] FIG. 3 is a diagram of a first illustrative example of message and station-specific neighbor list transmission in a wireless network.
[0016] FIG. 4 is a diagram of a second illustrative example of message and station-specific neighbor list transmission in a wireless network.
[0017] FIG. 5 is a flow diagram of an exemplary method for transmitting a message and neighbor list in a wireless network.
[0018] FIG. 6 is a flow diagram of an exemplary method for selectively transmitting a message and a neighbor list in a wireless network.
[0019] FIG. 7 is a flow diagram of an exemplary method for selectively removing a station from a wireless network based on the number of messages received during a particular time period.
[0020] FIG. 8 is a diagram of a wireless device operable to support various aspects of one or more of the methods, systems, devices, and / or computer-readable media disclosed herein.

[0021] Certain aspects of the disclosure are described below with reference to the drawings. In the description, common features are designated by common reference numerals throughout the figures.

[0022] Referring to FIG. 1, there is shown a particular exemplary aspect of a system 100 that includes a wireless network that supports selective transmission of messages and station-specific neighbor lists. The system 100 includes a first station STA_1 104, a second station STA_2 106, a third station STA_3 108, a fourth station STA_4 110, a fifth station STA_5 ) 112, and a sixth station (STA_6, 114).

[0023] Stations 104-114 may form a group of stations that are configured to perform wireless communications between stations. For example, a group of stations (e.g., stations 104-114) may be configured to perform wireless communications over one or more wireless channels. A group of stations may form a peer-to-peer wireless network. In some implementations, the group of stations may include or correspond to a data path group (e.g., a group of stations that share a particular service). In other implementations, the group of stations may comprise or correspond to different infrastructure-less, ad-hoc wireless networks. In certain implementations, the wireless network 102 may be a social wireless mesh network (" social wi-fi mesh "). In other specific implementations, the wireless network 102 may operate in accordance with one or more standards, such as the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard. As used herein, the wireless network 102 is illustrative and, by way of example and not limitation, may support transmissions in accordance with the IEEE 802.11s standard. Additionally, in some implementations, one or more stations of a group of stations may be part of other networks or may be included in other networks. For example, one or more of the stations 104-114 may correspond to or be included in a neighbor aware network (NAN).

[0024] Each of the stations 104-114 may be a wireless communication device configured to transmit data and / or receive data from other wireless communication devices within the wireless network 102. For example, stations 104-114 may be coupled to a processor (e.g., a central processing unit (CPU), a digital signal processor (DSP), a network processing unit (E.g., an NPU), etc.), memory (e.g., random access memory (RAM), read only memory (ROM), etc.), and / or a wireless interface configured to transmit and receive data over a wireless network. Each of the stations 104-114 may be configured to operate in accordance with the IEEE 802.11s standard, as a non-limiting example. In other implementations, stations 104-114 may be configured to operate according to other standards, such as one or more IEEE 802.11 standards, one or more Wi-Fi Alliance standards, or a combination thereof chat.

[0025] The first station 104 may be configured to generate a message 120 addressed to a plurality of stations of the wireless network 102. In certain implementations, the message 120 may be a broadcast message (e.g., it may be addressed to a different station in the wireless network 102). In other implementations, the message 120 may be a multicast message (e.g., it may be addressed to a subset of other stations of the wireless network 102). In certain implementations, the message 120 may include a unique identifier, such as one or more bits encoded in the message 120 and not encoded in other messages. For example, the message 120 may include a first identifier 124. The first station 104 may also be configured to generate a first neighbor list (List_1) The first neighbor list 130 may identify one or more stations in the " neighboring "stations of the first station (e.g., one or more stations in the one- The one-hop range 150 shown in FIG. 1 is for convenience only and is not limited. In certain implementations, the one-hop range 150 may be circular and may be centered at the first station 104.

[0026] In a particular implementation, the message 120 may be a multicast message and the first neighbor list 130 may be a multicast-specific neighbor list (e.g., a multicast message 120 Lt; / RTI > neighboring stations). Stations 104-114 may each determine neighboring stations in accordance with the IEEE 802.11s standard, such as via beacons or probe request / response messages. Additionally or alternatively, neighboring stations may be determined using a light-weighed neighbor discovery mechanism. Although the first station 104 (e.g., being the source or "originating" station of the message 120) is described herein as generating the message 120, in other implementations, the stations 106-114 May generate message (120). In addition, each of the other stations 106-114 may generate a respective neighbor list (e.g., neighbor lists 132-140).

[0027] The first station 104 may send the message 120 and the first neighbor list 130 to neighboring stations. In a particular implementation, the first neighbor list 130 may be encoded into a message 120. In an alternative implementation, a first neighbor list 130 may be attached to the message 120. Each of the neighboring stations receives a message 120 and a first neighbor list 130 and generates a first neighbor list 130 based on station-specific analysis of the first neighbor list 130, as further described herein with respect to FIG. (E. G., Forwarding) the message 120. < / RTI >

[0028] During operation, the first station 104 may generate the message 120 and the first neighbor list 130. The first neighbor list 130 may identify the second station 106, the third station 108 and the sixth station 114 as neighboring stations of the first station 104. In certain implementations, the first neighbor list 130 may identify the first station 104 as a source. The first station 104 transmits the message 120 including the first neighbor list 130 and the first identifier 124 to the second station 106, the third station 108, and the sixth station 114, As shown in Fig. Stations 106, 108 and 114 may receive messages 120 and first neighbor list 130 and may transmit their neighbor lists to stations 1, 2 and 3, as further described with reference to FIG. Based on the comparison with the neighbor list 130, whether to transmit or suppress (e.g., not transmit) the message 120, respectively.

Because stations (eg, stations 106-114) at the "downstream" of the source (eg, first station 104) receive first neighbor list 130 , The downstream stations may selectively transmit or suppress the message 120 based on the first neighbor list 130. Thus, the stations can save power by suppressing (e.g., not transmitting) the message 120 when neighboring stations are expected to receive the message 120 from different stations. Reducing power consumption may include, as two non-limiting examples, allowing wireless network 102 to transmit (or receive) content, such as content sharing between distributed sensor nodes and / or streaming or sharing information - Enables support for intensive applications.

[0030] FIG. 2 illustrates additional transmission of message 120 and station-specific neighbor lists in system 100 of FIG. For example, FIG. 2 illustrates transmitting (e.g., forwarding) a message 120 to multiple stations in the wireless network 102.

[0031] As described with reference to Figure 1, each of the stations 106-114 may receive a message 120 comprising a first neighbor list 130 from a first station 104 . Stations 106-114 may be configured to selectively transmit or suppress message 120 to neighboring stations based on a comparison between the station-specific neighbor list and first neighbor list 130 (e.g., . The arrangement of stations 104-114 and 1-hop ranges 152 and 154 in FIG. 2 are exemplary purposes and are not limited. For example, stations 104-114 may be in any arrangement within wireless network 102, and one-hop ranges 152 and 154 are circular and may be centered at each station.

For example, the second station 106 may generate a message (e.g., a message) based on a comparison between the first neighbor list 130 and the second neighbor list (List_ 2) 132 generated by the second station 106 120, respectively. For example, the second station 106 may compare the station (s) identified by the second neighbor list 132 with the station (s) identified by the first neighbor list 130. [ For example, each neighbor list identifies station (s) using station identifiers, such as media access control (MAC) addresses or other station identifiers. If each station identified by the second neighbor list 132 is also identified by the first neighbor list 130 (i.e., the second neighbor list 132 is a subset of the first neighbor list 130) , The second station 106 may decide to discard (e.g., delete) the message 120 without sending out (e.g., without sending or forwarding) the message 120. As such, message suppression may include deciding not to send the message and deleting or removing the message. The second station 106 may decide not to transmit the message 120. According to the first neighbor list 130 each of the neighboring stations of the second station 106 receives a message 120) is expected to be received (or received). However, if at least one station (e.g., the fourth station 110) identified by the second neighbor list 132 is not identified by the first neighbor list 130, then the second station 106, At least one station is expected to receive (or will receive) message 120 since it may decide to transmit (e.g., forward) this message 120. The second station 106 may also transmit the second neighbor list 132. For example, the second station 106 may transmit the message 120 and the second neighbor list 132 (e.g., the second station 106 may transmit the message 120 Lt; / RTI > message 120 with neighbor list 132). Neighboring station (s) receiving the forwarded message 120 including the second neighbor list 132 from the second station 106 may similarly determine whether to transmit or suppress the message 120.

[0033] In certain implementations, the second station 106 may be configured to suppress transmission of the message 120 based on the first identifier 124 included in the message 120. For example, the second station 106 may include a buffer 168 configured to store identifiers of messages. The second station 106 may store in the buffer 168 an identifier corresponding to any message sent by the second station 106 for a period of time. For example, multiple identifiers corresponding to multiple messages may be stored in the buffer 168. The time period may be selected based on the size of the buffer 168, the expiration time of the identifier, or other factors. In some implementations, the time period may be determined based on the end-to-end delay of the wireless network 102. The second station 106 may be configured to suppress (e.g., determine not to transmit) the transmission of the message 120 if a particular identifier of the message 120 is stored in the buffer 168 . For example, if the message 120 was previously transmitted by the second station 106, the buffer 168 may store the first identifier 124 and the second station 106 may store the first identifier 124 (E. G., Forward) an additional copy of the message 120 based on the buffer 168 that stores the messages 120,124. It may be faster to determine that a particular unique identifier is stored in the buffer and may consume less power than comparing the first neighbor list 130 and the second neighbor list 132. [ As such, the stations may use the buffer 168 to determine whether to forward the message 120 in preference to and / or instead of comparing the neighbor lists.

[0034] The various operations, examples, and implementations described herein are described with reference to a second station 106. This is for convenience only and is not limiting. For example, each of the other stations 104 and 108-114 may operate similarly to the second station 106 as described herein.

[0035] In order to promote fairness in the wireless network 102 (eg, to prevent a particular station from forwarding or ribbroadcasting more messages and consuming more power than other stations) , The stations 104-114 may be configured to count down from the station-specific countdown value before sending the message 120. [ For example, the second station 106 may be configured to initiate a countdown from the countdown value 142 in response to determining to transmit the message 120. For example, the second station 106 may include a counter, timer, or other counting or timing logic configured to generate a countdown value 142 and to perform a countdown from the countdown value 142 have.

[0036] In a particular implementation, the second station 106 may determine the countdown value 142 by randomly selecting a countdown value 142 from a range of 0 to a maximum waiting time (MWT) value, Lt; RTI ID = 0.0 > 142 < / RTI > In one example, an MWT value 146 may be pre-generated and stored in the second station 106 and may be the same for each of the stations 104-114. As such, the countdown value may be any value, or a pseudo-random value, between zero and the MWT value 146. [ In response to the countdown reaching zero, the second station 106 may transmit (e.g., forward) the message 120 that includes the second neighbor list 132. Although initiating the countdown is described as occurring after determining whether to send the message 120, in other implementations, determining whether to initiate a countdown and to send the message 120 may result in a message 120, May occur in any order prior to transmission or suppression.

[0037] The countdown at the station may be stopped based on receiving one or more additional messages. For example, as described above, after determining to send message 120, second station 106 may initiate a countdown from countdown value 142. [ During the countdown (e.g., before the countdown reaches zero), the second station 106 may receive additional messages. For example, the second station 106 may receive an additional message and a third neighbor list from a station in the one-hop range 152 of the second station 106. [ In a non-limiting example, the second station 106 may receive from the third station 108 a second message 122 comprising a third neighbor list (List_3) 134 and a second identifier 126 have. The second identifier 126 may be identical to the first identifier 124 included in the message 120 (e.g., the second message 122 may be the same as the first identifier 124 included in the message 120) Message 120). The second station 106 may compare the second neighbor list 132 with the third neighbor list 134, as described above. In response to determining that each station identified by the second neighbor list 132 is also identified by the third neighbor list 134, the second station 106 determines that it will not send the message 120 You can decide. This determination can occur before the countdown reaches zero or when the countdown reaches zero. The second station 106 may also stop the countdown if no other message is pending transmission / forwarding at the second station 106. However, if one or more messages are not pending transmission / forwarding, the countdown may continue. Thus, each device can implement one countdown for all group-addressed messages.

[0038] In certain implementations, the second station 106 may perform separate countdowns for each message having a different identifier. For example, if the second identifier 126 contained in the second message 122 is different from the first identifier 124 included in the message 120, the station 106 may determine (E.g., starting a second countdown from the second message 122). In an alternative implementation, the second station 106 may perform a single countdown (e.g., using one timer) for multiple messages. As a non-limiting example, the second message 122 may differ from the message 120. The second identifier 126 may be different from the first identifier 124. The second station 106 may be configured to determine whether at least one station identified by the second neighbor list 132 is not identified by the third neighbor list 134. [ In response to determining that at least one station is not identified by the third neighbor list 134, the second station 106 may send a second message 122 when the second countdown is complete You can decide. For example, if the countdown reaches zero, the second station 106 may transmit both the message 120 and the second message 122. The second neighbor list 132 may be encoded in each of the forwarded copies of the message 120 and the second message 122 or may be encoded in the forwarded copy of the message 120 and the second message 122, And may be attached to each copy. Thus, one countdown can be used to transmit multiple messages (e.g., messages with different identifiers).

[0039] In certain implementations, the MWT value 146 may be independently determined at each station and may be different for one or more of the stations 104-114. For example, the second station 106 may be configured such that the neighboring stations of the second station 106 determine the MWT value 146 based on the number. As mentioned herein, the Degree (A) function returns the number of neighboring stations of an argument A (e.g., a particular station). In this implementation, the second station 106 may be configured to determine the number of neighbor stations using the Degree () function and to determine the MWT value 146 based on the inverse of the result. Thus, the MWT value 146 may be inversely proportional to the number of stations neighboring the second station 106 (e.g., the number of stations identified by the second neighbor list 132). Determining the MWT value 146 based on the number of neighboring stations may reduce the overall power consumption of the wireless network 102. For example, stations within a one-hop range of a large number of stations may have a smaller MWT value and may transmit messages more than stations within a small number of stations (reaching a larger number of neighbor stations ) May be greater, thereby reducing the overall power consumption associated with message propagation and the total number of stations transmitting messages.

[0040] In certain implementations, the MET value 146 may be determined based on whether a particular station is a "new" member of the wireless network 102 (eg, recently joined). For example, the second station 106 may determine a lower value for the MWT 146 value when the second station 106 first joins the wireless network 102 (e.g., the MWT value of other stations Lt; / RTI > value). Thus, the second station 106 may be more likely to send an incoming message, such as the message 120, when the second station 106 first joins the wireless network 102. [ Determining lower values as MWT values in the "new " stations allows" new " stations to announce their presence to other stations in the wireless network 102. In addition, fairness can be increased by allowing the second station 106 to contribute first to forwarding messages within the wireless network 102. [

Additionally or alternatively, the second station 106 may generate the countdown value 142 by selecting the countdown value 142 from the range of the minimum wait time (mWT) value 148 to the MWT value . The mWT value 148 may be determined based on the received signal strength of the message 120. For example, the second station 106 may be configured to determine a received signal strength indication (RSSI) 160 for the message 120 received from the first station 104. The second station 106 may be further configured to select the countdown value 142 from the range of the mWT value 148 to the MWT value 146 in response to the RSSI 160 exceeding the threshold . In certain implementations, the mWT value 146 may be a pre-generated value that is greater than zero and is the same for each of the stations 104-114. Alternatively, the mWT value 146 may be independently determined by the stations 104-114 based on the station-specific RSSI 160. Choosing from the range of mWT 148 to MWT value 146 instead of selecting the countdown value 142 from a range of values from 0 to MWT 146 may be used to determine the probability that a particular station will send message 120 . For example, the RSSI 160 may be higher if a particular station is near the source of the message 120 (e.g., the first station 104). Thus, reducing the likelihood of high RSSI-based transmissions allows stations located near the source of the message to remain silent longer. This increases efficiency in dense wireless networks because the stations located near the source are likely to be within a one-hop range of only a few additional stations that are not in range of the source.

[0042] In a particular implementation, the second station 106 may determine a countdown value 142 by selecting a countdown value 142 from a range of mWT values 148 through MWT values 146 based on the channel power of the message 120 Value < RTI ID = 0.0 > 142 < / RTI > For example, the second station 106 may be configured to determine a received channel power indication (RCPI) 162 for the message 120 received from the first station 104. The second station 106 may be further configured to select the countdown value 142 from the range of the mWT value 148 to the MWT value 146 in response to the RCPI 162 exceeding the threshold . In certain implementations, the MET value 146 may be a pre-generated value that is greater than zero and is the same for each of the stations 104-114. Alternatively, the mWT value 146 may be determined individually by the stations 104-114 based on the station-specific RCPI. Choosing a countdown value 142 based on the RCPI may provide similar advantages in dense wireless networks as described above.

[0043] Additionally or alternatively, the second station 106 may be configured to determine whether a particular time interval 144 has elapsed. The specific time interval 144 can not be selected at random and can be independent of the countdown from the randomly selected or pseudo-randomly selected countdown value 142 described above. The second station 106 may be configured to monitor the number of messages transmitted during a particular time interval 144 and to determine whether the at least one message has been transmitted during a particular time interval 144. [ In response to determining that 0 messages have been sent during a particular time interval 144, the second station 106 may send a received message, such as message 120, and a second neighbor list 132, have. In certain implementations, the second station 106 may be an edge station or a border station (e.g., a station located at the edge of the wireless network 102). Sending a message 120 that includes a second neighbor list 132 may signal the presence of the wireless network 102 to "external" stations. Additionally, sending messages 120 (including the second neighbor list 132) when messages are not transmitted during a particular time interval 144 may cause the edge station or the boundary station (e.g., message 120) Lt; RTI ID = 0.0 > message forwarding. ≪ / RTI > After the specific time interval 144 has elapsed, the above-described process may be repeated for each subsequent time interval.

[0044] In certain implementations, each station may be configured to determine whether to remove stations from the wireless network 102 based on the contributions of the stations. For example, the sixth station 114 may be configured to monitor the number of messages received from the fifth station 112 for a period of time. The sixth station 114 may maintain a count 164 of the number of messages received from the fifth station 112 during the time period, and transmissions of the fifth neighbor list 138. The sixth station 114 may be further configured to determine whether to transmit the network key 166 to the fifth station 112 based on the count 164. [ For example, the network key 166 may be used by the following stations 104-114 to encrypt messages or decrypt received messages before sending them. When the sixth station 114 receives the network key 166 from another station, the sixth station 114 may determine whether to transmit the network key 166 to the fifth station 112. The sixth station 114 may transmit the network key 166 to the fifth station 112 in response to determining that the number of messages (e.g., the count 164) exceeds the threshold. The threshold may represent a desired minimum contribution of each station for message propagation in the wireless network 102.

[0045] The sixth station 114 may send a message to the fifth station 112 of the network key 166 in response to determining that the number of messages (eg, the count 164) does not exceed the threshold Can be suppressed. Suppressing the transmission of the network key 166 may effectively remove the fifth station 112 from the wireless network 102. The fifth station 112 may encrypt the messages and transmit them, Because they will not be able to decode them. In an alternative implementation, the sixth station 114 determines whether to transmit the network key 166 to the fifth station 112 based on whether the score corresponding to the fifth station 112 exceeds the threshold score You can decide. The score may be based at least in part on the number of messages received from the fifth station 112. The score may also be based on other scoring criteria corresponding to the fifth station 112, such as proximity to the transmission sources, network age, time length of the wireless network 102, historical transmission data, Can be based.

During operation, the second station 106, the third station 108, and the sixth station 114 receive the message 120 and the first neighbor list 130, respectively, from the first station 104 And may determine whether to transmit (e.g., forward or libro cast) the message 120 based on the first neighbor list 130. For example, stations 106, 108, and 114 may compare their own neighbor lists to first neighbor list 130 as described above. In the example shown in Figure 2, each of the stations 106,108, and 114 is configured by a second neighbor list 132, a third neighbor list 134, or a sixth neighbor list (List_6) 140 It is determined that at least one station identified is not identified by the first neighbor list 130, respectively. In response, the stations 106, 108, and 114 may decide to send the message 120 and station-specific countdowns may be initiated from the randomly generated countdown values.

[0047] At a first time, the second station 106 may complete the countdown. The second station 106 may send the message 120 and the second neighbor list 132 to the third station 108, the fourth station 110 and the first station 110 in response to completing the countdown 104) (e.g., neighboring stations within the one-hop range 152 of the second station 106). The first station 104 may discard the message 120 because the first station 104 has already sent the message 120. [ At a second time subsequent to the first time, the sixth station 114 may complete the countdown. The sixth station 114 may transmit the message 120 and the sixth neighbor list 140 to the third station 108, the fifth station 112 and the first station 104 (e.g., (E.g., neighboring stations within the one-hop range 154 of the base station 114). The first station 104 may discard the message 120 because the first station 104 has already sent the message 120. [

[0048] The third station 108 receives the second neighbor list 132 and the sixth neighbor list 132 (together with the transmissions of the message 120) from the second station 106 and the sixth station 114, Lt; RTI ID = 0.0 > 140 < / RTI > The third station 108 may compare the third neighbor list 134 with the second neighbor list 132, the sixth neighbor list 140, or a combination thereof. In response to determining that each station identified by the third neighbor list 134 is also identified by a second neighbor list 132, a sixth neighbor list 140, or a combination thereof, 0.0 > 108 < / RTI > In some implementations, the decision to suppress transmission may occur when the countdown reaches zero. In other implementations, the decision to suppress transmission may occur before the countdown reaches zero (e.g., prior to completion). Additionally, the third station 108 may stop the countdown prior to completion if other messages are not pending transmission / forwarding at the third station 108. In an alternative implementation, the third station 108 may complete the countdown prior to the second station 106 and the sixth station 114, and may transmit the second message 122 and the third neighbor list 134 To neighboring stations. In this implementation, the second station 106 may suppress transmission of the message 120 based on a comparison between the second neighbor list 132 and the third neighbor list 134, and the sixth station 114 may The transmission of the message 120 may be inhibited based on the comparison between the sixth neighbor list 140 and the third neighbor list 134. [

[0049] By using countdowns from randomly generated countdown values (e.g., values randomly selected from one or more ranges), or pseudo-randomly selected countdown values, each station May have the opportunity to contribute to the propagation of the message or to save power by suppressing the transmission of the message. In this way, the fairness between the stations in the wireless network 102 is promoted because each station has a random opportunity, or a pseudo-random opportunity, of receiving message transmission. As such, the maximum power consumption of each station associated with message propagation can be reduced in a fair manner.

[0050] FIG. 3 shows a timing diagram 300 of a first example of a message in a wireless network and a station-specific neighbor list transmission. Timing diagram 300 illustrates the communication between three stations in a wireless network, such as the stations 104-108 of FIGS. 1 and 2. In the example of FIG. 3, the stations are arranged such that the second station STA_2 106 and the third station STA_3 108 are adjacent to the first station STA_1 104 and the third neighbor list List_3, (134) may be arranged to be a subset of the second neighbor list (List_2) (132).

At the first time t 1, each of the second station 106 and the third station 108 may receive the message and the first neighbor list (List_ 1) 130 from the first station 104 . The first neighbor list 130 may identify the second station 106 and the third station 108 as neighboring stations of the first station 104. The second station 106 may determine that at least one station identified by the second neighbor list 132 is not identified by the first neighbor list 130, as described with reference to Figure 2 , The second station 106 may start counting down. In addition, the third station 108 may determine that at least one station identified by the third neighbor list 134 is not identified by the first neighbor list 130, as described with reference to FIG. 2 And may start a countdown at the third station 108. [

[0052] At the second time t2, the countdown at the second station 106 reaches zero. As such, in the example of the timing diagram 300, the countdown value generated by the second station 106 (e.g., a random / pseudo-random value selected from one or more ranges) 0.0 > 108 < / RTI > In response to the completion of the countdown, the second station 106 transmits (e.g., forwards or libro casts) the message and second neighbor list 132 to its neighbor station (s). In certain implementations, the second station 106 may be a neighbor station of the third station 108. [

At a third time t3 the third station 108 receives the message and second neighbor list 132 from the second station 106 and sends the third neighbor list 134 to the second neighbor list 132). Each station identified by the third neighbor list 134 may also include a second neighbor list 132 (e.g., a neighbor station of the third station 108) In response to determining that the first station 130 is a neighbor station of the first station 130 or the first station 130 is identified by the first neighbor list 130, / Not pending forwarding) stops the countdown and suppresses the transmission of the message. In another implementation, this comparison may occur at time t3, or may occur at times t1 and t3, while comparing the first neighbor list 130 and the third neighbor list 134 is described as occurring at time t1, Lt; / RTI >

[0054] FIG. 4 shows a timing diagram 400 of a second example of a message in a wireless network and a station-specific neighbor list transmission. Timing diagram 400 illustrates the communication between three stations in a wireless network, such as stations 104-108 in FIGS. 1 and 2. In the example of FIG. 3, the stations are arranged such that the second station (STA_2) 106 and the third station (STA_3) 108 are adjacent to the first station (STA_1) 104 and the second neighbor list (List_2) (132) may be arranged to identify at least one station that is not identified by the third neighbor list (List_3) (134). The example of FIG. 4 also differs from the example of FIG. 3 in that the third station 108 generates a lower countdown value than the second station 106.

At the first time t 1, the second station 106 and the third station 108 operate as described with reference to the first time t 1 in FIG. 3. At the second time t2, the countdown at the third station 108 reaches zero. In response to the countdown completion, the third station 108 transmits (e.g., forwards or libro casts) the message and third neighbor list 134 to its neighbor station (s). In certain implementations, the second station 106 may be a neighbor station of the third station 108. [

At a third time t3, the second station 106 receives the message and the third neighbor list 134 from the third station 108 and sends the second neighbor list 132 to the third neighbor list 134). At least one station identified by the second neighbor list 132 may communicate with a third neighbor list 134 (e.g., as described above), such that at least one neighbor station of the second station 106 is the third The second station 106 continues counting down in response to determining that the first neighbor list 130 is not identified by the second neighbor list 130 (i.e., not the neighbor station of the station 108) or the first neighbor list 130. [ In another implementation, this comparison may occur at time t3, or may occur at times t1 and t3, while the comparison of the first neighbor list 130 and the second neighbor list 132 is described as occurring at time t1, Lt; / RTI >

[0057] At the fourth time t4, the countdown at the second station 106 reaches zero. In response to the countdown complete, the second station 106 transmits the message and second neighbor list 132 to its neighbor station (s).

[0058] Referring to FIG. 5, an exemplary method of transmitting a message and a neighbor list in a wireless network is described and designated 500. The method 500 may be performed using stations 104-114, and the wireless network may include or correspond to the wireless network 102 of FIGS. 1 and 2.

[0059] The method 500 may include generating a first neighbor list at a first station of the wireless network (502). For example, the first neighbor list may include or correspond to a first neighbor list 130, and the first station may include or correspond to the first station 104 of FIG. The first neighbor list may identify one or more stations within a particular range of the first station. In certain implementations, the specific range is the one-hop range of the first station, such as the one-hop range 150 of FIG.

[0060] The method 500 may further include sending a first message comprising a first neighbor list to a second station of the wireless network (504). For example, the first neighbor list may include or correspond to the message 120, and the second station may include or correspond to the second station 106 of FIG. In certain implementations, the first neighbor list may be encoded within the message 120. Additionally or alternatively, the first message may comprise a multicast message. In certain implementations, the neighbor list may be a multicast-specific neighbor list. The multicast-specific neighbor list may comprise a subset of stations within a particular range of the first station. In another specific implementation, the first message may comprise a broadcast message. Additionally or alternatively, the message may include a unique identifier, such as the first identifier 124 of FIG. In another specific implementation, the second station may be identified in the first neighbor list. Alternatively, the second station may not be identified in the first neighbor list.

[0061] The method 500 may enable a first station to transmit a message and a neighbor list to stations for use in selective transmission (eg, forwarding) of the message.

[0062] Referring to FIG. 6, an exemplary method for selectively transmitting a message and a neighbor list in a wireless network is described and designated 600. The method 600 may be performed using stations 104-114, and the wireless network may include or correspond to the wireless network 102 of FIGS. 1 and 2.

[0063] The method 600 may include receiving, at a second station of the wireless network, a message including a first neighbor list from a first station of the wireless network (602). For example, a first station may include or correspond to a first station 104, a second station may include or correspond to a second station 106, 120, and the first neighbor list may include or correspond to the first neighbor list 130 of FIGS. 1 and 2. In certain implementations, the method 600 may be performed after the method 500 of FIG. 5, and the received message may have an identifier that is different from the first message described with reference to FIG.

[0064] The method 600 may further include selectively transmitting a copy of the message and the second neighbor list to another station of the wireless network based on a comparison between the first neighbor list and the second neighbor list 604). The second neighbor list may be generated by the second station. For example, the second neighbor list may include or correspond to the second neighbor list 132 of FIGS. 1 and 2. In a particular implementation, the first neighbor list may identify one or more stations within the one-hop range of the first station, and the second neighbor list may identify one or more stations within the one-hop range of the second station, Lt; / RTI > stations.

[0065] In a particular implementation, the second station may compare the first neighbor list to the second neighbor list and determine whether at least one station identified by the second neighbor list is not identified by the first neighbor list have. The second station may inhibit (e.g., determine not to transmit) the transmission of a copy of the message in response to determining that each station identified by the second neighbor list is also identified by the first neighbor list, can do. Additionally or alternatively, the second station may inhibit (e.g., transmit) the transmission of a copy of the message in response to determining that the second station has already transmitted another message with the same unique identifier as the message for a period of time ). In a particular implementation, the second station may store an identifier corresponding to each message transmitted by the second station for a period of time in a buffer, such as buffer 168 of FIG. 2. The duration of the time period may be determined based on the end-to-end delay of the wireless network. For example, the duration of the time period may be determined based on the end-to-end delay of the wireless network 102 of FIGS.

[0066] Additionally or alternatively, the second station may be configured to determine that the at least one station identified by the second neighbor list is not identified by the first neighbor list, The countdown can be started. In certain implementations, the second station may generate a particular value by randomly selecting a particular value from a range of values from zero to maximum waiting time (MWT) values. For example, referring to FIG. 2, the second station 106 may generate a countdown value 142 by randomly selecting a countdown value 142 from a range of 0 to MWT values 146 . The second station may send a copy of the message containing the second neighbor list in response to the countdown reaching zero. For example, referring to FIG. 2, the second station 106 may initiate a countdown using the countdown value 142 and may generate a second neighbor list 132 (FIG. 2) in response to the countdown reaching zero (E. G., Forwarding) a message 120 that includes a < / RTI > In certain implementations, the MET value may be the same for each station in the wireless network.

[0067] Additionally or alternatively, the second station may receive a second message and a third neighbor list from a third station of the wireless network before the countdown reaches zero. For example, referring to FIG. 2, the second station 106 may receive a second message 122 including a third neighbor list 134 from a third station 108. The second station may determine that the first message and the second message have the same identifier. For example, the second station 106 may receive the second message 122 and determine that the first identifier 124 and the second identifier 126 are the same. The second station may determine whether at least one station identified by the second neighbor list is not identified by the third neighbor list and in response to the countdown reaching zero and by a second neighbor list May be conditioned for determining that at least one station identified is not identified by the third neighbor list, and may transmit a copy of the second message and the second neighbor list. For example, the second station 106 may send a message 120 (e.g., a copy of a message received from the first station 104). Additionally or alternatively, the second station may receive the second message and the third neighbor list from a third station of the wireless network before the countdown reaches zero. The second message and the message may have the same unique identifier. For example, the first identifier 124 and the second identifier 126 may be the same. The second station may determine whether at least one station identified by the second neighbor list is not identified by the third neighbor list and the second station may determine that each station identified by the second neighbor list And may decide not to transmit a copy of the second message in response to determining that it is identified by the third neighbor list. The second station may decide not to transmit a copy of the second message before the countdown reaches zero or when the countdown reaches zero. In certain implementations, the second station may stop the countdown prior to completion if other messages are not pending transmission / forwarding.

[0068] In another specific implementation, the second station may determine the number of stations identified by the second neighbor list and determine the MWT value based on the number of stations. For example, the MTW value, such as the MWT value 146 of FIG. 2, may be inversely proportional to the number of stations.

[0069] In another specific implementation, the second station determines a received signal strength indicator (RSSI) for the message and, in response to the RSSI exceeding the threshold, a minimum waiting time (mWT) value to a maximum waiting time It is possible to randomly select a specific value from the range. For example, referring to FIG. 2, the second station 106 may generate a countdown value 142 (i. E., From the range of mWT value 148 to MWT value 146) in response to the RSSI 160 exceeding the threshold May be generated randomly to generate the countdown value 142. [ In certain implementations, the mWT value may be greater than zero and may be the same for each station in the wireless network. Alternatively, the second station may determine the mWT value based on the RSSI. Additionally or alternatively, the second station may determine the received channel power indication (RCPI) for the message and may randomly select a particular value from the range of mWT values to MWT values in response to the RCPI exceeding the threshold . For example, referring to FIG. 2, the second station 106 may generate a countdown value 142 (e.g., a range of values) from the range of mWT values 148 to 146 in response to the RCPI 162 exceeding the threshold May be generated randomly to generate the countdown value 142. [ In certain implementations, the second station may determine the mWT value based on the RCPI.

[0070] In another specific implementation, the second station may determine whether the second station has transmitted at least one message during a particular time interval. For example, referring to FIG. 2, the second station 106 may determine whether at least one message has been transmitted during a particular time interval 144. [0033] FIG. The second station may send a message comprising the second neighbor list in response to determining that the second station has not sent at least one message for a particular time interval.

[0071] The method 600 may enable selective transmission or suppression of messages at stations in a wireless network.

[0072] Referring to FIG. 7, an exemplary method for selectively removing stations in a wireless network is described and designated 700. The method 700 may be performed using stations 104-114, and the wireless network may include or correspond to the wireless network 102 of FIGS. 1 and 2.

[0073] The method 700 may include monitoring 702 the number of messages received from the first station of the wireless network at a second station of the wireless network for a period of time. For example, referring to FIG. 2, the sixth station 114 may monitor a count 164 of the number of messages received from the fifth station 112.

[0074] The method 700 may further include determining 704 whether to transmit the network key to the first station based on the number of messages. For example, referring to FIG. 2, the sixth station 114 may determine whether to transmit the network key 166 to the fifth station 112 based on the count 164. In certain implementations, each of the messages received from the first station may include a neighbor list corresponding to the first station. In another specific implementation, the second station may determine to transmit the network key to the first station in response to the number of messages exceeding the threshold. Additionally or alternatively, the second station may determine to transmit the network key to the first station in response to the score corresponding to the second station exceeding the threshold. The score may be based, at least in part, on the number of messages, or other scoring criteria, as described with reference to FIG. Additionally or alternatively, the second station may suppress (e.g., decide not to transmit) the transmission of the network key to the first station in response to the number of messages not exceeding the threshold.

[0075] The method 700 may enable a first station to selectively remove a second station from the wireless network through selective transmission of a network key based on the number of messages received from the second station .

[0076] Referring to FIG. 8, a specific exemplary aspect of a wireless communication device is shown and generally designated 800. The device 800 includes a processor 810, such as a digital signal processor (DSP), coupled to a memory 832. In an exemplary implementation, the device 800, or components thereof, may correspond to the stations 104-114 of Figs. 1 and 2, or components thereof.

[0077] Processor 810 may be configured to execute software stored in memory 832 (e.g., a program of one or more instructions 868). Additionally or alternatively, the processor 810 may be configured to implement one or more instructions stored in a memory of the wireless interface 840 (e.g., an IEEE 802.11 interface). For example, the air interface 840 may be configured to operate in accordance with the IEEE 802.11s standard. In certain implementations, the processor 810 may be configured to operate in accordance with one or more of the methods of FIGS. 5-7. For example, processor 810 may include message transmission logic 864 to perform one or more of the methods of FIGS. 5-7. The processor 810 may also be configured to generate and store a neighbor list 870 for the device 800. [ In an exemplary implementation, the neighbor list 870 can identify one or more neighboring stations of the device 800 in the wireless network 102 of FIGS. 1 and 2.

[0078] The air interface 840 may be coupled to the processor 810 and to the antenna 842. For example, the wireless interface 840 may be coupled to the antenna 842 via a transceiver 846 such that wireless data may be received via the antenna 842 and provided to the processor 810.

[0079] A coder / decoder (CODEC) 834 may also be coupled to the processor 810. The speaker 836 and the microphone 838 may be coupled to the CODEC 834. [ The display controller 826 may be coupled to the processor 810 and to the display device 828. In a particular implementation, processor 810, display controller 826, memory 832, CODEC 834, and wireless interface 840 are included in a system-in-package or system-on-a-chip device 822 . In certain implementations, the input device 830 and the power source 844 may be coupled to the system-on-a-chip device 822. 8, the display device 828, the input device 830, the speaker 836, the microphone 838, the antenna 842, and the power source 844 are connected to the system-on Lt; RTI ID = 0.0 > 822 < / RTI > However, the display device 828, the input device 830, the speaker 836, the microphone 838, the antenna 842, and the power source 844 each include a system-on-a-chip device 822, Or more of one or more of the interfaces or controllers.

[0080] In conjunction with the implementation described, the first device comprises means for generating a first neighbor list at a first station of the wireless network, wherein the first neighbor list comprises one or more ≪ / RTI > For example, the means for generating may comprise a processor 810 programmed to execute the stations 104-114, the wireless interface 840, the instructions 868 of FIGS. 1 and 2, the message transmission logic 810 of FIG. 8, Other devices, circuits, modules, or instructions for generating a neighbor list at a first station of the wireless network 864, or any combination thereof.

[0081] The first device also includes means for transmitting a first message comprising a first neighbor list to a second station of the wireless network. For example, the means for transmitting comprises a processor 810, which is programmed to execute the stations 104-114, the wireless interface 840, the instructions 868 in Figures 1 and 2, Circuits, modules, or instructions for sending a message containing a list of neighbors 864, a neighbor list to a second station of the wireless network, or any combination thereof.

[0082] In conjunction with the implementation described, the second device comprises, at a second station of the wireless network, means for receiving a message and a first neighbor list from a first station of the wireless network. For example, the means for receiving comprises a processor 810 programmed to execute the stations 104-114, the wireless interface 840, the instructions 868 in Figures 1 and 2, the message transmission logic 810 of Figure 8, Circuits, modules, or instructions for receiving a message containing a first neighbor list from a first station of a wireless network at a second station of the wireless network, Combinations thereof.

[0083] The second device also includes means for selectively transmitting the message and the second neighbor list to other stations of the wireless network based on a comparison between the first neighbor list and the second neighbor list, Is generated by the second station. For example, the means for selectively transmitting comprises a processor 810 programmed to execute the stations 104-114, the wireless interface 840, the instructions 868 of FIGS. 1 and 2, Circuits, modules, and other elements for selectively sending messages and second neighbor lists to other stations in the wireless network based on a comparison between the first neighbor list and the second neighbor list, Or instructions, or any combination thereof.

[0084] In conjunction with the implementation described, the third device includes means for monitoring the number of messages received from the first station of the wireless network at the second station of the wireless network for a period of time. For example, the means for monitoring may comprise a processor 810 programmed to execute the stations 104-114, the wireless interface 840, the instructions 868 in Figures 1 and 2, the message transmission logic 810 of Figure 8, Circuits, modules, or commands for monitoring the number of messages received from the first station of the wireless network at a second station of the wireless network for a period of time 864, Combinations thereof.

[0085] The third device also includes means for determining whether to transmit the network key to the first station based on the number of messages. For example, the means for determining may comprise a processor 810 programmed to execute the stations 104-114, the wireless interface 840, the instructions 868 in Figures 1 and 2, the message transmission logic 810 in Figure 8, Circuitry, modules, or instructions for determining whether to transmit the network key to the second station based on the number of messages 864, the number of messages, or any combination thereof.

[0086] The various illustrative logical blocks, configurations, modules, circuits, and algorithm steps described in connection with the implementations disclosed herein may be implemented as electronic hardware, computer software executed by a processor, It will be understood by those skilled in the art that it is possible. The various illustrative components, blocks, structures, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or processor executable instructions depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

[0087] The steps of a method or algorithm described in connection with the disclosure may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may be implemented as a random access memory (RAM), flash memory, read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read- Non-transitory storage (e. G., Non-transitory storage) known in the art, such as floppy diskettes, floppy diskettes, floppy diskettes, And may reside in any other form of media. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. Alternatively, the storage medium may be integrated into the processor. The processor and the storage medium may reside in an application-specific integrated circuit (ASIC). The ASIC may reside in a computing device or a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a computing device or user terminal.

[0088] The foregoing description is provided to enable any person skilled in the art to make or use implementations of the invention. Various modifications to these implementations will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other implementations without departing from the scope of the disclosure. Accordingly, the present disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features as defined by the following claims.

Claims (30)

As a method,
Generating first data at the first station in response to expiration of a specific time period beginning upon receipt of an incoming message at a first station of the wireless network, A first set of stations within a particular range of the first set of stations;
Transmitting a first message including the first data to a second station of the wireless network; And
Sending a second message comprising second data to the second station in response to expiration of a second specific time period beginning upon receipt of a second incoming message,
Wherein the specific time period and the second specific time period have different durations. The method according to claim 1,
Wherein the specific range is a one-hop range of the first station, the first message comprises an identifier, and the incoming message comprises the identifier. The method according to claim 1,
Wherein the first message comprises a multicast message, the first set of stations is represented by a first neighbor list, and the first neighbor list comprises a multicast-specific neighbor list. The method according to claim 1,
Wherein the first message comprises a broadcast message. The method according to claim 1,
Receiving a third message from the second station, the third message comprising third data representing a third neighbor list, the first message and the third message comprising different identifiers, A first set of stations being indicated by a first neighbor list;
At the first station, comparing the first neighbor list to the third neighbor list; And
Further comprising determining whether at least one station identified by the third neighbor list is not identified by the first neighbor list. 6. The method of claim 5,
Further comprising deciding not to transmit a copy of the third message in response to determining that each station identified by the third neighbor list is also identified by the first neighbor list . 6. The method of claim 5,
Determining not to transmit a copy of the third message in response to determining that the first station has already transmitted another message having the same identifier as the third message for a first time period; And
Storing an identifier corresponding to each message transmitted by the first station during the first time period in a buffer of the first station. 6. The method of claim 5,
Further comprising determining a duration of a third specific time period at the first station in response to determining that at least one station identified by the first neighbor list is not identified by the third neighbor list , Way. 9. The method of claim 8,
And sending a copy of the third message including the third neighbor list in response to expiration of the third specific time period. 9. The method of claim 8,
Receiving a fourth message including fourth data indicating a fourth neighbor list from a third station of the wireless network prior to expiration of the third specific time period;
Determining that the third message and the fourth message have the same identifier;
Determining whether at least one station identified by the first neighbor list is not identified by the fourth neighbor list; And
In response to expiration of the third specific time period and on condition that it determines that at least one station identified by the first neighbor list is not identified by the fourth neighbor list, And sending a copy of the third message containing the list. 9. The method of claim 8,
Receiving a fourth message including fourth data indicating a fourth neighbor list from a third station of the wireless network prior to expiration of the third specific time period;
Determining that the third message and the fourth message have the same identifier;
Determining whether at least one station identified by the first neighbor list is not identified by the fourth neighbor list; And
Further comprising the step of determining that each station identified by the first neighbor list is also not to be transmitted a copy of the third message in response to determining that it is also identified by the fourth neighbor list. 9. The method of claim 8,
Wherein the duration of the third specific time period is selected based on a random value or a pseudorandom value. 9. The method of claim 8,
Determining a number of stations identified by the first neighbor list; And
Further comprising determining a duration of the third specific time period based on the number of stations. 9. The method of claim 8,
Determining a received signal strength indication (RSSI) for the third message; And
Determining a duration of the third specific time period based on the RSSI in response to the RSSI exceeding a threshold. 9. The method of claim 8,
Determining a received channel power indication (RCPI) for the third message; And
Further comprising determining, in response to the RCPI exceeding a threshold, a duration of the third specific time period based on the RCPI. The method according to claim 1,
Wherein the first message comprises a copy of the incoming message, the incoming message comprises data indicative of a particular set of stations, and the first set of stations comprises at least one ≪ / RTI > The method according to claim 1,
Further comprising generating a specific value at the first station,
Wherein the duration of the specific time period is based on the specific value,
Way. The method according to claim 1,
Determining a duration of the specific time period based on the random value or based on the pseudo-random value. The method according to claim 1,
The second data indicating at least the first set of stations. The method according to claim 1,
The second incoming message indicating a second identifier, and the second message indicating the second identifier. As an apparatus,
A processor; And
A memory coupled to the processor,
The memory comprising:
Generating first data at the first station in response to expiration of a specific time period beginning upon receipt of an incoming message at a first station of the wireless network, Displaying a first set of stations;
Transmitting a first message including the first data to a second station of the wireless network; And
Sending a second message containing second data to the second station in response to expiration of a second specific time period beginning upon receipt of a second incoming message
Storing instructions executable by the processor to perform operations comprising:
Wherein the specific time period and the second specific time period have different durations. 22. The method of claim 21,
The operations include:
Receiving a third message comprising third data indicative of a third neighbor list from the second station, the first set of stations being represented by a first neighbor list;
At the first station, comparing the first neighbor list to the third neighbor list; And
In response to determining that at least one station identified by the first neighbor list is not identified by the third neighbor list and in response to expiration of a third specific time period, 3 To send a copy of the message
≪ / RTI > 22. The method of claim 21,
The operations include:
Monitoring the number of messages received from the second station at the first station during a first time period; And
Determining whether to transmit a network key to the second station based on the number of messages
≪ / RTI > 24. The method of claim 23,
The operations include:
Determining to send the network key to the second station in response to the number of messages exceeding a threshold
≪ / RTI > 24. The method of claim 23,
The operations include:
Determining to transmit the network key to the second station in response to the score corresponding to the second station exceeding a threshold value
Further comprising:
Wherein the score is based at least in part on the number of messages. 24. The method of claim 23,
The operations include:
Determining not to transmit the network key to the second station in response to the number of messages not exceeding a threshold value
≪ / RTI > As an apparatus,
Means for generating first data at the first station in response to expiration of a specific time period beginning upon receipt of an incoming message at a first station of the wireless network, A first set of stations within the first set of stations; And
Sending a first message containing the first data to a second station of the wireless network and sending a second message to the second station in response to expiration of a second specified time period beginning upon receipt of a second incoming message, And means for transmitting a second message comprising data,
Wherein the specific time period and the second specific time period have different durations. 28. The method of claim 27,
Means for receiving a third message comprising third data indicative of a third neighbor list from the second station of the wireless network, the first set of stations being indicated by a first neighbor list;
At the first station, means for comparing the first neighbor list to the third neighbor list; And
In response to determining that the first neighbor list identifies at least one station that is not identified by the third neighbor list and in response to expiration of a third specific time period, And means for transmitting a copy of the message. 17. A non-transitory computer readable storage medium comprising instructions,
The instructions, when executed by a processor, cause the processor to:
To cause the first station to generate first data in response to expiration of a specific time period beginning upon receipt of an incoming message at a first station of the wireless network, Displaying a first set of stations;
Send a message containing the first data to a second station of the wireless network; And
Cause the second station to transmit a second message comprising second data in response to expiration of a second specific time period beginning upon receipt of a second incoming message,
Wherein the specific time period and the second specific time period have different durations. 30. The method of claim 29,
Wherein the instructions, when executed by the processor, further cause the processor to:
Determine whether the first station has sent at least one message during a third specified time period interval before sending the message; And
To transmit a message comprising the first data in response to determining that the first station has not transmitted at least one message during the third specific time period interval.

Images