Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
In wireless networks, the channels are often subject to random variations that limit the reliability of communications between any two radios. Geographic transmission strategies ca...
Murali Rao, Tathagata D. Goswami, Joseph Glover, J...
In this paper, we consider the security of geographical forwarding (GF) – a class of algorithms widely used in ad hoc and sensor networks. In GF, neighbors exchange their locati...
This paper investigates the energy-saving organization of sensor nodes in large wireless sensor networks. Due to a random deployment used in many application scenarios, much more n...