Consider a wireless network where a subset L of nodes have long communication range while the remaining nodes, denoted by subset S, have short communication range. Nodes in L are directly or indirectly (through multiple hops) connected to each other. Nodes in S may or may not be connected to each other. However, every node in S is connected directly or indirectly (through multiple hops) to at least one node in L. Devise a routing mechanism for this network.