Sciweavers

412 search results - page 71 / 83
» Random Key Predistribution Schemes for Sensor Networks
Sort
View
MOBIQUITOUS
2007
IEEE
15 years 8 months ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....
ICASSP
2011
IEEE
14 years 6 months ago
Compressed classification of observation sets with linear subspace embeddings
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...
Dorina Thanou, Pascal Frossard
SUTC
2006
IEEE
15 years 8 months ago
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation
Security in wireless ad hoc networks is hard to achieve due to the vulnerability of its links, limited physical protection, and the absence of a centralized management point. Cons...
Edith C. H. Ngai, Michael R. Lyu
108
Voted
INFOCOM
2010
IEEE
15 years 24 days ago
RIPPLE Authentication for Network Coding
Abstract—By allowing routers to randomly mix the information content in packets before forwarding them, network coding can maximize network throughput in a distributed manner wit...
Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jagg...
INFOCOM
2008
IEEE
15 years 8 months ago
Cross-Monotonic Multicast
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...
Zongpeng Li