Sciweavers

4962 search results - page 126 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
TMC
2008
125views more  TMC 2008»
15 years 6 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
APWEB
2006
Springer
15 years 10 months ago
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
Ding-Zhu Du, My T. Thai, Yingshu Li, Dan Liu, Shiw...
CATS
2007
15 years 7 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
LCN
1999
IEEE
15 years 10 months ago
Periodic Route Optimization for Handed-Off Connections in Wireless ATM Networks
In Wireless ATM networks, user connections need to be rerouted during handoff as mobile users move among base stations. The rerouting of connections must be done quickly with mini...
Khaled Salah, Elias Drakopoulos, Tzilla Elrad
TELSYS
2008
94views more  TELSYS 2008»
15 years 6 months ago
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks
This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the ex...
Nelson Antunes, Gonçalo Jacinto, Antó...