Sciweavers

1089 search results - page 79 / 218
» NetComplex: A Complexity Metric for Networked System Designs
Sort
View
136
Voted
GLVLSI
2009
IEEE
154views VLSI» more  GLVLSI 2009»
15 years 10 months ago
Design of a maximum-likelihood detector for cooperative communications in intersymbol interference channels
Recently, cooperative communication has attracted a lot of attention for its potential to increase spatial diversity. However, limited attention has been paid to the physical laye...
Yanjie Peng, Andrew G. Klein, Xinming Huang
WS
2006
ACM
15 years 10 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla
134
Voted
SAC
2010
ACM
15 years 10 months ago
Estimating node similarity from co-citation in a spatial graph model
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
Jeannette Janssen, Pawel Pralat, Rory Wilson
CN
2008
117views more  CN 2008»
15 years 4 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
IWSOS
2009
Springer
15 years 10 months ago
Revisiting P2P Content Sharing in Wireless Ad Hoc Networks
Classical content sharing applications like BitTorrent are not designed to run over wireless networks. When adapting them to these constrained networks, two main problems arise. On...
Mohamed Karim Sbai, Chadi Barakat