A data forwarding algorithm based on estimated Hungarian method for underwater sensor networks

With the increasing concern over marine applications in recent years, the technology of underwater wireless sensor networks (UWSNs) has received considerable attention. In UWSNs, the gathered data is sent to terrestrial control center through multi-hops for further processing. UWSNs usually consists of three types of nodes: ordinary nodes, anchor nodes, and sink nodes. The data messages are transferred from an ordinary node or an anchored node to one of the sink nodes by discrete hops. Thus, we propose a Data Forwarding Algorithm based on estimated Hungarian method (DFAH) to improve delivery ratio and reduce transmission delay. The estimated Hungarian method is applied to solve the assignment problem in data forwarding process, where the anchor nodes receive the forwarding requests from ordinary nodes and optimize the waiting queue. Both analysis and simulation results indicate that DFAH has advantages in delivery success rate and transmission delay.

[1]  Jun-Hong Cui,et al.  Improving the Robustness of Location-Based Routing for Underwater Sensor Networks , 2007, OCEANS 2007 - Europe.

[2]  Lou Jian-hua.  The Simplex Method and the Hungary Method in Excel Demonstration Linear Programming , 2007 .

[3]  Guang Yang,et al.  LE-VBF: Lifetime-Extended Vector-Based Forwarding Routing , 2012, 2012 International Conference on Computer Science and Service System.

[4]  Bin Li,et al.  Research on Resource Scheduling Method Based on Improved Hungary Algorithm , 2015 .

[5]  Dario Pompili,et al.  Underwater acoustic sensor networks: research challenges , 2005, Ad Hoc Networks.

[6]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[7]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[8]  V. Vetriselvi,et al.  Survey on routing algorithms in opportunistic networks , 2013 .

[9]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[10]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[11]  James A. Davis,et al.  Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks , 2001, Proceedings Fifth International Symposium on Wearable Computers.

[12]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[13]  Harold W. Kuhn,et al.  Statement for Naval Research Logistics , 2005 .

[14]  Nesrine Chakchouk,et al.  A Survey on Opportunistic Routing in Wireless Communication Networks , 2015, IEEE Communications Surveys & Tutorials.

[15]  Kun-Chan Lan,et al.  A Survey of Opportunistic Networks , 2008, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008).

[16]  Yuh-Ren Tsai,et al.  Coverage-preserving routing protocols for randomly distributed wireless sensor networks , 2007, IEEE Transactions on Wireless Communications.

[17]  Shaojie Tang,et al.  COUPON: A Cooperative Framework for Building Sensing Maps in Mobile Opportunistic Networks , 2015, IEEE Transactions on Parallel and Distributed Systems.

[18]  Jun-Hong Cui,et al.  DBR: Depth-Based Routing for Underwater Sensor Networks , 2008, Networking.

[19]  Min Tan,et al.  A Power Efficient Routing Protocol for Wireless Sensor Network , 2007, 2007 IEEE International Conference on Networking, Sensing and Control.