Impact of node-selfishness on the connectivity and path delay of Ad-hoc networks
We investigate the impact of the node-selfishness on the network connectivity and the path delay of information dissemination in large scale Ad-hoc networks based on the percolation theory. A network framework with links obeying stationary process is conceived by combining the effects of both node-s...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 70 |
|---|---|
| container_issue | |
| container_start_page | 66 |
| container_title | |
| container_volume | |
| creator | Li Feng Qinghai Yang Fenglin Fu Kyung Sup Kwak |
| description | We investigate the impact of the node-selfishness on the network connectivity and the path delay of information dissemination in large scale Ad-hoc networks based on the percolation theory. A network framework with links obeying stationary process is conceived by combining the effects of both node-selfishness and link qualities. The existence of the node cooperation probability boundary is proved when the network density exceeds a value. The network presents two connection characteristics with respect to this boundary. The minimum path delay is asymptotically independent of the source-destination distance when the node cooperation probability exceeds this boundary. While the node cooperation probability is below the boundary, the minimum path delay scales linearly with the source-destination distance. Simulation results verify the theoretical analysis. |
| doi_str_mv | 10.1109/ICTC.2012.6386781 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6386781</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6386781</ieee_id><sourcerecordid>6386781</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-ae2094fcb0badc80c44dcd20a8cddfa54408c4da3b3c1301181645491ddd53d43</originalsourceid><addsrcrecordid>eNpFkM1KxDAURiMqOI7zAOImL9B6b5J2kuVQ_BkY0EX3Q5qb0monLU1Q-vYiDrj6OItzFh9j9wg5IpjHfVVXuQAUeSl1udV4wW5RlVuptNiay38wxRVbCSxFhkLKG7aJ8QMAJGptpF6x9_1psi7xseVhJJ9FP7R97IKPkY-Bp85zN4bgXeq_-rRwG4hPNnWc_GCXX21HWTc6Hnz6HufPeMeuWztEvznvmtXPT3X1mh3eXvbV7pD1BlJmvQCjWtdAY8lpcEqRIwFWO6LWFkqBdoqsbKRDCYgaS1Uog0RUSFJyzR7-sr33_jjN_cnOy_F8hvwBrA1RnA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Impact of node-selfishness on the connectivity and path delay of Ad-hoc networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Li Feng ; Qinghai Yang ; Fenglin Fu ; Kyung Sup Kwak</creator><creatorcontrib>Li Feng ; Qinghai Yang ; Fenglin Fu ; Kyung Sup Kwak</creatorcontrib><description>We investigate the impact of the node-selfishness on the network connectivity and the path delay of information dissemination in large scale Ad-hoc networks based on the percolation theory. A network framework with links obeying stationary process is conceived by combining the effects of both node-selfishness and link qualities. The existence of the node cooperation probability boundary is proved when the network density exceeds a value. The network presents two connection characteristics with respect to this boundary. The minimum path delay is asymptotically independent of the source-destination distance when the node cooperation probability exceeds this boundary. While the node cooperation probability is below the boundary, the minimum path delay scales linearly with the source-destination distance. Simulation results verify the theoretical analysis.</description><identifier>ISSN: 2162-1233</identifier><identifier>ISBN: 1467348295</identifier><identifier>ISBN: 9781467348294</identifier><identifier>EISBN: 1467348279</identifier><identifier>EISBN: 9781467348270</identifier><identifier>EISBN: 1467348287</identifier><identifier>EISBN: 9781467348287</identifier><identifier>DOI: 10.1109/ICTC.2012.6386781</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ad hoc networks ; connectivity ; Delay ; Educational institutions ; Games ; minimum path delay ; percolation theory ; Propagation delay ; Reliability ; Selfish nodes ; Wireless communication</subject><ispartof>2012 International Conference on ICT Convergence (ICTC), 2012, p.66-70</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6386781$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6386781$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Li Feng</creatorcontrib><creatorcontrib>Qinghai Yang</creatorcontrib><creatorcontrib>Fenglin Fu</creatorcontrib><creatorcontrib>Kyung Sup Kwak</creatorcontrib><title>Impact of node-selfishness on the connectivity and path delay of Ad-hoc networks</title><title>2012 International Conference on ICT Convergence (ICTC)</title><addtitle>ICTC</addtitle><description>We investigate the impact of the node-selfishness on the network connectivity and the path delay of information dissemination in large scale Ad-hoc networks based on the percolation theory. A network framework with links obeying stationary process is conceived by combining the effects of both node-selfishness and link qualities. The existence of the node cooperation probability boundary is proved when the network density exceeds a value. The network presents two connection characteristics with respect to this boundary. The minimum path delay is asymptotically independent of the source-destination distance when the node cooperation probability exceeds this boundary. While the node cooperation probability is below the boundary, the minimum path delay scales linearly with the source-destination distance. Simulation results verify the theoretical analysis.</description><subject>Ad hoc networks</subject><subject>connectivity</subject><subject>Delay</subject><subject>Educational institutions</subject><subject>Games</subject><subject>minimum path delay</subject><subject>percolation theory</subject><subject>Propagation delay</subject><subject>Reliability</subject><subject>Selfish nodes</subject><subject>Wireless communication</subject><issn>2162-1233</issn><isbn>1467348295</isbn><isbn>9781467348294</isbn><isbn>1467348279</isbn><isbn>9781467348270</isbn><isbn>1467348287</isbn><isbn>9781467348287</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkM1KxDAURiMqOI7zAOImL9B6b5J2kuVQ_BkY0EX3Q5qb0monLU1Q-vYiDrj6OItzFh9j9wg5IpjHfVVXuQAUeSl1udV4wW5RlVuptNiay38wxRVbCSxFhkLKG7aJ8QMAJGptpF6x9_1psi7xseVhJJ9FP7R97IKPkY-Bp85zN4bgXeq_-rRwG4hPNnWc_GCXX21HWTc6Hnz6HufPeMeuWztEvznvmtXPT3X1mh3eXvbV7pD1BlJmvQCjWtdAY8lpcEqRIwFWO6LWFkqBdoqsbKRDCYgaS1Uog0RUSFJyzR7-sr33_jjN_cnOy_F8hvwBrA1RnA</recordid><startdate>201210</startdate><enddate>201210</enddate><creator>Li Feng</creator><creator>Qinghai Yang</creator><creator>Fenglin Fu</creator><creator>Kyung Sup Kwak</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201210</creationdate><title>Impact of node-selfishness on the connectivity and path delay of Ad-hoc networks</title><author>Li Feng ; Qinghai Yang ; Fenglin Fu ; Kyung Sup Kwak</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-ae2094fcb0badc80c44dcd20a8cddfa54408c4da3b3c1301181645491ddd53d43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Ad hoc networks</topic><topic>connectivity</topic><topic>Delay</topic><topic>Educational institutions</topic><topic>Games</topic><topic>minimum path delay</topic><topic>percolation theory</topic><topic>Propagation delay</topic><topic>Reliability</topic><topic>Selfish nodes</topic><topic>Wireless communication</topic><toplevel>online_resources</toplevel><creatorcontrib>Li Feng</creatorcontrib><creatorcontrib>Qinghai Yang</creatorcontrib><creatorcontrib>Fenglin Fu</creatorcontrib><creatorcontrib>Kyung Sup Kwak</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Li Feng</au><au>Qinghai Yang</au><au>Fenglin Fu</au><au>Kyung Sup Kwak</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Impact of node-selfishness on the connectivity and path delay of Ad-hoc networks</atitle><btitle>2012 International Conference on ICT Convergence (ICTC)</btitle><stitle>ICTC</stitle><date>2012-10</date><risdate>2012</risdate><spage>66</spage><epage>70</epage><pages>66-70</pages><issn>2162-1233</issn><isbn>1467348295</isbn><isbn>9781467348294</isbn><eisbn>1467348279</eisbn><eisbn>9781467348270</eisbn><eisbn>1467348287</eisbn><eisbn>9781467348287</eisbn><abstract>We investigate the impact of the node-selfishness on the network connectivity and the path delay of information dissemination in large scale Ad-hoc networks based on the percolation theory. A network framework with links obeying stationary process is conceived by combining the effects of both node-selfishness and link qualities. The existence of the node cooperation probability boundary is proved when the network density exceeds a value. The network presents two connection characteristics with respect to this boundary. The minimum path delay is asymptotically independent of the source-destination distance when the node cooperation probability exceeds this boundary. While the node cooperation probability is below the boundary, the minimum path delay scales linearly with the source-destination distance. Simulation results verify the theoretical analysis.</abstract><pub>IEEE</pub><doi>10.1109/ICTC.2012.6386781</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2162-1233 |
| ispartof | 2012 International Conference on ICT Convergence (ICTC), 2012, p.66-70 |
| issn | 2162-1233 |
| language | eng |
| recordid | cdi_ieee_primary_6386781 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Ad hoc networks connectivity Delay Educational institutions Games minimum path delay percolation theory Propagation delay Reliability Selfish nodes Wireless communication |
| title | Impact of node-selfishness on the connectivity and path delay of Ad-hoc networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T11%3A36%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Impact%20of%20node-selfishness%20on%20the%20connectivity%20and%20path%20delay%20of%20Ad-hoc%20networks&rft.btitle=2012%20International%20Conference%20on%20ICT%20Convergence%20(ICTC)&rft.au=Li%20Feng&rft.date=2012-10&rft.spage=66&rft.epage=70&rft.pages=66-70&rft.issn=2162-1233&rft.isbn=1467348295&rft.isbn_list=9781467348294&rft_id=info:doi/10.1109/ICTC.2012.6386781&rft_dat=%3Cieee_6IE%3E6386781%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1467348279&rft.eisbn_list=9781467348270&rft.eisbn_list=1467348287&rft.eisbn_list=9781467348287&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6386781&rfr_iscdi=true |