Controlled potential-based routing for large-scale wireless sensor networks

Improving the scalability of wireless sensor networks is an important task, and toward this end, much research on self-organization has been conducted. However, the problem remains that much larger networks based on pure self-organization cannot be guaranteed to behave as desired. In this paper, we propose a controlled potential-based routing protocol. This protocol is based on a novel concept: a "controlled self-organization scheme", which is a self-organization scheme accompanied by control from outside the system. This scheme ensures desired network behavior by controlling a portion of nodes operated in self-organization. Through simulation experiments with a multi-sink network, we show that traffic loads can be equalized among heterogeneously distributed sink nodes, and moreover, that load balancing among the relay nodes can bring about a 138% extension of network lifetime.

[1]  Sangsu Jung,et al.  Distributed potential field based routing and autonomous load balancing for wireless mesh networks , 2009, IEEE Communications Letters.

[2]  Shouling Ji,et al.  Routing in Multi-Sink Sensor Networks Based on Gravitational Field , 2008, 2008 International Conference on Embedded Software and Systems.

[3]  Anindya Basu,et al.  Routing using potentials: a dynamic traffic-aware routing algorithm , 2003, SIGCOMM '03.

[4]  Hiroshi Esaki,et al.  Message routing on potential-fields in forwarding-based DTNs , 2009, ICUIMC '09.

[5]  F. Dressler,et al.  Self-organization in Autonomous Sensor and Actuator Networks , 2007 .

[6]  P. Kumar,et al.  Connectivity-Aware Routing in Sensor Networks , 2007, 2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007).

[7]  Masayuki Murata,et al.  Energy-Efficient Receiver-Driven Wireless Mesh Sensor Networks , 2011, Sensors.

[8]  Masayuki Murata,et al.  Performance evaluation of intermittent receiver-driven data transmission on wireless sensor networks , 2009, 2009 6th International Symposium on Wireless Communication Systems.

[9]  Mark A. Shayman,et al.  Design optimization of multi-sink sensor networks by analogy to electrostatic theory , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[10]  Hartmut Schmeck,et al.  Organic Computing – Addressing Complexity by Controlled Self-Organization , 2006, Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006).

[11]  Jaideep Srivastava,et al.  PWave: A Multi-source Multi-sink Anycast Routing Framework for Wireless Sensor Networks , 2007, Networking.

[12]  Winston Khoon Guan Seah,et al.  A Scalable Priority-Based Multi-Path Routing Protocol for Wireless Sensor Networks , 2005, Int. J. Wirel. Inf. Networks.

[13]  Ruixi Yuan,et al.  A Novel Load Balanced and Lifetime Maximization Routing Protocol in Wireless Sensor Networks , 2008, VTC Spring 2008 - IEEE Vehicular Technology Conference.

[14]  Falko Dressler,et al.  Self-organization in sensor and actor networks , 2007, Wiley series in communications networking and distributed systems.

[15]  Qing Zhao,et al.  On the lifetime of wireless sensor networks , 2005, IEEE Communications Letters.

[16]  Chuang Lin,et al.  Effective Data Aggregation Supported by Dynamic Routing in Wireless Sensor Networks , 2010, 2010 IEEE International Conference on Communications.

[17]  Sanjay Shakkottai,et al.  Geographic Routing With Limited Information in Sensor Networks , 2010, IEEE Transactions on Information Theory.

[18]  Hartmut Schmeck,et al.  Organic Computing - A Paradigm Shift for Complex Systems , 2011, Organic Computing.

[19]  Omer Gurewitz,et al.  RI-MAC: a receiver-initiated asynchronous duty cycle MAC protocol for dynamic traffic loads in wireless sensor networks , 2008, SenSys '08.

[20]  Christian Müller-Schloer,et al.  Organic computing: on the feasibility of controlled emergence , 2004, CODES+ISSS '04.