It is conventionally assumed that all wireless devices will fol- low some prescribed routing protocols without any deviation. However, the scarce resources in wireless devices raise a concern about this assumption. Most often, the owners of wireless devices will try to manipulate the proto- cols for its own benefit, instead of faithfully following the protocols. There- fore, some new protocols intended for selfish and rational wireless devices need to be designed. In this paper, we specifically study the multicast in selfish and rational wireless ad hoc networks. By assuming that each wireless node has a pri- vate cost of forwarding data for other nodes, we give an efficient method to construct a multicast tree, namely VMST, whose cost is 5-approximation of the optimum multicast tree cost for homogeneous wireless networks mod- elled by unit disk graph. Based on VMST, we design a truthful payment scheme that pays minimum for any relay node among all truthful payment schemes based on VMST. We also conduct extensive experiments to study the practical performances of proposed protocol. I. I NTRODUCTION Wireless networks have received significant attentions over past few years due to its potential applications in various situ- ations such as battlefield, emergency relief and environmental monitoring, etc. Unlike wired networks and cellular networks, which have fixed infrastructures, wireless ad hoc networks en- joy a more flexible composition. A wireless ad hoc network is a collection of radio devices (transceivers) located in a geo- graphic region. Each node is equipped with an omni-directional antenna and has limited transmission power. One of the dis- tinctive features of wireless networks is that the signal sent out by each wireless device can be received by all nodes within its transmission range, i.e., it can use a broadcasting-like manner to distribute the message to all neighboring nodes. In this paper, we consider a wireless ad hoc network G = (V;E) consisting of a set V of n nodes distributed in a two-dimensional plane, and an edge uv 2 E if u and v can receive signal from each other directly. When all nodes have the same maximum trans- mission range, by a proper scaling, the wireless networks are modelled by unit disk graphs in the literature: an edge uv exits iff kuvk • 1. In multi-hop wireless networks, a communication session is established either through a single-hop radio transmission if the communication parties are close enough (within the transmis- sion range of each other), or through relaying by intermedi- ate devices . Many existing routing protocols for wireless ad hoc networks assume that each individual wireless node (pos- sibly owned by individual selfish users) will follow prescribed routing protocols without deviation - except, perhaps, for the faulty or malicious ones However, some users may deviate from this, or even modify the behavior of routing protocols for self- interested reasons: a user may refuse to relay the messages for