2391 search results - page 265 / 479 » The Complexity of Connectivity in Wireless Networks |
206
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
211
Voted
JSAC
2007
15 years 6 months ago
2007
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
179
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
198
click to vote
SPW
2000
Springer
15 years 10 months ago
2000
Springer
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
148
click to vote
PERCOM
2008
ACM
16 years 6 months ago
2008
ACM
Service placement deals with the problem of selecting which node in a network is most suitable for hosting a service that responds to queries from other nodes. Optimally placing s...