1074 search results - page 127 / 215 » Energy Conserving Routing in Wireless Ad-hoc Networks |
CCCG
2008
14 years 11 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
DIMVA
2004
14 years 11 months ago
2004
: The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node may exhibi...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
PERCOM
2005
ACM
15 years 9 months ago
2005
ACM
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
MOBIHOC
2001
ACM
15 years 9 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...