Node Deployment Algorithm Based on Connected Tree for Underwater Sensor Networks

Abstract

Designing an efficient deployment method to guarantee optimal monitoring quality is one of the key topics in underwater sensor networks. At present, a realistic approach of deployment involves adjusting the depths of nodes in water. One of the typical algorithms used in such process is the self-deployment depth adjustment algorithm (SDDA). This algorithm mainly focuses on maximizing network coverage by constantly adjusting node depths to reduce coverage overlaps between two neighboring nodes, and thus, achieves good performance. However, the connectivity performance of SDDA is irresolute. In this paper, we propose a depth adjustment algorithm based on connected tree (CTDA). In CTDA, the sink node is used as the first root node to start building a connected tree. Finally, the network can be organized as a forest to maintain network connectivity. Coverage overlaps between the parent node and the child node are then reduced within each sub-tree to optimize coverage. The hierarchical strategy is used to adjust the distance between the parent node and the child node to reduce node movement. Furthermore, the silent mode is adopted to reduce communication cost. Simulations show that compared with SDDA, CTDA can achieve high connectivity with various communication ranges and different numbers of nodes. Moreover, it can realize coverage as high as that of SDDA with various sensing ranges and numbers of nodes but with less energy consumption. Simulations under sparse environments show that the connectivity and energy consumption performances of CTDA are considerably better than those of SDDA. Meanwhile, the connectivity and coverage performances of CTDA are close to those depth adjustment algorithms base on connected dominating set (CDA), which is an algorithm similar to CTDA. However, the energy consumption of CTDA is less than that of CDA, particularly in sparse underwater environments.

Increased Throughput DB-EBH Protocol in Underwater Wireless Sensor Networks

“…This results in prolonged network lifetime. [17] III. MOTIVATION DB-EBH was proposed as a linearly random deployed network with unequal intermediate distance in comparison to EBH's linearly deployed network with fixed inter-node distance.…”

Elements of Hyperstructure Theory in UWSN Design and Data Aggregation

“…Thus one may employ techniques of algebra or graph theory in the description of the data aggregation process as has been recently done by Aboyamita et al, Domingo, or Jiang et al [7][8][9]. However, given the multivalued nature of data aggregation (multiple paths, more than one possible links of elements, etc.…”

Deployment Protocol for Underwater Wireless Sensors Network based on Virtual Force

“…Regarding the depth-adjustment deployment [18], [17], Akkaya et al [19] propose an algorithm for adjusting the position of sensor nodes after their initial deployment to reduce coverage overlaps between neighbor nodes based on clustering and Graph Colouring. However, this algorithm create small coverage holes between each two nodes which affect the whole connectivity in the topology.…”