diff --git a/CHANGELOG.md b/CHANGELOG.md
index fd706d22..f8b243a2 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -43,7 +43,8 @@ The git repositories are hosted at the following sites:
 
 ### Changed
 
-
+* Changed ReadRange by-position and by-sequence encoding by refactoring
+  into a common module. (#1028)
 * Changed default MS/TP APDU to 480 to avoid extended frames by default. (#1003)
 * Changed mirror script to improve debugging. (#968)
 * Changed dlenv to support multiple datalinks via environment variable. (#966)
diff --git a/src/bacnet/basic/service/h_rr.c b/src/bacnet/basic/service/h_rr.c
index 34d4d0ed..d67ebc67 100644
--- a/src/bacnet/basic/service/h_rr.c
+++ b/src/bacnet/basic/service/h_rr.c
@@ -151,8 +151,12 @@ void handler_read_range(
         } else {
             /* assume that there is an error */
             error = true;
+            data.application_data = &Temp_Buf[0];
+            data.application_data_len = sizeof(Temp_Buf);
+            /* note: legacy API passed buffer separately */
             len = Encode_RR_payload(&Temp_Buf[0], &data);
             if (len >= 0) {
+                data.application_data_len = len;
                 /* encode the APDU portion of the packet */
                 len = rr_ack_encode_apdu(NULL, service_data->invoke_id, &data);
                 if (len < sizeof(Handler_Transmit_Buffer) - pdu_len) {
diff --git a/src/bacnet/readrange.c b/src/bacnet/readrange.c
index 79f5a75c..607b2b88 100644
--- a/src/bacnet/readrange.c
+++ b/src/bacnet/readrange.c
@@ -684,3 +684,266 @@ int rr_ack_decode_service_request(
 
     return apdu_len;
 }
+
+/**
+ * @brief Encode a ReadRange-ACK by position request
+ * @param data  Pointer to the ReadRange data structure
+ * @param encoder  Function pointer to encode the record
+ * @param item_count  Number of items in the list 1..N
+ * @param apdu  Pointer to the buffer for encoding into
+ * @param apdu_size  Size of the buffer for encoding
+ * @return number of bytes encoded, or zero if unable to encode or too large
+ * @note This function encodes the ReadRange-ACK by position, encoding
+ *  the records starting from a specified position and returning as many
+ *  as will fit in the provided buffer.
+ */
+int readrange_ack_by_position_encode(
+    BACNET_READ_RANGE_DATA *data,
+    int (*encoder)(uint32_t object_instance, uint32_t item, uint8_t *apdu),
+    uint32_t item_count,
+    uint8_t *apdu,
+    size_t apdu_size)
+{
+    int apdu_len = 0; /* total length of the apdu, return value */
+    int len = 0;
+    int32_t ref_index;
+    uint32_t item = 0;
+    uint32_t first_item = 0;
+    uint32_t last_item = 0;
+
+    if (data->RequestType == RR_READ_ALL) {
+        /*
+         * Read all the list or as much as will fit in the buffer by selecting
+         * a range that covers the whole list and falling through to the next
+         * section of code
+         */
+        data->Count = item_count;
+        data->Range.RefIndex = 1; /* Starting at the beginning */
+    }
+    if (data->Count < 0) {
+        /* negative count means work from index backwards */
+        /*
+         * Convert from end index/negative count to
+         * start index/positive count and then process as
+         * normal. This assumes that the order to return items
+         * is always first to last, if this is not true we will
+         * have to handle this differently.
+         *
+         * Note: We need to be careful about how we convert these
+         * values due to the mix of signed and unsigned types - don't
+         * try to optimise the code unless you understand all the
+         * implications of the data type conversions!
+         */
+
+        /* pull out and convert to signed */
+        ref_index = data->Range.RefIndex;
+        /* Adjust backwards, remember count is -ve */
+        ref_index += data->Count + 1;
+        if (ref_index < 1) {
+            /* if count is too much, return from 1 to start index */
+            data->Count = data->Range.RefIndex;
+            data->Range.RefIndex = 1;
+        } else {
+            /* Otherwise adjust the start index and make count +ve */
+            data->Range.RefIndex = ref_index;
+            data->Count = -data->Count;
+        }
+    }
+    /* From here on in we only have a starting point and a positive count */
+    if (data->Range.RefIndex > item_count) {
+        /* Nothing to return as we are past the end of the list */
+        return 0;
+    }
+    /* Index of last required entry */
+    last_item = data->Range.RefIndex + data->Count - 1;
+    if (last_item > item_count) {
+        /* Capped at end of list if necessary */
+        last_item = item_count;
+    }
+    /* note: item is 1..N */
+    item = data->Range.RefIndex;
+    /* Record where we started from */
+    first_item = item;
+    /* encode the list */
+    while (item <= last_item) {
+        len = encoder(data->object_instance, item, NULL);
+        if ((apdu_len + len) < apdu_size) {
+            /* If we have space in the buffer, encode the item */
+            len = encoder(data->object_instance, item, apdu);
+            apdu_len += len;
+            if (apdu) {
+                apdu += len;
+            }
+            data->ItemCount++;
+        } else {
+            /* No more space in the buffer, stop processing */
+            bitstring_set_bit(&data->ResultFlags, RESULT_FLAG_MORE_ITEMS, true);
+            break;
+        }
+        item++;
+    }
+    /* Set remaining result flags if necessary */
+    if (first_item == 1) {
+        bitstring_set_bit(&data->ResultFlags, RESULT_FLAG_FIRST_ITEM, true);
+    }
+    if (last_item == item_count) {
+        bitstring_set_bit(&data->ResultFlags, RESULT_FLAG_LAST_ITEM, true);
+    }
+
+    return apdu_len;
+}
+
+/**
+ * @brief Encode a ReadRange-ACK by sequence request
+ * @param data  Pointer to the ReadRange data structure
+ * @param encoder  Function pointer to encode the record
+ * @param item_count  Number of items in the list 1..N
+ * @param item_count_total Number of items that have ever been in the list
+ * @param apdu  Pointer to the buffer for encoding into
+ * @param apdu_size  Size of the buffer for encoding
+ * @return number of bytes encoded, or zero if unable to encode or too large
+ * @note This function encodes the ReadRange-ACK by sequence,
+ * encoding the records starting from a specified sequence number
+ * and returning as many as will fit in the provided buffer.
+ */
+int readrange_ack_by_sequence_encode(
+    BACNET_READ_RANGE_DATA *data,
+    int (*encoder)(uint32_t object_instance, uint32_t item, uint8_t *apdu),
+    uint32_t item_count,
+    uint32_t item_count_total,
+    uint8_t *apdu,
+    size_t apdu_size)
+{
+    int apdu_len = 0; /* total length of the apdu, return value */
+    int len = 0;
+    /* Current entry number */
+    uint32_t uiIndex = 0;
+    /* Entry number we started encoding from */
+    uint32_t uiFirst = 0;
+    /* Entry number we finished encoding on */
+    uint32_t uiLast = 0;
+    /* Tracking sequence number when encoding */
+    uint32_t uiSequence = 0;
+    /* Sequence number for 1st record in log */
+    uint32_t uiFirstSeq = 0;
+    /* Starting Sequence number for request */
+    uint32_t uiBegin = 0;
+    /* Ending Sequence number for request */
+    uint32_t uiEnd = 0;
+    /* Has request sequence range spanned the max for uint32_t? */
+    bool bWrapReq = false;
+    /* Has sequence range spanned the max for uint32_t? */
+    bool bWrapLog = false;
+
+    /* Figure out the sequence number for the first record, last is
+     * item_count_total */
+    uiFirstSeq = item_count_total - (item_count - 1);
+    /* Calculate start and end sequence numbers from request */
+    if (data->Count < 0) {
+        uiBegin = data->Range.RefSeqNum + data->Count + 1;
+        uiEnd = data->Range.RefSeqNum;
+    } else {
+        uiBegin = data->Range.RefSeqNum;
+        uiEnd = data->Range.RefSeqNum + data->Count - 1;
+    }
+    /* See if we have any wrap around situations */
+    if (uiBegin > uiEnd) {
+        bWrapReq = true;
+    }
+    if (uiFirstSeq > item_count_total) {
+        bWrapLog = true;
+    }
+
+    if ((bWrapReq == false) && (bWrapLog == false)) {
+        /* Simple case no wraps */
+        /* If no overlap between request range and buffer contents bail out */
+        if ((uiEnd < uiFirstSeq) || (uiBegin > item_count_total)) {
+            return (0);
+        }
+        /* Truncate range if necessary so it is guaranteed to lie
+         * between the first and last sequence numbers in the buffer
+         * inclusive.
+         */
+        if (uiBegin < uiFirstSeq) {
+            uiBegin = uiFirstSeq;
+        }
+
+        if (uiEnd > item_count_total) {
+            uiEnd = item_count_total;
+        }
+    } else { /* There are wrap arounds to contend with */
+        /* First check for non overlap condition as it is common to all */
+        if ((uiBegin > item_count_total) && (uiEnd < uiFirstSeq)) {
+            return (0);
+        }
+
+        if (bWrapLog == false) { /* Only request range wraps */
+            if (uiEnd < uiFirstSeq) {
+                uiEnd = item_count_total;
+                if (uiBegin < uiFirstSeq) {
+                    uiBegin = uiFirstSeq;
+                }
+            } else {
+                uiBegin = uiFirstSeq;
+                if (uiEnd > item_count_total) {
+                    uiEnd = item_count_total;
+                }
+            }
+        } else if (bWrapReq == false) { /* Only log wraps */
+            if (uiBegin > item_count_total) {
+                if (uiBegin > uiFirstSeq) {
+                    uiBegin = uiFirstSeq;
+                }
+            } else {
+                if (uiEnd > item_count_total) {
+                    uiEnd = item_count_total;
+                }
+            }
+        } else { /* Both wrap */
+            if (uiBegin < uiFirstSeq) {
+                uiBegin = uiFirstSeq;
+            }
+
+            if (uiEnd > item_count_total) {
+                uiEnd = item_count_total;
+            }
+        }
+    }
+    /* We now have a range that lies completely within the log buffer
+     * and we need to figure out where that starts in the buffer.
+     */
+    uiIndex = uiBegin - uiFirstSeq + 1;
+    uiSequence = uiBegin;
+    /* Record where we started from */
+    uiFirst = uiIndex;
+    /* encode the list */
+    while (uiSequence != uiEnd + 1) {
+        len = encoder(data->object_instance, uiIndex, NULL);
+        if ((apdu_len + len) < apdu_size) {
+            /* If we have space in the buffer, encode the item */
+            len = encoder(data->object_instance, uiIndex, apdu);
+            apdu_len += len;
+            if (apdu) {
+                apdu += len;
+            }
+            data->ItemCount++;
+        } else {
+            /* No more space in the buffer, stop processing */
+            bitstring_set_bit(&data->ResultFlags, RESULT_FLAG_MORE_ITEMS, true);
+            break;
+        }
+        uiLast = uiIndex; /* Record the last entry encoded */
+        uiIndex++; /* and get ready for next one */
+        uiSequence++;
+    }
+    /* Set remaining result flags if necessary */
+    if (uiFirst == 1) {
+        bitstring_set_bit(&data->ResultFlags, RESULT_FLAG_FIRST_ITEM, true);
+    }
+    if (uiLast == item_count) {
+        bitstring_set_bit(&data->ResultFlags, RESULT_FLAG_LAST_ITEM, true);
+    }
+    data->FirstSequence = uiBegin;
+
+    return apdu_len;
+}
diff --git a/src/bacnet/readrange.h b/src/bacnet/readrange.h
index eabd3700..a2c28287 100644
--- a/src/bacnet/readrange.h
+++ b/src/bacnet/readrange.h
@@ -139,6 +139,23 @@ int rr_ack_decode_service_request(
     int apdu_len, /* total length of the apdu */
     BACNET_READ_RANGE_DATA *rrdata);
 
+BACNET_STACK_EXPORT
+int readrange_ack_by_position_encode(
+    BACNET_READ_RANGE_DATA *data,
+    int (*encoder)(uint32_t object_instance, uint32_t item, uint8_t *apdu),
+    uint32_t item_count,
+    uint8_t *apdu,
+    size_t apdu_size);
+
+BACNET_STACK_EXPORT
+int readrange_ack_by_sequence_encode(
+    BACNET_READ_RANGE_DATA *data,
+    int (*encoder)(uint32_t object_instance, uint32_t item, uint8_t *apdu),
+    uint32_t item_count,
+    uint32_t item_count_total,
+    uint8_t *apdu,
+    size_t apdu_size);
+
 #ifdef __cplusplus
 }
 #endif /* __cplusplus */
diff --git a/test/bacnet/basic/object/test/datetime_local.c b/test/bacnet/basic/object/test/datetime_local.c
index 03acc203..bdc1f432 100644
--- a/test/bacnet/basic/object/test/datetime_local.c
+++ b/test/bacnet/basic/object/test/datetime_local.c
@@ -41,3 +41,8 @@ void datetime_timesync(BACNET_DATE *bdate, BACNET_TIME *btime, bool utc)
     }
     (void)utc;
 }
+
+void datetime_init(void)
+{
+    /* nothing to do */
+}
diff --git a/test/bacnet/readrange/src/main.c b/test/bacnet/readrange/src/main.c
index eacfc0c8..c8d196fb 100644
--- a/test/bacnet/readrange/src/main.c
+++ b/test/bacnet/readrange/src/main.c
@@ -30,6 +30,17 @@ static const char *read_range_request_type(int type)
     }
 }
 
+static int
+testlist_item_encode(uint32_t object_instance, uint32_t item, uint8_t *apdu)
+{
+    int apdu_len = 0;
+
+    apdu_len += encode_application_unsigned(apdu, object_instance);
+    apdu_len += encode_application_unsigned(apdu, item);
+
+    return apdu_len;
+}
+
 /**
  * @brief Test
  */
@@ -131,6 +142,7 @@ static void testReadRangeUnit(BACNET_READ_RANGE_DATA *data)
 {
     uint8_t apdu[480] = { 0 };
     int apdu_len = 0, test_len = 0, null_len = 0;
+    uint32_t item_count = 5, item_count_total = 1200;
     BACNET_READ_RANGE_DATA test_data;
 
     null_len = read_range_request_encode(&apdu[0], 0, data);
@@ -153,6 +165,27 @@ static void testReadRangeUnit(BACNET_READ_RANGE_DATA *data)
     zassert_equal(test_data.object_instance, data->object_instance, NULL);
     zassert_equal(test_data.object_property, data->object_property, NULL);
     zassert_equal(test_data.array_index, data->array_index, NULL);
+    if (data->RequestType == RR_BY_POSITION) {
+        test_len = readrange_ack_by_position_encode(
+            data, testlist_item_encode, item_count, apdu, sizeof(apdu));
+        if (data->Range.RefIndex >= item_count) {
+            /* if the reference index must be less than the item count,
+               or it should encode nothing */
+            zassert_equal(test_len, 0, NULL);
+        } else {
+            zassert_not_equal(test_len, 0, NULL);
+        }
+    } else if (data->RequestType == RR_BY_SEQUENCE) {
+        test_len = readrange_ack_by_sequence_encode(
+            data, testlist_item_encode, item_count, item_count_total, apdu,
+            sizeof(apdu));
+        zassert_not_equal(test_len, 0, NULL);
+        item_count_total = item_count;
+        test_len = readrange_ack_by_sequence_encode(
+            data, testlist_item_encode, item_count, item_count_total, apdu,
+            sizeof(apdu));
+        zassert_not_equal(test_len, 0, NULL);
+    }
     while (apdu_len) {
         apdu_len--;
         test_len = rr_decode_service_request(&apdu[0], apdu_len, &test_data);
@@ -184,10 +217,29 @@ static void testReadRange(void)
     data.array_index = BACNET_ARRAY_ALL;
     data.RequestType = RR_READ_ALL;
     testReadRangeUnit(&data);
+
     data.RequestType = RR_BY_POSITION;
     testReadRangeUnit(&data);
+    data.Range.RefIndex = 5;
+    data.RequestType = RR_BY_POSITION;
+    testReadRangeUnit(&data);
+    data.Range.RefIndex = 6;
+    data.RequestType = RR_BY_POSITION;
+    testReadRangeUnit(&data);
+
+    data.Count = 0;
     data.RequestType = RR_BY_SEQUENCE;
     testReadRangeUnit(&data);
+    data.Range.RefSeqNum = 5;
+    data.RequestType = RR_BY_SEQUENCE;
+    testReadRangeUnit(&data);
+    data.Range.RefSeqNum = 6;
+    data.RequestType = RR_BY_SEQUENCE;
+    testReadRangeUnit(&data);
+    data.Range.RefSeqNum = 1200;
+    data.RequestType = RR_BY_SEQUENCE;
+    testReadRangeUnit(&data);
+
     data.RequestType = RR_BY_TIME;
     testReadRangeUnit(&data);