A weight-value algorithm for finding connected dominating sets in a MANET
In recent years, mobile devices are becoming popular and high-speed wireless communication is uproaring. In a wireless network environment, a mobile ad hoc network (MANET) has the characteristics of being infrastructure-free and self-organizing. Although the topology of MANET can be deployed easily...
Saved in:
| Published in | Journal of network and computer applications Vol. 35; no. 5; pp. 1615 - 1619 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Ltd
01.09.2012
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | In recent years, mobile devices are becoming popular and high-speed wireless communication is uproaring. In a wireless network environment, a mobile ad hoc network (MANET) has the characteristics of being infrastructure-free and self-organizing. Although the topology of MANET can be deployed easily with few restrictions, the maintenance faces great challenges. Furthermore, all nodes transmit packets by multi-hop in MANET. If transmission is by traditional broadcasting, it has a broadcasting storm problem and it can significantly reduce the wireless network throughput. The CDS (Connected Dominating Set) scheme is a well-known solution to the broadcasting storm problem. In a MANET, a virtual backbone network can be constructed by using CDS. All nodes can transmit data effectively through the virtual backbone network. In previous research on the subject, most algorithms are only suitable for a static MANET environment, with all nodes being stationary. This is contrary to the desirable characteristics of MANET. In this paper, we present an algorithm which is suitable for both static and dynamic MANET environments. |
|---|---|
| AbstractList | In recent years, mobile devices are becoming popular and high-speed wireless communication is uproaring. In a wireless network environment, a mobile ad hoc network (MANET) has the characteristics of being infrastructure-free and self-organizing. Although the topology of MANET can be deployed easily with few restrictions, the maintenance faces great challenges. Furthermore, all nodes transmit packets by multi-hop in MANET. If transmission is by traditional broadcasting, it has a broadcasting storm problem and it can significantly reduce the wireless network throughput. The CDS (Connected Dominating Set) scheme is a well-known solution to the broadcasting storm problem. In a MANET, a virtual backbone network can be constructed by using CDS. All nodes can transmit data effectively through the virtual backbone network. In previous research on the subject, most algorithms are only suitable for a static MANET environment, with all nodes being stationary. This is contrary to the desirable characteristics of MANET. In this paper, we present an algorithm which is suitable for both static and dynamic MANET environments. |
| Author | Chang, Ruay-Shiung Leu, Seiven |
| Author_xml | – sequence: 1 givenname: Seiven surname: Leu fullname: Leu, Seiven – sequence: 2 givenname: Ruay-Shiung surname: Chang fullname: Chang, Ruay-Shiung email: rschang@mail.ndhu.edu.tw |
| BookMark | eNp9kM1KAzEURoNUsK2-gKu8wIw3ycwkATelVC34s6nrEJNMm6FNJBkrvr0z1JWLru7lg_Nx75mhSYjBIXRLoCRAmruu7ILRJQVCS2AlQH2BpgRkXYha0sm4i6oQUNVXaJZzBwBNJdkUrRf42_ntri-Oev_lsN5vY_L97oDbmHDrg_Vhi00MwZneWWzjwQfdj2F2fcY-YI1fFq-rzTW6bPU-u5u_OUfvD6vN8ql4fntcLxfPhWEAfSF5YzkHozWTXEgjrLCc1A4ko7qRFaVEMO7khyasMTXlQyw0tFpKSrklbI7EqdekmHNyrTK-Hy6KoU_a7xUBNSpRnRqVqFGJAqYGJQNK_6GfyR90-jkP3Z8gNzx19C6pbLwLxlmfBifKRn8O_wUhnns6 |
| CitedBy_id | crossref_primary_10_1016_j_jnca_2015_05_019 crossref_primary_10_1080_03772063_2015_1136577 crossref_primary_10_1002_net_21728 crossref_primary_10_1080_23335777_2020_1811387 crossref_primary_10_3923_ajsr_2014_102_109 crossref_primary_10_1007_s11276_014_0800_4 |
| Cites_doi | 10.1007/11523468_92 10.5539/cis.v2n4p3 10.1016/j.comcom.2009.06.001 10.1109/ICCS.2006.301379 10.1145/872035.872040 10.1145/1167935.1167941 10.1016/S0304-3975(03)00209-3 10.1109/TPDS.2008.57 10.1007/11830924_3 10.1016/j.jnca.2010.11.007 10.4304/jnw.4.6.511-519 10.1109/TC.2006.40 10.1109/TNET.2007.905588 10.1109/ISWPC.2010.5483759 10.1023/A:1013763825347 10.1016/j.jnca.2006.01.004 10.1007/PL00009201 |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier Ltd |
| Copyright_xml | – notice: 2012 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jnca.2012.03.005 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1095-8592 |
| EndPage | 1619 |
| ExternalDocumentID | 10_1016_j_jnca_2012_03_005 S1084804512000720 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL 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 ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB 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 R2- RIG ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SST SSV SSZ T5K UHS WH7 XPP ZMT ZU3 ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP BNPGV CITATION SSH |
| ID | FETCH-LOGICAL-c300t-976d770caa39789c8d8d715e0932a694221837e9ba136c52732a8a0fa99227d13 |
| IEDL.DBID | .~1 |
| ISSN | 1084-8045 |
| IngestDate | Thu Apr 24 22:52:32 EDT 2025 Tue Jul 01 03:04:50 EDT 2025 Fri Feb 23 02:12:46 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Broadcasting Connected Dominating Set Mobile Ad Hoc Network |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c300t-976d770caa39789c8d8d715e0932a694221837e9ba136c52732a8a0fa99227d13 |
| PageCount | 5 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_jnca_2012_03_005 crossref_primary_10_1016_j_jnca_2012_03_005 elsevier_sciencedirect_doi_10_1016_j_jnca_2012_03_005 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | September 2012 2012-9-00 |
| PublicationDateYYYYMMDD | 2012-09-01 |
| PublicationDate_xml | – month: 09 year: 2012 text: September 2012 |
| PublicationDecade | 2010 |
| PublicationTitle | Journal of network and computer applications |
| PublicationYear | 2012 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Liang O, Sekercioglu YA, Manin N. Gateway multipoint relays—an MPR-based broadcast algorithm for ad hoc networks. In: 10th IEEE Singapore International Conference on Communication Systems, vols. 1 and 2; 2006. pp.71–76. Tseng, Ni, Chen, Sheu. (bib25) 2002; 8 Garey, Johnson (bib13) 1979 Ambühl, Christoph, Erlebach, Thomas, Mihal'ákz, Matú Nunkesserx, Marc. Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: APPROX. Proceedings of the 9th International workshop on approximation algorithms for combinatorial optimization problems. June 30, 2006. Adjih, Jacquet, Viennot (bib4) 2005; 1 Gao, Wang (bib26) 2009; 32 Ambuhl, C. An optimal bound for the mst algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of 32nd Int'l Colloquium in Automata, Languages and Programming (ICALP 05); Nov. 2005. p. 1139–50. Purohit, Sharma (bib7) 2010; 2 Funke, Kesselman, Meyer, Segal. (bib21) 2006; 2 Khan, Pandurangan, Anil Kumar (bib14) 2009; 20 Gandhi, Mishra, Parthasarathy (bib20) 2008; 16 Sakai, Sun, Ku (bib10) 2009 Fly, Meghanathan (bib19) 2010; 2 King, Meghanathan (bib12) 2009; 2 Quintero, Li, Castro (bib1) 2007; 30 Guha, Khuller (bib22) 1998 Nandl, Sharma (bib18) 2011; 5 William (bib24) 1998 Meghanathan (bib16) 2010 Rai, Verma, Tapaswi (bib15) 2009; 4 Wang, Liu, Jiao (bib9) 2011; 34 Sakai, Suny, Ku (bib11) 2010 Wu, Lou, Dai (bib8) 2006; 55 Kishoro Bisoyi1, Sahu (bib23) 2010; 1 Lu, Tang, Lee. (bib3) 2003; 306 Kuhn F, Wattenhofer R. Constant-time distributed dominating set approximation. In: Proceedings of the ACM symposium, principles of distributed computing (PODC). July 2003. Funke (10.1016/j.jnca.2012.03.005_bib21) 2006; 2 Gandhi (10.1016/j.jnca.2012.03.005_bib20) 2008; 16 Lu (10.1016/j.jnca.2012.03.005_bib3) 2003; 306 Wu (10.1016/j.jnca.2012.03.005_bib8) 2006; 55 Fly (10.1016/j.jnca.2012.03.005_bib19) 2010; 2 Kishoro Bisoyi1 (10.1016/j.jnca.2012.03.005_bib23) 2010; 1 Nandl (10.1016/j.jnca.2012.03.005_bib18) 2011; 5 Adjih (10.1016/j.jnca.2012.03.005_bib4) 2005; 1 10.1016/j.jnca.2012.03.005_bib17 Quintero (10.1016/j.jnca.2012.03.005_bib1) 2007; 30 Garey (10.1016/j.jnca.2012.03.005_bib13) 1979 Guha (10.1016/j.jnca.2012.03.005_bib22) 1998 Wang (10.1016/j.jnca.2012.03.005_bib9) 2011; 34 Purohit (10.1016/j.jnca.2012.03.005_bib7) 2010; 2 10.1016/j.jnca.2012.03.005_bib5 Gao (10.1016/j.jnca.2012.03.005_bib26) 2009; 32 Meghanathan (10.1016/j.jnca.2012.03.005_bib16) 2010 10.1016/j.jnca.2012.03.005_bib6 10.1016/j.jnca.2012.03.005_bib2 Rai (10.1016/j.jnca.2012.03.005_bib15) 2009; 4 Sakai (10.1016/j.jnca.2012.03.005_bib11) 2010 King (10.1016/j.jnca.2012.03.005_bib12) 2009; 2 Khan (10.1016/j.jnca.2012.03.005_bib14) 2009; 20 William (10.1016/j.jnca.2012.03.005_bib24) 1998 Sakai (10.1016/j.jnca.2012.03.005_bib10) 2009 Tseng (10.1016/j.jnca.2012.03.005_bib25) 2002; 8 |
| References_xml | – volume: 16 start-page: 840 year: 2008 end-page: 851 ident: bib20 article-title: Minimizing broadcast latency and redundancy in ad hoc networks publication-title: IEEE/ACM Transactions on Networking – year: 1979 ident: bib13 article-title: Computers and intractability. a guide to the theory of NP-completeness – reference: Kuhn F, Wattenhofer R. Constant-time distributed dominating set approximation. In: Proceedings of the ACM symposium, principles of distributed computing (PODC). July 2003. – volume: 2 year: 2010 ident: bib7 article-title: Constructing minimum connected dominating set: algorithmic approach publication-title: International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) – volume: 1 start-page: 338 year: 2010 end-page: 348 ident: bib23 article-title: Performance analysis of dynamic MANET on demand (DYMO) routing protocol publication-title: International Journal of Computer & Communication Technology – volume: 306 start-page: 55 year: 2003 end-page: 67 ident: bib3 article-title: The full Steiner tree problem publication-title: Theoretical Computer Science – volume: 8 start-page: 153 year: 2002 end-page: 167 ident: bib25 article-title: The broadcast storm problem in a mobile ad hoc network publication-title: Wireless Networks – volume: 34 start-page: 1138 year: 2011 end-page: 1149 ident: bib9 article-title: Building a trusted route in a Mobile Ad Hoc Network considering communication reliability and path length publication-title: Journal of Network and Computer Applications – start-page: 186 year: 2010 end-page: 191 ident: bib11 article-title: Message-efficient CDS construction in MANETs publication-title: Wireless Pervasive Computing (ISWPC'10) – volume: 2 start-page: 2096 year: 2010 end-page: 2103 ident: bib19 article-title: Predicted link expiration time based connected dominating sets for mobile ad hoc networks publication-title: International Journal on Computer Science & Engineering – volume: 4 year: 2009 ident: bib15 article-title: A power aware minimum connected dominating set for wireless sensor networks publication-title: Journal of Networks – year: 1998 ident: bib24 article-title: Mobile communications engineering – reference: Ambuhl, C. An optimal bound for the mst algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of 32nd Int'l Colloquium in Automata, Languages and Programming (ICALP 05); Nov. 2005. p. 1139–50. – start-page: 374 year: 1998 end-page: 387 ident: bib22 article-title: Approximation algorithms for connected dominating sets publication-title: Algorithmica – start-page: 1 year: 2009 end-page: 6 ident: bib10 article-title: Fast connected dominating set construction in Mobile Ad Hoc Networks publication-title: ICC'09 – start-page: 89 year: 2010 end-page: 96 ident: bib16 article-title: Use of minimum node velocity based stable connected dominating sets for Mobile Ad Hoc Networks publication-title: IJCA Special Issue on “Mobile Ad-hoc Networks” – volume: 5 year: 2011 ident: bib18 article-title: Performance study of broadcast based mobile adhoc routing protocols AODV, DSR and DYMO publication-title: International Journal of Security and its Applications – volume: 2 year: 2009 ident: bib12 article-title: A weighted-density connected dominating set data gathering algorithm for wireless sensor networks publication-title: Computer and Information Science – reference: Ambühl, Christoph, Erlebach, Thomas, Mihal'ákz, Matú Nunkesserx, Marc. Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: APPROX. Proceedings of the 9th International workshop on approximation algorithms for combinatorial optimization problems. June 30, 2006. – reference: Liang O, Sekercioglu YA, Manin N. Gateway multipoint relays—an MPR-based broadcast algorithm for ad hoc networks. In: 10th IEEE Singapore International Conference on Communication Systems, vols. 1 and 2; 2006. pp.71–76. – volume: 30 start-page: 614 year: 2007 end-page: 636 ident: bib1 article-title: A location routing protocol based on smart antennas for ad hoc networks publication-title: Journal of Network and Computer Applications – volume: 55 start-page: 334 year: 2006 end-page: 347 ident: bib8 article-title: Extended multipoint relays to determine connected dominating sets in MANETs publication-title: IEEE Transactions on Computers – volume: 20 year: 2009 ident: bib14 article-title: Distributes algorithms for constructing approximate minimum spanning trees in wireless sensor networks publication-title: IEEE Transactions on Parallel and Distributed System – volume: 32 start-page: 1631 year: 2009 end-page: 1641 ident: bib26 article-title: A passive tree-based backbone construction scheme for MANETs publication-title: Computer Communications – volume: 1 start-page: 27 year: 2005 end-page: 39 ident: bib4 article-title: Computing connected dominated sets with multipoint relays publication-title: Ad Hoc & Sensor Wireless Networks – volume: 2 start-page: 444 year: 2006 end-page: 453 ident: bib21 article-title: A simple improved distributed algorithm for minimum cds in unit disk graphs publication-title: ACM Transactions on Sensor Networks – ident: 10.1016/j.jnca.2012.03.005_bib2 doi: 10.1007/11523468_92 – volume: 2 start-page: 2096 issue: 6 year: 2010 ident: 10.1016/j.jnca.2012.03.005_bib19 article-title: Predicted link expiration time based connected dominating sets for mobile ad hoc networks publication-title: International Journal on Computer Science & Engineering – volume: 2 issue: 4 year: 2009 ident: 10.1016/j.jnca.2012.03.005_bib12 article-title: A weighted-density connected dominating set data gathering algorithm for wireless sensor networks publication-title: Computer and Information Science doi: 10.5539/cis.v2n4p3 – volume: 32 start-page: 1631 issue: 15 year: 2009 ident: 10.1016/j.jnca.2012.03.005_bib26 article-title: A passive tree-based backbone construction scheme for MANETs publication-title: Computer Communications doi: 10.1016/j.comcom.2009.06.001 – ident: 10.1016/j.jnca.2012.03.005_bib17 doi: 10.1109/ICCS.2006.301379 – ident: 10.1016/j.jnca.2012.03.005_bib6 doi: 10.1145/872035.872040 – year: 1998 ident: 10.1016/j.jnca.2012.03.005_bib24 – volume: 1 start-page: 27 year: 2005 ident: 10.1016/j.jnca.2012.03.005_bib4 article-title: Computing connected dominated sets with multipoint relays publication-title: Ad Hoc & Sensor Wireless Networks – volume: 2 start-page: 444 year: 2006 ident: 10.1016/j.jnca.2012.03.005_bib21 article-title: A simple improved distributed algorithm for minimum cds in unit disk graphs publication-title: ACM Transactions on Sensor Networks doi: 10.1145/1167935.1167941 – volume: 306 start-page: 55 issue: 2003 year: 2003 ident: 10.1016/j.jnca.2012.03.005_bib3 article-title: The full Steiner tree problem publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(03)00209-3 – start-page: 89 year: 2010 ident: 10.1016/j.jnca.2012.03.005_bib16 article-title: Use of minimum node velocity based stable connected dominating sets for Mobile Ad Hoc Networks publication-title: IJCA Special Issue on “Mobile Ad-hoc Networks” – volume: 20 issue: 1 year: 2009 ident: 10.1016/j.jnca.2012.03.005_bib14 article-title: Distributes algorithms for constructing approximate minimum spanning trees in wireless sensor networks publication-title: IEEE Transactions on Parallel and Distributed System doi: 10.1109/TPDS.2008.57 – volume: 1 start-page: 338 issue: 2–4 year: 2010 ident: 10.1016/j.jnca.2012.03.005_bib23 article-title: Performance analysis of dynamic MANET on demand (DYMO) routing protocol publication-title: International Journal of Computer & Communication Technology – ident: 10.1016/j.jnca.2012.03.005_bib5 doi: 10.1007/11830924_3 – start-page: 1 year: 2009 ident: 10.1016/j.jnca.2012.03.005_bib10 article-title: Fast connected dominating set construction in Mobile Ad Hoc Networks publication-title: ICC'09 – volume: 34 start-page: 1138 issue: 4 year: 2011 ident: 10.1016/j.jnca.2012.03.005_bib9 article-title: Building a trusted route in a Mobile Ad Hoc Network considering communication reliability and path length publication-title: Journal of Network and Computer Applications doi: 10.1016/j.jnca.2010.11.007 – year: 1979 ident: 10.1016/j.jnca.2012.03.005_bib13 – volume: 4 issue: 6 year: 2009 ident: 10.1016/j.jnca.2012.03.005_bib15 article-title: A power aware minimum connected dominating set for wireless sensor networks publication-title: Journal of Networks doi: 10.4304/jnw.4.6.511-519 – volume: 55 start-page: 334 year: 2006 ident: 10.1016/j.jnca.2012.03.005_bib8 article-title: Extended multipoint relays to determine connected dominating sets in MANETs publication-title: IEEE Transactions on Computers doi: 10.1109/TC.2006.40 – volume: 16 start-page: 840 year: 2008 ident: 10.1016/j.jnca.2012.03.005_bib20 article-title: Minimizing broadcast latency and redundancy in ad hoc networks publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/TNET.2007.905588 – volume: 5 issue: 1 year: 2011 ident: 10.1016/j.jnca.2012.03.005_bib18 article-title: Performance study of broadcast based mobile adhoc routing protocols AODV, DSR and DYMO publication-title: International Journal of Security and its Applications – volume: 2 issue: 3 year: 2010 ident: 10.1016/j.jnca.2012.03.005_bib7 article-title: Constructing minimum connected dominating set: algorithmic approach publication-title: International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) – start-page: 186 year: 2010 ident: 10.1016/j.jnca.2012.03.005_bib11 article-title: Message-efficient CDS construction in MANETs publication-title: Wireless Pervasive Computing (ISWPC'10) doi: 10.1109/ISWPC.2010.5483759 – volume: 8 start-page: 153 year: 2002 ident: 10.1016/j.jnca.2012.03.005_bib25 article-title: The broadcast storm problem in a mobile ad hoc network publication-title: Wireless Networks doi: 10.1023/A:1013763825347 – volume: 30 start-page: 614 issue: 2 year: 2007 ident: 10.1016/j.jnca.2012.03.005_bib1 article-title: A location routing protocol based on smart antennas for ad hoc networks publication-title: Journal of Network and Computer Applications doi: 10.1016/j.jnca.2006.01.004 – start-page: 374 year: 1998 ident: 10.1016/j.jnca.2012.03.005_bib22 article-title: Approximation algorithms for connected dominating sets publication-title: Algorithmica doi: 10.1007/PL00009201 |
| SSID | ssj0006493 |
| Score | 2.0129845 |
| Snippet | In recent years, mobile devices are becoming popular and high-speed wireless communication is uproaring. In a wireless network environment, a mobile ad hoc... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1615 |
| SubjectTerms | Broadcasting Connected Dominating Set Mobile Ad Hoc Network |
| Title | A weight-value algorithm for finding connected dominating sets in a MANET |
| URI | https://dx.doi.org/10.1016/j.jnca.2012.03.005 |
| Volume | 35 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PT8IwFG4IXvTgD9SIP0gP3kxl3bp1Oy4EAhq4CAm3pusKQnQQmfHm327f1ikmhoPHLX3J8vb23ve6731F6NblrhsloSaUJjPCPMWIQdUe8QyUdbRkKaMwOzwcBf0Je5j60xrqVLMwQKu0ub_M6UW2tnfa1pvt9WLRfqIgBQ_yKDBtwl3o2xnjEOX3nz80j4BFlmTPCKy2gzMlx2sJ2wamBLql0Kn_d3HaKji9Y3RokSKOy4c5QTWdNdBRdQoDth9lAx1sSQqeokGMP4rdTgIy3hrLl_nK9P_Pr9igU1z8oc7mWAG9RRmwidMVcGGA-4w3Ot_gRYYlHsaj7vgMTXrdcadP7HEJRHmOkxMDLFLOHSWlwRhhpMI0TDn1tWMgmgwi5gIa4jpKJPUCBcJrrgylM5MgTctT6p2jerbK9AXCHg0irblmoem3ItPF-qmkgYIXawAL401EKz8JZbXE4UiLF1GRxpYCfCvAt8LxhPFtE91926xLJY2dq_3K_eJXPAiT6nfYXf7T7grtw1XJHrtG9fztXd8YuJEnrSKeWmgvHjz2R1-PPM_t |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6hMgADb0R5emBDVuPEiZMxQqCWPhaK1M1yHbe0KmnVBvH38TUOAgl1YE1yUnSx775zvvsO4M4Xvp8MY0MZG44oDzSnFlUHNLBQ1jOKZ5xh73C3FzVf-fMgHGzBQ9ULg7RKF_vLmL6O1u5Kw3mzsZhMGi8MpeBRHgW7TYRv6_ZtVKcKa7CdttrN3ndAjnjiePacooHrnSlpXlM8ObBZ0C-1TsO_89OPnPN0CPsOLJK0fJ8j2DL5MRxUgxiI25fHsPdDVfAEWin5XB94UlTyNkTNxvPlpHh7JxagkvVP6nxMNDJctMWbJJsjHQbpz2RlihWZ5ESRbtp77J_C69Nj_6FJ3cQEqgPPK6jFFpkQnlbKwow40XEWZ4KFxrMoTUUJ9xEQCZMMFQsijdprvoqVN1KoTisyFpxBLZ_n5hxIwKLEGGF4bEuuxBayYaZYpPHbWszCRR1Y5SepnZw4TrWYyYo3NpXoW4m-lV4grW_rcP9tsyjFNDY-HVbul7-WhLTRfoPdxT_tbmGn2e92ZKfVa1_CLt4pyWRXUCuWH-baoo9ieONW1xfI7dKe |
| 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+weight-value+algorithm+for+finding+connected+dominating+sets+in+a+MANET&rft.jtitle=Journal+of+network+and+computer+applications&rft.au=Leu%2C+Seiven&rft.au=Chang%2C+Ruay-Shiung&rft.date=2012-09-01&rft.pub=Elsevier+Ltd&rft.issn=1084-8045&rft.eissn=1095-8592&rft.volume=35&rft.issue=5&rft.spage=1615&rft.epage=1619&rft_id=info:doi/10.1016%2Fj.jnca.2012.03.005&rft.externalDocID=S1084804512000720 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1084-8045&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1084-8045&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1084-8045&client=summon |