179 search results - page 23 / 36 » Distributed Graph Layout for Sensor Networks |
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
We examine distributed time-synchronization in mobile ad-hoc and sensor networks. The problem is to estimate the skews and offsets of clocks of all the nodes with respect to an arb...
IPSN
2004
Springer
15 years 2 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
116
click to vote
MOBIHOC
2004
ACM
15 years 9 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...