<?xml version="1.0" encoding="US-ASCII"?>

<!DOCTYPE rfc SYSTEM "rfc2629.dtd" [
	<!ENTITY RFC7228 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.7228.xml">
	<!ENTITY RFC6973 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.6973.xml">
	<!ENTITY RFC6864 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.6864.xml">
	<!ENTITY RFC7796 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.7796.xml">
	<!ENTITY RFC7661 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.7661.xml">
]>

<?xml-stylesheet type='text/xsl' href='rfc2629.xslt' ?>
<?rfc strict="yes"?>
<?rfc toc="yes"?>
<?rfc tocdepth="4"?>
<?rfc symrefs="yes"?>
<?rfc sortrefs="yes"?>
<?rfc compact="yes"?>
<?rfc subcompact="no"?>

<rfc category="exp" docName="draft-qin-lpwan-dau-00" ipr="pre5378Trust200902">
  <!-- category values: std, bcp, info, exp, and historic -->

  <front>
    <title abbrev="Data Aggregation Unit for LP-WAN">
      Data Aggregation Unit for LP-WAN
    </title>
    
    <author fullname="Xiaowei Qin" initials="X" surname="Qin">
      <organization>CNNIC</organization>
      <address>
        <postal>
          <street>4 South 4th Street, Zhongguancun, Haidian District</street>
          <city>Beijing</city>
          <region>Beijing</region>
          <code>100190</code>
          <country>China</country>
        </postal>
        <phone>+86 10 5881 3689</phone>
        <email>qinxiaowei@cnnic.cn</email>
      </address>
    </author>     

    <author fullname="Ning Kong" initials="N" surname="Kong">
      <organization>CNNIC</organization>
      <address>
        <postal>
          <street>4 South 4th Street, Zhongguancun, Haidian District</street>
          <city>Beijing</city>
          <region>Beijing</region>
          <code>100190</code>
          <country>China</country>
        </postal>
        <phone>+86 10 5881 3147</phone>
        <email>kongning@cnnic.cn</email>
      </address>
    </author> 



    <date month="May" year="2016" />

    <area>Internet Area</area>

    <workgroup>LPWAN</workgroup>

    <keyword>Data Aggregation Low-Power Wide Area Networks</keyword>

    <abstract>
      <t>
       Connecting LP-WANs(Low-Power Wide Area Networks) to the Internet is expected to provide significant benefits to these networks in terms of interoperability,
       application deployment, and management,among others. However, the specific characteristics of LP-WANs, such as very limited data unit size, and large-scale
       data sets make the network operation more complex: using one IP packet to send one LP-WAN data unit is a waste of bandwidth(because the packet header is much
       bigger than payload), and the large-scale LP-WAN data sets can also increase the Internet burden. This specification defines a Data Aggregation Unit(DAU) for
       LP-WANs to aggregate small-size date units into bigger data chains so they can be sent through the Internet more efficiently.
      </t>
    </abstract>
  </front>

  <middle>
    <section title="Introduction">
      <t>
       The existing pilot deployments of LP-WANs have shown the huge potential and the industrial interest in their capabilities, such as in control and monitoring
       applications. Examples of LPWAN technologies include LoRa, SigFox, IEEE 802.15.4k LECIM, DASH-7, Weightless, etc. [I-D.minaburo-lp-wan-gap-analysis]. Connecting
       these LP-WANs to the Internet is expected to provide significant benefits to these networks in terms of interoperability, application deployment, and management,
       among others. For these reasons, more and more LP-WAN owners are connecting their own LP-WANs to the Internet.      
      </t>
      <t>
       It is generally desirable that a given Data Unit(DU) generated by any LP-WANs can be sent through the Internet efficiently and quickly. However, the intrinsic
       characteristics of LP-WANs, very limited DU size and large-scale DU sets make the data transmission through Internet more complex. In a nutshell, that may be
       a terrible waste of bandwidth if use one IP packet to send one LP-WAN Data Unit(LDU), because the packet header is much bigger than payload.And what's more,
       the LP-WAN usually consists of many nodes, so the large-scale data may increase the Internet burden. This is the motivation for aggregating these small-size LDUs
       into a bigger data chain to improve the percentage of the payload in IP packet to make the information retrieval and dissemination more efficient. For example,a
       ZigBee Cluster can aggregate several LDUs into a LDU chain and send them together as an atomic payload of the IP packet. By doing this, the ZigBee Cluster doesn't
       need to initiate the transmission for every LDU as well as improve the proportion of the payload in the IP packet to increase the transmission efficiency.
      </t>
      <t>
       During transmission, the aggregator cannot do any processing on the LDUs and just encapsulates them into an aggregation chain. During reception, the de-aggregator
       just opens the data chain and separately forwards them to the applications.
      </t>
      <t>
       This arrangement provides numerous benefits for LP-WAN applications(both transmitter and receiver): increased delivery efficiency, reduced transmission/receiving times,
       and improved quality of experience for LP-WAN Users. Considering that a vast number of LP-WAN devices are,as of today,battery-powered,the DAU is also helpful for
       saving battery consumption.
      </t>

      <section title="Terminology">
       <t>This document uses the following terms:</t>
       <t>Aggregator: Software entity which resides either in the system kernel or hardware aggregating one or more LDUs into an aggregation chain, the payload of the IP
          packet that is sent through the internet. The aggregator is usually placed into transmitter device with cache capacity.</t>
       <t>De-aggregator: Software entity which resides either in the system kernel or hardware de-aggregating the LDU chain into seperate LDU, which comes from
          aggregator. De-aggregator is usually placed into receiving device with cache capacity.</t>
      <t>Data Unit:  Refers to data packets generated by LP-WANs in general, for example generated by LoRa, SigFox, IEEE 802.15.4k LECIM, etc.</t>
       </section>
       <section title="Abbreviations">
       <t>      
       <list style="symbols"> 
       <t>DU:Data Unit</t>
       <t>LDU: LP-WAN Data Unit</t>
       <t>L-DAU: LP-WAN Data Aggregation Unit</t> 
       </list> 
     </t>
      </section>
    </section>

    <section title="Problem Statemate">

    <t>
      LP-WAN technologies are a kind of constrained and challenged networks [RFC7228].  
      <list style="symbols"> 
       <t>very small frame payload as low as 12 bytes.  Typical traffic patterns are composed of a large majority of frames with payload size around 15 bytes and
          a small minority of up to 100 byte frames.</t>
       <t>ultra dense networks with thousands to tens of thousands of nodes.</t>
       </list>
     </t>
      <t>
        On the other side, the existing Internet technologies have their specific characteristics:
       <list style="symbols"> 
       <t>IP header is usually more than 20 bytes[RFC6864],[RFC6973], and the Ethernet header is at least 14 bytes[RFC7796].</t>
       <t>TCP is a reliable and connection oriented transport mechanism[RFC7661].</t>
       </list>
        Therefore, it is obviously unwise to just encapsulate one LDU into the IP packet. That's a waste of bandwidth and also increases Internet burdens. However,
        no standards or open specifications currently exist to solve above problems.
       </t>
     <t>
        In the terminology of [RFC7228], these characteristics put LP-WANs into the "challenged network" category, and the intrinsic characteristics, current usages
        and architectures will allow the group to make and justify the design choices. However, there also some desired properties:
       <list style="symbols"> 
       <t>preserve the end-to-end communication principle.</t>
       <t>maintain independence from L2 technology.</t>
       <t>use or adapt protocols defined by IETF to this new environment that could be less responsive.</t>
       <t>use existing addressing spaces and naming schemes defined by IETF.</t>
       <t>small message size, with potentially no L2 fragmentation.</t>
       <t>optimize the protocol stack in order to limit the number of duplicated functionalities; for instance acknowledgements should not be done at several layers.</t>
       </list>
         So,the L-DAU is proposed in this document to make the information retrieval and dissemination of LP-WANs more efficient as well as fully conforms to the
         principles proposed in [RFC7228]. 
     </t>
    </section>
    <section title="L-DAU Scheme">
      <t>The L-DAU service architecture is shown in Figure 1. During transmission, a LDU is passed down from LPWAN application, and stored temporarily by the aggregator,
         then aggregated into a L-DUA. During reception, a received L-DAU is de-aggregated into seperate LDUs and forwarded to the LP-WAN application.</t>

    <figure> 
                            <artwork>
                            <![CDATA[


         +--------------------+             +--------------------+ ^
       | |      LPWAN         | Frame Flow  |       LPWAN        | |
      S| | Application Lawer  |<----------->|    application     | |
      e| +--------------------+             +--------------------+ |g
      n| |       L-DAU        |             |       L-DAU        | |
      d| |    Aggregation     |             |     Aggregation    | |i
      i| +--------------------+             +--------------------+ |v      
      n| |      Network       |             |      Network       | |i
      g| |       Layer        |             |       Layer        | |e
       | +--------------------+             +--------------------+ |c
       | |        PHY         |             |         PHY        | |e
       | |       Layer        |             |        Layer       | |R
       V +--------------------+             +--------------------+ 
                     Figure 1 L-DAU service architecture

                       ]]>
</artwork>
                    </figure>

     <section title="L-DAU Format">
     <t>
       A L-DAU consists of a sequence of one or more L-DAU subframes as shown in Figure 2.
    </t>

    <figure> 
                            <artwork>
                            <![CDATA[
                                                                            
          +------------------+-----------------+------+------------------+                    
          | L-DAU subframe 1 | L-DAU subframe 2|  ... | L-DAU subframe n |
          +------------------+-----------------+------+------------------+                    
   Octets:     variable          variable                 variable


                           Figure 2 L-DAU format

                       ]]>
</artwork>
                    </figure>

      <t>
        Each L-DAU subframe consists of a LDU delimiter followed by a LDU. Except when a L-DAU subframe is the last one in a L-DAU. The L-DAU length should be
        less than 65535 octets. The LDU delimiter is 2 octets in length and the structure of the LDU delimiter is defined in Figure 3.
      </t>
    <figure> 
                            <artwork>
                            <![CDATA[
   Bits:     B0    B1    B2   B7      B8          B15                                                              
          +-----------+-----------+---------------------+---------------+                    
          |  Reserved | LDU length| Delimiter Signature |       LDU     | 
          +-----------+-----------+---------------------+---------------+                   
 
                              L-DAU Delimiter
 Octets:  <--------------------------------------------->     variable  
                                   2

                           Figure 3 L-DAU subframe format

                       ]]>
</artwork>
                    </figure>
      <t>
       The fields of the L-DAU delimiter are defined in Table 1.
      </t>

    <figure> 
                            <artwork>
                            <![CDATA[
               Table 1: L-DAU delimiter fields
     +-----------+--------+---------------------------------------------+
     |  Field    |  Size  |              Description                    |
     |           | (Bits) |                                             |
     +-----------+--------+---------------------------------------------+
     | Reserved  |   2    |                                             |
     +-----------+--------+---------------------------------------------+
     | LDU Length|   6    |  Length of the LDU in octets                |
     +-----------+--------+---------------------------------------------+
     |           |   8    |  Pattern that may be used to detect an L-DAU|
     | Delimiter |        |  delimiter when scanning for a delimiter.   |
     | Signature |        |  The unique pattern is set to the value     |
     |           |        |   0x7E.                                     |
     |           |        |                                             |
     +-----------+--------+---------------------------------------------+
                       ]]>
</artwork>
                    </figure>

   <t>
    The purpose of the L-DAU delimiter is to locate the LDUs within the L-DAU.
   </t>

</section>

    </section>

    <section title="Security Considerations">    	
    <t>
      This document focuses on approach and the motivational for L-DUA, and does not analyze the associated threats. Those threats will be discussed in future.			
    </t>
    </section>


   
<section title="Acknowledgments">  
    <t>
      The authors wish to thank Linlin Zhou for her invaluable comments.
    </t>  
    </section>  

  </middle>

  <back>
    <references title="Normative References">
    	&RFC7228;
    	&RFC6973;
    	&RFC6864;
    	&RFC7796;
    	&RFC7661;
    </references>

    <references title="Informative References">
    	
      
      <reference anchor="PPSP-Charter"
                   target="http://datatracker.ietf.org/wg/ppsp/charter/">
        <front>
          <title>
            simulated-annealing algorithm
          </title>
          <author initials="Yan Pu" surname="Y">
          </author>
          <date month="December" year="2009" />
        </front>
      </reference>     
      
    </references>
  </back>
</rfc>
