A binary artificial bee colony algorithm for constructing spanning trees in vehicular ad hoc networks
To accomplish reliable and efficient information routing, strong paths connecting all nodes are required in vehicular ad hoc networks (VANETs). Classical algorithms in graphic theory could find only one minimum spanning tree (MST) in VANETs. Swarm intelligence paradigms are able to obtain several al...
Uloženo v:
| Vydáno v: | Ad hoc networks Ročník 58; s. 198 - 204 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.04.2017
|
| Témata: | |
| ISSN: | 1570-8705, 1570-8713 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | To accomplish reliable and efficient information routing, strong paths connecting all nodes are required in vehicular ad hoc networks (VANETs). Classical algorithms in graphic theory could find only one minimum spanning tree (MST) in VANETs. Swarm intelligence paradigms are able to obtain several alternatives to MST, which is useful for improving reliability of VANETs. This paper proposes a binary coded artificial bee colony (BABC) algorithm for tackling the spanning tree construction problem. A two-element variation technique is designed to keep the consistence of binary coded solutions. The proposed algorithm is applied to tackle a roadside-to-vehicle communication example. The success rate and average hitting time of the algorithm to find MST are also analyzed. It is found that the BABC algorithm could find MST with 92% probability. Though it is slower than Kruskal algorithm in terms of computational time, the BABC algorithm can attain several suboptimal spanning trees in one run. This suggests that the algorithm would be useful under the condition that tree paths are required to be rebuilt frequently while the network topology is unchanged in a short period. |
|---|---|
| AbstractList | To accomplish reliable and efficient information routing, strong paths connecting all nodes are required in vehicular ad hoc networks (VANETs). Classical algorithms in graphic theory could find only one minimum spanning tree (MST) in VANETs. Swarm intelligence paradigms are able to obtain several alternatives to MST, which is useful for improving reliability of VANETs. This paper proposes a binary coded artificial bee colony (BABC) algorithm for tackling the spanning tree construction problem. A two-element variation technique is designed to keep the consistence of binary coded solutions. The proposed algorithm is applied to tackle a roadside-to-vehicle communication example. The success rate and average hitting time of the algorithm to find MST are also analyzed. It is found that the BABC algorithm could find MST with 92% probability. Though it is slower than Kruskal algorithm in terms of computational time, the BABC algorithm can attain several suboptimal spanning trees in one run. This suggests that the algorithm would be useful under the condition that tree paths are required to be rebuilt frequently while the network topology is unchanged in a short period. |
| Author | Zhang, Xin Zhang, Xiu |
| Author_xml | – sequence: 1 givenname: Xin orcidid: 0000-0003-3088-4399 surname: Zhang fullname: Zhang, Xin email: tjnumark@126.com organization: College of Electronic and Communication Engineering, Tianjin Normal University, Tianjin, China – sequence: 2 givenname: Xiu surname: Zhang fullname: Zhang, Xiu email: zhang210@126.com organization: College of Electronic and Communication Engineering, Tianjin Normal University, Tianjin, China |
| BookMark | eNqFkM1OAyEURompiW31CdzwAh2hOGVm4aJp_EuauNE1YeDS3jqFBmiNby9V48KFrvj4cs8NnBEZ-OCBkEvOKs747GpTabsOppqWS8VkxRg_IUNeSzZpJBeDn8zqMzJKacPYtC3DQwJz2qHX8Z3qmNGhQd3TDoCa0Adf2n4VIub1lroQS-lTjnuT0a9o2mnvjyFHgETR0wOs0ex7Ham2tLyHeshvIb6mc3LqdJ_g4vsck5e72-fFw2T5dP-4mC8nRjCRJ6ZuzaxtrLQS2plo3ExPRddcO6mbmjtpS9u2TQmSCSubrmbCMW3ttXG6450Yk_Zrr4khpQhOGcw6Y_A5auwVZ-roS23Upy919KWYVMVXYcUvdhdxW8z8Q918UVC-dUCIKhkEb8BiBJOVDfgn_wHDsook |
| CitedBy_id | crossref_primary_10_1007_s11277_021_08220_w crossref_primary_10_1109_ACCESS_2019_2892798 crossref_primary_10_3390_math11030514 crossref_primary_10_1109_ACCESS_2021_3124710 crossref_primary_10_1016_j_epsr_2022_109094 crossref_primary_10_1109_TITS_2020_3041746 crossref_primary_10_1007_s11276_024_03795_1 crossref_primary_10_56977_jicce_2025_23_2_88 crossref_primary_10_1007_s13198_021_01530_z crossref_primary_10_1109_ACCESS_2018_2808473 crossref_primary_10_1016_j_asoc_2021_107351 crossref_primary_10_1016_j_asoc_2017_10_022 crossref_primary_10_3233_ICA_200618 crossref_primary_10_3390_biomimetics9050283 crossref_primary_10_1007_s11227_018_2305_x crossref_primary_10_1109_ACCESS_2020_2984495 crossref_primary_10_1007_s11277_018_5976_y crossref_primary_10_1016_j_phycom_2017_06_003 crossref_primary_10_1002_cpe_5994 crossref_primary_10_3390_math7030289 crossref_primary_10_1007_s00500_018_3284_9 crossref_primary_10_1016_j_phycom_2023_102034 crossref_primary_10_1186_s13638_019_1496_z crossref_primary_10_1002_dac_70016 crossref_primary_10_1016_j_vehcom_2021_100332 crossref_primary_10_1109_JIOT_2024_3412692 crossref_primary_10_1007_s11277_021_08118_7 crossref_primary_10_1007_s10462_022_10328_9 crossref_primary_10_1016_j_neucom_2021_09_040 crossref_primary_10_3390_electronics9030394 |
| Cites_doi | 10.1109/TPDS.2008.57 10.1145/505241.505243 10.1016/j.asoc.2014.11.040 10.3390/s150101518 10.1007/s10898-007-9149-x 10.1016/j.omega.2013.12.004 10.1016/j.adhoc.2012.08.009 10.1007/s11760-012-0388-z 10.1016/j.sysarc.2013.04.004 10.1109/JSEN.2010.2097586 10.1186/1687-1499-2014-41 10.1109/TC.2013.85 10.1109/JSYST.2010.2090404 10.1016/j.asoc.2015.04.007 10.1109/TWC.2013.041913.121236 10.1109/TAES.2008.4655363 10.1186/s13638-015-0267-8 10.1016/j.asoc.2015.01.067 10.1016/j.neucom.2013.07.056 10.1109/TAES.2010.5461641 10.1109/TMAG.2013.2281818 10.1016/j.cie.2014.08.016 10.1016/j.adhoc.2015.05.019 |
| ContentType | Journal Article |
| Copyright | 2016 |
| Copyright_xml | – notice: 2016 |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.adhoc.2016.07.001 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1570-8713 |
| EndPage | 204 |
| ExternalDocumentID | 10_1016_j_adhoc_2016_07_001 S1570870516301718 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABFNM ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SST SSV SSZ T5K UHS ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c303t-c59c698d7d7e9638f6a23b84f7a851f7de96998f7d703d78b503f0add4cfab1b3 |
| ISICitedReferencesCount | 37 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000397371300021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1570-8705 |
| IngestDate | Sat Nov 29 02:26:09 EST 2025 Tue Nov 18 22:42:26 EST 2025 Fri Feb 23 02:27:35 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Vehicular ad hoc network Artificial bee colony Binary representation Minimum spanning tree |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c303t-c59c698d7d7e9638f6a23b84f7a851f7de96998f7d703d78b503f0add4cfab1b3 |
| ORCID | 0000-0003-3088-4399 |
| PageCount | 7 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_adhoc_2016_07_001 crossref_primary_10_1016_j_adhoc_2016_07_001 elsevier_sciencedirect_doi_10_1016_j_adhoc_2016_07_001 |
| PublicationCentury | 2000 |
| PublicationDate | April 2017 2017-04-00 |
| PublicationDateYYYYMMDD | 2017-04-01 |
| PublicationDate_xml | – month: 04 year: 2017 text: April 2017 |
| PublicationDecade | 2010 |
| PublicationTitle | Ad hoc networks |
| PublicationYear | 2017 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Wang, Liang (bib0017) 2013; 12 Cui, Gu (bib0019) 2015; 148 Han, Mu, Wang, Zhang (bib0014) 2014; 2014 Lachowski, Pellenz, Penna, Jamhour, Souza (bib0015) 2015; 15 Liang, Cheng, Huang, Chen (bib0002) 2014; 63 Ozturk, Hancer, Karaboga (bib0023) 2015; 28 Kponyo, Kuang, Zhang, Domenic (bib0016) 2013 Gorrieri, Martalo, Busanelli, Ferrari (bib0012) 2016; 36, Part 2 Khan, Pandurangan, Kumar (bib0009) 2009; 20 Gao, Yin (bib0011) 2015; 2015 Jia, Duan, Khan (bib0021) 2014; 76 Kiran (bib0024) 2015; 33 Zhang, Zhang, Ho, Fu (bib0026) 2014; 50 Wang, Liang (bib0001) 2013; 12 Cornejo, Viqar, Welch (bib0013) 2014; 12 Pan, Wang, Li, Duan (bib0020) 2014; 45 Liang, Cheng (bib0006) 2008; 44 Liang, Cheng, Samn (bib0004) 2010; 46 Contreras-Cruz, Ayala-Ramirez, Hernandez-Belmonte (bib0025) 2015; 30 Lachowski, Pellenz, Penna, Jamhour, Souza (bib0008) 2015; 15 Bitam, Mellouk, Zeadally (bib0007) 2013; 59 Hansen, Auger, Ros, Finck, Pošík (bib0027) 2010 Karaboga, Basturk (bib0010) 2007; 39 Liang (bib0003) 2011; 11 Pettie, Ramachandran (bib0018) 2002; 49 Chatterjee, Tudu, Paul (bib0022) 2013; 7 Liang (bib0005) 2011; 5 Wang (10.1016/j.adhoc.2016.07.001_bib0001) 2013; 12 Liang (10.1016/j.adhoc.2016.07.001_bib0005) 2011; 5 Contreras-Cruz (10.1016/j.adhoc.2016.07.001_bib0025) 2015; 30 Liang (10.1016/j.adhoc.2016.07.001_bib0003) 2011; 11 Gorrieri (10.1016/j.adhoc.2016.07.001_bib0012) 2016; 36, Part 2 Bitam (10.1016/j.adhoc.2016.07.001_bib0007) 2013; 59 Khan (10.1016/j.adhoc.2016.07.001_bib0009) 2009; 20 Pan (10.1016/j.adhoc.2016.07.001_bib0020) 2014; 45 Cornejo (10.1016/j.adhoc.2016.07.001_bib0013) 2014; 12 Hansen (10.1016/j.adhoc.2016.07.001_bib0027) 2010 Ozturk (10.1016/j.adhoc.2016.07.001_bib0023) 2015; 28 Chatterjee (10.1016/j.adhoc.2016.07.001_bib0022) 2013; 7 Lachowski (10.1016/j.adhoc.2016.07.001_bib0015) 2015; 15 Kiran (10.1016/j.adhoc.2016.07.001_bib0024) 2015; 33 Han (10.1016/j.adhoc.2016.07.001_bib0014) 2014; 2014 Liang (10.1016/j.adhoc.2016.07.001_bib0004) 2010; 46 Zhang (10.1016/j.adhoc.2016.07.001_bib0026) 2014; 50 Lachowski (10.1016/j.adhoc.2016.07.001_bib0008) 2015; 15 Liang (10.1016/j.adhoc.2016.07.001_bib0002) 2014; 63 Jia (10.1016/j.adhoc.2016.07.001_bib0021) 2014; 76 Wang (10.1016/j.adhoc.2016.07.001_bib0017) 2013; 12 Liang (10.1016/j.adhoc.2016.07.001_bib0006) 2008; 44 Pettie (10.1016/j.adhoc.2016.07.001_bib0018) 2002; 49 Gao (10.1016/j.adhoc.2016.07.001_bib0011) 2015; 2015 Kponyo (10.1016/j.adhoc.2016.07.001_sbref0016) 2013 Karaboga (10.1016/j.adhoc.2016.07.001_bib0010) 2007; 39 Cui (10.1016/j.adhoc.2016.07.001_bib0019) 2015; 148 |
| References_xml | – volume: 49 start-page: 16 year: 2002 end-page: 34 ident: bib0018 article-title: An optimal minimum spanning tree algorithm publication-title: J. ACM – volume: 28 start-page: 69 year: 2015 end-page: 80 ident: bib0023 article-title: Dynamic clustering with improved binary artificial bee colony algorithm publication-title: Appl. Soft Comput. – volume: 30 start-page: 319 year: 2015 end-page: 328 ident: bib0025 article-title: Mobile robot path planning using artificial bee colony and evolutionary programming publication-title: Appl. Soft Comput. – volume: 59 start-page: 953 year: 2013 end-page: 967 ident: bib0007 article-title: HyBR: A hybrid bio-inspired bee swarm routing protocol for safety applications in vehicular ad hoc networks (VANETs) publication-title: J. Syst. Arch. – volume: 7 start-page: 1195 year: 2013 end-page: 1209 ident: bib0022 article-title: Binary grayscale halftone pattern generation using binary artificial bee colony (bABC) publication-title: Sig. Image Video Process. – volume: 39 start-page: 459 year: 2007 end-page: 471 ident: bib0010 article-title: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithms publication-title: J. Global Optim. – volume: 2014 start-page: 1 year: 2014 end-page: 7 ident: bib0014 article-title: Optimization of relay placement and power allocation for decode-and-forward cooperative relaying over correlated shadowed fading channels publication-title: EURASIP J. Wireless Commun. Netw. – volume: 148 start-page: 248 year: 2015 end-page: 259 ident: bib0019 article-title: An improved discrete artificial bee colony algorithm to minimize the make span on hybrid flow shop problems publication-title: Neurocomputing – volume: 12 start-page: 259 year: 2014 end-page: 277 ident: bib0013 article-title: Reliable neighbor discovery for mobile ad hoc networks publication-title: Ad Hoc Netw. – start-page: 1689 year: 2010 end-page: 1696 ident: bib0027 article-title: Comparing results of 31 algorithms from the black-box optimization benchmarking bbob-2009 publication-title: Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation – volume: 15 start-page: 1518 year: 2015 end-page: 1536 ident: bib0015 article-title: An efficient distributed algorithm for constructing spanning trees in wireless sensor networks. publication-title: Sensors – volume: 12 start-page: 2930 year: 2013 end-page: 2940 ident: bib0017 article-title: On the throughput capacity and performance analysis of hybrid wireless networks over fading channels publication-title: IEEE Trans. Wireless Commun. – volume: 46 start-page: 558 year: 2010 end-page: 568 ident: bib0004 article-title: NEW: Network-enabled electronic warfare for target recognition publication-title: IEEE Trans. Aerosp. Electron. Syst. – volume: 11 start-page: 1448 year: 2011 end-page: 1457 ident: bib0003 article-title: Radar sensor wireless channel modeling in foliage environment: UWB versus narrowband publication-title: IEEE Sensors J. – volume: 15 start-page: 1518 year: 2015 end-page: 1536 ident: bib0008 article-title: An efficient distributed algorithm for constructing spanning trees in wireless sensor networks publication-title: Sensors – volume: 44 start-page: 1060 year: 2008 end-page: 1069 ident: bib0006 article-title: KUPS: Knowledge-based ubiquitous and persistent sensor networks for threat assessment publication-title: IEEE Trans. Aerosp. Electron. Syst. – volume: 45 start-page: 42 year: 2014 end-page: 56 ident: bib0020 article-title: A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation publication-title: Omega – volume: 5 start-page: 156 year: 2011 end-page: 163 ident: bib0005 article-title: Situation understanding based on heterogeneous sensor networks and human-inspired favor weak fuzzy logic system publication-title: IEEE Syst. J. – volume: 20 start-page: 124 year: 2009 end-page: 139 ident: bib0009 article-title: Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks publication-title: IEEE Trans. Parallel Distrib. Syst. – start-page: 101 year: 2013 end-page: 104 ident: bib0016 article-title: VANET cluster-on-demand minimum spanning tree (MST) prim clustering algorithm publication-title: International Conference on Computational Problem-solving (ICCP), 2013 – volume: 33 start-page: 15 year: 2015 end-page: 23 ident: bib0024 article-title: The continuous artificial bee colony algorithm for binary optimization publication-title: Appl. Soft Comput. – volume: 76 start-page: 360 year: 2014 end-page: 365 ident: bib0021 article-title: Binary artificial bee colony optimization using bitwise operation publication-title: Comput. Ind. Eng. – volume: 2015 start-page: 1 year: 2015 end-page: 6 ident: bib0011 article-title: Analysis of the local delay with slotted-aloha based cognitive radio ad hoc networks publication-title: EURASIP J. Wireless Commun. Netw. – volume: 63 start-page: 2002 year: 2014 end-page: 2010 ident: bib0002 article-title: Opportunistic sensing in wireless sensor networks: theory and applications publication-title: IEEE Trans. Comput. – volume: 50 start-page: 737 year: 2014 end-page: 740 ident: bib0026 article-title: A modification of artificial bee colony algorithm applied to loudspeaker design problem publication-title: IEEE Trans. Magnetics – volume: 12 start-page: 2930 year: 2013 end-page: 2940 ident: bib0001 article-title: On the throughput capacity and performance analysis of hybrid wireless networks over fading channels publication-title: IEEE Trans. Wireless Commun. – volume: 36, Part 2 start-page: 450 year: 2016 end-page: 464 ident: bib0012 article-title: Clustering and sensing with decentralized detection in vehicular ad hoc networks publication-title: Ad Hoc Netw. – volume: 20 start-page: 124 year: 2009 ident: 10.1016/j.adhoc.2016.07.001_bib0009 article-title: Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2008.57 – volume: 49 start-page: 16 issue: 1 year: 2002 ident: 10.1016/j.adhoc.2016.07.001_bib0018 article-title: An optimal minimum spanning tree algorithm publication-title: J. ACM doi: 10.1145/505241.505243 – volume: 28 start-page: 69 year: 2015 ident: 10.1016/j.adhoc.2016.07.001_bib0023 article-title: Dynamic clustering with improved binary artificial bee colony algorithm publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2014.11.040 – volume: 15 start-page: 1518 issue: 1 year: 2015 ident: 10.1016/j.adhoc.2016.07.001_bib0008 article-title: An efficient distributed algorithm for constructing spanning trees in wireless sensor networks publication-title: Sensors doi: 10.3390/s150101518 – volume: 39 start-page: 459 issue: 3 year: 2007 ident: 10.1016/j.adhoc.2016.07.001_bib0010 article-title: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithms publication-title: J. Global Optim. doi: 10.1007/s10898-007-9149-x – start-page: 101 year: 2013 ident: 10.1016/j.adhoc.2016.07.001_sbref0016 article-title: VANET cluster-on-demand minimum spanning tree (MST) prim clustering algorithm – start-page: 1689 year: 2010 ident: 10.1016/j.adhoc.2016.07.001_bib0027 article-title: Comparing results of 31 algorithms from the black-box optimization benchmarking bbob-2009 – volume: 45 start-page: 42 year: 2014 ident: 10.1016/j.adhoc.2016.07.001_bib0020 article-title: A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation publication-title: Omega doi: 10.1016/j.omega.2013.12.004 – volume: 12 start-page: 259 year: 2014 ident: 10.1016/j.adhoc.2016.07.001_bib0013 article-title: Reliable neighbor discovery for mobile ad hoc networks publication-title: Ad Hoc Netw. doi: 10.1016/j.adhoc.2012.08.009 – volume: 7 start-page: 1195 issue: 6 year: 2013 ident: 10.1016/j.adhoc.2016.07.001_bib0022 article-title: Binary grayscale halftone pattern generation using binary artificial bee colony (bABC) publication-title: Sig. Image Video Process. doi: 10.1007/s11760-012-0388-z – volume: 59 start-page: 953 issue: 10 year: 2013 ident: 10.1016/j.adhoc.2016.07.001_bib0007 article-title: HyBR: A hybrid bio-inspired bee swarm routing protocol for safety applications in vehicular ad hoc networks (VANETs) publication-title: J. Syst. Arch. doi: 10.1016/j.sysarc.2013.04.004 – volume: 11 start-page: 1448 issue: 6 year: 2011 ident: 10.1016/j.adhoc.2016.07.001_bib0003 article-title: Radar sensor wireless channel modeling in foliage environment: UWB versus narrowband publication-title: IEEE Sensors J. doi: 10.1109/JSEN.2010.2097586 – volume: 2014 start-page: 1 issue: 1 year: 2014 ident: 10.1016/j.adhoc.2016.07.001_bib0014 article-title: Optimization of relay placement and power allocation for decode-and-forward cooperative relaying over correlated shadowed fading channels publication-title: EURASIP J. Wireless Commun. Netw. doi: 10.1186/1687-1499-2014-41 – volume: 63 start-page: 2002 issue: 8 year: 2014 ident: 10.1016/j.adhoc.2016.07.001_bib0002 article-title: Opportunistic sensing in wireless sensor networks: theory and applications publication-title: IEEE Trans. Comput. doi: 10.1109/TC.2013.85 – volume: 5 start-page: 156 issue: 2 year: 2011 ident: 10.1016/j.adhoc.2016.07.001_bib0005 article-title: Situation understanding based on heterogeneous sensor networks and human-inspired favor weak fuzzy logic system publication-title: IEEE Syst. J. doi: 10.1109/JSYST.2010.2090404 – volume: 33 start-page: 15 year: 2015 ident: 10.1016/j.adhoc.2016.07.001_bib0024 article-title: The continuous artificial bee colony algorithm for binary optimization publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.04.007 – volume: 12 start-page: 2930 issue: 6 year: 2013 ident: 10.1016/j.adhoc.2016.07.001_bib0001 article-title: On the throughput capacity and performance analysis of hybrid wireless networks over fading channels publication-title: IEEE Trans. Wireless Commun. doi: 10.1109/TWC.2013.041913.121236 – volume: 44 start-page: 1060 issue: 3 year: 2008 ident: 10.1016/j.adhoc.2016.07.001_bib0006 article-title: KUPS: Knowledge-based ubiquitous and persistent sensor networks for threat assessment publication-title: IEEE Trans. Aerosp. Electron. Syst. doi: 10.1109/TAES.2008.4655363 – volume: 2015 start-page: 1 issue: 1 year: 2015 ident: 10.1016/j.adhoc.2016.07.001_bib0011 article-title: Analysis of the local delay with slotted-aloha based cognitive radio ad hoc networks publication-title: EURASIP J. Wireless Commun. Netw. doi: 10.1186/s13638-015-0267-8 – volume: 30 start-page: 319 year: 2015 ident: 10.1016/j.adhoc.2016.07.001_bib0025 article-title: Mobile robot path planning using artificial bee colony and evolutionary programming publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.01.067 – volume: 12 start-page: 2930 issue: 6 year: 2013 ident: 10.1016/j.adhoc.2016.07.001_bib0017 article-title: On the throughput capacity and performance analysis of hybrid wireless networks over fading channels publication-title: IEEE Trans. Wireless Commun. doi: 10.1109/TWC.2013.041913.121236 – volume: 148 start-page: 248 year: 2015 ident: 10.1016/j.adhoc.2016.07.001_bib0019 article-title: An improved discrete artificial bee colony algorithm to minimize the make span on hybrid flow shop problems publication-title: Neurocomputing doi: 10.1016/j.neucom.2013.07.056 – volume: 46 start-page: 558 issue: 2 year: 2010 ident: 10.1016/j.adhoc.2016.07.001_bib0004 article-title: NEW: Network-enabled electronic warfare for target recognition publication-title: IEEE Trans. Aerosp. Electron. Syst. doi: 10.1109/TAES.2010.5461641 – volume: 50 start-page: 737 year: 2014 ident: 10.1016/j.adhoc.2016.07.001_bib0026 article-title: A modification of artificial bee colony algorithm applied to loudspeaker design problem publication-title: IEEE Trans. Magnetics doi: 10.1109/TMAG.2013.2281818 – volume: 15 start-page: 1518 issue: 1 year: 2015 ident: 10.1016/j.adhoc.2016.07.001_bib0015 article-title: An efficient distributed algorithm for constructing spanning trees in wireless sensor networks. publication-title: Sensors doi: 10.3390/s150101518 – volume: 76 start-page: 360 year: 2014 ident: 10.1016/j.adhoc.2016.07.001_bib0021 article-title: Binary artificial bee colony optimization using bitwise operation publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2014.08.016 – volume: 36, Part 2 start-page: 450 year: 2016 ident: 10.1016/j.adhoc.2016.07.001_bib0012 article-title: Clustering and sensing with decentralized detection in vehicular ad hoc networks publication-title: Ad Hoc Netw. doi: 10.1016/j.adhoc.2015.05.019 |
| SSID | ssj0029201 |
| Score | 2.375869 |
| Snippet | To accomplish reliable and efficient information routing, strong paths connecting all nodes are required in vehicular ad hoc networks (VANETs). Classical... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 198 |
| SubjectTerms | Artificial bee colony Binary representation Minimum spanning tree Vehicular ad hoc network |
| Title | A binary artificial bee colony algorithm for constructing spanning trees in vehicular ad hoc networks |
| URI | https://dx.doi.org/10.1016/j.adhoc.2016.07.001 |
| Volume | 58 |
| WOSCitedRecordID | wos000397371300021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1570-8713 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0029201 issn: 1570-8705 databaseCode: AIEXJ dateStart: 20030701 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtZ05T8MwFMctVBhgQJzilge2EOQcjZMxQiBgqBiK1C3yFRpU0ooWxMfnOXbSAFUFA4sVOZfbn_P87PzzHkLnvseCGDqPKwNJ3TCK9CPFoCBEeJTHPEpklWyC9nrxYJA82Jyt0yqdAC3L-OMjmfwraqgD2PrT2T_gbi4KFbAN0KEE7FD-CnzqcPONrd5n40NwpUXpI5jpO2z0NH4tZsOXSmAoxnUEWb2sMDEJjLT6vNJpOe9qWBihKpPOcCyc0qjGp22fNl2wq70UPSjKBXVv7fUGGMPmMhVrIikBG0q6bRtqwq9bI-iZvNJ2PPVNeuEfptqsGjxfMglt1Bo7E0XV3upLYOxvA1YjI6wVas9ZdZFMXyQj-oU6zIdXfdpN4g5aTe-uB_fNJDzxiYmha39FHYmq0vz9aMtib6XlgfS30KadOuDUIN9GK6rcQRutgJK7SKXYwMdz-BjgYwMfN_AxwMdt-LiGjyv4uChxAx8ziaHFuCa8hx5vrvtXt65NpOEK8FBmrugmIkpiSSVV2uDmEfMDHoc5ZeBw51RCLUy7YQPsv6Qx75IgJzDyhSJn3OPBPuqU41IdIBwy8A9DGgkpwPcOgoST3BMBVbmCo4k6RH79h2XCRpnXyU5G2RJYh-iiOWligqwsPzyqSWTWTzT-XwZ9a9mJR3-7zzFanz8AJ6gDRNQpWhPvs2L6emY71ifWNIxN |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+binary+artificial+bee+colony+algorithm+for+constructing+spanning+trees+in+vehicular+ad+hoc+networks&rft.jtitle=Ad+hoc+networks&rft.au=Zhang%2C+Xin&rft.au=Zhang%2C+Xiu&rft.date=2017-04-01&rft.issn=1570-8705&rft.volume=58&rft.spage=198&rft.epage=204&rft_id=info:doi/10.1016%2Fj.adhoc.2016.07.001&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_adhoc_2016_07_001 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1570-8705&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1570-8705&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1570-8705&client=summon |