Sciweavers

11371 search results - page 215 / 2275
» The network inhibition problem
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 5 months ago
Choosability in geometric hypergraphs
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...
Panagiotis Cheilaris, Shakhar Smorodinsky
TMC
2008
146views more  TMC 2008»
15 years 6 months ago
General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies
In multihop wireless sensor networks that are often characterized by many-to-one (convergecast) traffic patterns, problems related to energy imbalance among sensors often appear. S...
Zhao Cheng, Mark A. Perillo, Wendi B. Heinzelman
LISA
2000
15 years 8 months ago
Peep (The Network Auralizer): Monitoring Your Network with Sound
Activities in complex networks are often both too important to ignore and too tedious to watch. We created a network monitoring system, Peep, that replaces visual monitoring with ...
Michael Gilfix, Alva L. Couch
MOBICOM
2012
ACM
13 years 9 months ago
Energy-based rate adaptation for 802.11n
Rate adaptation (RA) has been used to achieve high goodput. In this work, we explore to use RA for energy efficiency in 802.11n NICs. We show that current MIMO RA algorithms are ...
Chi-Yu Li, Chunyi Peng, Songwu Lu, Xinbing Wang
AAAI
2012
13 years 9 months ago
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic...
Carlos Sarraute, Olivier Buffet, Jörg Hoffman...