Opportunistic Routing for Time-Variety and Load-Balance over Wireless Sensor Networks

To aware the topology of wireless sensor networks (WSN) with time-variety, and load-balance the resource of communication and energy, an opportunistic routing protocol for WSN based on Opportunistic Routing Entropy and ant colony optimization, called ACO-TDOP, is proposed. At first, based on the second law of thermo-dynamics, we introduce the concept of Opportunistic Routing Entropy which is a parameter representing the transmission state of each node by taking into account the power left and the distance to the sink node. Then, it is proved that the problem of route thinking about Opportunistic Routing Entropy is shown to be NP-hard. So the protocol, ACO-TDOP, is proposed. At last, numerical results confirm that the ACO-TDOP is energy conservative and throughput gainful compared with other two existing routing protocols, and show that it is efficacious to analyze and uncover fundamental of message transmission with Opportunistic Routing in wireless network using the second law of thermodynamics.

[1]  Jian Li,et al.  Analytical modeling and mitigation techniques for the energy hole problem in sensor networks , 2007, Pervasive Mob. Comput..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[4]  Sagar Naik,et al.  Data Capacity Improvement of Wireless Sensor Networks Using Non-Uniform Sensor Distribution , 2006, Int. J. Distributed Sens. Networks.

[5]  Mary Ann Ingram,et al.  Two Energy-Saving Schemes for Cooperative Transmission with Opportunistic Large Arrays , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[6]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[7]  David Tse,et al.  Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities , 1998, IEEE Trans. Inf. Theory.

[8]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[9]  Gregory W. Wornell,et al.  Energy-efficient antenna sharing and relaying for wireless networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[10]  Ying Zhang,et al.  Improvements on Ant Routing for Sensor Networks , 2004, ANTS Workshop.

[11]  Hongqiang Zhai,et al.  On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[12]  Selcuk Okdem,et al.  Routing in Wireless Sensor Networks Using Ant Colony Optimization , 2006, First NASA/ESA Conference on Adaptive Hardware and Systems (AHS'06).

[13]  Hongqiang Zhai,et al.  Capacity of opportunistic routing in multi-rate and multi-hop wireless networks , 2008, IEEE Transactions on Wireless Communications.

[14]  Steven McCanne,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995, SIGCOMM '95.

[15]  Fernando Boavida,et al.  An Energy-Efficient Ant-Based Routing Algorithm for Wireless Sensor Networks , 2006, ANTS Workshop.

[16]  Yang Zhen.  Collaborative opportunistic routing in wireless sensor networks , 2009 .

[17]  Wing Cheong Lau,et al.  An Analysis of Opportunistic Routing in Wireless Mesh Network , 2008, 2008 IEEE International Conference on Communications.

[18]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.