Sciweavers

774 search results - page 2 / 155
» Efficient virtual-backbone routing in mobile ad hoc networks
Sort
View
IPPS
2005
IEEE
13 years 10 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
13 years 9 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
CORR
2010
Springer
218views Education» more  CORR 2010»
13 years 2 months ago
A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks
This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANE...
Busola S. Olagbegi, Natarajan Meghanathan
MOBIHOC
2002
ACM
14 years 4 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