自私性机会网络中激励感知的内容分发的研究

doi:10.3969/j.issn.1000-436x.2013.02.009

Abstract

Abstract:

A reciprocal incentive scheme named RIS was proposed,which could create win-win situation for the internet service provider,A type nodes and B type nodes.When RIS was deployed in a selfish opportunistic network,how these selfish nodes select data objects for their limited buffer to maximize their revenue was analyzed.Furthermore,the effect of the scope of network information the nodes maintain on the selection of stored data objects for their buffer was revealed.Extensive trace-driven simulations using MIT trace were carried out to evaluate the data dissemination performance when all nodes were trying to maximize their revenue during the process of data dissemin ion.The results demonstrate that after deploying this incentive scheme,the average receiving rate of each channel rises by 18%,and the average receiving delay of each channel was reduced 4.83 days.Moreover,B type nodes only need to pay less for each subscribed data object.The simulation results also show that the larger scope of network information nodes maintain,the better performance RIS can achieve.

Key words: opportunity network, selfishness, incentive mechanism, channel

Guang-song ZHAO,Ming CHEN. Research of incentive-aware data dissemination in selfish opportunistic networks[J]. Journal on Communications, 2013, 34(2): 73-84.

Figures/Tables 13

References 32

[1]	PELUSI L , PASSARELLA A , CONTI M . Opportunistic network ng:data forwarding in disconnected mobile ad hoc networks[J]. IEEE Comm Magazine, 2006,44(11):134-141.
[2]	FALL K . A delay-tolerant network architecture for challenged internets[A]. Proc of SIGCOMM[C]. 2003.27-34.
[3]	VAHDAT A , BECKER D . Epidemic Routing for Partially Connected Ad Hoc Networks[R]. CS-200006,Duke University, 2000.
[4]	LINDGREN A , DORIA A , SCHELEN O . Probabilistic routing n intermittently connected networks[A]. Proc SAPIR[C]. 2004.
[5]	SPYROPOULOS T , PSOUNIS K , RAGHAVENDRA C S . Efficient routing in intermittently connected mobile networks:the multiple-copy case[J]. IEEE/ACM Trans on Network, 2008,16(1):77-90.
[6]	DALY E , HAAHR M . Social network analysis for routing in disconnected delay-tolerant MANETs[A]. Proc of the MobiHoc 2007[C]. Montreal: ACM Press, 2007.32-40.
[7]	JUANG P , OKI H , WANG Y , et al. Energy efficient computing for wildlife tracking:design tradeoffs and early experiences with ZebraNet[A]. Proceedings of the 10th Int’l Conference on Architectural Support for Programming Languages and Operating Systems[C]. New York: ACM,USA, 2002.96-107.
[8]	MOTANI M , SRINIVASAN V , NUGGEHALLI P . PeopleNet:engineering a wireless virtual social network[A]. Proc MobiCom[C]. 2005. 243-257.
[9]	HUI P , CHAINTREAU A , SCOTT J ,et al. Pocket switched networks and human mobility in conference environments[A]. SIGCOMM Workshops[C]. 2005.
[10]	BOLDRINI C , CONTI M , PASSARELLA A . ContentPlace:social-aware data dissemination in opportunistic networks[A]. Proceedings of MSWiM[C]. 2008. 203-210.
[11]	YONEKI E , HUI P , CHAN S . A socio-aware overlay for publish/subscribe communication in delay tolerant networks[A]. Proceedings of the 10th ACM Symposium on Modeling,Analysis,and Simulation of Wireless and Mobile Systems (MSWiM ’07)[C]. New York,NY,USA, 2007. 225-234.
[12]	BOLDRINI C , CONTI M , PASSARELLA A . Context and resource awareness in opportunistic network data dissemination[A]. Proc of IEEE AOC[C]. 2008.
[13]	HUANG Y , GARCIA-MOLINA H . Publish/subscribe in a mobile environment[A]. Proceedings of the 2nd ACM International Workshop on Data Engineering Wireless and Mobile Access (MobiDE’01)[C]. 2001. 27-34.
[14]	DEMMER M , FALL K , KOPONEN T ,et al. Towards a modern communications API[A]. Proceedings of the 6th Workshop on Hot Topics in Networks (HotNets-VI)[C]. Atlanta,GA, 2007.
[15]	LENDERS V , KARLSSON G , MAY M . Wireless ad hoc podcasting[A]. Proc of IEEE SECON[C]. 2007.
[16]	PANAGAKIS A , VAIOS A , STAVRAKAKIS I . On the effects of cooperation in DTNs[A]. Proc COMSWARE[C]. 2007. 1-6.
[17]	LI Q , ZHU S , CAO G . Routing in socially selfish delay tolerant networks[A]. Proc IEEE INFOCOM[C]. 2010. 1-9.
[18]	RESTA G , SANTI P . The effects of node cooperation leve on routing performance in delay tolerant networks[A]. Proc IEEE SECON[C]. 2009. 1-9.
[19]	SHEVADE U , SONG H , QIU L ,et al. Incentive-aware routing in DTNs[A]. Proc IEEE ICNP[C]. 2008. 238-247.
[20]	CHEN B , CHAN M C . MobiCent:a credit-based incentive system for disruption tolerant network[A]. Proc of INFOCOM[C]. 2010. 1-9.
[21]	PAPADOPOULI M , SCHULZRINNE H . Effects of power conservation,wireless coverage and cooperation on data dissem nation among mobile devices[A]. Proc ACM MobiHoc[C]. 2001.
[22]	COSTA P , MASCOLO C , MUSOLESI M ,et al. Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoe networks[J]. IEEE Journal of Selected Areas in Communication, 2008,26(5): 748-760.
[23]	GREIFENBERG J , KUTSCHER D . Efficient publish/subscribe-based multicast for opportunistic networking with self-organized resource utilization[A]. Proceedings of the 22nd International Conference on Advanced Information Networking and Applications Workshops[C]. Washington,DC,USA, 2008. 1708-1714.
[24]	NING T , YANG Z P , XIE X J ,et al. Incentive-aware data dissemination in delay-tolerant mobile networks[A]. SECON[C]. 2011. 539-547.
[25]	DAWANDE M , KALAGNANAM J , KESKINOCAK P ,et al. Approximation algorithms for the multiple knapsack problem with assignment restrictions[J]. Journal of Combinatorial Optimization, 2000,4: 171-186.
[26]	IOANNIDIS S , CHAINTREAU A , MASSOULIE L . Optimal and scalable distribution of content updates over a mobile social network[A]. Proc INFOCOM[C]. 2009.
[27]	ROSS S M . Introduction to Probability Models[M]. Academic Press, 2006.
[28]	HSU W , HELMY A . On nodal encounter patterns in wireless LAN traces[A]. Proc WiNMee’06(2006),IEEE[C]. 2006.
[29]	DONG Z B , SONG G J , XIE K Q ,et al. An experimental study of large-scale mobile social network[A]. 18th int World Wide Web Conference (WWW2009)[C]. USA, 2009.
[30]	MILGRAM S . The small world problem[J]. Psychology Today, 1967,1(1): 60-67.
[31]	EAGLE N , PENTLAND A , LAZER D . Inferring friendship network structure by using mobile phone data[A]. Proceedings of the National Academy of Sciences[C]. 2009. 15274-15278.
[32]	CONAN V , LEGUAY J , FRIEDMAN T . Characterizing pairwise intercontact patterns in delay tolerant networks[A]. Proceedings of the 1st Int’l Conf on Autonomic Computing and Communicatio Systems[C]. 2007.

Metrics

Recommended 0

No Suggested Reading articles found!

Research of incentive-aware data dissemination in selfish opportunistic networks

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 13

References 32

Related Articles 15

Metrics

Recommended 0

[1]	Zhen ZHENG, Yingjian YAN, Juesong CAI, Yanjiang LIU. Non-specific TVLA method based on two-sample KS test [J]. Journal on Communications, 2023, 44(5): 137-147.
[2]	Youliang TIAN, Shihong WU, Ta LI, Lindong WANG, Hua ZHOU. Federated learning optimization algorithm based on incentive mechanism [J]. Journal on Communications, 2023, 44(5): 169-180.
[3]	Ming TANG, Yifan HU. Load-to-store: exploit the time leakage of store buffer transient window [J]. Journal on Communications, 2023, 44(4): 64-77.
[4]	Xiaobei ZHANG, Quan ZHANG, Ming FANG, Kun QIN, Qi ZHANG. Research on channel-fixed delay error estimation of wideband digital array radar [J]. Journal on Communications, 2023, 44(3): 24-32.
[5]	Wei CUI, Ying YU, Haixia YU, Chao CHEN, Yunpeng LI. Sparse channel fast reconstruction algorithm for OFDM system based on IOC-CSMP [J]. Journal on Communications, 2023, 44(2): 52-58.
[6]	Guojun LI, Cuiling XIANG, Changrong YE, Zunli WANG. Fast link-establishment method of integrated of communication and detection based on short-wave digital channelization [J]. Journal on Communications, 2023, 44(1): 89-102.
[7]	Leixiao LI, Jinze DU, Hao LIN, Haoyu GAO, Yanyan YANG, Jing GAO. Research progress of blockchain network covert channel [J]. Journal on Communications, 2022, 43(9): 209-223.
[8]	Rong ZENG, Xiao HANG. Reconfigurable intelligent surface assist wireless channel estimation algorithm in Internet of vehicles environment [J]. Journal on Communications, 2022, 43(8): 142-150.
[9]	Xin SONG, Shuyan NI, Zhe ZHANG, Yurong LIAO, Tuofeng LEI. Low error floor LT coding algorithm for unequal error protection [J]. Journal on Communications, 2022, 43(6): 85-97.
[10]	Pan TANG, Jiaxin LIN, Jianhua ZHANG, Lei TIAN, Zhaowei CHANG, Liang XIA, Qixing WANG. Research on reflection characteristics of the terahertz channel for 6G [J]. Journal on Communications, 2022, 43(5): 102-109.
[11]	Tuofeng LEI, Shuyan NI, Naiping CHENG, Xin SONG. SCMA codebooks design for Rayleigh fading channel [J]. Journal on Communications, 2022, 43(4): 107-113.
[12]	Fenghua LI, Chaoyang LI, Chao GUO, Zifu LI, Liang FANG, Yunchuan GUO. Survey on key technologies of covert channel in ubiquitous network environment [J]. Journal on Communications, 2022, 43(4): 186-201.
[13]	Lei LANG, Jingning WANG, Yi WANG, Zitao ZHAO. Radio resource and trajectory optimization for UAV assisted communication based on user route [J]. Journal on Communications, 2022, 43(3): 225-232.
[14]	Yao WANG, Xiang WANG, Guodong YANG, Zhitao HUANG. Recognition algorithm of non punctured polarization codes based on structural characteristics of coding matrix [J]. Journal on Communications, 2022, 43(2): 22-33.
[15]	Haixia LIU, Hao YI, Xiangjin MA, Shuyao YUE, Xudong KONG, Pei MA, Yuxin ZENG, Long LI. Indoor wireless signal coverage and enhancement based on passive reconfigurable intelligent metasurface [J]. Journal on Communications, 2022, 43(12): 32-44.