Sciweavers

4998 search results - page 174 / 1000
» The case for intentional networking
Sort
View
117
Voted
PEWASUN
2007
ACM
14 years 11 months ago
Analysis of the impact of hello protocol parameters over a wireless network self-organization
The neighborhood discovery and its maintenance are very important in wireless networks for any applications, especially for routing and every self-∗ algorithm. Neighbor nodes ar...
Tahiry Razafindralambo, Nathalie Mitton
CORR
2007
Springer
159views Education» more  CORR 2007»
14 years 10 months ago
Lifetime Improvement in Wireless Sensor Networks via Collaborative Beamforming and Cooperative Transmission
: Collaborative beamforming (CB) and cooperative transmission (CT) have recently emerged as communication techniques that can make effective use of collaborative/cooperative nodes ...
Zhu Han, H. Vincent Poor
EUROSEC
2009
ACM
15 years 5 months ago
Deep packet anonymization
Network traces of Internet attacks are among the most valuable resources for network analysts and security researchers. However, organizations and researchers are usually reluctan...
Michalis Foukarakis, Demetres Antoniades, Michalis...
IPSN
2004
Springer
15 years 3 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
INFOCOM
1995
IEEE
15 years 1 months ago
Degree-Constrained Multicasting in Point-to-Point Networks
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
Fred Bauer, Anujan Varma