메뉴 건너뛰기




Volumn 185, Issue , 2012, Pages 117-126

Backbone formation in wireless sensor networks

Author keywords

CDS problem; Learning automata; Network virtual backbone; WSN

Indexed keywords

BACKBONE FORMATION; CDS; CONNECTED DOMINATING SETS; CONTROL MESSAGE OVERHEADS; ENERGY EFFICIENT; LEARNING AUTOMATA; MINIMUM WEIGHT; NETWORK BACKBONES; NUMERICAL RESULTS; PAPER MODELS; RESIDUAL ENERGY; SIMULATION EXPERIMENTS; TRANSMISSION DELAYS; VIRTUAL BACKBONE; WSN;

EID: 84865604812     PISSN: 09244247     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sna.2012.06.032     Document Type: Article
Times cited : (15)

References (59)
  • 2
    • 39249085158 scopus 로고    scopus 로고
    • Efficiently reconfigurable backbones for wireless sensor networks
    • S. Basagni, C. Petrioli, and R. Petroccia Efficiently reconfigurable backbones for wireless sensor networks Computer Communications 31 2008 668 698
    • (2008) Computer Communications , vol.31 , pp. 668-698
    • Basagni, S.1    Petrioli, C.2    Petroccia, R.3
  • 3
    • 33745686736 scopus 로고    scopus 로고
    • Efficient distributed low-cost backbone formation for wireless networks
    • DOI 10.1109/TPDS.2006.86
    • Y. Wang, Wang. Member W, and X.Y. Li Efficient distributed low-cost backbone formation for wireless networks IEEE Transactions on Parallel and Distributed Systems 17 7 2006 681 693 (Pubitemid 43997190)
    • (2006) IEEE Transactions on Parallel and Distributed Systems , vol.17 , Issue.7 , pp. 681-693
    • Wang, Y.1    Wang, W.2    Li, X.-Y.3
  • 4
    • 63049122402 scopus 로고    scopus 로고
    • Link estimation and routing in sensor network backbones: Beacon-based or data-driven
    • H. Zhang, A. Arora, and P. Sinha Link estimation and routing in sensor network backbones: beacon-based or data-driven IEEE Transactions on Mobile Computing 8 5 2009 653 667
    • (2009) IEEE Transactions on Mobile Computing , vol.8 , Issue.5 , pp. 653-667
    • Zhang, H.1    Arora, A.2    Sinha, P.3
  • 9
    • 79960877514 scopus 로고    scopus 로고
    • Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks
    • H. Du, Q. Ye, W. Wu, W. Lee, D. Li, D. Du, and S. Howard Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks Proceedings of INFOCOM 2011 2011 1737 1744
    • (2011) Proceedings of INFOCOM 2011 , pp. 1737-1744
    • Du, H.1    Ye, Q.2    Wu, W.3    Lee, W.4    Li, D.5    Du, D.6    Howard, S.7
  • 14
    • 20344365067 scopus 로고    scopus 로고
    • A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks
    • 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
    • S. Basagni, M. Mastrogiovanni, and C. Petrioli A performance comparison of protocols for clustering and backbone formation in large scale ad hoc network Proceedings of the First IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS'04) 2004 70 79 (Pubitemid 40789335)
    • (2004) 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems , pp. 70-79
    • Basagni, S.1    Mastrogiovanni, M.2    Petrioli, C.3
  • 16
    • 53549119437 scopus 로고    scopus 로고
    • Zone-based virtual backbone formation in wireless ad hoc networks
    • B. Han Zone-based virtual backbone formation in wireless ad hoc networks Computer Networks 7 2009 183 200
    • (2009) Computer Networks , vol.7 , pp. 183-200
    • Han, B.1
  • 19
    • 84871433582 scopus 로고    scopus 로고
    • Maximal independent set, weakly connected dominating set, and induced spanners for mobile ad hoc networks
    • K.M. Alzoubi, P.J. Wan, and O. Frieder Maximal independent set, weakly connected dominating set, and induced spanners for mobile ad hoc networks International Journal of Foundations of Computer Science 14 2 2003 287 303
    • (2003) International Journal of Foundations of Computer Science , vol.14 , Issue.2 , pp. 287-303
    • Alzoubi, K.M.1    Wan, P.J.2    Frieder, O.3
  • 20
    • 77249159292 scopus 로고    scopus 로고
    • An intelligent backbone formation algorithm in wireless ad hoc networks based on distributed learning automata
    • J. Akbari Torkestani, and M.R. Meybodi An intelligent backbone formation algorithm in wireless ad hoc networks based on distributed learning automata Computer Networks 54 2010 826 843
    • (2010) Computer Networks , vol.54 , pp. 826-843
    • Akbari Torkestani, J.1    Meybodi, M.R.2
  • 21
    • 78650618678 scopus 로고    scopus 로고
    • New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
    • F. Zou, Y. Wang, X.H. Xu, X. Li, H. Du, P. Wan, and W. Wu New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs Theoretical Computer Science 412 2011 198 208
    • (2011) Theoretical Computer Science , vol.412 , pp. 198-208
    • Zou, F.1    Wang, Y.2    Xu, X.H.3    Li, X.4    Du, H.5    Wan, P.6    Wu, W.7
  • 23
    • 17244373061 scopus 로고    scopus 로고
    • An extended localized algorithm for connected dominating set formation in ad hoc wireless networks
    • DOI 10.1109/TPDS.2004.48
    • F. Dai, and J. Wu An extended localized algorithm for connected dominating set formation in ad hoc wireless networks IEEE Transactions on Parallel and Distributed Systems 15 10 2004 908 920 (Pubitemid 40527339)
    • (2004) IEEE Transactions on Parallel and Distributed Systems , vol.15 , Issue.10 , pp. 908-920
    • Dai, F.1    Wu, J.2
  • 25
    • 33646743846 scopus 로고    scopus 로고
    • An efficient distributed algorithm for finding virtual backbones in wireless ad-hoc networks
    • B. Paul, S.V. Rao, and S. Nandi An efficient distributed algorithm for finding virtual backbones in wireless ad-hoc networks Lecture Notes in Computer Science 3769 2005 302 311
    • (2005) Lecture Notes in Computer Science , vol.3769 , pp. 302-311
    • Paul, B.1    Rao, S.V.2    Nandi, S.3
  • 27
    • 21844475905 scopus 로고    scopus 로고
    • Maintaining weakly-connected dominating sets for clustering ad hoc networks
    • DOI 10.1016/j.adhoc.2004.08.009, PII S1570870504000708, Data Communication and Topology Control in Ad Hoc Networks
    • Y.P. Chen, and A.L. Liestman Maintaining weakly connected dominating sets for clustering ad-hoc networks Ad-Hoc Networks 3 2005 629 642 (Pubitemid 40952627)
    • (2005) Ad Hoc Networks , vol.3 , Issue.5 , pp. 629-642
    • Chen, Y.P.1    Liestman, A.L.2
  • 28
    • 34247518694 scopus 로고    scopus 로고
    • Clustering wireless ad hoc networks with weakly connected dominating set
    • DOI 10.1016/j.jpdc.2007.03.001, PII S0743731507000391
    • B. Han, and W. Jia Clustering wireless ad-hoc networks with weakly connected dominating set Journal of Parallel and Distributed Computing 67 2007 727 737 (Pubitemid 46660428)
    • (2007) Journal of Parallel and Distributed Computing , vol.67 , Issue.6 , pp. 727-737
    • Han, B.1    Jia, W.2
  • 29
    • 80053566567 scopus 로고    scopus 로고
    • Weighted Steiner connected dominating set and its application to multicast routing in wireless MANETs
    • J. Akbari Torkestani, and M.R. Meybodi Weighted Steiner connected dominating set and its application to multicast routing in wireless MANETs Wireless Personal Communications 60 2 2011 145 169
    • (2011) Wireless Personal Communications , vol.60 , Issue.2 , pp. 145-169
    • Akbari Torkestani, J.1    Meybodi, M.R.2
  • 34
    • 70349555770 scopus 로고    scopus 로고
    • A hierarchical system of learning automata that can learn the globally optimal path
    • M.A.L. Thathachat, and P.S. Sastry A hierarchical system of learning automata that can learn the globally optimal path Information Science 42 1997 743 766
    • (1997) Information Science , vol.42 , pp. 743-766
    • Thathachat, M.A.L.1    Sastry, P.S.2
  • 36
    • 80052270291 scopus 로고    scopus 로고
    • Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem
    • O.C. Granmo, and B.J. Oommen Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem Engineering Applications of Artificial Intelligence 24 7 2011 1238 1251
    • (2011) Engineering Applications of Artificial Intelligence , vol.24 , Issue.7 , pp. 1238-1251
    • Granmo, O.C.1    Oommen, B.J.2
  • 38
    • 0018907738 scopus 로고
    • On the behavior of a learning automaton in a changing environment with application to telephone traffic routing
    • K.S. Narendra, and M.A.L. Thathachar On the behavior of a learning automaton in a changing environment with application to telephone traffic routing IEEE Transactions on Systems, Man, and Cybernetics l0 5 1980 262 269
    • (1980) IEEE Transactions on Systems, Man, and Cybernetics , vol.0 , Issue.5 , pp. 262-269
    • Narendra, K.S.1    Thathachar, M.A.L.2
  • 42
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • S. Guha, and S. Khuller Approximation algorithms for connected dominating sets Algorithmica 20 4 1998 374 387 (Pubitemid 128664048)
    • (1998) Algorithmica (New York) , vol.20 , Issue.4 , pp. 374-387
    • Guha, S.1    Khuller, S.2
  • 43
    • 77953075014 scopus 로고    scopus 로고
    • Approximation two independent sets based connected dominating set construction algorithm for wireless sensor networks
    • Z. Liu, B. Wang, and Q. Tang Approximation two independent sets based connected dominating set construction algorithm for wireless sensor networks Information Technology Journal 9 5 2010 864 876
    • (2010) Information Technology Journal , vol.9 , Issue.5 , pp. 864-876
    • Liu, Z.1    Wang, B.2    Tang, Q.3
  • 44
    • 78149353689 scopus 로고    scopus 로고
    • A power aware minimum connected dominating set for wireless sensor networks
    • M. Rai, S. Verma, and S. Tapaswi A power aware minimum connected dominating set for wireless sensor networks Journal of Networks 4 6 2009
    • (2009) Journal of Networks , vol.4 , Issue.6
    • Rai, M.1    Verma, S.2    Tapaswi, S.3
  • 47
    • 70350545714 scopus 로고    scopus 로고
    • Optimal stochastic policies for distributed data aggregation in wireless sensor networks
    • Z. Ye, A.A. Abouzeid, and J. Ai Optimal stochastic policies for distributed data aggregation in wireless sensor networks IEEE/ACM Transactions on Networking 17 5 2009 1494 1507
    • (2009) IEEE/ACM Transactions on Networking , vol.17 , Issue.5 , pp. 1494-1507
    • Ye, Z.1    Abouzeid, A.A.2    Ai, J.3
  • 48
    • 84862010562 scopus 로고    scopus 로고
    • Degree constrained minimum spanning tree problem in stochastic graph
    • J. Akbari Torkestani Degree constrained minimum spanning tree problem in stochastic graph Journal of Cybernetics and Systems 43 1 2012 1 21
    • (2012) Journal of Cybernetics and Systems , vol.43 , Issue.1 , pp. 1-21
    • Akbari Torkestani, J.1
  • 49
    • 79959941612 scopus 로고    scopus 로고
    • LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks based on learning automata
    • J. Akbari Torkestani, and M.R. Meybodi LLACA: an adaptive localized clustering algorithm for wireless ad hoc networks based on learning automata Journal of Computers & Electrical Engineering 37 2011 461 474
    • (2011) Journal of Computers & Electrical Engineering , vol.37 , pp. 461-474
    • Akbari Torkestani, J.1    Meybodi, M.R.2
  • 50
    • 79956123278 scopus 로고    scopus 로고
    • A link stability-based multicast routing protocol for wireless mobile ad hoc networks
    • J. Akbari Torkestani, and M.R. Meybodi A link stability-based multicast routing protocol for wireless mobile ad hoc networks Journal of Network and Computer Applications 34 4 2011 1429 1440
    • (2011) Journal of Network and Computer Applications , vol.34 , Issue.4 , pp. 1429-1440
    • Akbari Torkestani, J.1    Meybodi, M.R.2
  • 51
    • 84862014790 scopus 로고    scopus 로고
    • An adaptive backbone formation algorithm for wireless sensor networks
    • J. Akbari Torkestani An adaptive backbone formation algorithm for wireless sensor networks Computer Communications 35 11 2012 1333 1344
    • (2012) Computer Communications , vol.35 , Issue.11 , pp. 1333-1344
    • Akbari Torkestani, J.1
  • 52
    • 84860274599 scopus 로고    scopus 로고
    • A new approach to the job scheduling problem in computational grids
    • in press
    • J. Akbari Torkestani, A new approach to the job scheduling problem in computational grids, Cluster Computing, in press.
    • Cluster Computing
    • Akbari Torkestani, J.1
  • 53
    • 84862014127 scopus 로고    scopus 로고
    • LAAP: A learning automata-based adaptive polling scheme for clustered wireless ad-hoc networks
    • in press
    • J. Akbari Torkestani, LAAP: a learning automata-based adaptive polling scheme for clustered wireless ad-hoc networks, Wireless Personal Communication, in press.
    • Wireless Personal Communication
    • Akbari Torkestani, J.1
  • 55
    • 84860290983 scopus 로고    scopus 로고
    • Finding minimum weight connected dominating set in stochastic graph based on learning automata
    • J. Akbari Torkestani, and M.R. Meybodi Finding minimum weight connected dominating set in stochastic graph based on learning automata Information Sciences 200 2012 57 77
    • (2012) Information Sciences , vol.200 , pp. 57-77
    • Akbari Torkestani, J.1    Meybodi, M.R.2
  • 58
    • 84860168752 scopus 로고    scopus 로고
    • An adaptive focused Web crawling algorithm based on learning automata
    • in press
    • J. Akbari Torkestani, An adaptive focused Web crawling algorithm based on learning automata, Applied Intelligence, in press.
    • Applied Intelligence
    • Akbari Torkestani, J.1
  • 59
    • 84867698029 scopus 로고    scopus 로고
    • An adaptive heuristic to the bounded-diameter minimum spanning tree problem
    • in press
    • J. Akbari Torkestani, An adaptive heuristic to the bounded-diameter minimum spanning tree problem, Soft Computing, in press.
    • Soft Computing
    • Akbari Torkestani, J.1


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