Opportunistic routing algorithm based on trust model for ad hoc network
Due to the absence of enough physical protection,dynamic topology,distributed collaboration,the limited bandwidth and computing ability in ad hoc network,traditional routing security mechanism cannot adapt to the design of routing protocols.Recently,opportunistic routing is of the research hotspots,...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-09-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.09.012/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539812685774848 |
|---|---|
| author | Bo WANG Xun-xun CHEN |
| author_facet | Bo WANG Xun-xun CHEN |
| author_sort | Bo WANG |
| collection | DOAJ |
| description | Due to the absence of enough physical protection,dynamic topology,distributed collaboration,the limited bandwidth and computing ability in ad hoc network,traditional routing security mechanism cannot adapt to the design of routing protocols.Recently,opportunistic routing is of the research hotspots,which can cope with the unreliable transmissions to improve throughput of the whole network by exploiting the broadcast nature of the wireless medium and spatial diversity of multi-hop wireless network.The concept of trust-based similarity in opportunistic routing for ad hoc network was incorporated,and a novel trusted opportunistic forwarding model based on trust degree of node and least cost of opportunistic routing were also built.Then a trusted minimum cost routing algorithm (MCOR) was proposed and the correctness and effectiveness of this algorithm from theoretical ana ysis were proved.Finally,MCOR algorithm was verified by simulation and was compared with the classic protocols:ExOR,TAODV and Watchdog-DSR.The simulation results show that MCOR scheme can detect and mitigate node misbehaviors.Furthermore,MCOR scheme outperforms the other protocols in terms of throughput,delay,expected ETX and cost of routing. |
| format | Article |
| id | doaj-art-70beaffe74b24a9c906bb1de09d0d8d5 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2013-09-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-70beaffe74b24a9c906bb1de09d0d8d52025-01-14T06:41:17ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-09-01349210459674909Opportunistic routing algorithm based on trust model for ad hoc networkBo WANGXun-xun CHENDue to the absence of enough physical protection,dynamic topology,distributed collaboration,the limited bandwidth and computing ability in ad hoc network,traditional routing security mechanism cannot adapt to the design of routing protocols.Recently,opportunistic routing is of the research hotspots,which can cope with the unreliable transmissions to improve throughput of the whole network by exploiting the broadcast nature of the wireless medium and spatial diversity of multi-hop wireless network.The concept of trust-based similarity in opportunistic routing for ad hoc network was incorporated,and a novel trusted opportunistic forwarding model based on trust degree of node and least cost of opportunistic routing were also built.Then a trusted minimum cost routing algorithm (MCOR) was proposed and the correctness and effectiveness of this algorithm from theoretical ana ysis were proved.Finally,MCOR algorithm was verified by simulation and was compared with the classic protocols:ExOR,TAODV and Watchdog-DSR.The simulation results show that MCOR scheme can detect and mitigate node misbehaviors.Furthermore,MCOR scheme outperforms the other protocols in terms of throughput,delay,expected ETX and cost of routing.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.09.012/trust-based similaritytrust modeldegree of trustopportunistic routingcost of opportunistic routing |
| spellingShingle | Bo WANG Xun-xun CHEN Opportunistic routing algorithm based on trust model for ad hoc network Tongxin xuebao trust-based similarity trust model degree of trust opportunistic routing cost of opportunistic routing |
| title | Opportunistic routing algorithm based on trust model for ad hoc network |
| title_full | Opportunistic routing algorithm based on trust model for ad hoc network |
| title_fullStr | Opportunistic routing algorithm based on trust model for ad hoc network |
| title_full_unstemmed | Opportunistic routing algorithm based on trust model for ad hoc network |
| title_short | Opportunistic routing algorithm based on trust model for ad hoc network |
| title_sort | opportunistic routing algorithm based on trust model for ad hoc network |
| topic | trust-based similarity trust model degree of trust opportunistic routing cost of opportunistic routing |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.09.012/ |
| work_keys_str_mv | AT bowang opportunisticroutingalgorithmbasedontrustmodelforadhocnetwork AT xunxunchen opportunisticroutingalgorithmbasedontrustmodelforadhocnetwork |