System and method for optimizing battery life in wireless multi-hop communication systems

Patent metadata

Field	Value
Publication number	US-9578599-B2
Application number	US-201414243202-A
Country	US
Kind code	B2
Filing date	Apr 2, 2014
Priority date	Apr 25, 2013
Publication date	Feb 21, 2017
Grant date	Feb 21, 2017

Abstract

Systems and methods for optimizing battery life in wireless multi-hop communication systems are provided. Some methods include a child node transmitting a data packet to a parent node in a wireless system, wherein the data packet includes a parent node identifier, data information, and a length of the data information, and wherein the data packet omits inclusion of a child node identifier. Some methods include a parent node receiving a data packet from a child node in a wireless system, wherein the data packet includes a parent node identifier, data information, and a length of the data information, and wherein the data packet omits inclusion of a child node identifier.

First claim

What is claimed is:

1. A method comprising:
a child node transmitting a first data packet to a first parent node in a wireless system; and
the first parent node transmitting a second data packet to a second parent node in the wireless system,
wherein the second parent node is a parent node of the first parent node,
wherein the first data packet includes a first identifier identifying the first parent node, first data information, and a first length of the first data information,
wherein the child node identifies itself to the first parent node based on a first assigned time slot during which the first data packet is transmitted, but the first data packet omits inclusion of a child node identifier,
wherein the second data packet includes a second identifier identifying the second parent node, the child node identifier, the first data information, and the first length of the first data information, and
wherein the first parent node identifies itself to the second parent node based on a second assigned time slot during which the second data packet is transmitted, but the second data packet omits inclusion of the first identifier identifying the first parent node.

2. The method of claim 1 further comprising:
the first parent node inserting the child node identifier into the second data packet.

3. The method of claim 2 wherein the first parent node inserting the child node identifier into the second data packet includes the first parent node inserting the child node identifier directly into the second data packet.

4. The method of claim 2 wherein the first parent node inserting the child node identifier into the second data packet includes the first parent node inserting the child node identifier into a position of the child node in a bitmap in the second data packet.

5. The method of claim 1 further comprising:
the first parent node inserting second data information and a second length of the second data information into the second data packet.

6. The method of claim 1 wherein the child node is at least one of a source node, a repeater node, and a repeater/source node.

7. The method of claim 1 wherein the first parent node is at least one of a source node, a repeater node, and a repeater/source node.

8. A method comprising:
a first parent node receiving a first data packet from a child node in a wireless system; and
a second parent node receiving a second data packet from the first parent node in the wireless system,
wherein the second node is a parent node of the first parent node,
wherein the first data packet includes a first identifier identifying the first parent node, first data information, and a first length of the first data information,
wherein the first parent node identifies the child node based on a first assigned time slot during which the first data packet is transmitted, but the first data packet omits inclusion of a child node identifier,
wherein the second data packet includes a second identifier identifying the second parent node, the child node identifier, the first data information, and the first length of the first data information, and
wherein the second parent node identifies the first parent node based on a second assigned time slot during which the second data packet is transmitted, but the second data packet omits inclusion of the first identifier identifying the first parent node.

9. The method of claim 8 further comprising:
the first parent node inserting the child node identifier into the second data packet.

10. The method of claim 9 wherein the first parent node inserting the child node identifier into the second data packet includes the first parent node inserting the child node identifier directly into the second data packet.

11. The method of claim 9 wherein the first parent node inserting the child node identifier into the second data packet includes the first parent node inserting the child node identifier into a position of the child node in a bitmap in the second data packet.

12. The method of claim 8 further comprising:
the first parent node inserting second data information and a second length of the second data information into the second data packet.

13. The method of claim 8 wherein the child node is at least one of a source node, a repeater node, and a repeater/source node.

14. The method of claim 8 wherein the first parent node is at least one of a source node, a repeater node, and a repeater/source node.

Assignees

• Honeywell Int Inc

Inventors

• Kore Vinayak Sadashiv
• Farrell Jason M
• Berezowski Andrew G
• Kurtz Edward J
• Bohanon Mark C

Classifications

• H04W84/18

  Self-organising networks, e.g. ad-hoc networks or sensor networks · CPC title

• H04W52/0212 Primary

  managed by the network, e.g. network or access point is leader and terminal is follower · CPC title

• H04W52/0206

  in access points, e.g. base stations · CPC title

• H04L67/147

  Signalling methods or messages providing extensions to protocols defined by standardisation · CPC title

• H04L29/0863

  Electricity · mapped topic