PReSENt: A Collaboration Framework for Resource Sharing in Wireless Mesh Networks

被引:1
作者
Kim, Hwangnam [1 ]
Kim, E-yong [2 ]
机构
[1] Korea Univ, Sch Elect Engn, Seoul 136713, South Korea
[2] Samsung Elect, Suwon 443742, Gyeonggi Do, South Korea
关键词
Network architecture and design; wireless communication; wireless mesh networks; SERVICE DIFFERENTIATION;
D O I
10.1109/TPDS.2008.81
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Many protocol particulars developed for the wireless mesh networks such as multipath routing, channel assignment, topology control, assume that a network-wide collaboration is available to establish connections to the network outside. However, the collaboration can be easily discouraged in the presence of selfish behaviors, referred to as free riding. In this paper, we propose a framework, PReSENt, to promote and make more secure the practices of collaboration among nodes by securing a compensation to the collaboration. When the PReSENt is enabled in wireless mesh networks, a node accumulates credits, an amount quantifying its resource provision when it provides its resource for other nodes. The nodes consuming the resource publish rewards, an amount quantifying their resource usage. The credits are used to guarantee the resource sharing for the provider from the customers in the future, whose amount is proportional to its relative contribution to the network-wide collaboration. The rewards are used to validate their corresponding credits in order to prevent false accumulations of the credits in selfish nodes. We formally define the underlying security model of the PReSENt and prove that the PReSENt is secure in the random oracle model. We then implement the PReSENt in J-Sim to illustrate its operational behaviors with respect to correct and secure resource sharing. The simulation results indicate that the PReSENt correctly encourages and controls the collaboration on resource sharing in wireless mesh networks.
引用
收藏
页码:289 / 302
页数:14
相关论文
共 34 条
[11]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[12]  
Buchegger S, 2002, P 3 ACM INT S MOB AD, P226, DOI DOI 10.1145/513800.513828
[13]   Stimulating cooperation in self-organizing mobile ad hoc networks [J].
Buttyán, L ;
Hubaux, JP .
MOBILE NETWORKS & APPLICATIONS, 2003, 8 (05) :579-592
[14]   Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit [J].
Calì, F ;
Conti, M ;
Gregori, E .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (06) :785-799
[15]  
Cha JC, 2003, LECT NOTES COMPUT SC, V2567, P18
[16]  
Chun BG, 2004, IEEE INFOCOM SER, P1329
[17]  
Fang ZY, 2004, IEEE INFOCOM SER, P1284
[18]  
Feldman M., 2004, EC 04, P102, DOI DOI 10.1145/988772.988788
[19]   Promoting the use of end-to-end congestion control in the Internet [J].
Floyd, S ;
Fall, K .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (04) :458-472
[20]  
Lai K., 2003, P WORKSH EC PEER TO