Low-power autonomous node for mesh communication network
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04W-004/00
H04L-012/56
H04J-003/16
G08C-017/00
출원번호
UP-0960709
(2004-10-06)
등록번호
US-7529217
(2009-07-01)
발명자
/ 주소
Pister, Kristofer S. J.
Zats, Yuri S.
Conant, Rob
Treuhaft, Noah
출원인 / 주소
Dust Networks, Inc.
대리인 / 주소
Van Pelt, Yi & James LLP
인용정보
피인용 횟수 :
34인용 특허 :
24
초록▼
In a packet communication network, a method and apparatus for packet switched transport is provided among intelligent nodes wherein the duty cycling of the intelligent nodes is minimized in order to maximize power life using a synchronization algorithm that assures all nodes are able to propagate in
In a packet communication network, a method and apparatus for packet switched transport is provided among intelligent nodes wherein the duty cycling of the intelligent nodes is minimized in order to maximize power life using a synchronization algorithm that assures all nodes are able to propagate information through the network without undue use of transmission and reception power. Frequency hopping time-division multiple access supports packet communication between intelligent nodes via assigned directed links, each link being assigned to a time-channel offset (cell) in a superframe, so that a link carrying a packet string between any two intelligent nodes is active only during its assigned time slot. The result is efficient use of spectrum and minimal expenditure of power.
대표청구항▼
What is claimed is: 1. In a multi-hop packet-switched communication network, a method for routing packets comprising: providing at least a first intelligent node and a second intelligent node, said first intelligent node and said second intelligent node serving as intelligent nodes in said packet c
What is claimed is: 1. In a multi-hop packet-switched communication network, a method for routing packets comprising: providing at least a first intelligent node and a second intelligent node, said first intelligent node and said second intelligent node serving as intelligent nodes in said packet communication network and each said first intelligent node and said second intelligent node having independent intelligence for storing and redirecting units of communication traffic; providing at least one digraph, each said digraph being expressed as routing information for directional links at each intelligent node in the network, including at least a first intelligent node having a plurality of outgoing directional links from said first intelligent node to a second intelligent node, wherein each directed link in said digraph is specific to a time slot in a time-frequency space; generating a plurality of packets, each of said packets having a header; wherein, at each said individual intelligent node that is operative to receive a packet, determining: a) whether the packet is intended for said individual intelligent node; and b) whether the packet is of interest to said individual intelligent node; directing, via said routing information at each said intelligent node, said packets to flow between selected ones of said intelligent nodes according to one of said digraphs in accordance with a synchronized time and frequency communication plan; otherwise turning off transmission and receiving elements of said intelligent nodes to minimize power consumption when not receiving and directing said packets. 2. In a multi-hop packet-switched communication network, a method for routing packets comprising: providing at least a first intelligent node and a second intelligent node, said first intelligent node and said second intelligent node serving as intelligent nodes in said packet communication network and each said first intelligent node and said second intelligent node having independent intelligence for storing and redirecting units of communication traffic; providing at least one digraph, each said digraph being expressed as routing information for directional links at each intelligent node in the network, including at least a first intelligent node having a plurality of outgoing directional links from said first intelligent node to a second intelligent node; generating a plurality of packets, each of said packets having a header; wherein at least one said packet is assigned to a position in a selected time slot of fixed duration that is substantially longer in duration than any packet, wherein all said time slots are assembled into a superframe consisting of a variable number of said time slots; and wherein each one of said time slots is assigned to a selected frequency channel; directing, via said routing information at each said intelligent node, said packets to flow between selected ones of said intelligent nodes according to one of said digraphs in accordance with a synchronized time and frequency communication plan; otherwise turning off transmission and receiving elements of said intelligent nodes to minimize power consumption when not receiving and directing said packets. 3. The method according to claim 2 wherein each directed link in said digraph is specific to an assigned slot in time-frequency space. 4. The method according to claim 2 wherein said at least one said intelligent node determines that a received packet is of interest to itself if a specific destination pattern described in the received packet matches with said intelligent node. 5. The method according to claim 4 wherein a specific destination pattern includes a measured temperature at said intelligent node is within a preselected range. 6. The method according to claim 2 wherein said determining step comprises: detecting whether a "time to live" field has expired. 7. The method according to claim 2 wherein said determining step comprises: detecting whether the received packet has requested an action of which said intelligent node is capable; and, if said intelligent node is capable of the requested action, taking the requested action. 8. The method according to claim 7 wherein said requested action comprises: extracting a payload of the packet out of the network; and sending the payload to a destination via the Internet. 9. The method according to claim 7 wherein said requested action comprises: extracting a payload of the packet out of the mesh network; and causing a specific task that is local to said intelligent node to be performed. 10. In a multi-hop packet-switched communication network, a method for routing packets comprising: providing at least a first intelligent node and a second intelligent node, said first intelligent node and said second intelligent node serving as intelligent nodes in said packet communication network and each said first intelligent node and said second intelligent node having independent intelligence for storing and redirecting units of communication traffic; providing at least one digraph, each said digraph being expressed as routing information for directional links at each intelligent node in the network, including at least a first intelligent node having a plurality of outgoing directional links from said first intelligent node to a second intelligent node; generating a plurality of packets, each of said packets having a header; wherein superframe offsets, an identification tag of each intelligent node, a password, and selected information known to both ends of a directed link of a selected digraph are operative to move both channel and time slots with respect to time; directing, via said routing information at each said intelligent node, said packets to flow between selected ones of said intelligent nodes according to one of said digraphs in accordance with a synchronized time and frequency communication plan; otherwise turning off transmission and receiving elements of said intelligent nodes to minimize power consumption when not receiving and directing said packets.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (24)
Turner, Jonathan S.; Wyatt, Leonard F., Alternate paths in a self-routing packet switching network.
Baran Paul (Atherton CA) Flammer ; III George H. (Cupertino CA) Kalkwarf Robert L. (San Jose CA), Method and system for routing packets in a packet communication network.
Flammer ; III George H. (Cupertino CA), Method and system for routing packets in a packet communication network using locally constructed routing tables.
Flammer ; III George H. (Cupertino CA) Galloway Brett D. (Campbell CA) Paulsen David L. (Mountain View CA), Method for frequency sharing and frequency punchout in frequency hopping communications network.
Ritter Michael W. (Los Altos CA) Bettendorff John (San Jose CA) Flammer ; III George H. (Cupertino CA) Galloway Brett D. (Campbell CA), Method of loose source routing over disparate network types in a packet communication network.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P.; Blevins, Terrence L., Adaptive scheduling in a wireless network.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P., Combined wired and wireless communications with field devices in a process control environment.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Phinney, Thomas L.; Lennvall, Tomas P.; Zats, Yuri; Enns, Frederick, Enhancing security in a wireless network.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Phinney, Thomas L.; Lennvall, Tomas P.; Zats, Yuri; Enns, Frederick, Enhancing security in a wireless network.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P.; Blevins, Terrence L., Increasing reliability and reducing latency in a wireless network.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P.; Blevins, Terrence L., Priority-based scheduling and routing in a wireless network.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P.; Zats, Yuri; Blevins, Terrence L., Routing packets on a network using directed graphs.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P.; Zats, Yuri; Blevins, Terrence Lynn, Routing packets on a network using directed graphs.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P.; Zats, Yuri; Blevins, Terrence L., Scheduling communication frames in a wireless network.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P., Support for network management and device communications in a wireless network.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P.; Zats, Yuri, Synchronizing timeslots in a wireless communication protocol.
Pratt, Jr., Wallace A.; Nixon, Mark J.; Rotvold, Eric D.; Pramanik, Robin S.; Lennvall, Tomas P., Wireless gateway in a process control environment supporting a wireless communication protocol.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.