217 search results - page 27 / 44 » Approximating Minimum Manhattan Networks |
107
Voted
STOC
1998
ACM
15 years 7 months ago
1998
ACM
In heterogeneousnetworks sending messagesmay incur different delayson different edges,and eachprocessormay havea different switching timebetweenmessages.Thewell studiedTelephonemo...
141
Voted
AINA
2007
IEEE
15 years 9 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
126
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
144
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
97
Voted
HICSS
2003
IEEE
15 years 8 months ago
2003
IEEE
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...