Distance vector routing via multi-point relays
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-012/28
H04B-007/14
H04J-003/08
출원번호
US-0302865
(2005-12-14)
등록번호
US-8199677
(2012-06-12)
발명자
/ 주소
Amis, Alan D.
Stevens, James A.
Young, Charles D.
출원인 / 주소
Rockwell Collins, Inc.
대리인 / 주소
Suchy, Donna P.
인용정보
피인용 횟수 :
21인용 특허 :
3
초록▼
The present invention is a method and system for propagating routing information in a wireless network. In an exemplary embodiment, the method includes defining a set of artery nodes to propagate distance vector routing information throughout the wireless network. The set of artery nodes may broadca
The present invention is a method and system for propagating routing information in a wireless network. In an exemplary embodiment, the method includes defining a set of artery nodes to propagate distance vector routing information throughout the wireless network. The set of artery nodes may broadcast distance vector routing information to neighboring network nodes. The method may also include receiving distance vector routing information by the neighboring nodes to modify distance vector routing tables defined within each of the neighboring nodes. The set of artery nodes may then re-broadcast distance vector routing information in order to propagate distance vector routing information throughout the wireless network.
대표청구항▼
1. A method for propagating network node topology data in a wireless network, the method comprising: electing a set of artery nodes to operate as multi-point relay (MPR) nodes using an algorithm, wherein a node, X, is an artery node when it is the midpoint of the shortest hop path between nodes Y an
1. A method for propagating network node topology data in a wireless network, the method comprising: electing a set of artery nodes to operate as multi-point relay (MPR) nodes using an algorithm, wherein a node, X, is an artery node when it is the midpoint of the shortest hop path between nodes Y and Z, said nodes Y and Z are not neighbors of each other and for which X is their only common neighbor node;transmitting distance vector routing information from each of the set of all artery and non-artery nodes to each node's respective one hop neighbor nodes;receiving said distance vector routing information by the one hop neighbor nodes of each of said set of all artery and non-artery nodes;updating a distance vector routing table defined within each of said set of all artery and non-artery nodes with received distance vector routing information; andtransmitting updated distance vector routing information from only the artery nodes to each of the respective one hop neighbor nodes of the artery nodes in order to propagate distance vector routing information throughout the wireless network. 2. The method of claim 1, wherein said respective one hop neighbor nodes include artery nodes and non-artery nodes. 3. The method of claim 1, wherein the transmitting of distance vector routing information from the set of artery nodes to propagate distance vector routing information throughout the wireless network includes information received by each neighboring network node that is one hop away from each of the artery nodes included within the set of artery nodes. 4. The method of claim 1, wherein the wireless network is a mobile ad-hoc network (MANET). 5. The method of claim 1, wherein the method is implemented in a radio system. 6. The method of claim 5, wherein the radio system is a Cluster 1 Joint Tactical Radio System (JTRS), a Cluster 5 JTRS, or an airborne maritime and fixed-station (AMF) JTRS. 7. A system for propagating network node topology data in a wireless network, the system comprising: a memory;a processor configured for being communicatively coupled to the memory, the processor being configured to execute an algorithm to elect a plurality of artery nodes such that a node, X, is an artery node when it is the midpoint of the shortest hop path between nodes Y and Z, said nodes Y and Z are not neighbors of each other and for which X is their only common neighbor node;the plurality of artery nodes operating as multi-point relay (MPR) nodes to propagate distance vector routing information throughout the wireless network; anda plurality of non-artery nodes communicatively coupled to the plurality of artery nodes, each non-artery node being located one hop from at least one artery node included in the plurality of artery nodes;wherein the plurality of artery nodes and the plurality of non-artery nodes each transmit distance vector routing information to their respective one hop neighbor nodes, which subsequently modify a routing table defined within each one hop neighbor node, and updated distance vector routing information based upon the routing table modifications is transmitted only from the plurality of artery nodes to each respective one hop neighbor node of the plurality of artery nodes in order to propagate distance vector routing information throughout the wireless network. 8. The system of claim 7, wherein the wireless network is a mobile ad-hoc network (MANET). 9. The system of claim 7, wherein the system is implemented in a radio system. 10. The system of claim 9, wherein the radio system is a Cluster 1 Joint Tactical Radio System (JTRS), a Cluster 5 JTRS, or an airborne maritime and fixed-station (AMF) JTRS. 11. A non-transitory computer-readable medium having computer-executable instructions for performing a method for propagating network node topology data in a wireless network, the method comprising: electing a set of artery nodes to operate as multi-point relay (MPR) nodes using an algorithm, wherein a node, X, is an artery node when it is the midpoint of the shortest hop path between nodes Y and Z, said nodes Y and Z are not neighbors of each other and for which X is their only common neighbor node;transmitting distance vector routing information from each of the set of all artery and non-artery nodes to each node's respective one hop neighbor nodes;receiving said distance vector routing information by the one hop neighbor nodes of each of said set of all artery and non-artery nodes;updating a distance vector routing table defined within each of said set of all artery and non-artery nodes with received distance vector routing information; andtransmitting updated distance vector routing information from only the artery nodes to each of the respective one hop neighbor nodes of the artery nodes in order to propagate distance vector routing information throughout the wireless network. 12. The non-transitory computer-readable medium of claim 11, wherein said respective one hop neighbor nodes include artery nodes and non-artery nodes. 13. The non-transitory computer-readable medium of claim 11, wherein the wireless network is a mobile ad-hoc network (MANET).
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (3)
Perkins Charles E. (Ossining NY), Highly dynamic destination-sequenced destination vector routing for mobile computers.
Rudnick, William Michael; Pun, Ngan-cheung; Clark, David; Datz, Charles Joseph, Mobile ad hoc network with dynamic TDMA slot assignments and related methods.
Smith, Wayne B.; Powers, Charles; Lin, Ellen K.; Dowin, Christopher T.; Sharpe, Ryan E., Noise, encryption, and decoys for communications in a dynamic computer network.
Stevens, James A.; Young, Charles D.; Ahmed, Syed A., Slot-by-slot preamble acquisition control to increase network capacity in mobile ad hoc networks.
Smith, Wayne B.; Lin, Ellen K., Systems and methods for identifying, deterring and/or delaying attacks to a network using shadow networking techniques.
Smith, Wayne B.; Powers, Charles; Lin, Ellen K.; Dowin, Christopher T.; Sharpe, Ryan E., Systems and methods for implementing moving target technology in legacy hardware.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.