971 search results - page 178 / 195 » Space-Time Routing in Ad Hoc Networks |
CCCG
2008
13 years 9 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...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—Some mobile ad hoc networks (MANETs) such as inter-vehicle communications require a transmission scheme that is robust to mobility and asynchronous reception with low setup over...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
In a distributed sensor network, large number of sensors deployed which communicate among themselves to selforganize a wireless ad hoc network. We propose an energyefficient level...
SECON
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Mobile ad hoc networks often support sensitive applications. These applications may require that users’ identity, location, and correspondents be kept secret. This is...
CCCG
2010
13 years 9 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...