{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T01:10:20Z","timestamp":1686013820631},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,4,5]],"date-time":"2011-04-05T00:00:00Z","timestamp":1301961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s11276-011-0339-6","type":"journal-article","created":{"date-parts":[[2011,4,4]],"date-time":"2011-04-04T04:01:22Z","timestamp":1301889682000},"page":"1095-1112","source":"Crossref","is-referenced-by-count":3,"title":["Efficient routing in MANETs using ordered walks"],"prefix":"10.1007","volume":"17","author":[{"given":"Stephen","family":"Dabideen","sequence":"first","affiliation":[]},{"given":"J. J.","family":"Garcia-Luna-Aceves","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,5]]},"reference":[{"issue":"3","key":"339_CR1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","volume":"20","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B. (1985). A new distributed depth-first-search algorithm. Information Processing Letters 20(3), 147\u2013150.","journal-title":"Information Processing Letters"},{"issue":"6","key":"339_CR2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0020-0190(88)90187-1","volume":"26","author":"I. Cidon","year":"1988","unstructured":"Cidon, I. (1988). Yet another distributed depth-first-search algorithm. Information Processing Letters 26(6), 301\u2013305.","journal-title":"Information Processing Letters"},{"key":"339_CR3","unstructured":"Makki, S., & Havas, G. (1994). Optimal distributed algorithms for constructing a depth first search tree. In Proceedings of ICPP."},{"key":"339_CR4","unstructured":"Tian, H., Shen, H., & Matsuzawa, T. (2005). Randomwalk routing for wireless sensor networks. In Proceedings of PDCAT."},{"key":"339_CR5","doi-asserted-by":"crossref","unstructured":"Servetto, S. D., & Barrenechea, G. (2002). Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks. Proceedings of WSNA.","DOI":"10.1145\/570738.570741"},{"key":"339_CR6","doi-asserted-by":"crossref","unstructured":"Karp, B., & Kung, H. (2000). Greedy perimeter stateless routing for wireless networks. In Proceedings of the sixth annual ACM\/IEEE international conference on mobile computing and networking, pp. 243\u2013254, August.","DOI":"10.1145\/345910.345953"},{"key":"339_CR7","doi-asserted-by":"crossref","unstructured":"Acer, U., Kalyanaraman, S., & Abouzeid, A. A. (2007). Weak state routing for large dynamic networks. In Proceedings of MobiCom, September.","DOI":"10.1145\/1287853.1287888"},{"key":"339_CR8","doi-asserted-by":"crossref","unstructured":"Caesar, M., Castro, M., Nightingale, E. B., O\u2019Shea, G., & Rowstron, A. (2006). Virtual ring routing: Network routing inspired by dht. In Proceedings of ACM SIGCOMM.","DOI":"10.1145\/1151659.1159954"},{"key":"339_CR9","doi-asserted-by":"crossref","unstructured":"Dabideen, S., & Garcia-Luna-Aceves, J. J. (2009). OWL: Towards scalable routing in manets using depth-first search on demand. Sixth IEEE international conference on mobile ad-hoc and sensor systems.","DOI":"10.1109\/MOBHOC.2009.5336953"},{"key":"339_CR10","unstructured":"Ni, S.-Y., Tseng, Y.-C., Hen, Y. S. V., & Sheu, J.-P. (2001). The boradcast storm problem in mobile ad-hoc networks. In Proceedings of MobiCom."},{"key":"339_CR11","doi-asserted-by":"crossref","unstructured":"Segall, A. (1983). Distributed network protocols. IEEE Transactions on Information Theory.","DOI":"10.1109\/TIT.1983.1056620"},{"key":"339_CR12","unstructured":"Spohn, M. A. (2005). Domination in graphs in the context of mobile ad hoc networks. Ph.D. dissertation, University of California, Santa Cruz."},{"issue":"3","key":"339_CR13","first-page":"155","volume":"1","author":"L. Kleinrock","year":"1977","unstructured":"Kleinrock, L., & Kamoun, F. (1977). Hierarchical routing for large networks: Performance evaluation and optimization. Computer Networks 1(3), 155\u2013174.","journal-title":"Computer Networks"},{"key":"339_CR14","unstructured":"Guangyu Pei, M. G., & Chen, T.-W. (2000). Fisheye state routing in mobile ad hoc networks. ICDCS workshop in wireless networks and mobile computing."},{"key":"339_CR15","unstructured":"Ramanathan, R., & Santivanez, C. (2001). Hazy sighted link state (hsls) routing: A scalable link state algorithm. BBM Technical Memo BBN-TM-I30I, BBN Technologies."},{"key":"339_CR16","unstructured":"Xu, K., Hong, X., & Gerla, M. (2002). An ad hoc network with mobile backbones. IEEE international conference on communications."},{"key":"339_CR17","unstructured":"Rubin, I., & Vincent, P. (2001). Topological synthesis of mobile backbone networks for managing ad hoc wireless networks. IEEE international conference on management of multimedia networks and services: Management of multimedia on the internet."},{"key":"339_CR18","doi-asserted-by":"crossref","unstructured":"Beraldi, R., Querzoni, L., & Baldoni, R. (2006). A hint based probabilistic protocol for unicast communications in manets. Elsevier Ad Hoc Networks, 4(5).","DOI":"10.1016\/j.adhoc.2005.06.004"},{"key":"339_CR19","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Sen, S., Talwar, K., Werneck, R. F., & Wieder, U. (2009). Virtual ring routing trends. In Proceedings of the 23rd international conference on distributed computing.","DOI":"10.1007\/978-3-642-04355-0_42"},{"key":"339_CR20","unstructured":"Jacquet, P., Laouiti, A., Minet, P., & Viennot, L. (2001). Performance analysis of olsr multipoint relay flooding in two ad hoc wireless network models. INRIA, Technical report."},{"key":"339_CR21","doi-asserted-by":"crossref","unstructured":"Clausen, T., & Jacquet, P. (2003). Optimized link state routing protocol (OLSR). RFC 3626, October.","DOI":"10.17487\/rfc3626"},{"key":"339_CR22","doi-asserted-by":"crossref","unstructured":"Perkins, C. E., & Royer, E. M. (2003). Ad hoc on-demand distance vector routing. IETF Internet draft, October.","DOI":"10.17487\/rfc3561"},{"key":"339_CR23","unstructured":"Kurkowski, S., Camp, T., & Navidi, W. (2006). Minimal standards for rigorous MANET routing protocol evaluation. Technical report MCS 06-02, Colorado School of Mines."},{"issue":"1","key":"339_CR24","first-page":"1153","volume":"3","author":"W. Navidi","year":"2006","unstructured":"Navidi, W., & Camp, T. (2006). Stationary distributions for the random waypoint mobility model. IEEE Transactions on Mobile Computing 3(1), 1153\u20131166.","journal-title":"IEEE Transactions on Mobile Computing"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-011-0339-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-011-0339-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-011-0339-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T00:53:33Z","timestamp":1686012813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-011-0339-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,5]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["339"],"URL":"https:\/\/doi.org\/10.1007\/s11276-011-0339-6","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,5]]}}}