Sciweavers

1716 search results - page 85 / 344
» Optimal Hopping in Ad Hoc Wireless Networks
Sort
View
ALGOSENSORS
2006
Springer
15 years 10 months ago
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power eci...
Colette Johnen, Le Huy Nguyen
DIALM
2003
ACM
133views Algorithms» more  DIALM 2003»
15 years 11 months ago
Ad-hoc networks beyond unit disk graphs
In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks whi...
Fabian Kuhn, Aaron Zollinger
GLOBECOM
2008
IEEE
16 years 25 days ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
GLOBECOM
2006
IEEE
16 years 13 days ago
Self-Adaptive Ad-Hoc/Sensor Network Routing with Attractor-Selection
Abstract— In this paper we propose MARAS, a biologicallyinspired method for routing in a mobile ad-hoc/sensor network environment. We assume that all nodes have no explicit knowl...
Kenji Leibnitz, Naoki Wakamiya, Masayuki Murata
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal