Research on Efficient Routing Algorithm Based on Dynamic Segmentation Network Coding
In order to solve the problem of existing routing algorithms, an efficient routing algorithm based on dynamic segmentation network coding (ERBNC) is proposed. By compressing the header of the encoded packet, deleting the redundant ACK packet and setting the priority of sending the encoded packet, th...
Uloženo v:
| Vydáno v: | 2018 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS) s. 202 - 205 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.01.2018
|
| Témata: | |
| 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 | In order to solve the problem of existing routing algorithms, an efficient routing algorithm based on dynamic segmentation network coding (ERBNC) is proposed. By compressing the header of the encoded packet, deleting the redundant ACK packet and setting the priority of sending the encoded packet, the proposed algorithm reduces the network overhead and packet average end-to-end delay. The simulation experiments of ERBNC algorithm, dynamic segmented network coding (DSNC) algorithm and segmented network coding (SNC) algorithm were completed by using OPNET simulation software. The performance of various algorithms is compared and analyzed. The simulation results show that the ERBNC algorithm can effectively reduce the network overhead and reduce the average end-to-end delay of data packets. |
|---|---|
| AbstractList | In order to solve the problem of existing routing algorithms, an efficient routing algorithm based on dynamic segmentation network coding (ERBNC) is proposed. By compressing the header of the encoded packet, deleting the redundant ACK packet and setting the priority of sending the encoded packet, the proposed algorithm reduces the network overhead and packet average end-to-end delay. The simulation experiments of ERBNC algorithm, dynamic segmented network coding (DSNC) algorithm and segmented network coding (SNC) algorithm were completed by using OPNET simulation software. The performance of various algorithms is compared and analyzed. The simulation results show that the ERBNC algorithm can effectively reduce the network overhead and reduce the average end-to-end delay of data packets. |
| Author | Wu, Yonghao Li, Cong |
| Author_xml | – sequence: 1 givenname: Cong surname: Li fullname: Li, Cong – sequence: 2 givenname: Yonghao surname: Wu fullname: Wu, Yonghao |
| BookMark | eNotjE1OwzAYRI0EC1o4AGLjCyT4N7GXbSgQqQKpzb5ynM-pRWOjxAj19qSC1Uhv3swCXYcYAKEHSnJKiX6qq7pZ73NGqMoJIVJfoQWVXBXigm5Rs4MJzGiPOAa8cc5bDyHhXfxOPvR4derj6NNxwGszQXeRns_BDN7iPfTDrJrkZ_gO6SeOn7iK3Ty7QzfOnCa4_88lal42TfWWbT9e62q1zbwmKWMtBwBrmbGqVJaWXcmBlbQQmjtBOqIKC4W2WgltCGNSMte23Bk594Xo-BI9_t36-efwNfrBjOeD4pyVgvNfy-NNDw |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICITBS.2018.00059 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 1538642018 9781538642016 |
| EndPage | 205 |
| ExternalDocumentID | 8332743 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i90t-2b3eeecc2ac878c17d73e2716493f40d086ce69c9849a022552fbb3fa593f64d3 |
| IEDL.DBID | RIE |
| IngestDate | Thu Jun 29 18:39:35 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i90t-2b3eeecc2ac878c17d73e2716493f40d086ce69c9849a022552fbb3fa593f64d3 |
| PageCount | 4 |
| ParticipantIDs | ieee_primary_8332743 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-Jan |
| PublicationDateYYYYMMDD | 2018-01-01 |
| PublicationDate_xml | – month: 01 year: 2018 text: 2018-Jan |
| PublicationDecade | 2010 |
| PublicationTitle | 2018 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS) |
| PublicationTitleAbbrev | ICITBS |
| PublicationYear | 2018 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.6514996 |
| Snippet | In order to solve the problem of existing routing algorithms, an efficient routing algorithm based on dynamic segmentation network coding (ERBNC) is proposed.... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 202 |
| SubjectTerms | Big Data Conferences Decoding Predictions Delay Tolerant Networks Network Coding Redundant Control Routing Algorithms Smart cities Transportation |
| Title | Research on Efficient Routing Algorithm Based on Dynamic Segmentation Network Coding |
| URI | https://ieeexplore.ieee.org/document/8332743 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4A8eBJDRjf6cGjK7vbXbo9CkIkMYSEPXAjfUyRRHYJgr_ftruiBy_emnb6yPTwZdrvmwG4V1JIo5EHghsVJAJpwDULA8NlzE1iTIQ-z-wrm0yy-ZxPG_Bw0MIgoief4aNr-r98Xaq9eyrrZpTaIIo2ockYq7Ra9UdlFPLueDDO-zPH1nL0SJ999FfBFI8Xo5P_7XQKnR_hHZkeIOUMGli0If9mx5GyIEOf8sFOJo7LY43I0_uytBH-25r0LSJpZ_RclZknM1yua21RQSYV4ZsMSrd2B_LRMB-8BHUxhGDFw10QS2oPqVQsVMYyFTHNKMYu2OHUJKG2kYnCHlc8S7iwuJymsZGSGpHa8V6i6Tm0irLACyBUUWTMSJ1mXqcqUhGZVEa9MJEO0S6h7Ryy2FTpLha1L67-7r6GY-fx6lXiBlq77R5v4Uh97lYf2zt_R18JCZaq |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4gmuhJDRjf9uDRld1tl90eBSEQcUPCHriRPpEEdg2Cv9-2u6IHL96advrI9PBl2u-bAbgXnHEtFfUY1cIjTGGPytj3NOUh1UTrQLk8s6M4TZPplI5r8LDTwiilHPlMPdqm-8uXhdjap7JWgrEJovAe7EeEhEGp1qq-KgOftobdYdaZWL6WJUi6_KO_SqY4xOgf_2-vE2j-SO_QeAcqp1BTeQOyb34cKnLUc0kfzGRk2TzGCD0t54WJ8d9WqGMwSVqj57LQPJqo-apSF-UoLSnfqFvYtZuQ9XtZd-BV5RC8BfU3XsixOaQQIRNJnIggljFWoQ13KNbElyY2EapNBU0IZQaZoyjUnGPNIjPeJhKfQT0vcnUOCAus4lhzGSVOqcoiFuiIB22fcItpF9CwDpm9lwkvZpUvLv_uvoPDQfY6mo2G6csVHFnvl28U11DfrLfqBg7E52bxsb519_UFDw2Z8Q |
| 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%3Abook&rft.genre=proceeding&rft.title=2018+International+Conference+on+Intelligent+Transportation%2C+Big+Data+%26+Smart+City+%28ICITBS%29&rft.atitle=Research+on+Efficient+Routing+Algorithm+Based+on+Dynamic+Segmentation+Network+Coding&rft.au=Li%2C+Cong&rft.au=Wu%2C+Yonghao&rft.date=2018-01-01&rft.pub=IEEE&rft.spage=202&rft.epage=205&rft_id=info:doi/10.1109%2FICITBS.2018.00059&rft.externalDocID=8332743 |