# US 7,411,919 B2 · Multi-hop time reservation using adaptive control for energy efficiency

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 7,411,919 B2
- Document ID: US7411919B2
- Status: Granted
- Kind: B2
- Application number: 10/388,762
- Filed: 2003-03-17
- Published: 2004-09-23
- Granted: 2008-08-12
- Earliest claimed: 2003-03-17
- Assignees: University of Rochester
- Inventors: Bulent Tavli; Wendi Heinzelman
- Web page: https://patentgrep.com/patent/US7411919B2

## CPC

- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04W 28/26: Resource reservation
- H04W 74/04: Scheduled access (hybrid access H04W74/02)
- Y02D 30/70: in wireless communication networks
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

The present invention extends the TRACE (Time Reservation Using Adaptive Control for Energy Efficiency) protocol to allow multi-hop communication in dispersed radio networks. The nodes in the network are dynamically clustered based on proximity and interference level. Time is divided into superframes, each cluster choosing a frame within the superframe for data transmission to reduce the likelihood of interference.

## Claims

### Claim 1

A method for transmitting information in a network having a plurality of nodes which are grouped into clusters, the method comprising:
(a) dividing time into superframes, each superframe comprising a predetermined number of frames, each frame comprising (i) a beacon slot for sending a beacon, (ii) a plurality of contention slots for sending requests for data slots, (iii) a header slot for sending a header which comprises a transmission schedule for the frame, (iv) a plurality of information summarization slots for sending summaries of the information, and (v) a plurality of data slots, each for information transmission by one of the nodes;
(b) permitting each of the clusters within the network to choose one of the predetermined number of frames;
(c) transmitting information within each of the clusters during said one of the predetermined number of frames in each superframe; and
(d) transmitting information between at least two of the clusters by way of one or more nodes;
wherein step (c) comprises:
(i) in each of the frames, permitting each of the plurality of nodes to reserve one of the plurality of data slots by sending the requests in the contention slots; and
(ii) maintaining a reservation of each of the plurality of data slots which is reserved by one of the plurality of nodes until said one of the plurality of nodes indicates that it has stopped transmitting; and wherein:
each node sends an information summarization packet during a corresponding one of the information summarization slots; and
each node indicates that it has stopped transmitting by sending an end-of-transmission bit in its information summarization packet.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
each node records a power level of the information summarization packet sent by each of a plurality of other nodes to determine a listening cluster of nodes based at least partially on proximity; and
said each node listens to the nodes in the listening cluster.

### Claim 3 (depends on 2)

The method of claim 2, wherein:
each node receives the information summarization packets sent by the nodes in its listening cluster, determines in accordance with the information summarization packets which information it wishes to receive, and listens only to the nodes sending the information that it wishes to receive.

### Claim 4 (depends on 3)

The method of claim 3, wherein, when a node is not transmitting information or listening, the node enters sleep mode.

### Claim 5 (depends on 1)

The method of claim 1, wherein, when a node sends the end-of-transmission bit, that node loses its reserved data slot.