메뉴 건너뛰기




Volumn 54, Issue 5, 2010, Pages 826-843

An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata

Author keywords

Backbone formation; Broadcast storm problem; Connected dominating set; Distributed learning automata; Wireless ad hoc networks

Indexed keywords

BACKBONE FORMATION; BROADCAST STORM PROBLEM; CONNECTED DOMINATING SET; DISTRIBUTED LEARNING; DISTRIBUTED LEARNING AUTOMATA;

EID: 77249159292     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2009.10.007     Document Type: Article
Times cited : (77)

References (49)
  • 1
    • 21844475905 scopus 로고    scopus 로고
    • Maintaining weakly-connected dominating sets for clustering ad hoc networks
    • Chen Y.P., and Liestman A.L. Maintaining weakly-connected dominating sets for clustering ad hoc networks. Ad Hoc Networks 3 (2005) 629-642
    • (2005) Ad Hoc Networks , vol.3 , pp. 629-642
    • Chen, Y.P.1    Liestman, A.L.2
  • 3
    • 34247518694 scopus 로고    scopus 로고
    • Clustering wireless ad hoc networks with weakly connected dominating set
    • Han B., and Jia W. Clustering wireless ad hoc networks with weakly connected dominating set. Journal of Parallel and Distributed Computing 67 (2007) 727-737
    • (2007) Journal of Parallel and Distributed Computing , vol.67 , pp. 727-737
    • Han, B.1    Jia, W.2
  • 4
    • 0038099200 scopus 로고    scopus 로고
    • Topology control and routing in ad hoc networks: a survey
    • Rajaraman R. Topology control and routing in ad hoc networks: a survey. SIGACT News 33 2 (2002) 60-73
    • (2002) SIGACT News , vol.33 , Issue.2 , pp. 60-73
    • Rajaraman, R.1
  • 9
    • 84871433582 scopus 로고    scopus 로고
    • Maximal independent set, weakly connected dominating set, and induced spanners for mobile ad hoc networks
    • Alzoubi K.M., Wan P.-J., and Frieder O. 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
  • 11
    • 13244278088 scopus 로고    scopus 로고
    • Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets
    • Wu J., Wu B., and Stojmenovic I. Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets. Journal of Wireless Communications and Mobile Computing 3 (2003) 425-438
    • (2003) Journal of Wireless Communications and Mobile Computing , vol.3 , pp. 425-438
    • Wu, J.1    Wu, B.2    Stojmenovic, I.3
  • 17
    • 70349555770 scopus 로고    scopus 로고
    • A hierarchical system of learning automata that can learn the globally optimal path
    • Thathachar M.A.L., and Sastry P.S. 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
    • Thathachar, M.A.L.1    Sastry, P.S.2
  • 21
    • 0018907738 scopus 로고
    • On the behavior of a learning automaton in a changing environment with application to telephone traffic routing
    • Narendra K.S., and Thathachar M.A.L. On the behavior of a learning automaton in a changing environment with application to telephone traffic routing. IEEE Transactions on Systems, Man, and Cybernetics SMC-l0 5 (1980) 262-269
    • (1980) IEEE Transactions on Systems, Man, and Cybernetics , vol.SMC-l0 , Issue.5 , pp. 262-269
    • Narendra, K.S.1    Thathachar, M.A.L.2
  • 23
    • 0033338095 scopus 로고    scopus 로고
    • A mobility-transparent deterministic broadcast mechanism for ad hoc network
    • Basagni S., Bruschi D., and Chlamtac I. A mobility-transparent deterministic broadcast mechanism for ad hoc network. IEEE/ACM Transactions on Networking 7 6 (1999) 799-807
    • (1999) IEEE/ACM Transactions on Networking , vol.7 , Issue.6 , pp. 799-807
    • Basagni, S.1    Bruschi, D.2    Chlamtac, I.3
  • 24
    • 0001002898 scopus 로고
    • Tree-based broadcasting in multihop radio networks
    • Chlamtac I., and Kutten S. Tree-based broadcasting in multihop radio networks. IEEE Transactions on Computing 36 10 (1987) 1209-1223
    • (1987) IEEE Transactions on Computing , vol.36 , Issue.10 , pp. 1209-1223
    • Chlamtac, I.1    Kutten, S.2
  • 27
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • Guha S., and Khuller S. Approximation algorithms for connected dominating sets. Algorithmica 20 4 (1998) 374-387
    • (1998) Algorithmica , vol.20 , Issue.4 , pp. 374-387
    • Guha, S.1    Khuller, S.2
  • 28
    • 0038562914 scopus 로고    scopus 로고
    • Distributed heuristics for connected dominating sets in wireless ad hoc networks
    • Alzoubi K.M., Wan P.J., and Frieder O. Distributed heuristics for connected dominating sets in wireless ad hoc networks. Journal of Communications and Networks 4 1 (2002) 22-29
    • (2002) Journal of Communications and Networks , vol.4 , Issue.1 , pp. 22-29
    • Alzoubi, K.M.1    Wan, P.J.2    Frieder, O.3
  • 29
    • 17244373061 scopus 로고    scopus 로고
    • An extended localized algorithm for connected dominating set formation in ad hoc wireless networks
    • Dai, 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.
    • (2004) IEEE Transactions on Parallel and Distributed Systems , vol.15 , Issue.10 , pp. 908-920
    • Dai, J.W.1
  • 33
    • 0038735958 scopus 로고    scopus 로고
    • On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks
    • Wu J., Dai F., Gao M., and Stojmenovic I. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. Journal of Communications and Networks 4 1 (2002)
    • (2002) Journal of Communications and Networks , vol.4 , Issue.1
    • Wu, J.1    Dai, F.2    Gao, M.3    Stojmenovic, I.4
  • 34
    • 20844446188 scopus 로고    scopus 로고
    • Adaptive downlink scheduling and rate selection: a cross layer design, special issue on mobile computing and networking
    • Haleem M., and Chandramouli R. Adaptive downlink scheduling and rate selection: a cross layer design, special issue on mobile computing and networking. IEEE Journal on Selected Areas in Communications 23 6 (2005)
    • (2005) IEEE Journal on Selected Areas in Communications , vol.23 , Issue.6
    • Haleem, M.1    Chandramouli, R.2
  • 37
    • 5444228997 scopus 로고    scopus 로고
    • Distributed protocols for ad-hoc wireless LANs: a learning-automata-based approach
    • Nicopolitidis P., Papadimitriou G.I., and Pomportsis A.S. Distributed protocols for ad-hoc wireless LANs: a learning-automata-based approach. Ad Hoc Networks 2 4 (2004) 419-431
    • (2004) Ad Hoc Networks , vol.2 , Issue.4 , pp. 419-431
    • Nicopolitidis, P.1    Papadimitriou, G.I.2    Pomportsis, A.S.3
  • 39
    • 33646751978 scopus 로고    scopus 로고
    • Learning-TCP: A novel learning automata based congestion window updating mechanism for ad hoc wireless networks
    • B.V. Ramana, C.S.R. Murthy, Learning-TCP: a novel learning automata based congestion window updating mechanism for ad hoc wireless networks, in: 12th IEEE International Conference on High 13 Performance Computing, 2005, pp. 454-464.
    • (2005) 12th IEEE International Conference on High 13 Performance Computing , pp. 454-464
    • Ramana, B.V.1    Murthy, C.S.R.2
  • 41
    • 24144474318 scopus 로고    scopus 로고
    • A general call admission policy for next generation wireless networks
    • Beigy H., and Meybodi M.R. A general call admission policy for next generation wireless networks. Computer Communications 28 (2005) 1798-1813
    • (2005) Computer Communications , vol.28 , pp. 1798-1813
    • Beigy, H.1    Meybodi, M.R.2
  • 42
    • 18544368209 scopus 로고    scopus 로고
    • An adaptive call admission algorithm for cellular networks
    • Beigy H., and Meybodi M.R. An adaptive call admission algorithm for cellular networks. Computers and Electrical Engineering 31 (2005) 132-151
    • (2005) Computers and Electrical Engineering , vol.31 , pp. 132-151
    • Beigy, H.1    Meybodi, M.R.2
  • 45
    • 58149192824 scopus 로고    scopus 로고
    • A cellular learning automata based clustering algorithm for wireless sensor networks
    • Esnaashari M., and Meybodi M.R. A cellular learning automata based clustering algorithm for wireless sensor networks. Sensor Letters 6 (2008) 1-13
    • (2008) Sensor Letters , vol.6 , pp. 1-13
    • Esnaashari, M.1    Meybodi, M.R.2
  • 46
    • 77249093234 scopus 로고    scopus 로고
    • J. Akbari Torkestani, M.R. Meybodi, A new vertex coloring algorithm based on variable action-set learning automata, Journal of Computing and Informatics (2009), in press.
    • J. Akbari Torkestani, M.R. Meybodi, A new vertex coloring algorithm based on variable action-set learning automata, Journal of Computing and Informatics (2009), in press.


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