Dynamic Team Formation on Team-Oriented Multicast对团队为导向的多播动态团队的形成.ppt

下载文档 降价啦

2
0
约5.32千字
约 21页
2018-06-24 发布于北京
举报
版权申诉
保障服务

Dynamic Team Formation on Team-Oriented Multicast对团队为导向的多播动态团队的形成.ppt

1、本文档共21页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

Dynamic Team Formation on Team-Oriented Multicast对团队为导向的多播动态团队的形成

Dynamic Team Formation on Team-Oriented Multicast Yiguo Wu and Siavosh Bahrami Tutor: Yunjung Yi Outline LANMAR Previous work: Dynamic team formation Our modified dynamic team formation protocol Preliminary results Discussion LANMAR MANET challenge: scalable routing Hierarchical Routing Protocol Assumption: “group affinity model” Benefit: scalable routing Limitation: assumes logical subnets known in advance Dynamic Team Formation Xiaoyan Hong ,Mario Gerla, Dynamic Group Discovery and Routing in Ad Hoc Networks, In Proceedings of Med-Hoc-Net 2002. No subnet assumption Two Phases: Phase 1) Initialization: traveling companion discovery, K-Hop clustering (connectivity, lowest ID, heuristics), and initial elections Phase 2) Maintenance: Hysteresis rule for stable landmark election Phase 1 stability issue? Stability Problem Confirmation Advertisement Protocol Algorithm Details:Routing Table Exchange Exchange local routing tables with direct neighbors periodically How frequently should we exchange local routing tables? Protocol Algorithm Details:Companion Identification Identify Companions Routing Table entry not “stale” Has been present in local routing table for at least time t (avoid roaming nodes) Protocol Algorithm Details:Election Elect Clusterhead Lowest ID Companion Pros: Stable Simple Fast Cons: Most likely not close to the minimum dominating set (optimal), i.e. many small clusters that may require further merging Note: in current implementation, every election is independent of the previous one raising stability issues (add maintenance heuristics?) Protocol Algorithm Details: Close Proximity Merge Small cluster problem - Clusters overlap each other Solution: Low Cost Merging - Observation: If landmarks can see each other directly, then their corresponding clusters overlap. - Action: Merge them ! Protocol Algorithm Details:Confirmation Advertise Confirmation Tentatively elected node can “respond” in 2 ways: If it is its own landmark, or has not