Sciweavers

972 search results - page 22 / 195
» Performance of data networks with random links
Sort
View
EWSN
2010
Springer
16 years 3 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth
IAT
2008
IEEE
16 years 13 days ago
Link-Based Anomaly Detection in Communication Networks
Communication networks, such as networks formed by phone calls and email communications, can be modeled as dynamic graphs with vertices representing agents and edges representing ...
Xiaomeng Wan, Evangelos E. Milios, Nauzer Kalyaniw...
IWCMC
2009
ACM
16 years 15 days ago
Energy penalties for non-shortest paths in wireless sensor networks with link failures
This paper addresses the additional energy consumption in wireless sensor networks where the communication between the sensor nodes and the sink nodes does not always make use of ...
Geir Egeland, Paal E. Engelstad
ICC
2008
IEEE
125views Communications» more  ICC 2008»
16 years 12 days ago
Protection and Restoration from Link Failures in DWDM Networks: A Cross-Layer Study
— Protection against failure in high bandwidth optical networks can prevent significant potential losses of data but at the same time it requires a considerable fraction of the ...
Amir Askarian, Yuxiang Zhai, Suresh Subramaniam, Y...
ICC
2009
IEEE
16 years 21 days ago
Random Linear Network Coding for Time Division Duplexing: Energy Analysis
—We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and rece...
Daniel Enrique Lucani, Milica Stojanovic, Muriel M...