Summary
Ad hoc networks have been used in the last few years to provide communications means among agents that need to accomplish common goals. Due to the importance of communication for the success of such missions, we study the problem of maximizing communication among a set of agents. As a practical tool to solve such problems, we introduce a one-pass randomized algorithm that maximizes the total communication, as measured by the proposed objective function. Agents in this problem are routed along the edges of a graph, connecting their individual starting nodes to their respective destination nodes. This problem, known as the Cooperative Communication Problem in Mobile Ad Hoc Networks, is known to be NP-hard. We present a new heuristic and motivate the need for more advanced methods for the solution of this problem. In particular, we describe 1) a construction algorithm and 2) a local improvement method for maximizing communication. Computational results for the proposed approach are provided, showing that instances of realistic size can be efficiently solved by the algorithm.
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
M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
R.K. Ahuja, T.L. Magnanti, J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993.
P. Biswas and Y Ye. A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. Technical report, Dept of Management Science and Engineering, Stanford University, 2003.
P. Biswas and Y. Ye. Semidefinite programming for ad hoc wireless sensor network localization. In Proceedings of the third international symposium on Information processing in sensor networks, pages 46–54. ACM Press, 2004.
S. Butenko, X. Cheng, D.-Z. Du, and P. M. Pardalos. On the construction of virtual backbone for ad hoc wireless network. In S. Butenko, R. Murphey, and P. M. Pardalos, editors, Cooperative Control: Models, Applications and Algorithms, pages 43–54. Kluwer Academic Publishers, 2002.
S.I. Butenko, X. Cheng, C.A.S. Oliveira, and P.M. Pardalos. A new algorithm for connected dominating sets in ad hoc networks. In S. Butenko, R. Murphey, and P. Pardalos, editors, Recent Developments in Cooperative Control and Optimization, pages 61–73. Kluwer Academic Publishers, 2003.
S. Capkun, M. Hamdi, and J. Hubaux. Gps-free positioning in mobile ad-hoc networks. In HICSS’ 01: Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9, page 9008, Washington, DC, USA, 2001. IEEE Computer Society.
X. Cheng, X. Huang, D. Li, W. Wu, and D.Z. Du. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks, 42(4):202–208, 2003.
C.W. Commander, S.I. Butenko, and P.M. Pardalos. On the performance of heuristics for broadcast scheduling. In D. Grundel, R. Murphey, and P. Pardalos, editors, Theory and Algorithms for Cooperative Systems, pages 63–80. World Scientific, 2004.
C.W. Commander, S.I. Butenko, P.M. Pardalos, and C.A.S. Oliveira. Reactive grasp with path relinking for the broadcast scheduling problem. In Proceedings of the 40th Annual International Telemetry Conference, pages 792–800, 2004.
T.H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1992.
E.W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math., 1:269–271, 1959.
L. Doherty, K. S. J. Pister, and Ghaoui L. E. Convex position estimation in wireless sensor networks. In Proc. IEEE INFOCOM, Anchorage, AK, 2001.
R.W. Floyd. Algorithm 97 (shortest path). Communications of the ACM, 5(6):345, 1962.
M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, and D.J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59–68, 1995.
David Moore, John Leonard, Daniela Rus, and Seth Teller. Robust distributed network localization with noisy range measurements. In SenSys’ 04: Proceedings of the 2nd international conference on Embedded networked sensor systems, pages 50–61, New York, NY, USA, 2004. ACM Press.
C.A.S. Oliveira and P.M. Pardalos. An optimization approach for cooperative communication in ad hoc networks. Technical report, School of Industrial Engineering and Management, Oklahoma State University, 2005.
C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende. Optimization problems in multicast tree construction. In Handbook of Optimization in Telecommunications, pages 701–733. Springer, New York, 2006.
N.B. Priyantha, H. Balakrishnan, E.D. Demaine, and S. Teller. Mobile-assisted localization in wireless sensor networks. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, volume 1, pages 172–183, 2005.
C. Savarese, J. Rabay, and K. Langendoen. Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In USENIX Technical Annual Conference, 2002.
L. Schrage. A more portable FORTRAN random number generator. ACM Transactions on Mathematical Software, 5:132–138, 1979.
S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11–12, 1962.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Commander, C.W., Oliveira, C.A.S., Pardalos, P.M., Resende, M.G.C. (2007). A One-Pass Heuristic for Cooperative Communication in Mobile Ad Hoc Networks. In: Grundel, D., Murphey, R., Pardalos, P., Prokopyev, O. (eds) Cooperative Systems. Lecture Notes in Economics and Mathematical Systems, vol 588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48271-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-48271-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48270-3
Online ISBN: 978-3-540-48271-0
eBook Packages: Business and EconomicsBusiness and Management (R0)