Sciweavers

477 search results - page 95 / 96
» Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout...
Sort
View
OPODIS
2010
13 years 4 months ago
Biased Selection for Building Small-World Networks
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
Andrés Sevilla, Alberto Mozo, M. Araceli Lo...
INFOCOM
2011
IEEE
12 years 9 months ago
Ubiquitous data collection for mobile users in wireless sensor networks
Abstract—We study the ubiquitous data collection for mobile users in wireless sensor networks. People with handheld devices can easily interact with the network and collect data....
Zhenjiang Li, Mo Li, Jiliang Wang, Zhichao Cao
IPSN
2004
Springer
13 years 11 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...
TPDS
2010
222views more  TPDS 2010»
13 years 4 months ago
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
Haibo Zhang, Hong Shen
CONEXT
2006
ACM
14 years 12 days ago
Migrating home agents towards internet-scale mobility deployments
While the IETF standardization process of the Mobile IPv6 and Network Mobility (NEMO) protocols is almost complete, their large-scale deployment is not yet possible. With these te...
Ryuji Wakikawa, Guillaume Valadon, Jun Murai