IP Library Granted Patent US 8,811,188
Granted Patent B1
US 8,811,188 · App. 13/361,639 · Granted Aug 19, 2014

Protocol for secure and energy-efficient reprogramming of wireless multi-hop sensor networks

Inventors: Saurabh Bagchi (West Lafayette, IN); Ness B. Shroff (West Dublin, OH); Issa M. I. Khalil (Al Ain, AE); Rajesh K. Panta (West Lafayette, IN); Mark D. Krasniewski (Austin, TX); James V. Krogmeier (West Lafayette, IN)
Assignee: Purdue Research Foundation
H04W84/02G06F8/65H04W52/02H04L45/02
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,811,188
App. No.
13/361,639
Granted
Aug 19, 2014
Kind
B1
Abstract

A protocol for optimizing the energy for code upload to sensors in a wireless sensor network and speeding up the dissemination if multiple sources of code are available. Energy optimization is achieved by equipping each node with limited non-local topology information, which it uses to determine the time when it can sleep since code is not being distributed in its vicinity. Another aspect of the invention is a protocol that facilitates secure upload of code in the wireless sensor network. The secure communication protocol divides the sensor field into control groups each with a control node, and manages data exchange between nodes within a control group through the mediation of a control head which provides the common key. The keys are refreshed periodically and the control nodes are changed periodically to enhance security. The protocol facilitates secure communication between sensor nodes despite the compromise of other nodes in the network.

Claims (13)

1. A method of reprogramming for a wireless sensor network using a three-way handshake protocol for transfer of new code from an originator of new code to a plurality of sensor nodes in the network, said handshake protocol including advertising, request and data transfer messages, said method comprising:

segmenting said new code into multiple pages each split into multiple packets;

performing a three-way handshake in units of a page, transmitting each page of said new code in units of a packet; and

enabling each node to receive pages of said new code out of order from multiple sources;

propagating a warning message containing information about the nature of new code to be transmitted, said warning message including network topology information indicative of the routing of the warning message from the originator;

at each node which receives the warning message, estimating the propagation time from the originator based on the network topology information contained in said warning message and, based on the propagation time length, conditionally disabling RF circuitry to reduce power consumption during a corresponding sleep period;

each node updating the network topology information indicative of the routing of said warning message and forwarding the updated warning message to other nodes in the network; and

each node waking up at the end of said sleep period and initiating a three-way handshake protocol for transfer of code, said node receiving advertising messages from other nodes relating to new code, sending request messages for needed code, receiving needed code, and sending advertising messages to other nodes in the network relating to received code.

2. The method of claim 1 , wherein a node is adapted to forward code to neighboring nodes once it has one page of a new version of code.

3. The method of claim 1 , wherein said originator is a base station for said plurality of sensor nodes, and wherein said new code is broadcast from said base station and propagated by sensor nodes through said wireless sensor network to other sensor nodes in the network via multiple hops from said base station.

4. The method of claim 1 , wherein each node cyclically turns its RF circuitry on and off during a quiescent phase between introductions of new code, the off time during each cycle based on the number of neighboring nodes in the network.

5. The method of claim 4 wherein each node is awake at least half the time.

6. The method of claim 5 , further comprising a pull-based mechanism for servicing new nodes in the network, each new node alerting other nodes by advertising its current code, other nodes responding by advertising available new code.

Assignments (1)
CONFIRMATORY LICENSE Recorded May 23, 2012
From: PURDUE UNIVERSITY
To: NATIONAL SCIENCE FOUNDATION
Reel/Frame 028260/0546 →
Continuity (3)
Continuation 11758636 · Jun 5, 2007
Provisional Application 60810962 · Jun 5, 2006
Provisional Application 60910533 · Apr 6, 2007