Embedded index coding problem is a variant of index coding problems, where each user functions as both broadcast sender and receiver. Consider a set of the messages, the indices of which form an ordered set. Each user owns a subset of these messages known as side information and tries to meet the demands of one another with a minimum number of transmissions. The side information is said to be consecutive if the elements of the index set of side information at a user are consecutive. We consider a practical vehicular ad-hoc network where the embedded index coding could be applied. In the scenario considered, the receiver demands all messages it does not possess, and the side-information is consecutive. Under this setup, a lower bound on the number of transmissions is determined. We present an optimal solution to achieve the bound. The constructed codes work over any field size, including binary.