A Scheme to Smooth Aggregated Traffic from Sensors with Periodic Reports
AbstractThe possibility of smoothing aggregated traffic from sensors with varying reporting periods and frame sizes to be carried on an access link is investigated. A straightforward optimization would take O(pn) time, whereas our heuristic scheme takes O(np) time where n, p denote the number of sensors and size of periods, respectively. Our heuristic scheme performs local optimization sensor by sensor, starting with the smallest to largest periods. This is based on an observation that sensors with large offsets have more choices in offsets to avoid traffic peaks than the sensors with smaller periods. A MATLAB simulation shows that our scheme excels the known scheme by M. Grenier et al. in a similar situation (aggregating periodic traffic in a controller area network) for almost all possible permutations. The performance of our scheme is very close to the straightforward optimization, which compares all possible permutations. We expect that our scheme would greatly contribute in smoothing the traffic from an ever-increasing number of IoT sensors to the gateway, reducing the burden on the access link to the Internet. View Full-Text
Share & Cite This Article
Oh, S.; Jang, J.W. A Scheme to Smooth Aggregated Traffic from Sensors with Periodic Reports. Sensors 2017, 17, 503.
Oh S, Jang JW. A Scheme to Smooth Aggregated Traffic from Sensors with Periodic Reports. Sensors. 2017; 17(3):503.Chicago/Turabian Style
Oh, Sungmin; Jang, Ju W. 2017. "A Scheme to Smooth Aggregated Traffic from Sensors with Periodic Reports." Sensors 17, no. 3: 503.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.