Hart Communication Foundation

Dust Networks, Inc.

Fieldcomm Group, Inc.

Yuri Zats

Mark J Nixon

Eric Darrell Rotvold

Tomas Lennvall

Wallace A Pratt, Jr

Robin S Pramanik

Terrence L Blevins

Kristofer S J Pister

Frederick R Enns

Thomas L Phinney

Noah Treuhaft

Lance Robert Doherty

William Alan Lindsay

Rob Conant

Robert Alan Contant

Tomas P Lennvall

Rick Enns

A method of routing a data packet between a first node and a second node on a communication network includes defining a first graph through the first node and the second node and zero or more intermediate nodes, associating several nodes which belong to the communication network with the first graph, associating a first unique graph identifier with the first graph and providing at least partial definitions of the first graph and the first unique identifier to at least some of the nodes associated with the first graph. The method then sends data packet with the graph identifier from the first node, and directs the data packet to the second node via the zero or more intermediate nodes using the graph identifier. This method may include forwarding the packet to a neighbor node of an intermediate node if the intermediate node and the neighbor node are nodes associated with the first graph and if the intermediate node and the neighbor node are connected by at least one direct communication connection.

Routing packets on a network using directed graphs

A method of enhancing security in a wireless mesh communication network operating in a process control environment and including a plurality of wireless network devices includes processing a join request from a wireless device wishing to join the wireless mesh communication network, providing a limited network functionality to the wireless device if the join request is granted, requesting a complete approval of the wireless device; and granting a full network functionality to the wireless device if the complete approval of the wireless device is received.

Enhancing security in a wireless network

A method for synchronizing communications in wireless mesh network operating in a process control environment and including a plurality of network devices includes defining a communication timeslot of a predetermined duration, wherein each of the plurality of network devices transmits or receives data only within the communication timeslot generating a network schedule including at least one superframe having repeating superframe cycles each having a number of communication timeslots sequentially numbered relative to a beginning of each cycle, the number of communication timeslots defining a length of the at least one superframe, maintaining an absolute slot number indicative of a number of communication timeslots scheduled since a start time of the wireless network, synchronizing each of the plurality of network devices with respect to a timing of an individual communication timeslot, and synchronizing each of the plurality of network devices with the network schedule based on the absolute slot number.

Synchronizing timeslots in a wireless communication protocol

Self managing a low power network is disclosed. A packet is received which includes network information and it is determined if a management action is required based at least in part on information in the packet. In the event that management action is required, the management action is performed wherein the management action is determined based at least in part on information in the packet.

Self managing a low power network

A method of scheduling communications in a multi-node wireless mesh network which has a first network device and a second network device includes defining a communication timeslot of a predetermined duration, defining a first superframe having a repeating superframe cycle including a first number of the communication timeslots, defining a second superframe having a repeating superframe cycle including a second number of the communication timeslots, aligning the first superframe with the second superframe, so that one of the timeslots of the first superframe begins simultaneously with one of the timeslots of the second superframe, and associating the first and the second superframes with a network schedule, so that the first network device and the second network device transmit data according to the network schedule.

Scheduling communication frames in a wireless network

A device for a node in a digraph network comprising is disclosed. The device comprises an internal time reference, a radio receiver, a radio transmitter. The device further comprises a temperature sensor for stabilizing the internal time reference against drifting with respect to an internal time reference of another node in the network and a microprocessor for managing the reception and transmission of information.

Low-powered autonomous radio node with temperature sensor and crystal oscillator

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.

Growing community of inventors

Menlo Park, CA, United States of America

Yuri Zats