An algorithm developed by Massachusetts Institute of Technology (MIT) researchers can refresh data within a simple wireless communication system, avoiding congestion.
A team led by MIT's Eytan Modiano modeled a basic network comprised of one data receiver and multiple nodes, operating under the assumption that only one node can broadcast data over a wireless channel at any given time.
Their algorithm calculates an "index" for each node at any given moment, dictated by the freshness of the data being transmitted, the reliability of the transmission channel, and the priority of the node. Nodes with greater priority, a more reliable channel, and older data are tagged with a higher index.
The algorithm instructs the node assigned the highest index to send its data to the receiver, ensuring receipt of the freshest possible data from all nodes without congesting the network's wireless channels.
From MIT News
View Full Article
Abstracts Copyright © 2018 Information Inc., Bethesda, Maryland, USA