Sciweavers

528 search results - page 38 / 106
» Some problems of directional sensor networks
Sort
View
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
13 years 10 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
ICICS
2010
Springer
13 years 6 months ago
Compromise-Resilient Anti-jamming for Wireless Sensor Networks
Abstract. Jamming is a kind of Denial-of-Service (DoS) attack in which an adversary purposefully emits radio frequency signals to corrupt wireless transmissions. Thus, the communic...
Xuan Jiang, Wenhui Hu, Sencun Zhu, Guohong Cao
PODC
2004
ACM
14 years 1 months ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...
WISEC
2009
ACM
14 years 3 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
ASIAMS
2007
IEEE
14 years 2 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham