{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:37:49Z","timestamp":1781109469485,"version":"3.54.1"},"reference-count":32,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10,1]]},"abstract":"<p>In geographical routing algorithms, mobile nodes rely on geographical position to make routing judgments. Researchers frequently discuss such routing algorithms in (2D) space. However, in reality, mobile nodes spread in (3D) space. In this paper the authors present four new 3D geographical-based routing algorithms Cylinder, Greedy-Cylinder, Cluster-Cylinder, and Greedy-cluster-Cylinder. In Cylinder routing, the nodes are locally projected on the inner surface of a cylinder, perimeter routing is executed after that. Greedy-Cylinder starts with Greedy routing algorithm until a local minimum is reached. The algorithm then switches to Cylinder routing. Cluster-Cylinder elects a dominating set for all nodes and then uses this set for projection and routing. The fourth algorithm Greedy-cluster-Cylinder is a combination between Greedy-Cylinder and Cluster-Cylinder. The authors evaluate their new algorithms and compare them with many classical known algorithms. The simulation outcomes show the substantial enhancement in delivery rate over other algorithms.<\/p>","DOI":"10.4018\/ijitwe.2014100105","type":"journal-article","created":{"date-parts":[[2015,2,26]],"date-time":"2015-02-26T12:42:44Z","timestamp":1424954564000},"page":"54-66","source":"Crossref","is-referenced-by-count":0,"title":["Cluster-Based Online Routing Protocols for Ad Hoc Network"],"prefix":"10.4018","volume":"9","author":[{"given":"Alaa E.","family":"Abdallah","sequence":"first","affiliation":[{"name":"Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Zarqa, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Bsoul","sequence":"additional","affiliation":[{"name":"Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Zarqa, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emad E.","family":"Abdallah","sequence":"additional","affiliation":[{"name":"Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Zarqa, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ibrahim","family":"Al\u2013Oqily","sequence":"additional","affiliation":[{"name":"Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Zarqa, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Kao","sequence":"additional","affiliation":[{"name":"Averna Technologies Inc., Montreal, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijitwe.2014100105-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.10.037"},{"key":"ijitwe.2014100105-1","unstructured":"Abdallah, A., Fevens, T., & Opatrny, J. (2010). 3d local algorithm for dominating sets of unit disk graphs. In Proceedings of the canadian conference on computational geometry (cccg) (p. 35-38). Winnipeg-Manitoba."},{"issue":"1-2","key":"ijitwe.2014100105-2","first-page":"21","article-title":"3d local algorithm for dominating sets of unit disk graphs.","volume":"19","author":"A.Abdallah","year":"2013","journal-title":"Ad Hoc Sensor Wireless Networks"},{"key":"ijitwe.2014100105-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2009.03.001"},{"key":"ijitwe.2014100105-4","doi-asserted-by":"publisher","DOI":"10.1504\/IJNVO.2013.051752"},{"key":"ijitwe.2014100105-5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1195412"},{"key":"ijitwe.2014100105-6","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2002.6596929"},{"key":"ijitwe.2014100105-7","doi-asserted-by":"crossref","unstructured":"Alzoubi, K., Wan, P., & Frieder, O. (2002b). Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks. In Proc. of the third acm international symp. mobile ad hoc networking and computing (mobihoc) (pp. 157-164). Lausanne.","DOI":"10.1145\/513800.513820"},{"key":"ijitwe.2014100105-8","doi-asserted-by":"crossref","unstructured":"Barri_ere, L., Fraigniaud, P., Narayanan, L., & Opatrny, J. (2003). Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wireless Communications and Mobile Computing Journal, 3(2), 141-153.","DOI":"10.1002\/wcm.108"},{"key":"ijitwe.2014100105-9","doi-asserted-by":"crossref","unstructured":"Basagni, S., Chlamtac, I., Syrotiuk, V., & Woodward, B. (1998). A distance routing effect algorithm for mobility (DREAM). In Proc. of the 4th annual acm\/ieee international conference on mobile computing and networking (mobicom) (pp. 76-84). Dallas.","DOI":"10.1145\/288235.288254"},{"key":"ijitwe.2014100105-10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369387"},{"issue":"6","key":"ijitwe.2014100105-11","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1023\/A:1012319418150","article-title":"Routing with guaranteed delivery in ad hoc wireless networks.","volume":"7","author":"P.Bose","year":"2001","journal-title":"Wireless Networks Journal"},{"key":"ijitwe.2014100105-12","unstructured":"Choi, W., & Das, S. (2002). Performance of randomized destination sequence distance vector (R-DSDV) protocol for congestion control in ad hoc wireless network routing. In Proc. of the applied telecommunications symposium wireless track (ats). San Diego."},{"key":"ijitwe.2014100105-13","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"ijitwe.2014100105-14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1997.605303"},{"key":"ijitwe.2014100105-15","doi-asserted-by":"publisher","DOI":"10.1007\/11561354_6"},{"key":"ijitwe.2014100105-16","doi-asserted-by":"crossref","unstructured":"Fin, G. (1987). Routing and addressing problems in large metropolitan-scale internetworks. In Technical report isu\/rr-87-180, uscisi, marina del ray. California.","DOI":"10.21236\/ADA180187"},{"key":"ijitwe.2014100105-17","doi-asserted-by":"publisher","DOI":"10.1145\/1161089.1161133"},{"key":"ijitwe.2014100105-18","doi-asserted-by":"publisher","DOI":"10.2307\/2412323"},{"key":"ijitwe.2014100105-19","doi-asserted-by":"crossref","unstructured":"Giordano, S., Stojmenovic, I., & Blazevic, L. (2003). Postion based routing algorithms for ad hoc networks for ad hoc networks: A taxonomy. In Ad hoc wireless networking (ed. x. cheng, x. huang, and d.z. du), Kluwer (pp. 103-136).","DOI":"10.1007\/978-1-4613-0223-0_4"},{"key":"ijitwe.2014100105-20","doi-asserted-by":"publisher","DOI":"10.1109\/5.163414"},{"key":"ijitwe.2014100105-21","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"ijitwe.2014100105-22","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"ijitwe.2014100105-23","doi-asserted-by":"crossref","unstructured":"Karp, B., & Kung, H. (2000). GPSR: Greedy perimeter stateless routing for wireless net-works. In Proc. of the 6th acm\/ieee conference on mobile computing and networking (mobicom 2000) (pp. 243-254). Boston.","DOI":"10.1145\/345910.345953"},{"key":"ijitwe.2014100105-24","unstructured":"Kranakis, E., Singh, H., & Urrutia, J. (1999). Compass routing on geometric networks. In Proc. of the 11th canadian conference on computational geometry (cccg '99) (pp. 51-54). Vancouver."},{"key":"ijitwe.2014100105-25","doi-asserted-by":"publisher","DOI":"10.1145\/941079.941089"},{"key":"ijitwe.2014100105-26","doi-asserted-by":"publisher","DOI":"10.1109\/65.967595"},{"key":"ijitwe.2014100105-27","doi-asserted-by":"publisher","DOI":"10.1109\/MCSA.1999.749281"},{"key":"ijitwe.2014100105-28","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0887"},{"key":"ijitwe.2014100105-29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096061"},{"key":"ijitwe.2014100105-30","doi-asserted-by":"crossref","unstructured":"Wu, J., Dai, F., Gao, M., & Stojmenovic, I. (2002). On calculating power-aware connected dominating sets for e_cient routing in ad hoc wireless networks. IEEE\/KICS Journal of Communications and Networks, 4(1), 59-70.","DOI":"10.1109\/JCN.2002.6596934"},{"key":"ijitwe.2014100105-31","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016783217662"}],"container-title":["International Journal of Information Technology and Web Engineering"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=124029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T23:19:31Z","timestamp":1747696771000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijitwe.2014100105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2014,10,1]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijitwe.2014100105","relation":{},"ISSN":["1554-1045","1554-1053"],"issn-type":[{"value":"1554-1045","type":"print"},{"value":"1554-1053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,1]]}}}