Payment-based anycast routing in non-cooperative Ad Hoc networks

In dynamic topology and energy limited mobile Ad Hoc networking environment, the use of anycast routing to locate and forward network traffic is perhaps the best-suited approach^[1]. In this paper, the first anycast routing mechanism (ARM) in non-cooperative ad hoc networks is proposed. Instead of sending a packet to a nearest destination, the packet is delivered to the minimum profit node in order to prevent excessive payment. A simple and efficient anycast algorithm is proposed to compute the payment. The proposed ARM is highly efficient, and suitable for non-cooperative networks, as shown here by a detailed simulation.