摘要
Timeefficiencyofkeyestablishmentandupdateisoneofthemajorproblemscontributorykeymanagementsstrivetoaddress.Toachievebettertimeefficiencyinkeyestablishment,weproposeaLocation-basedHuffman(L-Huffman)scheme.First,usersareseparatedintoseveralsmallgroupstominimizecommunicationcostwhentheyaredistributedoverlargenetworks.Second,bothuser'scomputationdifferenceandmessagetransmissiondelayaretakenintoconsiderationwhenHuffmancodingisemployedtoformingtheoptimalkeytree.Third,thecombinedweightsinHuffmantreearelocatedinahigherplaceofthekeytreetoreducethevarianceoftheaveragekeygenerationtimeandminimizethelongestkeygenerationtime.SimulationsdemonstratethatL-HuffmanhasmuchbetterperformanceinwideareanetworksandisalittlebetterinlocalareanetworkthanHuffmanscheme.
出版日期
2009年02月12日(中国期刊网平台首次上网日期,不代表论文的发表时间)