Sciweavers

1008 search results - page 179 / 202
» Routing in intermittent network topologies
Sort
View
MOBIHOC
2002
ACM
16 years 1 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
GLVLSI
2009
IEEE
262views VLSI» more  GLVLSI 2009»
14 years 11 months ago
Power distribution paths in 3-D ICS
Distributing power and ground to a vertically integrated system is a complex and difficult task. Interplane communication and power delivery are achieved by through silicon vias (...
Vasilis F. Pavlidis, Giovanni De Micheli
MOBIHOC
2002
ACM
16 years 1 months ago
Performance evaluation of a fair backoff algorithm for IEEE 802.11 DFWMAC
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
Zuyuan Fang, Brahim Bensaou, Yu Wang
MOBIHOC
2008
ACM
16 years 1 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
PIMRC
2010
IEEE
14 years 11 months ago
Automatically configured, optimised and QoS aware wireless mesh networks
Wireless mesh networks (WMNs) are comprised of nodes with multiple radio interfaces and provide broadband residential internet access or connectivity to temporal events. Our goal i...
Elias Z. Tragos, Raffaele Bruno, Emilio Ancillotti...