In order to provide real-time communication in wireless multimedia sensor networks (WMSNs)

the QoS supported routing algorithm is addressed. Theoretically

data aggregation is defined and its advantages in QoS routing are introduced. Based on it

a least energy realtime routing algorithm (LERTR) is presented to construct the delay-constrained routing tree in WMSNs. In LERTR

a least energy routing tree is constructed by average distance heuristic (ADH)

and then

if the path delay can't meet the delay upper bound

a shortest delay path which is computed by Dijkstra's algorithm will be merged into the existing routing tree to meet the delay upper bound. Finally

the simulation results verify the correctness of the algorithm in some degree.