• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4844-4864
• /
• 2017

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1404-1415
• /
• 2022

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.