RPL-based Clustering Routing Protocol
draft-tan-roll-clustering-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Yuan-Rui Tan | ||
| Last updated | 2015-12-27 (Latest revision 2015-06-25) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) is one of the emerging routing standards for multi-hop Wireless Sensor Networks (WSNs). RPL is based on the construction of a Destination- Oriented Directed Acyclic Graph (DODAG), which offers a loop-free topology to route data packets. But due to the tree topology, the upper nodes in tree topology are easy to run out of energy. Moreover, the hop count and ETX are the only route metrics for which standards related to their usage in RPL are published. Due to the seriously resource-constrained character, we take nodes' residual energy into account. Here we present an RPL-based clustering scheme and detailed description of Objective Function.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)