期刊
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS
卷 59, 期 -, 页码 4-13出版社
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
DOI: 10.1016/j.jnca.2015.01.005
关键词
Underwater Wireless Sensor Networks; Geographic routing; Geospatial Division; Duty-cycle
类别
资金
- Qing Lan Project
- Natural Science Foundation of JiangSu Province of China [BK20131137]
- Applied Basic Research Program of Nantong Science and Technology Bureau [BK2013032]
- Jiangsu Province Ordinary University Graduate Innovation Project [CXZZ13_02]
- Fundamental Research Funds for the Central Universities [HEUCF140803]
- Instituto de Telecomunicacoes, Next Generation Networks and Applications Group (NetGNA), Covilha Delegation
- Government of Russian Federation [074-U01]
- FCT - Fundacao para a Ciencia e a Tecnologia [Pest-OE/EEI/LA0008/2013]
In Underwater Wireless Sensor Networks (UWSNs), the geographic routing is a preferred choice for data transmission due to the unique characteristics of underwater environment such as the three dimensional topology, the limited bandwidth and power resources. This paper focuses on underwater routing protocols in the network layer, where underwater sensor nodes can collaborate with each other to transfer data information. The three dimensional underwater network is first divided into small cube spaces, thus data packets are supposed to be collaboratively transmitted by unit of small cubes logically. By taking complex properties of underwater medium into consideration such as three dimensional topology, high propagation delay and path loss of acoustic channel, we propose two novel multi-path strategies called Greedy Geographic Forwarding based on Geospatial Division (GGFGD) and Geographic Forwarding based on Geospatial Division (GFGD). The proposed two algorithms mainly consist of two phases, choosing the next target small cube, and choosing the next hop node in the target small cube. Furthermore, all the sensor nodes in the network are duty-cycled in the MAC layer. Finally, performance analysis is derived, and simulation results illustrate the performance improvement in finding route paths, optimal length of found paths. In addition, energy consumption of route finding is reduced and propagation delay of data transmission is decreased. (C) 2015 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据