Sciweavers

971 search results - page 188 / 195
» Space-Time Routing in Ad Hoc Networks
Sort
View
OPODIS
2010
13 years 5 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
ISSTA
2000
ACM
13 years 12 months ago
Verisim: Formal analysis of network simulations
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
Karthikeyan Bhargavan, Carl A. Gunter, Moonjoo Kim...
ICRA
2003
IEEE
133views Robotics» more  ICRA 2003»
14 years 25 days ago
Connectivity-through-time protocols for dynamic wireless networks to support mobile robot teams
—Mobile robot teams are increasingly deployed in various applications involving remote operations in unstructured environments that do not support wireless network infrastructure...
Nageswara S. V. Rao, Qishi Wu, S. Sitharama Iyenga...
ANSS
2008
IEEE
14 years 2 months ago
A Simulation Study of Common Mobility Models for Opportunistic Networks
Understanding mobility characteristics is important for the design and analysis of routing schemes for mobile ad hoc networks (MANETs). This is especially true for mobile opportun...
Muhammad Abdulla, Robert Simon
IPPS
2005
IEEE
14 years 1 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu