Sciweavers

242 search results - page 35 / 49
» Deterministic small-world communication networks
Sort
View
JSAC
2008
98views more  JSAC 2008»
14 years 11 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
MOBICOM
2004
ACM
15 years 5 months ago
A study on the feasibility of mobile gateways for vehicular ad-hoc networks
Development in Wireless LAN and Cellular technologies has motivated recent efforts to integrate the two. This creates new application scenarios that were not possible before. Veh...
Vinod Namboodiri, Manish Agarwal, Lixin Gao
INFOCOM
2009
IEEE
15 years 6 months ago
Capabilities of Low-Power Wireless Jammers
— In this paper, motivated by the goal of modeling the fine-grain capabilities of jammers for the context of security in low-power wireless networks, we experimentally character...
Lifeng Sang, Anish Arora
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 6 months ago
A Novel Algorithm and Architecture for High Speed Pattern Matching in Resource-Limited Silicon Solution
— Network Intrusion Detection Systems (NIDS) are more and more important for identifying and preventing the malicious attacks over the network. This paper proposes a novel cost-e...
Nen-Fu Huang, Yen-Ming Chu, Chi-Hung Tsai, Chen-Yi...
SIGCOMM
2006
ACM
15 years 5 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau