In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Research into large-scale distributed systems often relies on the use of simulation frameworks in order to bypass the disadvantages of performing experiments on real testbeds. SimG...
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in...
Jin Zhang, Yaping Lin, Mu Lin, Ping Li, Si-wang Zh...
: We present a table-less position based routing scheme for low power data centric wireless sensor networks. Our proposed scheme is localized, uses greedy forwarding approach, and ...
Sajjad Ahmad Madani, Daniel Weber, Stefan Mahlknec...