3 citations · 3 across the 5 of their papers we have counts for
5 papers
On Random Tree Structures, Their Entropy, and Compression
Amirmohammad Farzaneh, Mihai-Alin Badiu, Justin P. Coon
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then b…
LEAST: a Low-Energy Adaptive Scalable Tree-based routing protocol for Wireless Sensor Networks
Amirmohammad Farzaneh, Mihai-Alin Badiu, Justin P. Coon
Routing is one of the critical and ongoing challenges in Wireless Sensor Networks. The main challenge has always been to have a routing protocol that reduces the communication over…
TreeExplorer: a coding algorithm for rooted trees with application to wireless and ad hoc routing
Amirmohammad Farzaneh, Mihai-Alin Badiu, Justin P. Coon
Routing tables in ad hoc and wireless routing protocols can be represented using rooted trees. The constant need for communication and storage of these trees in routing protocols d…
An Information Theory Approach to Network Evolution Models
Amirmohammad Farzaneh, Justin P. Coon
A novel Markovian network evolution model is introduced and analysed by means of information theory. It will be proved that the model, called Network Evolution Chain, is a stationa…
BernoulliZip: a Compression Algorithm for Bernoulli Processes and Erdos-Renyi Graphs
Amirmohammad Farzaneh, Mihai-Alin Badiu, Justin P. Coon
A novel compression scheme for compressing the outcome of independent Bernoulli trials is introduced and analysed. The resulting algorithm, BernoulliZip, is a fast and near-opt…