Method providing adhoc network state to support distributed scheduling
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-012/727
H04W-040/02
H04L-012/733
H04L-012/701
H04L-012/751
H04L-012/721
H04W-084/18
출원번호
US-0490131
(2012-06-06)
등록번호
US-9515913
(2016-12-06)
발명자
/ 주소
Lord, Bruce J.
출원인 / 주소
The Boeing Company
대리인 / 주소
Toler Law Group, P.C.
인용정보
피인용 횟수 :
0인용 특허 :
9
초록▼
A computer-based system to schedule network traffic in a communication network includes a processor coupled to a first node of a network, a memory module coupled to the processor. Logic instructions are stored on a tangible computer readable medium which, when executed by the processor, configure th
A computer-based system to schedule network traffic in a communication network includes a processor coupled to a first node of a network, a memory module coupled to the processor. Logic instructions are stored on a tangible computer readable medium which, when executed by the processor, configure the processor to receive at the first node of the network, situational awareness information from at least a second network node which is directly accessible by the first node, identify, in the first node, situational awareness information commonly known by multiple nodes across the network, generate a network schedule based on the commonly known situational information, generate a shortest path routing table from the first node to all other network nodes based on the network schedule, and route network traffic at the first node using the network schedule.
대표청구항▼
1. A method comprising: receiving, at a first node device of a communication network, first situational awareness information from a second node device within range of the first node device, wherein the first situational awareness information includes a data frame associated with a first time, where
1. A method comprising: receiving, at a first node device of a communication network, first situational awareness information from a second node device within range of the first node device, wherein the first situational awareness information includes a data frame associated with a first time, wherein the data frame includes first link information corresponding to a link between the second node device and a third node device at the first time;storing a portion of the first situational awareness information at the first node device; after storing the portion of the first situational awareness information, routing network traffic at the first node device based on second situational awareness information stored at the first node device, wherein the second situational awareness information is common to the first node device, the second node device, and the third node device, wherein the second situational awareness information includes second link information corresponding to the link between the second node device and the third node device at a second time, the second time after the first time;after routing the network traffic at the first node device based on the second situational awareness information, routing second network traffic at the first node device based on the first situational awareness information;determining, based on the second situational awareness information, shortest routing paths from the first node device to a plurality of node devices;determining, based on the shortest routing paths, a maximum network hop parameter;storing the maximum network hop parameter at a situational awareness information frame, wherein the situational awareness information frame is associated with a time tag indicating that a current time is a generation time for the situational awareness information frame; andtransmitting third situational awareness information, wherein the third situational awareness information is distinct from the first situational awareness information and the second situational awareness information, and wherein the third situational awareness information includes the maximum network hop parameter. 2. The method of claim 1, wherein the second situational awareness information is associated with a particular situational awareness information frame that is selected from a plurality of situational awareness information frames based on a particular frame number of the particular situational awareness information frame. 3. The method of claim 2, wherein the particular frame number is equal to a maximum number of hops for a message to reach every node of the communication network via a shortest route from the first node device. 4. The method of claim 1, wherein storing the first situational awareness information at the first node device includes generating a first frame of a plurality of situational awareness information frames based on the first situational awareness information, wherein the second situational awareness information is stored in a second frame of the plurality of situational awareness information frames, and wherein the third situational awareness information is stored in the first frame. 5. The method of claim 4, wherein the first situational awareness information is received during a first scheduling time period, and further comprising: receiving, during a second scheduling time period, fourth situational awareness information from the second node device;generating a third frame of the plurality of situational awareness information frames based on the fourth situational awareness information; andupdating multiple frame numbers corresponding to multiple frames of the plurality of situational awareness information frames. 6. The method of claim 4, wherein the first frame is generated based on fourth situational information received from the third node device. 7. A system comprising: a processor coupled to a first node device of a communication network;a memory module coupled to the processor, wherein the memory module includes instructions that, when executed by the processor, cause the processor to perform operations comprising: receiving, at the first node device of the communication network, first situational awareness information from a second node device within range of the first node device, wherein the first situational awareness information includes a data frame associated with a first time, wherein the data frame includes first link information corresponding to a link between the second node device and a third node device at the first time;storing a portion of the first situational awareness information at the first node device;after storing the portion of the first situational awareness information, routing network traffic at the first node device based on second situational awareness information stored at the first node device, wherein the second situational awareness information is common to the first node device, the second node device, and the third node device, wherein the second situational awareness information includes second link information corresponding with the link between the second node device and the third node device at a second time, the second time after the first time;after routing the network traffic at the first node device based on the second situational awareness information, routing second network traffic at the first node device based on the first situational awareness information;determining, based on the second situational awareness information, shortest routing paths from the first node device to a plurality of node devices;determining, based on the shortest routing paths, a maximum network hop parameter;storing the maximum network hop parameter at a situational awareness information frame, wherein the situational awareness information frame is associated with a time tag indicating that a current time is a generation time for the situational awareness information frame; andtransmitting third situational awareness information, wherein the third situational awareness information is distinct from the first situational awareness information and the second situational awareness information, andwherein the third situational awareness information includes the maximum network hop parameter. 8. The system of claim 7, wherein the operations further include updating situational awareness information associated with a plurality of situational awareness information frames at the first node device based on the first situational awareness information. 9. The system of claim 8, wherein a first frame of the plurality of situational awareness information frames is associated with a third time corresponding to when the first frame was generated, wherein the first situational awareness information includes node status information associated with a fourth time corresponding to when the node status information was generated, and wherein the first frame is updated with the node status information when the third time corresponds to the fourth time. 10. The system of claim 7, wherein the first situational awareness information comprises a second maximum network hop parameter that indicates a maximum number of hops for a message to reach every node of the communication network when taking a shortest routing path from the second node device. 11. The system of claim 7, wherein storing the first situational awareness information at the first node device includes generating a first frame of a plurality of situational awareness information frames based on the first situational awareness information, wherein the second situational awareness information is stored in a second frame of the plurality of situational awareness information frames, and wherein the operations further comprise transmitting the third situational awareness information to the third node device. 12. A non-transitory computer-readable medium comprising instructions that, when executed by a processor, cause the processor to perform operations comprising: receiving, at a first node device of a communication network, first situational awareness information from a second node device within range of the first node device, wherein the first situational awareness information includes a data frame associated with a first time, wherein the data frame includes first link information corresponding to a link between the second node device and a third node device at the first time;storing a portion of the first situational awareness information at the first node device;after storing the portion of the first situational awareness information, routing network traffic at the first node device based on second situational awareness information stored at the first node device, wherein the second situational awareness information is common to the first node device, the second node device, and the third node device, wherein the second situational awareness information includes second link information corresponding with the link between the second node device and the third node device at a second time, the second time after the first time;after routing the network traffic at the first node device based on the second situational awareness information, routing second network traffic at the first node device based on the first situational awareness information;determining, based on the second situational awareness information, shortest routing paths from the first node device to a plurality of node devices;determining, based on the shortest routing paths, a maximum network hop parameter; storing the maximum network hop parameter at a situational awareness information frame, wherein the situational awareness information frame is associated with a time tag indicating that a current time is a generation time for the situational awareness information frame; andtransmitting third situational awareness information, wherein the third situational awareness information is distinct from the first situational awareness information and the second situational awareness information, and wherein the third situational awareness information includes the maximum network hop parameter. 13. The non-transitory computer-readable medium of claim 12, wherein the operations further comprise updating situational awareness information associated with a plurality of situational awareness information frames at the first node device based on the first situational awareness information. 14. The non-transitory computer-readable medium of claim 13, wherein a first frame of the plurality of situational awareness information frames is associated with a third time corresponding to when the first frame was generated, wherein the first situational awareness information includes node status information associated with a fourth time corresponding to when the node status information was generated, and wherein the first frame is updated with the node status information when the third time corresponds to the fourth time. 15. The non-transitory computer-readable medium of claim 13, wherein the second network traffic is routed during a time period after the network traffic is routed, wherein the time period is based on a difference between the first time and the second time. 16. The non-transitory computer-readable medium of claim 12, wherein the operations further comprise: generating a path routing table from the first node device to each other node device of the communication network based on the second situational awareness information; androuting network traffic at the first node device using the second situational awareness information and the path routing table. 17. The non-transitory computer-readable medium of claim 12, wherein the first situational awareness information comprises a second maximum network hop parameter that indicates a maximum number of hops for a message to reach every node of the communication network when taking a shortest routing path from the second node device.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (9)
Ghanadan, Reza; Gu, John A.; Hsu, Jessica; Sadosuk, Gregory S.; Khuu, Phong C., Adaptive message routing for mobile ad HOC networks.
Ghosh,Arpita; Greene,Daniel H; Huang,Qingfeng; Liu,Juan, Methods, apparatus, and program products for applying a visibility function to networked information.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.