Conscious and Unconscious Counting on Anonymous Dynamic Networks

Luna, Giuseppe Antonio Di; Baldoni, Roberto; Bonomi, Silvia; Chatzigiannakis, Ioannis

doi:10.1007/978-3-642-45249-9_17

Cited by 30 publications

(43 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For dynamic anonymous networks, consensus based size estimation methods have been proposed in [6]- [8]. Another size estimation technique has been investigated by Evans et al [9] for Peer-to-Peer (P2P) network.…”

Section: Introductionmentioning

confidence: 98%

Effect of bandwidth in cross-correlation based underwater network size estimation

Anower

Chowdhury

Giti

et al. 2014

8th International Conference on Electrical and Computer Engineering

View full text Add to dashboard Cite

Due to the harshness of underwater environment, size estimation of underwater network is difficult using conventional protocol techniques. A statistical signal processing approach of size estimation is proposed for this purpose using cross-correlation of Gaussian signals, which is effective for any environment networks. Limited bandwidth of underwater communications channel poses constraint on using Gaussian signal, which has infinite bandwidth. The aim of this paper is to investigate the effect of this limited bandwidth in crosscorrelation based underwater network size estimation using Gaussian signals with finite bandwidth.Index Terms-Cross-correlation function (CCF); effect of bandwidth; size estimation; underwater acoustic channels; underwater wireless communication network (UWCN).

show abstract

Section: Introductionmentioning

confidence: 98%

Effect of bandwidth in cross-correlation based underwater network size estimation

Anower

Chowdhury

Giti

et al. 2014

8th International Conference on Electrical and Computer Engineering

View full text Add to dashboard Cite

show abstract

“…Indeed, the protocol in [12] computes only an upper bound on the network size that may be as bad as exponential. The protocols in [5] compute the exact count, but one guarantees only double-exponential running time and the other, called unconscious, does not terminate. Another protocol [6] is shown to have eventual termination, but without running-time guarantees.…”

Section: Introductionmentioning

confidence: 99%

“…On the practical side, in [7] the unconscious protocol [5] is augmented with a termination heuristic that allows the leader to decide when to stop. They show experimentally that the algorithm converges to a decision in a number of rounds that is linear in the size of the system.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Counting in Practical Anonymous Dynamic Networks is Polynomial

2016

View full text Add to dashboard Cite

Anonymous Dynamic Networks is a harsh computational environment due to changing topology and lack of identifiers. Computing the size of the network, a problem known as Counting, is particularly challenging because messages received cannot be tagged to a specific sender. Previous works on Counting in Anonymous Dynamic Networks do not provide enough guarantees to be used in practice. Indeed, they either compute only an upper bound on the network size that may be as bad as exponential, or guarantee only double-exponential running time, or do not terminate, or guarantee only eventual termination without running-time guarantees. Faster experimental protocols do not guarantee the correct count. Recently, we presented the first Counting protocol that computes the exact count with exponential running-time guarantees. The protocol requires the presence of one leader node and knowledge of any upper bound ∆ on the maximum number of neighbors that any node will ever have. In the present work, we complement the latter theoretical study evaluating the performance of such protocol in practice. We tested a variety of network topologies that may appear in practice, including extremal cases such as trees, paths, and continuously changing topologies. We also tested networks that temporarily are not connected. Our simulations showed that the protocol is polynomial for all the inputs tested, paving the way to use it in practical applications where topology changes are predictable. The simulations also provided insight on the impact of topology changes on information dissemination. To the best of our knowledge, this is the first experimental study that shows the possibility of computing the exact count in polynomial time in a variety of Anonymous Dynamic Networks that are worse than expected in practice.

show abstract

“…Then, size estimation algorithm for two networks [4], distributed network size estimation and distributed statistical estimation [5]- [8], circled random walk and the tokened random walk [9] have been investigated. Howlader et al proposed an ALOHA based node estimation technique [10]- [12] counting capture effect and long delay.…”

Section: Introductionmentioning

confidence: 99%

Impact of underwater bandwidth on cross-correlation based node estimation technique

Bain

Chowdhury

Asif

et al. 2014

2014 17th International Conference on Computer and Information Technology (ICCIT)

View full text Add to dashboard Cite

Bandwidth is the most monumental topic both for the terrestrial and underwater communications. For proper network operation the estimation of number of signal sources (N) is very important. Most of the protocol based techniques are failed to give the desired results of node estimation due to underwater properties (long propagation delay, high absorptions and dispersion). Node estimation technique using crosscorrelation is not based on protocol, where infinite band Gaussian signals are used. But the underwater bandwidth is finite ( 1-15 kHz). This limited bandwidth can encumber the signal bandwidth which might invade the estimation process. In this paper, the number of estimated nodes is being obtained considering the effect of underwater bandwidth using three sensors.

show abstract

Conscious and Unconscious Counting on Anonymous Dynamic Networks

Cited by 30 publications

References 15 publications

Effect of bandwidth in cross-correlation based underwater network size estimation

Effect of bandwidth in cross-correlation based underwater network size estimation

Counting in Practical Anonymous Dynamic Networks is Polynomial

Impact of underwater bandwidth on cross-correlation based node estimation technique

Contact Info

Product

Resources

About