Symmetry (Feb 2019)
Cooperative and Delay Minimization Routing Schemes for Dense Underwater Wireless Sensor Networks
Abstract
Symmetry in nodes operation in underwater wireless sensor networks (WSNs) is crucial so that nodes consume their energy in a balanced fashion. This prevents rapid death of nodes close to water surface and enhances network life span. Symmetry can be achieved by minimizing delay and ensuring reliable packets delivery to sea surface. It is because delay minimization and reliability are very important in underwater WSNs. Particularly, in dense underworks, packets reliability is of serious concern when a large number of nodes advance packets. The packets collide and are lost. This inefficiently consumes energy and introduces extra delay as the lost packets are usually retransmitted. This is further worsened by adaptation of long routes by packets as the network size grows, as this increases the collision probability of packets. To cope with these issues, two routing schemes are designed for dense underwater WSNs in this paper: delay minimization routing (DMR) and cooperative delay minimization routing (CoDMR). In the DMR scheme, the entire network is divided into four equal regions. The minor sink nodes are placed at center of each region, one in each of the four regions. Unlike the conventional approach, the placement of minor sink nodes in the network involves timer based operation and is independent of the geographical knowledge of the position of every minor sink. All nodes having physical distance from sink lower than the communication range are able to broadcast packets directly to the minor sink nodes, otherwise multi-hopping is used. Placement of the minor sinks in the four regions of the network avoids packets delivery to water surface through long distance multi-hopping, which minimizes delay and balances energy utilization. However, DMR is vulnerable to information reliability due to single path routing. For reliability, CoDMR scheme is designed that adds reliability to DMR using cooperative routing. In CoDMR, a node having physical distance from the sink greater than its communication range, sends the information packets by utilizing cooperation with a single relay node. The destination and the relay nodes are chosen by considering the lowest physical distance with respect to the desired minor sink node. The received packets at the destination node are merged by fixed ratio combining as a diversity technique. The physical distance computation is independent of the geographical knowledge of nodes, unlike the geographical routing protocols. This makes the proposed schemes computationally efficient. Simulation shows that DMR and CoDMR algorithms outperform the counterpart algorithms in terms of total energy cost, energy balancing, packet delivery ratio (PDR), latency, energy left in the battery and nodes depleted of battery power.
Keywords
