Sciweavers

661 search results - page 84 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li
AMC
2006
114views more  AMC 2006»
14 years 9 months ago
A multi-objective resource allocation problem in dynamic PERT networks
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
Amir Azaron, Reza Tavakkoli-Moghaddam
EUROPAR
2006
Springer
15 years 1 months ago
Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
IPPS
2006
IEEE
15 years 3 months ago
Preserving source location privacy in monitoring-based wireless sensor networks
While a wireless sensor network is deployed to monitor certain events and pinpoint their locations, the location information is intended only for legitimate users. However, an eav...
Yong Xi, Loren Schwiebert, Weisong Shi
ICS
2010
Tsinghua U.
15 years 7 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns