{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:05:26Z","timestamp":1754157926446,"version":"3.41.2"},"reference-count":24,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2009,11,20]],"date-time":"2009-11-20T00:00:00Z","timestamp":1258675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,11,20]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>Group communication has become increasing important in mobile <jats:italic>ad hoc<\/jats:italic> networks (MANET). Current multicast routing protocols in MANET have been shown to incur large overheads due to dynamic network topology. To this end, this paper proposes an overlay multicast scheme in MANET that is more efficient.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The approach is to construct an overlay multicast tree based on the locations of the group nodes. The paper proposes several tree construction algorithms, namely, location\u2010guided <jats:italic>k<\/jats:italic>\u2010ary (LGK) tree, location\u2010guided directional (LGD) tree and location\u2010guided Steiner (LGS) tree. All of them rely on the geometric locations of the nodes as heuristics to construct the tree. The paper also introduces several mechanisms to enhance the proposed algorithms.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>The simulation results show that the location\u2010guided heuristics is very effective in constructing low bandwidth cost overlay multicast trees in MANET. When location information is up\u2010to\u2010date, the bandwidth cost of a LGS tree is similar to that of an optimal router\u2010assisted Steiner multicast tree. When location information is out\u2010dated, LGD tree has the lowest cost.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>This paper demonstrates the effectiveness of location\u2010guided heuristics in constructing overlay multicast trees in MANET. This study strongly suggests that location\u2010guided heuristics can be used to design many other algorithms in a mobile network.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17427370911008811","type":"journal-article","created":{"date-parts":[[2009,12,5]],"date-time":"2009-12-05T07:09:53Z","timestamp":1259996993000},"page":"388-410","source":"Crossref","is-referenced-by-count":8,"title":["Effective location\u2010guided overlay multicast in mobile <i>ad hoc<\/i> networks"],"prefix":"10.1108","volume":"5","author":[{"given":"Kai","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klara","family":"Nahrstedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022021519575162100_b9","unstructured":"Boivie, R., Feldman, N., Imai, Y., Livens, W., Ooms, D. and Paridaens, O. (2003), \u201cExplicit multicast (xcast) basic specification\u201d, IETF internet draft, August, available at: draft\u2010ooms\u2010xcast\u2010basic\u2010spec\u201005.txt."},{"key":"key2022021519575162100_b10","doi-asserted-by":"crossref","unstructured":"Chen, S. and Nahrstedt, K. (1998), \u201cAn overview of quality\u2010of\u2010service routing for the next generation high\u2010speed networks: problems and solutions\u201d, IEEE Network Magazine, Vol. 12 No. 6, pp. 64\u201076.","DOI":"10.1109\/65.752646"},{"key":"key2022021519575162100_b4","unstructured":"Chen, K. and Nahrstedt, K. (2002), \u201cEffective location\u2010guided tree construction algorithms for small group multicast in manet\u201d, in Proceedings of the IEEE INFOCOM 2002, New York, NY, USA, June."},{"key":"key2022021519575162100_b15","unstructured":"Chiang, C., Gerla, M. and Zhang, L. (1998), \u201cForwarding group multicast protocol (FGMP) for multihop mobile wireless networks\u201d, Cluster Computing, Vol. 1 No. 2, pp. 187\u201096."},{"key":"key2022021519575162100_b24","doi-asserted-by":"crossref","unstructured":"Cordeiro, C.M., Gossain, H. and Agrawal, D. (2003), \u201cMulticast over wireless mobile ad hoc networks: present and future directions\u201d, IEEE Network Magazine, Vol. 17 No. 1.","DOI":"10.1109\/MNET.2003.1174178"},{"key":"key2022021519575162100_b8","unstructured":"Cormen, T., Leiserson, C. and Rivest, R. (1989), Introduction to Algorithms, The MIT Press, Cambridge, MA."},{"key":"key2022021519575162100_b18","doi-asserted-by":"crossref","unstructured":"Das, S., Manoj, B. and Murthy, C. (2002), \u201cA dynamic core based multicast routing protocol\u201d, in Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2002), Lausanne, Switzerland, June.","DOI":"10.1145\/513800.513804"},{"key":"key2022021519575162100_b16","doi-asserted-by":"crossref","unstructured":"Garcia\u2010Luna\u2010Aceves, J. and Madruga, E. (1999), \u201cA multicast routing protocol for ad\u2010hoc networks\u201d, in Proceedings of IEEE INFOCOM'99, New York, New York, USA, March.","DOI":"10.1109\/INFCOM.1999.751466"},{"key":"key2022021519575162100_b21","unstructured":"Gui, C. and Mohapatra, P. (2003a), \u201cEfficient overlay multicast for mobile ad hoc networks\u201d, in Proceedings of IEEE Wireless Communications and Networking Conference (WCNC 2003), New Orleans, Louisiana, USA, March."},{"key":"key2022021519575162100_b22","doi-asserted-by":"crossref","unstructured":"Gui, C. and Mohapatra, P. (2003b), \u201cScalable multicasting in mobile ad hoc networks\u201d, in Proceedings of IEEE INFOCOM 2004, Hong Kong, China, March.","DOI":"10.1007\/0-387-22690-7_4"},{"key":"key2022021519575162100_b6","doi-asserted-by":"crossref","unstructured":"Hwang, F., Richards, D. and Winter, P. (1992), The Steiner Tree Problem, North\u2010Holland, Amsterdam.","DOI":"10.1002\/net.3230220105"},{"key":"key2022021519575162100_b2","unstructured":"IETF (2004), Home page of IETF mobile ad\u2010hoc networks (manet) WG, available at: www.ietf.org\/html.charters\/manet\u2010charter.html."},{"key":"key2022021519575162100_b13","unstructured":"Ji, L. and Corson, M. (1998), \u201cA lightweight adaptive multicast protocol\u201d, in Proceedings of the Global Telecommunications Conference (Globe\u2010Com'98), Sydney, Australia, November."},{"key":"key2022021519575162100_b1","unstructured":"Ji, L. and Corson, M. (2001), \u201cDifferential destination multicast \u2013 a manet multicast routing protocol for small groups\u201d, in Proceedings of IEEE INFOCOM 2001, Anchorage, Alaska, USA, April, pp. 1192\u2010201."},{"key":"key2022021519575162100_b5","unstructured":"Johnson, D.B. and Maltz, D.A. (1996), \u201cDynamic source routing in ad hoc wireless networks\u201d, in Imielinski, T. and Korth, H. (Eds), Mobile Computing, Kluwer Academic Publishers, Dordrecht."},{"key":"key2022021519575162100_b17","unstructured":"Lee, S.\u2010J., Gerla, M. and Chiang, C.\u2010C. (1999), \u201cOn\u2010demand multicast routing protocol\u201d, in Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC'99), New Orleans, Louisiana, USA, September, pp. 1298\u2010302."},{"key":"key2022021519575162100_b19","unstructured":"Luo, J., Eugster, P. and Hubaux, J.\u2010P. (2003), \u201cRoute driven gossip: probabilistic reliable multicast in ad hoc networks\u201d, in Proceedings of the IEEE INFOCOM 2003, San Francisco, California, USA, March\u2010April."},{"key":"key2022021519575162100_b3","unstructured":"Obraczka, K., Tsudik, G. and Viswanath, K. (2001), \u201cPushing the limits of multicast in ad hoc networks\u201d, in Proceedings of the International Conference on Distributed Computing Systems (ICDCS 2001), Phoenix, Arizona, USA, April."},{"key":"key2022021519575162100_b12","doi-asserted-by":"crossref","unstructured":"Royer, E. and Perkins, C. (1999), \u201cMulticast operation of the ad\u2010hoc on\u2010demand distance vector routing protocol\u201d, in Proceedings of the ACM\/IEEE International Conference on Mobile Computing and Networking (MobiCom'99), Seattle, Washington, USA, August.","DOI":"10.1145\/313451.313538"},{"key":"key2022021519575162100_b7","unstructured":"Takahashi, H. and Matsuyama, A. (1998), \u201cAn approximate solution for the Steiner problem in graphs\u201d, Mathmatica Japonica, Vol. 24, pp. 573\u20107."},{"key":"key2022021519575162100_b11","doi-asserted-by":"crossref","unstructured":"Wang, B. and Hou, J. (2000), \u201cMulticast routing and its QoS extension: problems, algorithms and protocols\u201d, IEEE Network Magazine, Vol. 14 No. 1, pp. 22\u201036.","DOI":"10.1109\/65.819168"},{"key":"key2022021519575162100_b14","unstructured":"Wu, C. and Tay, Y. (1999), \u201cAMRIS: a multicast protocol for ad hoc wireless networks\u201d, in Proceedings of IEEE Military Communications Conference (MILCOM'99), Atlantic City, New Jersey, USA, November."},{"key":"key2022021519575162100_b20","unstructured":"Xie, J., Talpade, R., McAuley, A. and Liu, M. (2002), \u201cAMRoute: ad hoc multicast routing protocol\u201d, ACM\/Kluwer Mobile Networks and Applications (MONET), Vol. 7 No. 6."},{"key":"key2022021519575162100_b23","unstructured":"Yang, S. and Wu, J. (2004), \u201cNew technologies of multicasting in manet\u201d, in Pan, Y. and Xiao, Y. (Eds), Design and Analysis of Wireless Networks, Nova Science Publishers, Hauppauge, NY."}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17427370911008811","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370911008811\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370911008811\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:24:14Z","timestamp":1753403054000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/5\/4\/388-410\/374781"}},"subtitle":[],"editor":[{"given":"D.A.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2009,11,20]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11,20]]}},"alternative-id":["10.1108\/17427370911008811"],"URL":"https:\/\/doi.org\/10.1108\/17427370911008811","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2009,11,20]]}}}