A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Wireless multihop ad hoc networks face a multitude of challenging problems including highly dynamic multihop topologies, lossy and noisy communications channels, and sporadic conne...
Alvin C. Valera, Hwee-Pink Tan, Winston Khoon Guan...
— It has been a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc n...
Mobility in ad hoc networks causes link failures, which in turn result in packet losses. TCP attributes these losses to congestion. This results in frequent TCP retransmission time...
Fabius Klemm, Srikanth V. Krishnamurthy, Satish K....
Mobility in ad hoc networks causes frequent link failures, which in turn causes packet losses. TCP attributes these packet losses to congestion. This incorrect inference results i...
Fabius Klemm, Zhenqiang Ye, Srikanth V. Krishnamur...