Degree-energy-based local random routing strategies for sensor networks

Abstract This paper proposes several comparable degree-energy-based local random routing strategies for wireless sensor networks and reports a detailed numerical study of the new strategies. Specifically, energy consumption and lifetime efficiency of sensor networks are investigated for five different structural topologies and five different routing methods under the degree-energy-awareness principle, regarding their performances and costs. The new findings could provide some references and guidelines for designing more efficient sensor networks under various conditions for future applications. Based on these findings, a few rules of thumb for the design of more energy-efficient sensor networks are suggested.

[1]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[2]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[3]  Guanrong Chen,et al.  A numerical study of energy consumption and time efficiency of sensor networks with different structural topologies and routing methods , 2013, Commun. Nonlinear Sci. Numer. Simul..

[4]  T. Teichmann,et al.  Elementary Statistical Physics , 1959 .

[5]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[6]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance , 2003, IEEE Trans. Mob. Comput..

[7]  P. Casari,et al.  A detailed simulation study of geographic random forwarding (GeRaF) in wireless sensor networks , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[8]  Zhongliang Jing,et al.  Study on an improved Hausdorff distance for multi-sensor image matching , 2012 .

[9]  Deborah Estrin,et al.  ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[11]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[12]  Mario Di Francesco,et al.  Energy conservation in wireless sensor networks: A survey , 2009, Ad Hoc Networks.

[13]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[14]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[15]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[16]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[17]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[18]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[19]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[20]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..