1104 search results - page 196 / 221 » Simple Robotic Routing in Ad Hoc Networks |
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
Accurate analysis and simulation in multi-hop (sensor, ad hoc, and mesh) networks requires accurate representation of physical layer fading processes. Current models either ignore...
CCCG
2008
15 years 1 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...
SIGMOD
2004
ACM
15 years 12 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
15 years 6 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...
106
click to vote
CCCG
2010
15 years 1 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 ...