{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:29:50Z","timestamp":1725496190919},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771128"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77115-9_5","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T10:11:56Z","timestamp":1196331116000},"page":"54-66","source":"Crossref","is-referenced-by-count":1,"title":["Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Khot","sequence":"first","affiliation":[]},{"given":"Ravikant","family":"Poola","sequence":"additional","affiliation":[]},{"given":"Kishore","family":"Kothapalli","sequence":"additional","affiliation":[]},{"given":"Kannan","family":"Srinathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Proc. 13th International Symposium on Algorithms and Computation, pp. 535\u2013549 (2002)","DOI":"10.1007\/3-540-36136-7_47"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Onus, M., Richa, A., Kothapalli, K., Scheideler, C.: Constant density spanners for wireless ad-hoc networks. In: ACM SPAA (2005)","DOI":"10.1145\/1073970.1073987"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobil ad-hoc routing. In: ACM DIALM (2002)","DOI":"10.1145\/570811.570814"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: Proc.\u00a0of the 22nd IEEE Symp.\u00a0on Principles of Distributed Computing (PODC) (2003)","DOI":"10.1145\/872035.872044"},{"key":"5_CR5","unstructured":"Perkins, C.: Adhoc on demand distance vector (aodv) routing, Internet draft, draft\u2013ietf\u2013manet\u2013aodv\u201304.txt (1999)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, vol.\u00a0353, Kluwer Academic Publishers, Dordrecht (1996)","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: Proc. of ACM SIGCOMM, pp. 234\u2013244 (1994)","DOI":"10.1145\/190314.190336"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Park, V., Corson, M.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proceedings of IEEE Infocom, pp. 1405\u20131413 (1997)","DOI":"10.1109\/INFCOM.1997.631180"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Broch, J., Maltz, D., Johnson, D., Hu, Y., Jetcheva, J.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Proceedings of the 4th annual ACM\/IEEE International conference on Mobile computing and networking, pp. 85\u201397 (1998)","DOI":"10.1145\/288235.288256"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: MobiHoc 2001. Proc.\u00a0of the 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing, pp. 45\u201355 (2001)","DOI":"10.1145\/501416.501424"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Bose, P., Morin, P., Brodnik, A., Carlsson, S., Demaine, E., Fleischer, R., Munro, J., Lopez-Ortiz, A.: Online routing in convex subdivisions. In: International Symposium on Algorithms and Computation (ISSAC), pp. 47\u201359 (2000)","DOI":"10.1007\/3-540-40996-3_5"},{"issue":"6","key":"5_CR12","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P. Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. ACM\/Kluwer Wireless Networks\u00a07(6), 609\u2013616 (2001)","journal-title":"ACM\/Kluwer Wireless Networks"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, pp. 267\u2013278 (2003)","DOI":"10.1145\/778415.778447"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A.C.C. Yao","year":"1982","unstructured":"Yao, A.C.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comp.\u00a011, 721\u2013736 (1982)","journal-title":"SIAM J. Comp."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Hassin, Y., Peleg, D.: Sparse communication networks and efficient routing in the plane. In: Proceedings of the ACM symposium on Principles of distributed computing, pp. 41\u201350 (2000)","DOI":"10.1145\/343477.343514"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Parthasarathy, S., Gandhi, R.: Distributed algorithms for coloring and domination in wireless ad hoc networks. In: Proc. of FSTTCS (2004)","DOI":"10.1007\/978-3-540-30538-5_37"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: ACM SPAA, pp. 39\u201348 (2005)","DOI":"10.1145\/1073970.1073977"},{"key":"5_CR18","unstructured":"Kumar, V.A., Marathe, M., Parthasarathy, S., Srinivasan, A.: End-to-end packet-scheduling in wireless ad-hoc networks. In: ACM SODA, pp. 1021\u20131030 (2004)"},{"issue":"6","key":"5_CR19","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1023\/A:1012311216333","volume":"7","author":"S. Krumke","year":"2001","unstructured":"Krumke, S., Marathe, M., Ravi, S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks\u00a07(6), 575\u2013584 (2001)","journal-title":"Wireless Networks"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: Self stabilization in spite of distributed control. Communications of the ACM\u00a017, 643\u2013644 (1974)","DOI":"10.1145\/361179.361202"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: Proc. of the 17th ACM Symposium on Theory of Computing (STOC), pp. 1\u201310 (1985)","DOI":"10.1145\/22145.22146"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77115-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:58Z","timestamp":1619521258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77115-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771128"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77115-9_5","relation":{},"subject":[]}}