Sciweavers

Share
777 search results - page 2 / 156
» Efficient virtual-backbone routing in mobile ad hoc networks
Sort
View
IPPS
2005
IEEE
9 years 3 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
INFOCOM
2003
IEEE
9 years 3 months ago
Network Layer Support for Service Discovery in Mobile Ad Hoc Networks
— Service discovery is an integral part of the ad hoc networking to achieve stand-alone and self-configurable communication networks. In this paper, we discuss possible service ...
Ulas C. Kozat, Leandros Tassiulas
MOBIHOC
2002
ACM
9 years 10 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
CN
2002
169views more  CN 2002»
8 years 10 months ago
A new wireless ad hoc multicast routing protocol
An ad hoc network is a multi-hop wireless network of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and mobility require that ad hoc routing prot...
Seungjoon Lee, Chongkwon Kim
books