Each packet contains the location of the destination node as well. The main objective of these routing protocols is to directionally forward the data packet towards the sink(s) to minimize the propagation delay, reduce energy consumption and utilize minimum bandwidth by restricting the broadcast of multiple copies of the data packet. Another category of routing protocols consists of the routing schemes that do not use any location information but the depth of the node [15; 16; 17; 18; 19; 20]. Node's depth information can be estimated locally by the node itself from the pressure sensor, and it does not require any additional control overhead. The packet does not contain any destination information because it is assumed that the packet needs to be forwarded towards the surface. Additionally, the packet contains the depth of the relaying node. In the context of this paper, we focus on the depth based routing schemes. The depth based routing schemes minimize the propagation delay by distributively selecting the next forwarder node among the neighbors that has the smallest depth than the packet forwarder or _Sender_ node. All the other nodes at the depths between the packet forwarder and the lowest depth node will simply discard or suppress the data packet transmission [15]. This packet suppression at the intermediate nodes minimizes the energy consumption and implemented using the holding time. In the holding time strategy, each node computes its holding time when it receives the data packet and the holding time computation simply involves the depth information of the node(s). Before computation of the holding time, each node must check whether its depth is smaller than the depth of the data packet forwarding node. If a node has the smaller depth, then it estimates the holding time. Otherwise, it simply discards the packet. Holding time of the smaller depth node(s) that the node(s) with the smallest depth in the neighborhood of the data packet sender must have the smallest holding time among all neighbors. After computation of the holding time, it initiates the timer. Once the holding timer expires, the node verifies whether it has received additional copies of the same data packet or not. If it did not receive any additional copy, then it further transmits the packet. Otherwise, it suppresses the transmission and removes the copy of the data packet from its buffer. To ensure that the smaller depth neighbor must forward the packet, its holding time must be shorter than rest of the neighbors. Along with the depth information, there are some depth based routing schemes that consider not only depth but other metrics to forward the data packets or compute the holding time. These metrics not only involves the depth but also the energy of the node, link quality, depth information of the next hop forwarders and so forth [16; 17; 18; 19; 20]. The propagation delay in the depth based routing scheme can be minimized if the node with lesser depth forwards the data packet because that node is closer to sink. However, this depth based forwarding process may penalize the less depth nodes, and all the communication is forwarded through the same set of nodes. In result, the battery power of these nodes will drain very quickly and create the void region. The phenomenon of the void region is simply described as the area in the network where there is no node available to further the communication towards the destination node that is Sink. Hence, any node at the edge of the void region fails to forward the data packets. In order to avoid the communication through edge node of the void region, the schemes in literature consider the depth differences between the sender, receiver and one-hop neighbors of _receiver_ nodes. It assures that the potential forwarder must have the next hop node, not the void region. However, this type of schemes do not avoid the formation of the void region and do not provide any energy balancing in the network.