{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:26:01Z","timestamp":1725539161782},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642054334"},{"type":"electronic","value":"9783642054341"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05434-1_11","type":"book-chapter","created":{"date-parts":[[2009,10,14]],"date-time":"2009-10-14T10:08:35Z","timestamp":1255514915000},"page":"102-115","source":"Crossref","is-referenced-by-count":4,"title":["Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Florian","family":"Huc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aubin","family":"Jarry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Leone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luminita","family":"Moraru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sotiris","family":"Nikoletseas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Rolim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.comcom.2005.01.013","volume":"29","author":"A. Boukerche","year":"2006","unstructured":"Boukerche, A., Chatzigiannakis, I., Nikoletseas, S.E.: A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range. Computer Communications\u00a029(4), 477\u2013489 (2006)","journal-title":"Computer Communications"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1504\/IJMC.2005.007024","volume":"3","author":"S. Biaz","year":"2005","unstructured":"Biaz, S., Ji, Y.: A survey and comparison on localisation algorithms for wireless ad hoc networks. International Journal of Mobile Communications\u00a03(4), 374\u2013410 (2005)","journal-title":"International Journal of Mobile Communications"},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P. Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovi, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks\u00a07(6), 609\u2013616 (2001)","journal-title":"Wireless Networks"},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.adhoc.2005.06.006","volume":"4","author":"I. Chatzigiannakis","year":"2006","unstructured":"Chatzigiannakis, I., Dimitriou, T., Nikoletseas, S.E., Spirakis, P.G.: A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks. Ad Hoc Networks\u00a04(5), 621\u2013635 (2006)","journal-title":"Ad Hoc Networks"},{"issue":"1-2","key":"11_CR5","first-page":"133","volume":"10","author":"I. Chatzigiannakis","year":"2005","unstructured":"Chatzigiannakis, I., Nikoletseas, S.E., Spirakis, P.G.: Efficient and robust protocols for local detection and propagation in smart dust networks. MONET\u00a010(1-2), 133\u2013149 (2005)","journal-title":"MONET"},{"issue":"1-4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/COMST.2007.358971","volume":"9","author":"D. Chen","year":"2007","unstructured":"Chen, D., Varshney, P.K.: A survey of void handling techniques for geographic routing in wireless networks. IEEE Communications Surveys and Tutorials\u00a09(1-4), 50\u201367 (2007)","journal-title":"IEEE Communications Surveys and Tutorials"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1013985610753","volume":"5","author":"S. Datta","year":"2002","unstructured":"Datta, S., Stojmenovic, I., Wu, J.: Internal node and shortcut based routing with guaranteed delivery in wireless networks. Cluster Computing\u00a05(2), 169\u2013178 (2002)","journal-title":"Cluster Computing"},{"issue":"2","key":"11_CR8","first-page":"187","volume":"11","author":"Q. Fang","year":"2006","unstructured":"Fang, Q., Gao, J., Guibas, L.J.: Locating and bypassing holes in sensor networks. MONET\u00a011(2), 187\u2013200 (2006)","journal-title":"MONET"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. Technical Report RR-87-180, University of Southern California, Marina del Rey, Information Sciences Institut (March 1987)","DOI":"10.21236\/ADA180187"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis (1969)","DOI":"10.2307\/2412323"},{"issue":"11","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1016\/j.comcom.2004.01.012","volume":"27","author":"M. Heissenb\u00fcttel","year":"2004","unstructured":"Heissenb\u00fcttel, M., Braun, T., Bernoulli, T., W\u00e4lchli, M.: Blr: beacon-less routing algorithm for mobile ad hoc networks. Computer Communications\u00a027(11), 1076\u20131086 (2004)","journal-title":"Computer Communications"},{"key":"11_CR12","unstructured":"Jain, R., Puri, A., Sengupta, R.: Geographical routing using partial information for wireless ad hoc networks (1999)"},{"key":"11_CR13","unstructured":"Kim, Y.-J., Govindan, R., Karp, B., Shenker, S.: Geographic routing made practical. In: NSDI 2005: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation, Berkeley, CA, USA, pp. 217\u2013230. USENIX (2005)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/345910.345953","volume-title":"MobiCom 2000: Proceedings of the 6th annual international conference on Mobile computing and networking","author":"B. Karp","year":"2000","unstructured":"Karp, B., Kung, H.T.: Gpsr: greedy perimeter stateless routing for wireless networks. In: MobiCom 2000: Proceedings of the 6th annual international conference on Mobile computing and networking, pp. 243\u2013254. ACM Press, New York (2000)"},{"key":"11_CR15","unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11 th Canadian Conference on Computational Geometry, Vancouver, August 1999, pp. 51\u201354 (1999)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing. In: Proc. 4th ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing, MobiHoc (2003)","DOI":"10.1145\/778415.778447"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TNET.2007.900372","volume":"16","author":"F. Kuhn","year":"2008","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: An algorithmic approach to geographic routing in ad hoc and sensor networks. IEEE\/ACM Transactions on Networking\u00a016(1), 51\u201362 (2008)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/872035.872044","volume-title":"PODC 2003: Proceedings of the twenty-second annual symposium on Principles of distributed computing","author":"F. Kuhn","year":"2003","unstructured":"Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: PODC 2003: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pp. 63\u201372. ACM Press, New York (2003)"},{"key":"11_CR19","unstructured":"Leong, B., Liskov, B., Morris, R.: Geographic routing without planarization. In: NSDI 2006: Proceedings of the 3rd conference on 3rd Symposium on Networked Systems Design & Implementation, Berkeley, CA, USA, pp. 25\u201325. USENIX Association (2006)"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1298239.1298246","volume-title":"Q2SWinet 2007: Proceedings of the 3rd ACM Workshop on QoS and security for wireless and mobile networks","author":"L. Moraru","year":"2007","unstructured":"Moraru, L., Leone, P., Nikoletseas, S., Rolim, J.D.P.: Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms. In: Q2SWinet 2007: Proceedings of the 3rd ACM Workshop on QoS and security for wireless and mobile networks, pp. 31\u201338. ACM, New York (2007)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-85209-4_12","volume-title":"Ad-hoc, Mobile and Wireless Networks","author":"L. Moraru","year":"2008","unstructured":"Moraru, L., Leone, P., Nikoletseas, S., Rolim, J.: Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds.) ADHOC-NOW 2008. LNCS, vol.\u00a05198, pp. 148\u2013161. Springer, Heidelberg (2008)"},{"issue":"4","key":"11_CR22","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01262051","volume":"2","author":"R. Mathar","year":"1996","unstructured":"Mathar, R., Mattfeldt, J.: Optimal transmission ranges for mobile communication in linear multihop packet radio networks. Wirel. Netw.\u00a02(4), 329\u2013342 (1996)","journal-title":"Wirel. Netw."},{"key":"11_CR23","unstructured":"Radhakrishnan, S., Rao, N., Racherla, G., Sekharan, C., Batsell, S.: Dst - a routing protocol for ad hoc networks using distributed spanning trees. In: IEEE Wireless Communications and Networking Conference, pp. 100\u2013104 (1999)"},{"issue":"10","key":"11_CR24","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1109\/71.963415","volume":"12","author":"I. Stojmenovic","year":"2001","unstructured":"Stojmenovic, I., Lin, X.: Loop-free hybrid single-path\/flooding routing algorithms with guaranteed delivery for wireless networks. IEEE Trans. Parallel Distrib. Syst.\u00a012(10), 1023\u20131032 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"11_CR25","unstructured":"Toussaint, G.: Some unsolved problems on proximity graphs (1991)"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Urrutia, J.: Routing with guaranteed delivery in geometric and wireless networks. pp. 393\u2013406 (2002)","DOI":"10.1002\/0471224561.ch18"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Wireless Sensor Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05434-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:38Z","timestamp":1606186298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05434-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054334","9783642054341"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05434-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}