Vehicular Ad-hoc Network (VANET) is one of the interesting research topics. Because VANET has some special characteristics such as speed of node and intermittent connectivity. Due to an intermittent connectivity or a long-time disconnection many protocols in VANET need a store-and-forward technique to improve their performance. So a node will store its data into its buffer then it can send the data to other nodes in such an intermittent connectivity scenario. However most of the researchers are interested only in a routing improvement. In fact node’s buffer size is limited and node need a solution to manage their buffer so nodes can store the right packets and provide an efficient operation. This thesis proposes a dropping policy for protocols in VANET. The proposed policy use number of packet copies to decide which packet will be dropped. When nodes receive the new packet and its buffer is full, a packet with highest copy value will be removed from nodes buffer. Moreover this thesis proposes the mechanism to estimate copy value based on density information and solutions for updating copy value in each scenario that is flexible for most of store-and-forward protocols for VANET. From the simulation results, all packets are distributed over nodes in scenarios with almost the same amount of packet copies. The policy also provides the highest reliability results among other traditional policies.
