Networks of wireless sensors having a fixed power source are widespread and inexpensive. But there are challenges: energy limitation, local noise-induced RF interference, and mote failures. Routing protocols must address these challenges in order to provide scalability, energy conservation, and dependable transmission of messages in such networks. To fulfill these requirements, yet, there exist conflicting demands. This work intends to enhance the performance of mobile Adhoc networks by service priority-based dynamic TDMA scheduling. This research presents an efficient and reliable routing protocol (EAR) to achieve dependability and scalable performance with little energy economy sacrifice. Predicted trip length, energy levels, area traveled, and link transmission success history are the four factors that EAR’s routing design considers in order to dynamically locate and maintain the optimal routes. For allocation techniques to provide real-time performance for all kinds of service data, they must be adaptable enough to adjust to shifting service requirements and give resource access for perceived service information first priority. We introduce an algorithm for dynamic TDMA scheduling (SP–DS) based on service priority. When allocating slots, this technique considers transmission throughput and end-to-end delay performance as its major metrics. Combining multiple SP–DS algorithms is the new method. The recommended method performs better in simulations evaluating slot utilization, allocation efficiency, end-to-end latency, as well as transmission throughput than existing slot allocation methods.