IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0199451
(2005-08-08)
|
등록번호 |
US-7260100
(2007-08-21)
|
발명자
/ 주소 |
|
출원인 / 주소 |
|
인용정보 |
피인용 횟수 :
2 인용 특허 :
15 |
초록
▼
A method of allocating communication resources among nodes in a network is provided. Communication among the nodes uses a time division multiple access protocol that includes a plurality of time slots. After identifying and synchronizing with a first communication node, a search algorithm is execut
A method of allocating communication resources among nodes in a network is provided. Communication among the nodes uses a time division multiple access protocol that includes a plurality of time slots. After identifying and synchronizing with a first communication node, a search algorithm is executed. The search algorithm allocates one or more time slot of the plurality of time slots to communicate control information with the identified first communication node and allocates the remaining time slots of the plurality of time slots to identification of a second communication node. Upon identification of and synchronization with the second communication node, a merged network is formed. Execution of the search algorithm continues until a desired confidence level is achieved. The confidence level estimates the likelihood that another communication node capable of communication with the network has not been identified. A communication algorithm utilizing otherwise wasted time slots is executed if the desired confidence level is achieved.
대표청구항
▼
What is claimed is: 1. A communication node, the communication node comprising: a communication processing module, the communication processing module (a) executing a first search algorithm using a time division multiple access (TDMA) protocol, the TDMA protocol allocating a plurality of time slots
What is claimed is: 1. A communication node, the communication node comprising: a communication processing module, the communication processing module (a) executing a first search algorithm using a time division multiple access (TDMA) protocol, the TDMA protocol allocating a plurality of time slots, the first search algorithm allocating one or more time slot of the plurality of time slots to communicate control information with a first communication node and allocating remaining time slots of the plurality of time slots to identify a second communication node; (b) identifying the second communication node; (c) synchronizing with the second communication node to form a network including the first communication node and the identified second communication node; (d) calculating a confidence level wherein the confidence level estimates the likelihood that a third communication node capable of communication with the network has not been identified; (e) comparing the calculated confidence level to a desired confidence level; and (f) if the desired confidence level is not achieved, repeating (a)-(f); and a transceiver communicating the control information. 2. The communication node of claim 1, wherein the communication processing module executes a second search algorithm before (a)-(f), wherein the second search algorithm uses all of the plurality of time slots to identify the first communication node. 3. The communication node of claim 1, wherein the communication processing module executes a communication algorithm if the desired confidence level is achieved, wherein the communication algorithm comprises: receiving an allocated set of time slots for transmission of a communication signal; identifying a time slot of the allocated set of time slots that is no longer needed for transmission of the communication signal; and tuning to a network synchronization frequency during the identified time slot. 4. The communication node of claim 3, wherein the communication algorithm further comprises: receiving, during the identified time slot, a synchronization signal transmitted by a fourth communication node, wherein the fourth communication node is not in communication with the second network; and synchronizing with the fourth communication node using the synchronization signal thereby allowing communication between the fourth communication node and the second network. 5. The communication node of claim 1, wherein the second communication node is communicating with a third network. 6. The communication node of claim 5, further comprising selecting a time reference for the second network and the third network. 7. The communication node of claim 6, further comprising selecting a network from the second network and the third network to switch to the selected time reference. 8. The communication node of claim 7, further comprising sending a message to the selected network, the message directing the selected network to switch to the selected time reference. 9. The communication node of claim 7, wherein selecting the network uses a network identifier. 10. The communication node of claim 9, wherein the network identifier is selected from the group consisting of a radio number, a tail number, and an internet protocol address. 11. A method of allocating communication resources between communication nodes in a network of communication nodes to rapidly identify a new node capable of communication with the network, the method comprising: (a) executing a first search algorithm using a time division multiple access (TDMA) protocol, the TDMA protocol allocating a plurality of time slots, the first search algorithm allocating one or more time slot of the plurality of time slots to communicate control information with a first communication node and allocating remaining time slots of the plurality of time slots to identify a second communication node; (b) identifying the second communication node; (c) synchronizing with the second communication node to form a network including the first communication node and the identified second communication node; (d) calculating a confidence level wherein the confidence level estimates the likelihood that a third communication node capable of communication with the network has not been identified; (e) comparing the calculated confidence level to a desired confidence level; and (f) if the desired confidence level is not achieved, repeating (a)-(f). 12. The method of claim 11, further comprising executing a communication algorithm if the desired confidence level is achieved, wherein the communication algorithm comprises: receiving an allocated set of time slots for transmission of a communication signal; identifying a time slot of the allocated set of time slots that is no longer needed for transmission of the communication signal; and tuning to a network synchronization frequency during the identified time slot. 13. The method of claim 12, further comprising: receiving, during the identified time slot, a synchronization signal transmitted by a fourth communication node, wherein the fourth communication node is not in communication with the second network; and synchronizing with the fourth communication node using the synchronization signal thereby allowing communication between the fourth communication node and the second network. 14. The method of claim 11, wherein the second communication node is communicating with a third network. 15. The method of claim 14, further comprising selecting a time reference between the second network and the third network. 16. The method of claim 15, further comprising selecting a network from the second network and the third network to switch to the selected time reference. 17. The method of claim 16, further comprising sending a message to the selected network, the message directing the selected network to switch to the selected time reference. 18. The method of claim 16, wherein selecting the network uses a network identifier. 19. The method of claim 18, wherein the network identifier is selected from the group consisting of a radio number, a tail number, and an internet protocol address. 20. A computer-readable medium having computer-readable instructions stored thereon that, upon execution by a processor, cause the processor to allocate communication resources among a network of communication nodes to rapidly identify a new node capable of communication with the network, the instructions comprising: (a) executing a first search algorithm using a time division multiple access (TDMA) protocol, the TDMA protocol allocating a plurality of time slots, the search algorithm allocating one or more time slot of the plurality of time slots to communicate control information with a first communication node and allocating remaining time slots of the plurality of time slots to identify a second communication node; (b) identifying the second communication node; (c) synchronizing with the second communication node to form a network including the first communication node and the identified second communication node; (d) calculating a confidence level wherein the confidence level estimates the likelihood that a third communication node capable of communication with the network has not been identified; (e) comparing the calculated confidence level to a desired confidence level; and (f) if the desired confidence level is not achieved, repeating (a)-(f).
※ AI-Helper는 부적절한 답변을 할 수 있습니다.