{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T10:11:50Z","timestamp":1684577510003},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T00:00:00Z","timestamp":1223510400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst Sign Image Video Technol"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s11265-008-0277-4","type":"journal-article","created":{"date-parts":[[2008,10,8]],"date-time":"2008-10-08T16:39:06Z","timestamp":1223483946000},"page":"401-414","source":"Crossref","is-referenced-by-count":1,"title":["Using Heterogeneity to Enhance Random Walk-based Queries"],"prefix":"10.1007","volume":"57","author":[{"given":"Marco","family":"Zuniga","sequence":"first","affiliation":[]},{"given":"Chen","family":"Avin","sequence":"additional","affiliation":[]},{"given":"Bhaskar","family":"Krishnamachari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,9]]},"reference":[{"key":"277_CR1","doi-asserted-by":"crossref","unstructured":"Krishnamachari, B., & Ahn, J. (2006). Optimizing data replication for expanding ring-based queries in wireless sensor networks. WiOpt.","DOI":"10.1109\/WIOPT.2006.1666457"},{"key":"277_CR2","unstructured":"Ganesan, D., Krishnamachari, B., Woo, A., Culler, D., Estrin,\u00a0D., & Wicker, S. (2002). Complex behavior at scale: an experimental study of low-power wireless sensor networks. UCLA CS Technical Report UCLA\/CSD-TR 02-0013."},{"key":"277_CR3","unstructured":"Govindan, R., Kohler, E., Estrin, D., Bian, F., Chintalapudi, K., Gnawali, O., et al. (2005). Tenet: An architecture for tiered embedded networks. CENS Technical Report 56, November\u00a010."},{"key":"277_CR4","doi-asserted-by":"crossref","unstructured":"Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000). Directed diffusion: A scalable and robust communication paradigm for sensor networks. ACM Mobicom.","DOI":"10.1145\/345910.345920"},{"key":"277_CR5","doi-asserted-by":"crossref","unstructured":"Chang, N. B., & Liu, M. (2004). Revisiting the ttl-based controlled flooding search: Optimality and randomization. ACM MobiCom.","DOI":"10.1145\/1023720.1023730"},{"key":"277_CR6","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/TNET.2007.892880","volume":"15","author":"N.B. Chang","year":"2006","unstructured":"Chang, N. B., & Liu, M. (2006). Controlled flooding search in a large network. IEEE\/ACM Transactions on Networking, 15, 436\u2013449.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"277_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, Z., & Heinzelman, W. (2005). Flooding strategy for target discovery in wireless networks. ACM\/Baltzer Wireless Networks.","DOI":"10.1007\/s11276-005-3516-7"},{"key":"277_CR8","unstructured":"Cheng, Z., & Heinzelman, W. (2004). Searching strategy for multi-target discovery in wireless networks. ASWN."},{"key":"277_CR9","unstructured":"Aldous, D., & Fill, J. (1994). Reversible Markov chains and random walks on graphs. Draft monograph. http:\/\/www.stat.berkeley.edu\/~aldous\/RWG\/book.html"},{"key":"277_CR10","first-page":"353","volume-title":"Combinatorics, Paul Erdos is eighty (Vol. 2)","author":"L. Lovasz","year":"1996","unstructured":"Lovasz, L. (1996). Random walks on graphs: A survey. In Combinatorics, Paul Erdos is eighty (Vol. 2, pp. 353\u2013398). Janos Bolyai Mathematical Society, Budapest."},{"key":"277_CR11","doi-asserted-by":"crossref","unstructured":"Burioni, R., & Cassi, D. (2005). Random walks on graphs: Ideas, techniques and results. Journal of Physics A: Mathematical and General, 38(8), Article R01, March.","DOI":"10.1088\/0305-4470\/38\/8\/R01"},{"key":"277_CR12","unstructured":"Fertr, M., Jeanvoine, E., Morin, C., & Rilling, L. (2005). Grid-aware operating system. Programming Parallel and Distributed Systems for Large Scale Numerical Simulation Applications."},{"key":"277_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, E., & Shenker, S. (2002). Replication strategies in unstructured peer-to-peer networks. ACM SIGCOMM.","DOI":"10.1145\/633025.633043"},{"key":"277_CR14","doi-asserted-by":"crossref","first-page":"46135","DOI":"10.1103\/PhysRevE.64.046135","volume":"64","author":"L.A. Adamic","year":"2001","unstructured":"Adamic, L. A., Lukose, R., Puniyani, A., & Huberman, B. (2001). Search in power-law networks. Physical Review E, 64, 46135.","journal-title":"Physical Review E"},{"key":"277_CR15","doi-asserted-by":"crossref","unstructured":"Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., & Shenker, S. (2003). Gia: Making gnutella like p2p systems scalable. ACM SIGCOMM.","DOI":"10.1145\/863955.864000"},{"key":"277_CR16","doi-asserted-by":"crossref","unstructured":"Tian, R., Xiong, Y., Zhang, Q., Li, B., Zhao, B. Y., & Li,\u00a0X. (2005). Hybrid overlay structure based on random walks. IPTPS.","DOI":"10.1007\/11558989_14"},{"key":"277_CR17","unstructured":"Dolev, S., Schiller, E., & Welch, J. (2002). Random walk for self-stabilizing group communication in ad-hoc networks. SRDS."},{"key":"277_CR18","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Friedman, R., Kliot, G. (2006). RaWMS\u2014random walk based lightweight membership service for wireless Ad Hoc networks. MobiHoc.","DOI":"10.1145\/1132905.1132932"},{"key":"277_CR19","doi-asserted-by":"crossref","unstructured":"Sivaraj, H., & Gopalakrishnan, G. (2003). Random walk based heuristic algorithms for distributed memory model checking. PDMC.","DOI":"10.1016\/S1571-0661(05)80096-9"},{"key":"277_CR20","doi-asserted-by":"crossref","unstructured":"Henzinger, M. R., Heydon, A., Mitzenmacher, M., & Najork,\u00a0M. (1999). Measuring index quality using random walks on the web. In 8th International world wide web conference, May.","DOI":"10.1016\/S1389-1286(99)00016-X"},{"key":"277_CR21","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. WSNA.","DOI":"10.1145\/570738.570741"},{"key":"277_CR22","doi-asserted-by":"crossref","unstructured":"Avin, C., & Brito, C. (2004). Efficient and robust query processing in dynamic environments using random walk techniques. Fontenay-aux-Roses: IPSN.","DOI":"10.1145\/984622.984663"},{"issue":"1","key":"277_CR23","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.adhoc.2003.08.001","volume":"3","author":"N. Sadagopan","year":"2005","unstructured":"Sadagopan, N., Krishnamachari, B., & Helmy, A. (2005). Active query forwarding in sensor networks (ACQUIRE). Journal of Ad Hoc Networks, Elsevier, 3(1), 91\u2013113, January.","journal-title":"Journal of Ad Hoc Networks, Elsevier"},{"key":"277_CR24","doi-asserted-by":"crossref","unstructured":"Braginsky, D., & Estrin, D. (2002). Rumor routing algorithm for sensor networks. WSNA.","DOI":"10.1145\/570738.570742"},{"key":"277_CR25","doi-asserted-by":"crossref","unstructured":"Shakkottai, S. (2004). Asymptotics of query strategies over a sensor network. IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2004.1354526"},{"key":"277_CR26","unstructured":"Alanyali, M., Saligrama, V., & Savas, O. (2006). A random-walk model for distributed computation in energy-limited networks. In 1st workshop on information theory and its applications."},{"key":"277_CR27","first-page":"102","volume-title":"Adventures in stochastic processes","author":"S. Resnick","year":"1992","unstructured":"Resnick, S. (1992). Adventures in stochastic processes (pp. 102\u2013110). Birkh\u00e4user, Boston."},{"key":"277_CR28","doi-asserted-by":"crossref","unstructured":"Doyle, P., & Snell, J. (1984). Random walks and electric networks. MAA.","DOI":"10.5948\/UPO9781614440222"},{"key":"277_CR29","doi-asserted-by":"crossref","unstructured":"Chandra, A., Raghavan, P., Ruzzo, W., Smolensky, R. (1989). The electrical resistance of a graph captures its commute and cover times. In ACM symposium on theory of computing.","DOI":"10.1145\/73007.73062"},{"key":"277_CR30","unstructured":"Zuniga, M., & Krishnamachari, B. (2007). An analysis of unreliability and asymmetry in low-power weireless links. ACM Transactions on Sensor Networks (TOSN), 3(2), June."},{"key":"277_CR31","unstructured":"Ahn, J., Kapadia, S., Pattem, S., Sridharan, A., Zuniga, M., Jun, J., et al. (2008). Analyzing the transitional region in low power wireless links. ACM CCR, in press."}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-008-0277-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-008-0277-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-008-0277-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T09:55:11Z","timestamp":1684576511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-008-0277-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,9]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["277"],"URL":"https:\/\/doi.org\/10.1007\/s11265-008-0277-4","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,9]]}}}