Weak state routing for large scale dynamic networks

UG Acer, S Kalyanaraman, AA Abouzeid - Proceedings of the 13th …, 2007 - dl.acm.org
Routing in communication networks involves the indirection from a persistent name (or ID) to
a locator and delivering packets based upon the locator. In a large-scale, highly dynamic …

Understanding stateful vs stateless communication strategies for ad hoc networks

V Manfredi, M Crovella, J Kurose - Proceedings of the 17th annual …, 2011 - dl.acm.org
Structural change and uncertainty are fundamental properties of an ad hoc network, making
it difficult to develop communication strategies, ie, network-level approaches to transport …

Impact of information on network performance-an information-theoretic perspective

J Hong, VOK Li - GLOBECOM 2009-2009 IEEE Global …, 2009 - ieeexplore.ieee.org
Available network information is an important factor in determining network performance. In
this paper, we study the basic limits on the amount of network information that should be …

Resolution-based content discovery in network of caches: Is the control traffic an issue?

B Azimdoost, C Westphal… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
As networking attempts to cleanly separate the control plane and forwarding plane
abstractions, it also defines a clear interface between these two layers. An underlying …

On the cost of knowledge of mobility in dynamic networks: An information-theoretic approach

D Wang, AA Abouzeid - IEEE Transactions on Mobile …, 2012 - ieeexplore.ieee.org
In this paper, we extend an information-theoretic approach for characterizing the minimum
cost of tracking the motion state information, such as locations and velocities, of nodes in …

Proactive routing overhead in Mobile Ad-hoc Networks

QM Tran, A Dadej - … of IEEE International Symposium on a …, 2014 - ieeexplore.ieee.org
This paper presents an analytical model for quantifying the control overhead of proactive
routing protocols in Mobile Ad-hoc Networks (MANETs). In particular, the lower bound on the …

Overhead-performance tradeoff for relay selection in cooperative networks

H Feng, LJ Cimini - 2012 46th Annual Conference on …, 2012 - ieeexplore.ieee.org
In this paper, we use rate distortion theory to investigate the overhead-performance tradeoff
for relay selection in cooperative communications. Existing research is usually highly …

The effect of information on scheduling performance in multi-hop wireless networks

J Hong, VOK Li - IEEE transactions on wireless …, 2010 - ieeexplore.ieee.org
Previous research has estimated the performance of wireless networks by assuming that
nodes in the network can obtain precise network information. However, in reality, available …

Performance improvements for network-wide broadcast with instantaneous network information

A Banerjee, CH Foh, CK Yeo, BS Lee - Journal of Network and Computer …, 2012 - Elsevier
We study the performance of network-wide broadcasting as a function of the information
implicitly available at nodes from neighbourhood transmissions. We term this set of …

A framework for balancing information collection and data transmission

J Chuai, VOK Li - … Symposium on Personal, Indoor, and Mobile …, 2013 - ieeexplore.ieee.org
Network protocol performance is closely related to knowledge about the network state.
However, acquiring such knowledge expends network bandwidth resource. Thus a trade off …