Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung...
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
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...
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
In this paper, we proposed an IP Local Link-Protection (IPLLP) scheme based on the characteristic of shortest-path routing in IP networks. Our scheme working in an intra-area routi...