{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:31:35Z","timestamp":1761611495761},"reference-count":20,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcm"],"published-print":{"date-parts":[[2019]]},"DOI":"10.12720\/jcm.14.8.739-744","type":"journal-article","created":{"date-parts":[[2019,12,30]],"date-time":"2019-12-30T06:18:21Z","timestamp":1577686701000},"page":"739-744","source":"Crossref","is-referenced-by-count":8,"title":["Performance Analysis of Adaptive Fuzzy Spray and Wait Routing Protocol"],"prefix":"10.12720","author":[{"name":"Laboratory of Applied Mathematics and Informatique (LAMAI) Cadi Ayyad University, Faculty of Sciences & Techniques Marrakech, Morocco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youssef","family":"Harrati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelmounaim","family":"Abdali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4977","published-online":{"date-parts":[[2019]]},"reference":[{"key":"ref0","doi-asserted-by":"publisher","unstructured":"[1] A. Balasubramanian, B. Levine, and A. Venkataramani, \"Dtn routing as a resource allocation problem,\" SIGCOMM Comput. Commun. Rev., vol. 37, no. 4, pp. 373-384, August 2007.","DOI":"10.1145\/1282427.1282422"},{"key":"ref1","doi-asserted-by":"publisher","unstructured":"[2] J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, \"Maxprop: Routing for vehicle-based disruption-tolerant networks,\" in Proc. 25th IEEE International Conference on Computer Communications, April 2006, pp. 1-11.","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"ref2","unstructured":"[3] M. C. Chuah, P. Yang, B. D. Davison, and L. Cheng, \"Store-and-forward performance in a dtn,\" in Proc. IEEE 63rd Vehicular Technology Conference, vol. 1, pp. 187-191, May 2006."},{"key":"ref3","doi-asserted-by":"publisher","unstructured":"[4] K. Fall, \"A delay-tolerant network architecture for challenged internets,\" in Proc. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, New York, NY, USA, 2003, pp. 27-34.","DOI":"10.1145\/863955.863960"},{"key":"ref4","doi-asserted-by":"publisher","unstructured":"[5] S. Jain, K. Fall, and R. Patra, \"Routing in a delay tolerant network,\" SIGCOMM Comput. Commun. Rev., vol. 34, no. 4, pp. 145-158, August 2004.","DOI":"10.1145\/1030194.1015484"},{"key":"ref5","unstructured":"[6] A. Keranen, \"Opportunistic network environment simulator,\" Special Assignment report, Helsinki University of Technology, Department of Communications and Networking, 2008."},{"key":"ref6","doi-asserted-by":"publisher","unstructured":"[7] A. Ker\u0308anen, J. Ott, and T. K\u0308arkk\u0308ainen, \"The ONE Simulator for DTN Protocol Evaluation,\" in Proc. 2nd International Conference on Simulation Tools and Techniques, New York, NY, USA, 2009.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"ref7","doi-asserted-by":"publisher","unstructured":"[8] A. Krifa, C. Baraka, and T. Spyropoulos, \"Optimal buffer management policies for delay tolerant networks,\" in Proc. 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2008.","DOI":"10.1109\/SAHCN.2008.40"},{"key":"ref8","doi-asserted-by":"publisher","unstructured":"[9] A. Krifa, C. Barakat, and T. Spyropoulos, \"An optimal joint scheduling and drop policy for delay tolerant networks,\" in Proc. International Symposium on a World of Wireless, Mobile and Multimedia Networks, June 2008, pp. 1-6.","DOI":"10.1109\/WOWMOM.2008.4594889"},{"key":"ref9","doi-asserted-by":"publisher","unstructured":"[10] A. Krifa, C. Barakat, and T. Spyropoulos, \"An optimal joint scheduling and drop policy for delay tolerant networks,\" in Proc. IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks, Jun. 2008, pp. 1-6.","DOI":"10.1109\/WOWMOM.2008.4594889"},{"key":"ref10","unstructured":"[11] J. Ott, \"Delay-tolerant networking at aalto university comnet,\" Apr 2013."},{"key":"ref11","doi-asserted-by":"publisher","unstructured":"[12] W. Pttner, F. Bsching, G. V. Zengen, and L. Wolf, \"Data elevators: Applying the bundle protocol in delay tolerant wireless sensor networks,\" in Proc. IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems, Oct. 2012, pp. 218-226.","DOI":"10.1109\/MASS.2012.6502520"},{"key":"ref12","doi-asserted-by":"publisher","unstructured":"[13] S. Rashid, Q. Ayub, M. S. M. Zahid, and A. H. Abdullah, \"EDROP an effective drop buffer management policy for DTN routing protocols,\" International Journal of Computer Applications, vol. 13, no. 7, pp. 8-13, 2011.","DOI":"10.5120\/1795-2486"},{"key":"ref13","doi-asserted-by":"publisher","unstructured":"[14] S. Rosati, K. Kruelecki, G. Heitz, D. Floreano, and B. Rimoldi, \"Dynamic routing for flying ad hoc networks,\" IEEE Transactions on Vehicular Technology, vol. 65, no. 3, pp. 1690-1700, March 2016.","DOI":"10.1109\/TVT.2015.2414819"},{"key":"ref14","unstructured":"[15] B. K. Saha, \"Commonly used metrics for performance evaluation,\" Mar. 2014."},{"key":"ref15","doi-asserted-by":"publisher","unstructured":"[16] K. Scott and S. Burleigh, \"Bundle protocol specification,\" RFC 5050, RFC Editor, November 2007.","DOI":"10.17487\/rfc5050"},{"key":"ref16","doi-asserted-by":"publisher","unstructured":"[17] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, \"Spray and wait: An efficient routing scheme for intermittently connected mobile networks,\" in Proc. ACM SIGCOMM Workshop on Delay-tolerant Networking, New York, NY, USA, 2005, pp. 252-259.","DOI":"10.1145\/1080139.1080143"},{"key":"ref17","unstructured":"[18] TKK\/COMNET. Project page of the one simulator. [Online]. Available: https:\/\/akeranen.github.io\/the-one\/"},{"key":"ref18","unstructured":"[19] A. Vahdat and D. Becker, \"Epidemic routing for partially-connected ad hoc networks,\" Technical Report, Department of Computer Science, Duke University, 2000"},{"key":"ref19","doi-asserted-by":"publisher","unstructured":"[20] Y. Harrati and A. Abdali, \"MaxHopCount: A new drop policy to optimize messages delivery rate in delay tolerant networks,\" International Journal of Interactive Multimedia and Artificial Intelligence, vol. 4, no. 1, p. 37, 2016.","DOI":"10.9781\/ijimai.2016.417"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2019\/0711\/20190711105952928.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T03:04:29Z","timestamp":1609383869000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/index.php?m=content&c=index&a=show&catid=229&id=1414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":20,"URL":"https:\/\/doi.org\/10.12720\/jcm.14.8.739-744","relation":{},"ISSN":["2374-4367"],"issn-type":[{"type":"print","value":"2374-4367"}],"subject":[],"published":{"date-parts":[[2019]]}}}