Andreas Loukas
Koen Langendoen
ABSTRACT
A common task of mobile wireless ad-hoc networks is to distributedly extract information from a monitored process. We define process information as a measure that is sensed and computed by each mobile node in a network. For complex tasks, such as searching in a network and coordination of robotic swarms, we are typically interested in the spatial distribution of the process information. Spatial distributions can be thought of as information potentials that recursively consider the richness of information around each node. This paper describes a localized mechanism for determining the information potential on each node based on local process information and the potential of neighboring nodes. The mechanism allows us to distributedly generate a spectrum of possible information potentials between the extreme points of a local view and distributed averaging. In this work, we describe the mechanism, prove its exponential convergence, and characterize the spectrum of information potentials. Moreover, we use the mechanism to generate information potentials that are unimodal, i.e., feature a single extremum. Unimodality is a very valuable property for chemotactic search, which can be used in diverse application tasks such as directed search of information and rendezvous of mobile agents.
- O. Babaoglu, G. Canright, A. Deutsch, G. A. D. Caro, F. Ducatelle, L. M. Gambardella, N. Ganguly, M. Jelasity, R. Montemanni, A. Montresor, and T. Urnes. Design patterns from biology for distributed computing. ACM Trans. Autonomous Adaptive Systems, 1:26--66, September 2006. Google Scholar
Digital Library
- T. Biyikoglu, J. Leydold, and P. F. Stadler. Laplacian eigenvectors of graphs: Perron-Frobenius and Faber-Krahn Type Theorems. Springer, 2007.Google Scholar
- S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE Transactions on Information Theory, 52:2508--2530, Jun. 2006.Google ScholarDigital Library
- J. Cortés. Achieving coordination tasks in finite time via nonsmooth gradient flows. In Proc. IEEE Conf. on Decision and Control, pages 6376--6381, Dec. 2005.Google ScholarCross Ref
- J. Cortés. Distributed algorithms for reaching consensus on general functions. Automatica, pages 726--737, 2008. Google ScholarDigital Library
- E. B. Davies, G. M. L. Gladwell, J. Leydold, and P. F. Stadler. Discrete nodal domain theorems. Linear Algebra and its Applications, 336:51--60, 2001.Google ScholarCross Ref
- A. Dimakis, A. Sarwate, and M. Wainwright. Geographic gossip: Efficient averaging for sensor networks. IEEE Trans. on Signal Processing, 56(3):1205--1216, March 2008. Google ScholarDigital Library
- W. Fan, Y. Liu, F. Wang, and X. Cai. Multi-robot formation control using potential field for mobile ad-hoc networks. In Proc. IEEE Int'l Conf. on Robotics and Biomimetics, pages 133--138, July 2005.Google ScholarCross Ref
- A. Gaba, S. Voulgaris, and M. van Steen. Towards congestion-aware all-to-all information dissemination in mobile ad-hoc networks. In Proc. Workshop on Ubiquitous Computing and Networks, pages 1690--1695, Dec. 2010.Google ScholarCross Ref
- C. Gkantsidis, G. Goel, M. Mihail, and A. Saberi. Towards topology aware networks. In Proc. IEEE Int'l Conf. on Computer Communications, pages 2591--2595, May 2007.Google ScholarDigital Library
- G. M. L. Gladwell and H. Zhu. Courant's nodal line theorem and its discrete counterparts. The Quarterly Journal of Mechanics and Applied Mathematics, 55:1--15, 2002.Google ScholarCross Ref
- M. A. Gonzalez, J. Gomez, M. Lopez-Guerrero, V. Rangel, and M. M. Oca. Guide-gradient: A guiding algorithm for mobile nodes in WLAN and ad-hoc networks. Wirel. Pers. Commun., 57(4):629--653, April 2011. Google ScholarDigital Library
- L. K. Grover. Local search and the local structure of NP-complete problems. Operations Research Letters, 12:235--243, 1992. Google ScholarDigital Library
- D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. of IEEE Symposium Foundations of Computer Science, pages 482--491, Oct. 2003. Google ScholarDigital Library
- O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. Int'l Journal of Robotics Research, 5:90--98, Apr 1986. Google ScholarDigital Library
- H. Lin, M. Lu, N. Milosavljevic, J. Gao, and L. J. Guibas. Composable Information Gradients in Wireless Sensor Networks. In Proc. of IEEE International Conference on Information Processing in Sensor Networks, pages 121--132, Apr. 2008. Google ScholarDigital Library
- P. Ogren, E. Fiorelli, and N. Leonard. Cooperative control of mobile sensor networks: Adaptive gradient climbing in a distributed environment. IEEE Trans. on Automatic Control, 49:1292--1302, Aug. 2004.Google ScholarCross Ref
- P. Song and V. Kumar. A potential field based approach to multi-robot manipulation. In Proc. IEEE Int'l Conf. on Robotics and Automation, volume 2, pages 1217--1222, May 2002.Google ScholarCross Ref
- D. P. Spanos and R. M. Murray. Distributed sensor fusion using dynamic consensus. IFAC World Congress, 2005.Google Scholar
- L. Xiao, S. Boyd, and S. Lall. A scheme for robust distributed sensor fusion based on average consensus. In Proc. Int'l Conf. on Information processing in sensor networks, Apr. 2005. Google ScholarDigital Library
- M. Zavlanos, M. Egerstedt, and G. Pappas. Graph-theoretic connectivity control of mobile robot networks. Proc. of the IEEE, 99:1525--1540, Sept. 2011.Google ScholarCross Ref
Index Terms
- On distributed computation of information potentials
Recommendations
A hybrid multiagent routing approach for wireless ad hoc networks
Wireless ad-hoc networks are infrastructureless networks that comprise wireless mobile nodes able to communicate each other outside wireless transmission range. Due to frequent network topology changes in one hand and the limited underlying bandwidth in ...
Reputation based selfishness prevention techniques for mobile ad-hoc networks
Mobile ad-hoc networks require nodes to cooperate in the relaying of data from source to destination. However, due to their limited resources, selfish nodes may be unwilling to forward packets, which can deteriorate the multi-hop connectivity. Different ...
Effect of mobility parameters on the inaccuracy of the position information of position-based MANET routing
Position-based routing protocols have become increasingly popular in mobile ad-hoc networks because they can use geographical node position information to route data packets to their destinations. Each node periodically sends its geographical position ...
Comments