IP Library Granted Patent US 8,619,644
Granted Patent B2
US 8,619,644 · App. 12/919,524 · Granted Dec 31, 2013

Robust coding in multi-hop networks

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,619,644
App. No.
12/919,524
Granted
Dec 31, 2013
Kind
B2
Abstract

A method and apparatus make use of a multiple receiver frame aggregation for creating data units so that they require acknowledgment of a single packet data unit by a group of several intended receivers. A multi-hop topology information regarding the neighborhood of a destination node can be used to derive the intended receivers which acknowledge a packet transmission besides the primary destination node of the packet.

Claims (30)

1. An apparatus for broadcasting packet data by a sender node to a destination node multi-hop wireless network, said apparatus comprising:

a memory storing instructions; and

a processor which, when the instructions are executed by the processor, configure the processor:

to derive a multi-hop topology information of a target node;

derive a reception history of neighboring nodes of a selected node;

to determine a group of receiving nodes based on said multi-hop topology information and the reception history; and

to specify at least two receiving nodes of said group in a multiple receiver frame aggregation for packing data units, wherein the at least two specified receiving nodes and the destination node must send back acknowledgements to the sender node.

2. The apparatus according to claim 1 , wherein said processor is further configured to derive said multi-hop topology information by a beaconing procedure.

3. The apparatus according to claim 2 , wherein said multi-hop topology information comprises a beacon group of immediate neighbors of a destination node, and an extended beacon group of neighbor nodes of at least one node of said beacon group.

4. The apparatus according to claim 1 , wherein said processor is further configured to determine said group of receiving nodes based on a first condition which requires that a potential receiving node had received a previously transmitted packet, and a second condition which requires at least one additional potential receiving node capable of decoding a packet to be transmitted.

5. The apparatus according to claim 1 , wherein said processor is further configured to dynamically configure at least one channel access parameter in accordance with an information content of a packet to be transmitted.

6. The apparatus according to claim 5 , wherein said at least one channel access parameter comprises at least one of a contention window size and an arbitration inter frame space.

7. The apparatus according to claim 5 , wherein said processor is further configured to dynamically configure said at least one channel access parameter by estimating throughput as a function of a predetermined traffic class.

8. The apparatus according to claim 5 , wherein said processor is further configured to dynamically configure said at least one channel access parameter by using a look-up table which stores pre-defined values of said at least one channel access parameter.

9. A system for broadcast transmission in a multi-hop network, said system comprising at least two network nodes each having an apparatus according to claim 1 .

10. The apparatus of claim 1 , wherein the processor is further configured to includes addresses of the at least two specified receiving nodes in a packet sent by the sender.

11. A method of broadcasting packet data by a sender node to a destination node in a multi-hop wireless network, said method comprising the acts of:

deriving by a processor a multi-hop topology information of a target node;

deriving a reception history of neighboring nodes of a selected node;

determining a group of receiving nodes based on said multi-hop topology information and the reception history;

specifying at least two receiving nodes of said group in a multiple receiver frame aggregation for packing data units; and

the at least two specified receiving nodes and the destination node sending back acknowledgements to the sender node.

12. The method of claim 11 , wherein the specifying act includes the act of including addresses of the at least two specified receiving nodes in a packet sent by the sender.

13. A non-transitory computer readable medium comprising computer instructions which, when executed by a processor, configure the processor to perform the acts of:

deriving a multi-hop topology information of a target node;

deriving a reception history of neighboring nodes of a selected node;

determining a group of receiving nodes based on said multi-hop topology information and the reception history;

specifying at least two receiving nodes of said group in a multiple receiver frame aggregation for packing data units; and

the at least two specified receiving nodes and the destination node sending back acknowledgements to the sender node.

14. The non-transitory computer readable medium of claim 13 , wherein the specifying act includes the act of including addresses of the at least two specified receiving nodes in a packet sent by the sender.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2017
From: PHILIPS LIGHTING HOLDING B.V.
To: PHILIPS LIGHTING HOLDING B.V.; KONINKLIJKE PHILIPS N.V.
Reel/Frame 042782/0045 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 13, 2016
From: KONINKLIJKE PHILIPS N.V.
To: PHILIPS LIGHTING HOLDING B.V.
Reel/Frame 040060/0009 →
CHANGE OF NAME Recorded Jul 22, 2016
From: KONINKLIJKE PHILIPS ELECTRONICS N.V.
To: KONINKLIJKE PHILIPS N.V.
Reel/Frame 039428/0606 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 26, 2010
From: ARGYRIOU, ANTONIOS
To: KONINKLIJKE PHILIPS ELECTRONICS N V
Reel/Frame 024889/0907 →