System and method for artery node selection in an ad-hoc network
원문보기
IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
UP-0224823
(2005-09-13)
|
등록번호 |
US-7680068
(2010-04-21)
|
발명자
/ 주소 |
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
3 인용 특허 :
1 |
초록
▼
A system for optimizing an ad-hoc network. The system includes a plurality of nodes, wherein each node includes a computer implemented application configured to determine whether the present node is a link node such that the present node is the only node connecting at least one pair of nodes in the
A system for optimizing an ad-hoc network. The system includes a plurality of nodes, wherein each node includes a computer implemented application configured to determine whether the present node is a link node such that the present node is the only node connecting at least one pair of nodes in the ad-hoc network, determine a connection number for the present node, wherein the connection number is the number of pairs of nodes connected by the present node not including pairs of nodes connected by link nodes, and determine whether the present node should be classified as an artery node based on the link node and connection number classifications.
대표청구항
▼
What is claimed is: 1. A system for optimizing an ad-hoc network, comprising: a plurality of nodes, wherein each node includes a computer implemented application configured to: a. determine that a present node has a link node classification when the present node is the only node connecting a pair o
What is claimed is: 1. A system for optimizing an ad-hoc network, comprising: a plurality of nodes, wherein each node includes a computer implemented application configured to: a. determine that a present node has a link node classification when the present node is the only node connecting a pair of nodes in the ad-hoc network on a two-hop connection, wherein the two-hop connection is the only two-hop connection connecting the pair of nodes and wherein the two nodes of the pair of nodes are not otherwise directly connected; b. determine a connection number for the present node, wherein if the present node does not have the link node classification, the connection number is a number of two-hop connections having the present node as an intermediary node and having the two end nodes of each connection not otherwise directly connected; and c. determine whether the present node should be classified as an artery node based on the link node classification or the connection number. 2. The system of claim 1, wherein the connection number is set to infinity if the present node has the link node classification. 3. The system of claim 1, wherein the computer implemented application is further configured to broadcast to and receive from other nodes within the ad-hoc network connection numbers and active artery node statuses. 4. The system of claim 3, wherein the computer implemented application is further configured to determine whether the present node should be classified as an artery node based on the received connection numbers and active artery node statuses from the other nodes. 5. The system of claim 3, further including determining whether a node previously designated as an artery node should no longer be classified as an artery node based on the received connection numbers and active artery node statuses from the other nodes. 6. The system of claim 3, wherein the broadcasted connection numbers and active artery node statuses include the connection number and active artery node status for the present node and the connection numbers and active artery node statuses for the 1-hop neighbors of the present node. 7. A computer implemented method for optimizing an ad-hoc network, the method comprising: determining that a present node has a link node classification when the present node is the only node connecting a pair of nodes in the ad-hoc network on a two-hop connection, wherein the two-hop connection is the only two-hop connection connecting the pair of nodes and wherein the two nodes of the pair of nodes are not otherwise directly connected; determining a connection number for the present node, wherein if the present node does not have the link node classification, the connection number is a number of two-hop connections having the present node as an intermediary node and having the two end nodes of each connection not otherwise directly connected; and determining whether the present node should be classified as an artery node based on the link node classification or the connection number. 8. The method of claim 7, wherein the connection number is set to infinity if the present node has the link node classification. 9. The method of claim 7, further including broadcasting to and receiving from other nodes within the ad-hoc network connection numbers and active artery node statuses. 10. The method of claim 9, further including determining whether the present node should be classified as an artery node based on the received connection numbers and active artery node statuses from the other nodes. 11. The method of claim 9, further including determining whether a node previously designated as an artery node should no longer be classified as an artery node based on the received connection numbers and active artery node statuses from the other nodes. 12. The method of claim 11, further including classifying the artery node that should no longer be classified as an artery node as a deprecated artery node during a waiting period. 13. The method of claim 9, wherein the broadcasted connection numbers and active artery node statuses include the connection number and active artery node status for the present node and the connection numbers and active artery node statuses for 1-hop neighbors of the present node. 14. A tangible machine readable medium for optimizing an ad-hoc network, comprising machine-readable program code for causing, when executed, one or more machines to perform the following method steps: a. determine that a present node has a link node classification when the present node is the only node connecting a pair of nodes in the ad-hoc network on a two-hop connection, wherein the two-hop connection is the only two-hop connection connecting the pair of nodes and wherein the two nodes of the pair of nodes are not otherwise directly connected; b. determine a connection number for the present node, wherein if the present node does not have the link node classification, the connection number is a number of two-hop connections having the present node as an intermediary node and having the two end nodes of each connection not otherwise directly connected; and c. determine whether the present node should be classified as an artery node based on the link node classification or the connection number. 15. The machine readable medium of claim 14, wherein the connection number is set to infinity if the present node has the link node classification. 16. The machine readable medium of claim 14, wherein the program code is further configured to broadcast to and receive from other nodes within the ad-hoc network connection numbers and active artery node statuses. 17. The machine readable medium of claim 16, further including determining whether the present node should be classified an artery node based on the received connection numbers and active artery node statuses from the other nodes. 18. The machine readable medium of claim 16, further including determining whether a node previously designated as an artery node should no longer be classified as an artery node based on the received connection numbers and active artery node statuses from the other nodes. 19. The machine readable medium of claim 18, further including classifying the artery node that should no longer be classified as the artery node as a deprecated artery node during a waiting period. 20. The machine readable medium of claim 16, wherein the broadcasted connection numbers and active artery node statuses include the connection number and active artery node status for the present node and the connection numbers and active artery node statuses for 1-hop neighbors of the present node.
이 특허에 인용된 특허 (1)
-
Liu,Yu Jih; Visvader,Joseph John; Schnabel,Jon William, Method and apparatus for on demand multicast and unicast using controlled flood multicast communications.
이 특허를 인용한 특허 (3)
-
Walton, J. Rodney; Ketchum, John W; Michaelis, Oliver, Methods and systems for exploitation of well-connected nodes in peer-to-peer wireless networks.
-
Walton, J. Rodney; Ketchum, John W; Michaelis, Oliver, Methods and systems for exploitation of well-connected nodes in peer-to-peer wireless networks.
-
Rudnick, William Michael; Pun, Ngan-cheung; Clark, David; Datz, Charles Joseph, Mobile ad hoc network with dynamic TDMA slot assignments and related methods.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.