Abstract
When multiagent systems are used, design of an energy-efficient and autonomous data routing mechanism for wireless sensor networks is challenging. We see this challenge in the problem of coalition formation of agents (transmitters) for allocating dynamic-motion tasks (sensors) where the tasks have different service deadlines, and are in motion. The problem becomes harder when there are more tasks than agents, and when the data transmission is noisy. To address this, we design a novel and anytime decentralized heuristic algorithm to form coalitions. This algorithm can achieve at least 72±0.8% and at most 102±2.2% performance relative to the best known centralized coalition formation algorithm in such a sensor network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ramchurn, S.D., Polukarov, M., Farinelli, A., Truong, C., Jennings, N.R.: Coalition formation with spatial and temporal constraints. In: AAMAS 2010, pp. 1181–1188 (2010)
Saad, W., Han, Z., Basar, T., Merouane, D., Hjorungnes, A.: Hedonic Coalition Formation for Distributed Tak Allocation Among Wireless Agents. IEEE Transactions on Mobile Computing, 1327–1334 (2011)
Proakis, J., Salehi, M.: Digital Communications, 5th edn. McGraw-Hill (2007)
Vinyals, M., Rodriguez-Aguilar, J.A., Cerquides, J.: A survey on sensor networks from a multiagent perspective. The Computer Journal, 455–470 (2011)
Rogers, A., David, E., Jennings, N.R.: Self-organized routing for wireless micro-sensor networks. IEEE Transactions on Systems, Man, and Cybernetics - Part A, 349–359 (2005)
Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics, 2nd edn. Springer (2010)
Aggarwal, N., Aggarwal, K.: An Improved K-means Clustering Algorithm for Data Mining, 2nd edn. LAP LAMBERT Academic Publishing (2012)
Helsgaun, K.: General k-opt submoves for the lin-kernighan tsp heuristic. Mathematical Programming Computation 1(2-3), 119–163 (2009)
Turgut, D., Bölöni, L.: Three heuristics for transmission scheduling in sensor networks with multiple mobile sinks. In: AAMAS Workshop on Agent Technology for Sensor Networks, pp. 1–8 (2008)
Akkaya, K., Younis, M.: A survey of routing protocols in wireless sensor networks. Ad Hoc Network 3(3), 325–349 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weerakoon, U., Allan, V. (2013). Coalition Formation for Servicing Dynamic Motion Tasks. In: Gomes, C., Sellmann, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2013. Lecture Notes in Computer Science, vol 7874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38171-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-38171-3_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38170-6
Online ISBN: 978-3-642-38171-3
eBook Packages: Computer ScienceComputer Science (R0)