메뉴 건너뛰기




Volumn 22, Issue 3, 2016, Pages 975-989

Distributed probabilistic routing for sensor network lifetime optimization

Author keywords

Distributed algorithm; Network lifetime maximization; Probabilistic routing; Sensor networks

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; PARALLEL ALGORITHMS; PROBABILITY; SENSOR NETWORKS; TOPOLOGY;

EID: 84936885353     PISSN: 10220038     EISSN: 15728196     Source Type: Journal    
DOI: 10.1007/s11276-015-1012-2     Document Type: Article
Times cited : (9)

References (34)
  • 4
    • 33749636506 scopus 로고    scopus 로고
    • Energy balanced data propagation in wireless sensor networks
    • Efthymiou, C., Nikoletseas, S., & Rolim, J. (2006). Energy balanced data propagation in wireless sensor networks. Wireless Networks, 12, 691–707.
    • (2006) Wireless Networks , vol.12 , pp. 691-707
    • Efthymiou, C.1    Nikoletseas, S.2    Rolim, J.3
  • 5
    • 33746035711 scopus 로고    scopus 로고
    • An optimal data propagation algorithm for maximizing the lifespan of sensor networks. DCOSS’2006 (Vol. 4026, pp. 405–421)
    • Berlin/Heidelberg: Springer
    • Jarry, A., Leone, P., Powell, O., & Rolim, J. (2006). An optimal data propagation algorithm for maximizing the lifespan of sensor networks. DCOSS’2006 (Vol. 4026, pp. 405–421)., Lecture Notes in Computer Science. Berlin/Heidelberg: Springer.
    • (2006) Lecture Notes in Computer Science
    • Jarry, A.1    Leone, P.2    Powell, O.3    Rolim, J.4
  • 6
    • 25844495403 scopus 로고    scopus 로고
    • Power aware routing for sensor databases
    • Buragohain, C., Agrawal, D., Suri, S. (2005). Power aware routing for sensor databases. INFOCOM’05, pages 1747–1757 2881
    • (2005) INFOCOM’05 , vol.2881 , pp. 1747-1757
    • Buragohain, C.1    Agrawal, D.2    Suri, S.3
  • 8
    • 83055196606 scopus 로고    scopus 로고
    • Close-to-optimal energy balanced data propagation via limited, local network density information. Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems, MSWiM ’11 (pp. 85–92)
    • USA: ACM
    • Boukerche, A., Efstathiou, D., Nikoletseas, S., & Raptopoulos, C. (2011). Close-to-optimal energy balanced data propagation via limited, local network density information. Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems, MSWiM ’11 (pp. 85–92). New York: NY, USA, ACM.
    • (2011) New York: NY
    • Boukerche, A.1    Efstathiou, D.2    Nikoletseas, S.3    Raptopoulos, C.4
  • 10
    • 33845622861 scopus 로고    scopus 로고
    • Online data gathering for maximizing network lifetime in sensor networks
    • Liang, W. F., & Liu, Y. Z. (2007). Online data gathering for maximizing network lifetime in sensor networks. IEEE Transactions on Mobile Computing, 6(1), 2–11.
    • (2007) IEEE Transactions on Mobile Computing , vol.6 , Issue.1 , pp. 2-11
    • Liang, W.F.1    Liu, Y.Z.2
  • 11
    • 84961408567 scopus 로고    scopus 로고
    • Liang, L. W. (2010). Prolonging network lifetime for data gathering in wireless sensor networks. IEEE Transactions on Computers (in press)
    • Liang, L. W. (2010). Prolonging network lifetime for data gathering in wireless sensor networks. IEEE Transactions on Computers (in press).
  • 12
    • 72849113423 scopus 로고
    • Rearrangement inequality
    • Wu, K., & Liu, A. (1995). Rearrangement inequality. Mathematics Competitions, 8, 53–60.
    • (1995) Mathematics Competitions , vol.8 , pp. 53-60
    • Wu, K.1    Liu, A.2
  • 13
    • 84961406567 scopus 로고    scopus 로고
    • Guided-evolving:convergence to globally optimal load balance by distributed computing using local information, mobicom’10 demo
    • Wang, Y., Wang, Y., Qi, X. (2010). Guided-evolving:convergence to globally optimal load balance by distributed computing using local information, mobicom’10 demo, online at.
    • (2010) online at
    • Wang, Y.1    Wang, Y.2    Qi, X.3
  • 14
    • 26444534431 scopus 로고    scopus 로고
    • Probability based dynamic load-balancing tree algorithm for wireless sensor networks. Networking and Mobile Computing (Vol. 3619, pp. 682–691)
    • Berlin/Heidelberg: Springer
    • Yan, T., Bi, Y., Sun, L., & Zhu, H. (2005). Probability based dynamic load-balancing tree algorithm for wireless sensor networks. Networking and Mobile Computing (Vol. 3619, pp. 682–691)., Lecture Notes in Computer Science. Berlin/Heidelberg: Springer.
    • (2005) Lecture Notes in Computer Science
    • Yan, T.1    Bi, Y.2    Sun, L.3    Zhu, H.4
  • 15
    • 84961395119 scopus 로고    scopus 로고
    • Wang, Y., Wang, Y., Qi, X. (2010). Guided-evolution: Convergence to global optimal by distributed computing using local information. Demo in MobiCom’10, online at
    • Wang, Y., Wang, Y., Qi, X. (2010). Guided-evolution: Convergence to global optimal by distributed computing using local information. Demo in MobiCom’10, online at: http://project.iiis.tsinghua.edu.cn/balance.
  • 16
    • 84961408374 scopus 로고    scopus 로고
    • Dag package
    • Dag package, http://www-sigproc.eng.cam.ac.uk/atc27/matlab/layout.html.
  • 17
    • 4644360171 scopus 로고    scopus 로고
    • Maximum lifetime routing in wireless sensor networks
    • Chang, J.-H., & Tassiulas, L. (2004). Maximum lifetime routing in wireless sensor networks. IEEE/ACM Transactions on Networking, 12(4), 609–619.
    • (2004) IEEE/ACM Transactions on Networking , vol.12 , Issue.4 , pp. 609-619
    • Chang, J.-H.1    Tassiulas, L.2
  • 19
    • 0842332478 scopus 로고    scopus 로고
    • A node-centric load balancing algorithm for wireless sensor networks
    • Dai, H., Han, R. (2003). A node-centric load balancing algorithm for wireless sensor networks. Globecom’03, pp. 548–552 4209.
    • (2003) Globecom’03 , vol.4209 , pp. 548-552
    • Dai, H.1    Han, R.2
  • 20
    • 33748633815 scopus 로고    scopus 로고
    • Distributed algorithms for maximum lifetime routing in wireless sensor networks
    • Madan, R., & Lall, S. (2006). Distributed algorithms for maximum lifetime routing in wireless sensor networks. IEEE Transactions on Wireless Communications, 5(8), 2185–2193.
    • (2006) IEEE Transactions on Wireless Communications , vol.5 , Issue.8 , pp. 2185-2193
    • Madan, R.1    Lall, S.2
  • 22
    • 77955360666 scopus 로고    scopus 로고
    • Optimal data gathering paths and energy balance mechanisms in wireless networks. DCOSS’2010 (Vol. 6131, pp. 288–305)
    • Berlin/Heidelberg: Springer
    • Jarry, A., Leone, P., & Nikoletseas, S. (2010). Optimal data gathering paths and energy balance mechanisms in wireless networks. DCOSS’2010 (Vol. 6131, pp. 288–305)., Lecture Notes in Computer Science. Berlin/Heidelberg: Springer.
    • (2010) Lecture Notes in Computer Science
    • Jarry, A.1    Leone, P.2    Nikoletseas, S.3
  • 23
    • 1542347200 scopus 로고    scopus 로고
    • Parametric probabilistic sensor network routing. WSNA ’03 (pp. 122–131)
    • USA: ACM
    • Barrett, C. L., Eidenbenz, S. J., Kroc, L., Marathe, M., & Smith, J. P. (2003). Parametric probabilistic sensor network routing. WSNA ’03 (pp. 122–131). New York: NY, USA, ACM.
    • (2003) New York: NY
    • Barrett, C.L.1    Eidenbenz, S.J.2    Kroc, L.3    Marathe, M.4    Smith, J.P.5
  • 24
    • 78650972584 scopus 로고    scopus 로고
    • Distributed lifetime optimized routing algorithm for wireless sensor networks
    • Chen, Y. R., Yu, L., Dong, Q. F., & Hong, Z. (2011). Distributed lifetime optimized routing algorithm for wireless sensor networks. Applied Mechanics and Materials, 40–41, 448–452.
    • (2011) Applied Mechanics and Materials , vol.40-41 , pp. 448-452
    • Chen, Y.R.1    Yu, L.2    Dong, Q.F.3    Hong, Z.4
  • 25
    • 44249085206 scopus 로고    scopus 로고
    • Load and energy balanced geographic routing for sensor networks. 10th International Conference on Advanced Communication Technology, Vol
    • Razzaque, M. A., Hong, C. S. (2008). Load and energy balanced geographic routing for sensor networks. 10th International Conference on Advanced Communication Technology, Vol. I-III, pp. 1419–1422.
    • (2008) I-III , pp. 1419-1422
    • Razzaque, M.A.1    Hong, C.S.2
  • 26
    • 80052729021 scopus 로고    scopus 로고
    • Design and analysis of a multi-candidate selection scheme for greedy routing in wireless sensor networks
    • Nguyen, D. T., Choi, W., Ha, M. T., & Choo, H. (2011). Design and analysis of a multi-candidate selection scheme for greedy routing in wireless sensor networks. Journal of Network and Computer Applications, 34(6), 1805–1817.
    • (2011) Journal of Network and Computer Applications , vol.34 , Issue.6 , pp. 1805-1817
    • Nguyen, D.T.1    Choi, W.2    Ha, M.T.3    Choo, H.4
  • 27
    • 46449105138 scopus 로고    scopus 로고
    • Multiconstrained qos multipath routing in wireless sensor networks
    • Huang, X. X., & Fang, Y. G. (2008). Multiconstrained qos multipath routing in wireless sensor networks. Wireless Networks, 14(4), 465–478.
    • (2008) Wireless Networks , vol.14 , Issue.4 , pp. 465-478
    • Huang, X.X.1    Fang, Y.G.2
  • 28
    • 74549168388 scopus 로고    scopus 로고
    • Energy aware multi-path and multi-speed routing protocol in wireless sensor networks. 2009 14th International Computer Conference, pp
    • Sanati, S., Yaghmaee, M. H., Beheshti, A. (2009). Energy aware multi-path and multi-speed routing protocol in wireless sensor networks. 2009 14th International Computer Conference, pp. 639–644,
    • (2009) 639–644
    • Sanati, S.1    Yaghmaee, M.H.2    Beheshti, A.3
  • 29
    • 67650330056 scopus 로고    scopus 로고
    • Localized probabilistic routing for data gathering in wireless ad hoc networks. 2009 7th Annual Communication Networks and Services Research Conference, pp
    • Sung, E. S., Potkonjak, M. (2009). Localized probabilistic routing for data gathering in wireless ad hoc networks. 2009 7th Annual Communication Networks and Services Research Conference, pp. 356–363.
    • (2009) 356–363
    • Sung, E.S.1    Potkonjak, M.2
  • 30
    • 34249332794 scopus 로고    scopus 로고
    • Power-aware single- and multipath geographic routing in sensor networks
    • Wu, S. B., & Candan, K. S. (2007). Power-aware single- and multipath geographic routing in sensor networks. Ad Hoc Networks, 5(7), 974–997.
    • (2007) Ad Hoc Networks , vol.5 , Issue.7 , pp. 974-997
    • Wu, S.B.1    Candan, K.S.2
  • 31
    • 33745171554 scopus 로고    scopus 로고
    • A distributed algorithm for congestion-minimized multi-path routing over ad hoc networks
    • Zhu, X. Q., Girod, B. (2005). A distributed algorithm for congestion-minimized multi-path routing over ad hoc networks. ICME’05, pp. 1485–1488.
    • (2005) ICME’05 , pp. 1485-1488
    • Zhu, X.Q.1    Girod, B.2
  • 33
    • 70449673153 scopus 로고    scopus 로고
    • Franceschelli, M., Giua, A., & Seatzu, C. (2009). Load balancing over heterogeneous networks with gossip-based algorithms. American Control Conference (ACC)’09, pp. 1987–1993
    • Franceschelli, M., Giua, A., & Seatzu, C. (2009). Load balancing over heterogeneous networks with gossip-based algorithms. American Control Conference (ACC)’09, pp. 1987–1993.
  • 34
    • 77954027144 scopus 로고    scopus 로고
    • Near-lifetime-optimal data collection in wireless sensor networks via spatio–temporal load balancing
    • Lee, H., Keshavarzian, A., & Aghajan, H. (2010). Near-lifetime-optimal data collection in wireless sensor networks via spatio–temporal load balancing. ACM Transactions on Sensor Networks, 6, 26:1–26:32.
    • (2010) ACM Transactions on Sensor Networks , vol.6 , pp. 261-2632
    • Lee, H.1    Keshavarzian, A.2    Aghajan, H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.