Discrete Scale Spaces via Heat Equation
SIBGRAPI '01 Proceedings of the 14th Brazilian Symposium on Computer Graphics and Image Processing
Routing using potentials: a dynamic traffic-aware routing algorithm
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Data acquisition in multiple-sink sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Self-organization in Autonomous Sensor and Actuator Networks
Self-organization in Autonomous Sensor and Actuator Networks
Connectivity-Aware Routing in Sensor Networks
SENSORCOMM '07 Proceedings of the 2007 International Conference on Sensor Technologies and Applications
Composable Information Gradients in Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Organic Computing - Addressing Complexity by Controlled Self-Organization
ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Hop ID: A Virtual Coordinate-Based Routing for Sparse Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Routing in Multi-Sink Sensor Networks Based on Gravitational Field
ICESS '08 Proceedings of the 2008 International Conference on Embedded Software and Systems
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Message routing on potential-fields in forwarding-based DTNs
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Distributed potential field based routing and autonomous load balancing for wireless mesh networks
IEEE Communications Letters
PWave: a multi-source multi-sink anycast routing framework for wireless sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Adaptivity and self-organization in organic computing systems
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Organic Computing - A Paradigm Shift for Complex Systems
Organic Computing - A Paradigm Shift for Complex Systems
Traffic-Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks
IEEE Transactions on Mobile Computing
EBRP: Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
| Hi-index | 0.00 |
Improving the scalability and robustness of wireless sensor networks is an important task, and much research on self-organization has been conducted toward this end. However, desired behavior is not yet guaranteed in much larger networks based on pure self-organization. In this article, we propose a controlled potential-based routing protocol implementing a novel controlled self-organization scheme that also allows for external control. The scheme obtains close-to-optimal network behavior by this external control which controls a part of nodes in the network. We show that global traffic flow can be controlled through simulation experiments with a multi-sink sensor network. For example, traffic loads can be equalized among heterogeneously distributed sink nodes, and load balancing among the relay nodes based on remaining energy can bring an approximate four times extension of network lifetime. The proposed method is furthermore robust to message loss and resilient to failure of the sink node.