简介：Timeefficiencyofkeyestablishmentandupdateisoneofthemajorproblemscontributorykeymanagementsstrivetoaddress.Toachievebettertimeefficiencyinkeyestablishment,weproposeaLocation-basedHuffman(L-Huffman)scheme.First,usersareseparatedintoseveralsmallgroupstominimizecommunicationcostwhentheyaredistributedoverlargenetworks.Second,bothuser'scomputationdifferenceandmessagetransmissiondelayaretakenintoconsiderationwhenHuffmancodingisemployedtoformingtheoptimalkeytree.Third,thecombinedweightsinHuffmantreearelocatedinahigherplaceofthekeytreetoreducethevarianceoftheaveragekeygenerationtimeandminimizethelongestkeygenerationtime.SimulationsdemonstratethatL-HuffmanhasmuchbetterperformanceinwideareanetworksandisalittlebetterinlocalareanetworkthanHuffmanscheme.