We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
Recent observations through experiments that we have performed in current third generation wireless networks have revealed that the achieved throughput over wireless links varies ...
Pablo Rodriguez, Sarit Mukherjee, Sampath Rangaraj...
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Existing flooding algorithms have demonstrated their effectiveness in achieving communication efficiency and reliability in wireless sensor networks. However, further performance ...