Hangar
发表于 2025-3-28 14:56:18
http://reply.papertrans.cn/16/1530/152912/152912_41.png
obscurity
发表于 2025-3-28 20:40:23
http://reply.papertrans.cn/16/1530/152912/152912_42.png
Accrue
发表于 2025-3-29 01:07:13
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metricstatic and independent of the number of data sources and fusion-costs at intermediate nodes. The tree construction is in polynomial time, and for . topologies it guarantees a .(log..)-approximation of the optimal aggregation cost. With constant fusion-cost functions our aggregation tree gives a .(log
果仁
发表于 2025-3-29 05:15:36
http://reply.papertrans.cn/16/1530/152912/152912_44.png
使人烦燥
发表于 2025-3-29 10:07:26
http://reply.papertrans.cn/16/1530/152912/152912_45.png
诽谤
发表于 2025-3-29 13:06:47
Better Face Routing Protocolsing plane subgraph and assume that the network changes only when routing is not being performed. To improve efficiency, they are often used only when greedy approaches fail..We present protocols for connected quasi unit disk graphs, where nodes which are close to one another (distance at most .) are
GEM
发表于 2025-3-29 16:25:18
Building a Communication Bridge with Mobile Hubs optimization problem where the objectives are minimizing the number of hubs on the bridge and either the maximum or the total distance traveled by the hubs. For a geometric version of the problem where the hubs must move onto the line segment [.,.], we present algorithms which achieve the minimum n
ARENA
发表于 2025-3-29 21:02:52
Valerie Trollinger,Robert Thayer Sataloffetermine and manipulate high-level properties, such as the boundary of the swarm or the connectivity of the communication network. When only a few sensors can move, we would like the mobile sensors to be able to deploy immobile sensors to improve or repair the network connectivity or coverage. When
Hla461
发表于 2025-3-30 03:45:08
http://reply.papertrans.cn/16/1530/152912/152912_49.png
表被动
发表于 2025-3-30 07:27:30
http://reply.papertrans.cn/16/1530/152912/152912_50.png