Sciweavers

3733 search results - page 508 / 747
» Logics of communication and change
Sort
View
SIGCOMM
2010
ACM
15 years 6 months ago
Source flow: handling millions of flows on flow-based nodes
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
Yasunobu Chiba, Yusuke Shinohara, Hideyuki Shimoni...
TWC
2010
15 years 1 months ago
Efficient Measurement Generation and Pervasive Sparsity for Compressive Data Gathering
We proposed compressive data gathering (CDG) that leverages compressive sampling (CS) principle to efficiently reduce communication cost and prolong network lifetime for large scal...
Chong Luo, Feng Wu, Jun Sun, Chang Wen Chen
INFOCOM
2011
IEEE
14 years 10 months ago
Understanding robustness of mobile networks through temporal network measures
—The application of complex network theory to communication systems has led to several important results. Nonetheless, previous research has often neglected to take into account ...
Salvatore Scellato, Ilias Leontiadis, Cecilia Masc...
MOBIHOC
2007
ACM
16 years 6 months ago
A random perturbation-based scheme for pairwise key establishment in sensor networks
A prerequisite for secure communications between two sensor nodes is that these nodes exclusively share a pairwise key. Although numerous pairwise key establishment (PKE) schemes ...
Wensheng Zhang, Minh Tran, Sencun Zhu, Guohong Cao
MOBIHOC
2002
ACM
16 years 6 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder