Methods and systems for exploitation of well-connected nodes in peer-to-peer wireless networks

One embodiment of the present disclosure relates generally to wireless communication, and more specifically to methods for improving connectivity in peer-to-peer wireless networks.

Peer-to-peer (P2P) wireless networks are designed so that all devices operate in a manner that shares a common wireless resource (ie, bandwidth) for both receive and transmit operations (ie, time division duplex). Will be done. The main purpose of P2P networks is to facilitate discovery, that is, to facilitate the operation of discovering devices in the vicinity of radio frequencies (RF) where terminals can establish a connection (ie, receive from it and transmit to it). Is. The interconnection of P2P devices constitutes a network.

The discovery process generally involves a P2P device sending an identifier (ID) probe message that is intended to be received by another P2P device in the vicinity of the RF, periodically (possibly at a pseudo-random time). is required. In general, P2P devices spend most of their time listening to ID probes from other devices and very little time sending their own ID probe messages.

ID probe messages typically contain various types of information, such as the device's unique ID, the location of the device (if possible), and the specific services communicated by the device. All P2P devices create and maintain a "discovery" database of other P2P devices near the RF. The discovery database then stores the information collected from the received ID probe.

The coverage of a particular node (ie, device) in a P2P network is usually non-uniform and is severely constrained, even when compared to, for example, macrocell, microcell, and even picocell coverage. This is because many P2P devices are often buried in local clutter, which causes large changes in propagation conditions, leading to large path loss due to shadowing and building penetration loss. Due to the large variability in propagation, the device notifying the desired service may be found even if it is far away from the node being searched (for example, 1 km), while notifying the same desired service. Other devices that are much closer to the node you are searching for may not be found due to excessive path loss specific to the shape and topology of your P2P network.

One embodiment of the present disclosure provides a method for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network. This method generally involves generating a connectivity metric (CM) value, which indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected, and transmitting the CM value.

One embodiment of the present disclosure provides a method for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network. This method generally determines the CM value by generating a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected, and by receiving a query for the service. Includes responding to a query for a service if it is greater than the CM threshold given.

One embodiment of the present disclosure provides a method for wireless communication. This method typically refers to the connectivity metric associated with each of the wireless nodes, which indicates the number of wireless nodes in the P2P wireless network to which the wireless nodes are connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. Includes receiving the CM) value and determining the time slot for receiving the complete connectivity information held by the wireless node based on the CM value.

One embodiment of the present disclosure provides a method for wireless communication. This method typically refers to the connectivity metric associated with each of the wireless nodes, which indicates the number of wireless nodes in the P2P wireless network to which the wireless nodes are connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. Includes receiving a CM) value and sending a service query to a wireless node when the received CM value exceeds a defined CM threshold.

One embodiment of the present disclosure provides a device for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network. This device typically includes a logic circuit for generating connectivity metrics (CM) values and a logic circuit for transmitting CM values, which indicates the number of other wireless nodes in the P2P wireless network to which the wireless nodes are connected. including.

One embodiment of the present disclosure provides a device for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network. The device typically has a logic circuit for generating connectivity metrics (CM) values that indicate the number of other wireless nodes in the P2P wireless network to which the wireless node is connected, and a logic circuit for receiving queries for services. And a logic circuit for responding to a query for the service when the CM value is larger than the determined CM threshold.

One embodiment of the present disclosure provides a device for wireless communication. This device typically has a connectivity metric associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless nodes are connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. It includes a logic circuit for receiving the CM) value and a logic circuit for determining the time slot for receiving the complete connectivity information held by the wireless node based on the CM value.

One embodiment of the present disclosure provides a device for wireless communication. This device typically has a connectivity metric associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless nodes are connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. It includes a logic circuit for receiving a CM) value and a logic circuit for sending a service query to a wireless node when the received CM value exceeds a determined CM threshold.

One embodiment of the present disclosure provides a device for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network. The device generally includes means for generating a connectivity metric (CM) value, which indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected, and means for transmitting the CM value. ..

One embodiment of the present disclosure provides a device for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network. The device typically has a means to generate a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected, and a means to receive queries for services. Includes means for responding to a query for a service when the CM value is greater than a defined CM threshold.

One embodiment of the present disclosure provides a device for wireless communication. This device typically has a connectivity metric associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless nodes are connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. It includes means for receiving the CM) value and means for determining the time slot for receiving the complete connectivity information held by the wireless node based on the CM value.

One embodiment of the present disclosure provides a device for wireless communication. This device typically has a connectivity metric associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless nodes are connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. It includes means for receiving a CM) value and means for sending a service query to a wireless node when the received CM value exceeds a determined CM threshold.

One embodiment of the present disclosure provides a computer program product for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network, including a computer-readable medium containing instructions that can be executed by one or more processors. The instructions generally include an instruction to generate a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected, and an instruction to send the CM value. ..

One embodiment of the present disclosure provides a computer program product for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network, including a computer-readable medium containing instructions that can be executed by one or more processors. The instructions typically include an instruction to generate a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected, and an instruction to receive a query for the service. Includes an instruction to respond to a query for a service when the CM value is greater than the determined CM threshold.

One embodiment of the present disclosure provides a computer program product for wireless communication, including a computer-readable medium containing instructions that can be executed by one or more processors. The instruction generally indicates the number of wireless nodes in a P2P wireless network to which the wireless nodes are connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network, and the connectivity metric associated with each wireless node ( Includes an instruction to receive the CM) value and an instruction to determine the time slot for receiving the complete connectivity information held by the wireless node based on the CM value.

One embodiment of the present disclosure provides a computer program product for wireless communication, including a computer-readable medium containing instructions that can be executed by one or more processors. The instruction generally indicates the number of wireless nodes in a P2P wireless network to which the wireless nodes are connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network, and the connectivity metric associated with each wireless node ( It includes an instruction to receive a CM) value and an instruction to send a service query to a wireless node when the received CM value exceeds a predetermined CM threshold.

More specific descriptions briefly summarized above can be made with reference to embodiments so that the above features of the present disclosure can be understood in detail, and some of the embodiments are shown in the accompanying drawings. However, as the description may tolerate other similarly valid embodiments, the accompanying drawings merely exemplify certain exemplary embodiments of the present disclosure and should be considered to limit the scope of the present disclosure. Note that this is not the case.<figref num="1">Illustration of an exemplary wireless communication system according to an embodiment of the present disclosure.</figref><figref num="2">A diagram of a system that allows two nodes to communicate according to an embodiment of the present disclosure.</figref><figref num="3">The figure which shows the example of the communication device by an embodiment of this disclosure.</figref><figref num="4">FIG. 5 illustrates an exemplary operation for sharing connectivity information in a peer-to-peer (P2P) wireless network according to an embodiment of the present disclosure.</figref><figref num="4A">Diagram of an exemplary component that can perform the operations shown in Figure 4.</figref><figref num="5">FIG. 5 illustrates an exemplary operation for processing connectivity information received from a wireless node in a P2P network according to an embodiment of the present disclosure.</figref><figref num="5A">Diagram of an exemplary component that can perform the operations shown in Figure 5.</figref>

Various embodiments of the present disclosure are described more fully below with reference to the accompanying drawings. However, it should be construed that this disclosure can be embodied in many different forms and is not limited in any way to the specific structure or function presented throughout this disclosure. Rather, these embodiments are provided to complete and complete the disclosure and fully convey the scope of the disclosure to those skilled in the art. Based on the teachings of this specification, one of ordinary skill in the art will appreciate whether any embodiment of the disclosure disclosed herein is implemented independently of any other embodiment of the present disclosure. It should be understood that it is intended to include any such embodiment, whether combined or not. For example, the device can be implemented or the method can be implemented using any number of embodiments described herein. In addition, the scope of this disclosure is an apparatus or method that is performed in addition to, or in addition to, the various embodiments of the disclosure described herein, with other structures, functions, or structures and functions. Is intended to include. It should be understood that any embodiment of the disclosure disclosed herein may be embodied by one or more elements of the claims.

The term "exemplary" is used herein to mean "act as an example, case, or example." Any embodiment described herein as "exemplary" should not necessarily be construed as preferred or advantageous over other embodiments.

Although specific embodiments are described herein, many variants and substitutions of these embodiments fall within the scope of the present disclosure. Although some benefits or advantages of preferred embodiments are mentioned, the scope of this disclosure is not intended to be limited to any particular benefit, use, or purpose. Rather, the embodiments of the present disclosure are intended to be widely applicable to various wireless technologies, system configurations, networks, and transmission protocols, some of which, by way of example, drawings and preferred embodiments. It is shown in the following description of the form. The detailed description and drawings are not limited and are merely examples of the present disclosure, and the scope of the present disclosure is defined by the appended claims and their equivalents.

The techniques described herein can be used in a variety of broadband wireless communication systems, including communication systems based on orthogonal multiplexing schemes. Examples of such communication systems include orthogonal frequency division multiple access (OFDMA) systems, single frequency division multiple access (SC-FDMA) systems, and the like. The OFDMA system utilizes orthogonal frequency division multiplexing (OFDM), which is a modulation technique that divides the entire bandwidth of the system into multiple orthogonal subcarriers. These subcarriers can also be called tones, bins, and the like. In OFDM, each subcarrier can be independently modulated for the data. SC-FDMA systems may utilize interleaved FDMA (IFDMA) to transmit on subcarriers distributed over the bandwidth of the system, or utilize localized FDMA (LFDMA) to adjacent subs. Carrier blocks may be transmitted or extended FDMA (EFDMA: enhanced) FDMA) may be used to transmit on multiple blocks of adjacent subcarriers. Generally, modulated symbols are transmitted by OFDM in the frequency domain and by SC-FDMA in the time domain.

Illustrative wireless communication system Here, with reference to FIG. 1, a wireless communication system 100 according to various embodiments of the present disclosure is shown. System 100 includes base station 102, which may include multiple antenna groups. For example, one antenna group may include antennas 104 and 106, another group may include antennas 108 and 110, and an additional group may include antennas 112 and 114. Two antennas are shown for each antenna group, but more or fewer antennas may be utilized for each group. Base station 102 may further include a transmitter group and a receiver group, each of which, as will be appreciated by those skilled in the art, a plurality of components (eg, processor, modulation) associated with signal transmission and signal reception. Can include devices, multiplexers, demodulators, demultiplexers, antennas, etc.). Further, the base station 102 may be a home base station, a femto base station, and / or the like.

It should be appreciated that base station 102 can communicate with one or more devices, such as device 116, but base station 102 can communicate with virtually any number of devices similar to device 116. As shown, device 116 is communicating with antennas 104 and 106, antennas 104 and 106 transmitting information to device 116 via forward link 118 and from device 116 via reverse link 120. Receive information. In a Frequency Division Duplex (FDD) system, the forward link 118 can utilize, for example, a frequency band different from the frequency band used by the reverse link 120. Further, in a Time Division Duplex (FDD) system, the forward link 118 and the reverse link 120 can utilize a common frequency band.

In addition, devices 122 and 124 may communicate with each other, as in a peer-to-peer configuration. In addition, device 122 may communicate with device 124 using links 126 and 128. In peer-to-peer ad hoc networks, devices within each other's territory, such as devices 122 and 124, communicate directly with each other without base station 102 and / or wired equipment to relay the communication. In addition, peer devices or peer nodes can relay traffic. Devices in a network that communicate in a peer-to-peer manner can function like a base station, can relay traffic or communication to other devices, and base until the traffic reaches its final destination. Works like a station. The device can also transmit control channels, which carry information that can be used to manage data transmission between peer nodes.

A communication network can include any number of devices or nodes during wireless (or wired) communication. Each node may be within the realm of one or more other nodes and may communicate with or through the use of other nodes, as in multihop topography. (For example, communication can hop from node to node until the final destination is reached). For example, the sender node may want to communicate with the receiver node. One or more intermediate nodes can be utilized to allow packet transmission between the sender and receiver nodes. Any node can be a sender node and / or a receiver node, transmitting and / or transmitting information at substantially the same time (eg, broadcasting or communicating information at about the same time as receiving the information), or at different times. Alternatively, the receive function can be executed.

System 100 may be configured so that a node that initiates a communication session over a network can move the session directly to a connection. Directly connected nodes can exchange packets as they are, without any encapsulation. According to some embodiments, a "homeless" node can switch to a wireless network without losing an ongoing session. "Homeless" means that there is no home agent entity at all, it does not help keep the session in progress uninterrupted when switching to an external network, and it forwards any new requests to the node. It also means that no new session will be established at the current position. According to some embodiments, the nodes may be mobile (eg wireless), fixed (eg wired), or any combination thereof (eg the first node is fixed and second). Nodes may move, both nodes move, etc.).

FIG. 2 shows a system 200, according to various embodiments, that allows two nodes to communicate via a wide area network interface and / or a device-to-device interface. The system 200 includes a first node (node 1) 202 and a second node (node 2) 204. Each node 202, 204 includes at least two interfaces. The first interface may be connected to network 206, which provides an Internet Protocol (IP) address. For example, networks include wide area networks (WAN), local area networks (LAN), home networks, digital subscriber lines (DSL), cables, 3GPP-based technology, 3GPP2-based technology, WiMAX-based technology, and WLAN-based. It can be a technology, or any other technology that provides interoperability and routing to a target network (eg, the Internet).

The interfaces of nodes 202 and 204 may be wired (eg, between devices), wireless (eg, WAN), or any combination thereof. For example, the interface of node 1 202 may be wireless and the interface of node 2 204 may be wired, or the interface of node 2 204 may be wireless and the interface of node 1 202 may be wired 202. Both interfaces of 204 may be wireless, or both interfaces of 202 and 204 may be wired.

As an example, the first interface of each node 202, 204 is WAN interface 208 and 210. WAN interfaces 208, 210 provide connectivity over network 206, as indicated by links 212 and 214. Further, each node 202, 204 includes at least a second interface connected to a local network or a multi-hop mesh network having directly connected peers. For example, the local network may be a wireless local area network (WLAN) or other device-to-device (eg peer-to-peer) technology. As an example, the second interface of each node 202, 204 is shown as device-to-device (D2D) interface 216, 218. D2D interfaces 216, 218 allow nodes 202, 204 to carry out direct communication, as indicated by the direct link 220.

Procedures in various embodiments for starting a session over network 206 and moving directly to the session (eg, via a direct link 220) are described here. As an example, node 1202 is assumed to utilize the mobile internet protocol. Communication is performed by node 1202, which uses the mobile IP home address as the source address. The home address is a unicast routable address assigned to the node and is used as the permanent address of the node. Node 1 202 communicates with node 2 204 over network 206 (eg WAN) by transmitting and receiving packets through their respective first interfaces (eg WAN interfaces 208, 210). The packet can be encapsulated in a MIPv6 tunnel to the home agent, which may be contained in network 206 according to various embodiments, or is a direct route optimization tunnel to node 2 204. You may.

FIG. 3 shows an exemplary first communication device 300 according to an exemplary embodiment. The exemplary first communication device 300 is, for example, one of the wireless communication devices (102, 116, 122, 124) of FIG. 1 or one of the wireless communication devices (202, 204) of FIG. It is one.

The first communication device 300 includes a processor 302 and a memory 304 that are coupled together via the bus 309, and various elements (302, 304) can exchange data and information through the bus 309. .. The communication device 300 further includes an input module 306 and an output module 308 that can be coupled to the processor 302, as shown. However, in some embodiments, the input module 306 and the output module 308 are located inside the processor 302. The input module 306 can receive the input signal. The input module 306 may include a wireless receiver and / or a wired or optical input interface to receive the input, including in some embodiments. The output module 308 may include a wireless transmitter and / or a wired or optical output interface for transmitting output, including in some embodiments.

Processor 302 receives the first signal from the second communication device, generates the first application warning if the first signal above meets the application warning criteria, and sends the second signal from the access point. The second signal, which is configured to receive, carries the second communication device information based on the previous signal from the second communication device. The access point may be a base station and may be a base station. In some embodiments, the information in the second communication device is location information. In various embodiments, the processor 302 is configured to receive the first signal described above via a wireless peer-to-peer interface as a portion that is configured to receive the first signal. In some embodiments, processor 302 is configured to receive a second signal via a wireless wide area network interface as a portion that is configured to receive a second signal.

The processor 302 is further configured to determine the operation to be performed based on the information of the second communication device contained in the second signal and the information contained in the first signal described above. In one exemplary embodiment, the information about the second communication device contained in the second signal is information about the position in front of the second communication device and is included in the first signal. The above information is the current location information, and the above operation is one of a location-based traffic update operation and a location-based notification update operation. In some embodiments, the processor 302 is further configured to send an information request signal to the access point requesting information corresponding to the second communication device in response to the generated first application warning. To.

Information collected by a given node in a peer-to-peer (P2P) network, such as network 100 from Figure 1 and / or network 206 from Figure 2, is efficiently connected to other nodes directly connected to that node. Can be shared. Sharing connectivity information between connected nodes can substantially extend the coverage of a given node. In many real-world deployments, some nodes may have better connectivity than others. These "well-connected" nodes can play an important role in P2P wireless networks because of their favorable location in the network.

Therefore, it is desirable to devise a method in which these "well-connected" nodes can be utilized so that the overall connectivity of all nodes in the P2P network is improved.

Illustrative use of well-connected nodes in P2P wireless networks Some embodiments of the disclosure provide discovery protocols in which nodes in a P2P network broadcast a metric, optionally as a generic identifier (ID) probe message, indicating the number of individual nodes to which they can be connected. .. This "connectivity metric" (CM) can then be used by other nodes to help discover other nodes (and services) in the network. That is, by knowing the CM of each node, a given node can selectively choose which node can be a better candidate to listen to (thus saving power) or query. You can selectively choose between possible better candidates (which reduces the queries and subsequent responses broadcast and saves overall bandwidth).

A node with a high CM value (indicating that it is connected to a relatively large number of other nodes) can indicate that it has more chances to discover a service than a node with a low CM value. In P2P networks that benefit from common timing (eg, as provided by a common clock that spreads over the Global Positioning System (GPS) or Wide Area Network (WAN)), for efficiency, the nodes Transmission is incorporated into the time slot.

In addition, there may be various types of surrogate notified service messages in which full disclosure of connectivity information held by a given node does not occur frequently and partial disclosure may occur more frequently. A well-connected node may need to send a longer message than a poorly connected node when sending full disclosure information, thus adding a transmit load to a well-connected node. Transmission slot cycles (ie, periodicity and slot index) may be rarely used to minimize them.

As well-connected nodes broadcast full connectivity information, these nodes may need to know when to listen to the broadcast in order for others to benefit. Therefore, it is desirable to know which nodes can have the most information to share and when these nodes send full connectivity information. Therefore, it may be useful to indicate the transmit slot cycle index of a given node, along with the CM value. Allows other nodes to calculate the transmit slot cycle of a given node from CM values and, in some cases, from other information such as electronic serial number (ESN) and mobile phone identification number (MIN). The algorithm to do so can also be useful. This algorithm allows other nodes to minimize the power consumption of keeping the receiver running for extended periods of time. For example, these nodes may refrain from listening to complete connectivity information until a fixed time slot. This technique can also minimize the likelihood of queries generated by a given node, as connectivity information can be more efficient with well-connected nodes.

Even if the complete disclosure of node connectivity information is not aided by system design via some broadcast message, the node's CM value is still likely to affect the node's queries and responses in a P2P network. To do. In systems that support directed queries (ie, queries directed to a single node), the received CM value associated with the connected node determines which node the receiving node should query. Can help you to do it. In other words, the higher the CM value, the higher the probability that the node will gain knowledge about the specific service they are looking for. Therefore, the CM value can be directly proportional to the rank assigned by the node issuing the directed query at the connected node. The directed query can be sent first, for example, to the wireless node that has the highest CM value of the connected nodes' CM values. This may reduce the amount of query traffic generated by each node. In addition, a node with a high CM value may be more likely to respond to a directed query, so a query response message can be designed to benefit other nodes that receive it.

When targeted queries are used (for example, multicast queries to node groups that share common attributes), use CM values to help influence the response of the queried node. be able to. For example, according to some embodiments, the query message can store a predetermined CM threshold that the node uses in determining whether the node should respond to the query. Therefore, if the CM value of a node is above a defined threshold, the node can be authorized to respond, otherwise the node cannot respond to queries.

In addition, the absolute value of the difference between the CM value of the node and the CM threshold can be used to determine the timing of a given response. For example, a large difference (meaning a large CM value) can increase the probability of a response in an early time slot. Conversely, if the difference is small, the response may be delayed and the probability that a node with a high CM value will be able to respond may increase. In addition, a node authorized to respond to a common received service query or to a query for the same service previously sent by another wireless node will respond to the query of the actively sending node. Can be read, inspected, and attempted to determine if the response is verbose. In this way, unnecessary redundancy can be reduced and random access wireless media can be made available faster for other nodes.

FIG. 4 shows an exemplary operation 400 for sharing connectivity information in a P2P wireless network. According to certain embodiments of the present disclosure, operation 400 can be performed, for example, by a wireless node in a P2P network to share relevant connectivity information.

At 402, connectivity metric (CM) values associated with wireless nodes can be transmitted. In a 404, you can receive one or more service queries directed to a wireless node, and the higher the CM value sent, the more often you can receive the query, and vice versa. .. At 406, the wireless node can respond to at least one of the received queries according to the CM value sent.

FIG. 5 shows an exemplary operation 500 for processing connectivity information in a P2P wireless network. According to certain embodiments of the present disclosure, operation 500 can be performed, for example, by a wireless node that receives connectivity information from other wireless nodes in a P2P network.

At 502, the wireless node can receive CM values associated with each of the other wireless nodes from one or more other wireless nodes in the P2P network. At 504, the time slot may be determined at the wireless node for receiving the complete connectivity information held by the other wireless node. After receiving the complete connectivity information sent by the other wireless node, at 506, a service query can be sent to the other wireless node based on the CM value received.

Various operations of the methods described above can be performed by various hardware and / or software components and / or modules corresponding to the means-plus-function blocks shown in the figure. .. For example, blocks 402-406 shown in FIG. 4 correspond to means plus function blocks 402A-406A shown in FIG. 4A. Similarly, blocks 502 to 506 shown in FIG. 5 correspond to means plus function blocks 502A to 506A shown in FIG. 5A. More generally, if there is a method shown in the figure with the corresponding means plus function diagram, the operation block corresponds to a similarly numbered means plus function block.

The various exemplary logic blocks, modules, and circuits described with this disclosure are general purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate array signals (FPGAs), or With other programmable logic devices (PLDs), separate gate or transistor logic circuits, separate hardware components, or any combination of these designed to perform the functions described herein. Can be implemented and executed. The general purpose processor may be a microprocessor, but instead, the processor may be any commercially available processor, controller, microcontroller, or state machine. Processors are also implemented as a combination of computing devices, such as a combination of DSP and microprocessor, multiple microprocessors, one or more microprocessors attached to a DSP core, or any other such configuration. sell.

The steps of the method or algorithm described with this disclosure may be embodied in software modules executed by the processor directly in hardware or in combination of the two. The software module can reside in any form of storage medium known in the art. Some examples of storage media that can be used include random access memory (RAM), read-only memory (ROM), flash memory, EPROM memory, EEPROM memory, registers, hard disks, removable disks, CD-ROMs, and the like. The software module may contain a single instruction or a large number of instructions, and may be distributed across multiple storage media across several different code segments in various programs. The storage medium can be coupled to the processor so that the processor can read information from the storage medium and write the information to the storage medium. Alternatively, the storage medium may be integrated with the processor.

The methods disclosed herein include one or more steps or actions to achieve the methods described. The steps and / or operations of the method may be interchangeable with each other without departing from the claims. In other words, unless a specific order of steps or actions is specified, the specific order of steps and / or actions and / or uses may be modified without departing from the claims.

The features described may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, features may be stored as one or more instructions on a computer-readable medium. The storage medium may be any available medium accessible by the computer. As an example, but not limited to, such computer-readable media may instruct or instruct RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage device, or the desired program code. It can include any other medium that can be used to carry or store in the form of a data structure and is accessible by a computer. Disks and discs, as used herein, are compact discs (CDs), laser discs (registered trademarks), optical discs, digital multipurpose discs (DVDs), floppy (registered trademarks) discs, and Blu-rays (registered trademarks). Including registered trademark) discs, discs usually reproduce data magnetically, and discs optically reproduce data with a laser.

Software or instructions can also be transmitted through the transmission medium. For example, the software uses coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technology such as infrared, wireless, and microwave from a website, server, or other remote source. When transmitted via coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, wireless, and microwave are included in the definition of transmission medium.

In addition, modules and / or other suitable means for performing the methods and techniques described herein may be downloaded and / or as appropriate by the user terminal and / or base station. Please understand that it may be obtained in other ways. For example, such a device can be combined with a server to facilitate transporting means for performing the methods described herein. Alternatively, the various methods described herein can be provided via storage means (eg, RAM, ROM, and physical storage media such as compact discs (CDs) or floppy disks). User terminals and / or base stations can obtain various methods by coupling or providing storage means to the device. In addition, any other suitable technique for providing the device with the methods and techniques described herein may be utilized.

It should be understood that the claims are not limited to exactly the same configurations and components as exemplified above. Various modifications, changes, and modifications can be made to the configurations, operations, and details of the methods and devices described above without departing from the claims.

Although the above-mentioned matters are directed to the embodiments of the present disclosure, other further embodiments of the present disclosure can be devised without departing from the basic scope of the present disclosure, and the scope of the present disclosure is as follows. It is determined by the scope of claims of.<u style="single"> The inventions that describe the scope of the initial claims of the application of the present application are described below.</u> [C1] A method for wireless communication by wireless nodes in a peer-to-peer (P2P) wireless network. To generate a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected. To send the CM value A method. [C2] The CM value is transmitted as part of a broadcast identifier (ID) probe message. The method described in [C1]. [C3] Receiving service queries and Determining whether to respond to the received service query based on information sent from another wireless node in response to the received service query or pre-sent service query. The method described in [C1], further comprising. [C4] Further comprising transmitting the complete connectivity information held by the wireless node at a frequency determined based on the CM value. The method described in [C1]. [C5] A method for wireless communication by wireless nodes in a peer-to-peer (P2P) wireless network. To generate a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected. Receiving queries for services and Responding to a query for the service when the CM value is greater than the determined CM threshold A method. [C6] The CM threshold is included in the query for the service. The method described in [C5]. [C7] Further comprising determining when to respond to the query based on the absolute value of the difference between the CM value and the CM threshold. The method described in [C5]. [C8] A connectivity metric (CM) associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless node is connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. To receive the value and The time slot for receiving the complete connectivity information held by the wireless node is determined based on the CM value. A method for wireless communication. [C9] Further prepared to refrain from listening to the complete connectivity information until the determined time slot. The method described in [C8]. [C10] It further comprises sending a service query to the wireless node based on the CM value after the reception of the complete connectivity information from the wireless node. The method described in [C8]. [C11] A connectivity metric (CM) associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless node is connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. To receive the value and To send a service query to the wireless node when the received CM value exceeds the determined CM threshold. A method for wireless communication. [C12] The service query is first sent to the wireless node associated with the highest CM value of all received CM values of all the wireless nodes. The method described in [C11]. [C13] A device for wireless communication by wireless nodes in a peer-to-peer (P2P) wireless network. A logic circuit for generating a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected. With a logic circuit for transmitting the CM value A device that comprises. [C14] The CM value is transmitted as part of a broadcast identifier (ID) probe message. The device according to [C13]. [C15] A logic circuit for receiving service queries and With a logic circuit for determining whether to respond to the received service query based on the information transmitted from another wireless node in response to the received service query or the pre-sent service query. The device according to [C13], further comprising. [C16] Further comprising a logic circuit for transmitting the complete connectivity information held by the wireless node at a frequency determined based on the CM value. The device according to [C13]. [C17] A device for wireless communication by wireless nodes in a peer-to-peer (P2P) wireless network. A logic circuit for generating a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected. A logic circuit for receiving queries for services, and A logic circuit for responding to a query for the service when the CM value is larger than a determined CM threshold. A device that comprises. [C18] The CM threshold is included in the query for the service. The device according to [C17]. [C19] A logic circuit for determining when to respond to the query is further provided based on the absolute value of the difference between the CM value and the CM threshold value. The device according to [C17]. [C20] A connectivity metric (CM) associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless node is connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. A logic circuit for receiving values and With a logic circuit for determining the time slot for receiving the complete connectivity information held by the wireless node based on the CM value. A device for wireless communication. [C21] Further provided with logic circuits to refrain from listening to the complete connectivity information up to the determined time slot. The device described in [C20]. [C22] A logic circuit for transmitting a service query to the wireless node based on the CM value after the reception of the complete connectivity information from the wireless node is further provided. The device described in [C20]. [C23] A connectivity metric (CM) associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless node is connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. A logic circuit for receiving values and With a logic circuit for sending a service query to the wireless node when the received CM value exceeds a determined CM threshold value. A device for wireless communication. [C24] The service query is first sent to the wireless node associated with the highest CM value of all received CM values of all the wireless nodes. The device according to [C23]. [C25] A device for wireless communication by wireless nodes in a peer-to-peer (P2P) wireless network. A means for generating a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected. As a means for transmitting the CM value A device that comprises. [C26] The CM value is transmitted as part of a broadcast identifier (ID) probe message. The device described in [C25]. [C27] Means for receiving service queries and As a means for determining whether to respond to the received service query based on the information sent from another wireless node in response to the received service query or the pre-sent service query. The device according to [C25], further comprising. [C28] Further provided are means for transmitting the complete connectivity information held by the wireless node at a frequency determined based on the CM value. The device described in [C25]. [C29] A device for wireless communication by wireless nodes in a peer-to-peer (P2P) wireless network. A means for generating a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected. Means for receiving queries for services and As a means for responding to a query for the service when the CM value is larger than a determined CM threshold. A device that comprises. [C30] The CM threshold is included in the query for the service. The device according to [C29]. [C31] Further provided are means for determining when to respond to the query based on the absolute value of the difference between the CM value and the CM threshold. The device according to [C29]. [C32] A connectivity metric (CM) associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless node is connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. Means for receiving values and As a means for determining the time slot for receiving the complete connectivity information held by the wireless node based on the CM value. A device for wireless communication. [C33] Further provided are means for refraining from listening to the complete connectivity information up to the determined time slot. The device according to [C32]. [C34] Further provided are means for sending a service query to the wireless node based on the CM value after the reception of the complete connectivity information from the wireless node. The device according to [C32]. [C35] A connectivity metric (CM) associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless node is connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. Means for receiving values and As a means for sending a service query to the wireless node when the received CM value exceeds a determined CM threshold. A device for wireless communication. [C36] The service query is first sent to the wireless node associated with the highest CM value of all received CM values of all the wireless nodes. The device according to [C35]. [C37] A computer program product for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network, comprising a computer-readable medium containing instructions that can be executed by one or more processors. An instruction to generate a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected. With the instruction to send the CM value A computer program product. [C38] The CM value is transmitted as part of a broadcast identifier (ID) probe message. Computer program products described in [C37]. [C39] The command is Instructions for receiving service queries and An instruction to determine whether to respond to the received service query based on the information sent from another wireless node in response to the received service query or the pre-sent service query. The computer program product described in [C37], further equipped with. [C40] The command is Further provided with instructions for transmitting complete connectivity information held by the wireless node at a frequency determined based on the CM value. Computer program products described in [C37]. [C41] A computer program product for wireless communication by a wireless node in a peer-to-peer (P2P) wireless network, comprising a computer-readable medium containing instructions that can be executed by one or more processors. An instruction to generate a connectivity metric (CM) value that indicates the number of other wireless nodes in the P2P wireless network to which the wireless node is connected. Instructions to receive queries for services and An instruction to respond to a query for the service when the CM value is greater than a determined CM threshold. A computer program product. [C42] The CM threshold is included in the query for the service. The computer program product described in [C41]. [C43] The command is Further provided with instructions for determining when to respond to the query based on the absolute value of the difference between the CM value and the CM threshold. The computer program product described in [C41]. [C44] A computer program product for wireless communication comprising a computer-readable medium containing instructions that can be executed by one or more processors. A connectivity metric (CM) associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless node is connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. The instruction to receive the value and With an instruction to determine the time slot for receiving the complete connectivity information held by the wireless node based on the CM value. A computer program product. [C45] The command is Further provided with instructions to refrain from listening to the complete connectivity information up to the determined time slot. Computer program products described in [C44]. [C46] The command is It further comprises an instruction to send a service query to the wireless node based on the CM value after the reception of the complete connectivity information from the wireless node. Computer program products described in [C44]. [C47] A computer program product for wireless communication comprising a computer-readable medium containing instructions that can be executed by one or more processors. A connectivity metric (CM) associated with each of the wireless nodes that indicates the number of wireless nodes in the P2P wireless network to which the wireless node is connected from one or more wireless nodes in a peer-to-peer (P2P) wireless network. The instruction to receive the value and An instruction to send a service query to the wireless node when the received CM value exceeds a predetermined CM threshold value. A computer program product. [C48] The service query is first sent to the wireless node associated with the highest CM value of all received CM values of all the wireless nodes. Computer program products described in [C47].