- 1、本文档共21页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
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
您可能关注的文档
- Blue and Red Gradient - wickUP - HOME PAGE蓝色和红色的梯度wickup -首页.ppt
- BlueEyes Human-Operator Monitoring Systemblueeyes操作员监控系统.ppt
- Blue and Red Gradient蓝色和红色的梯度.ppt
- BND National Diploma IT Practitioners和国家文凭的IT从业人员.ppt
- Bohr ModelAtomic Spectra玻尔modelatomic谱.ppt
- Body Planes, Directions, and Cavities - Swcsus体层,方向,和型腔的swcsus.ppt
- Blessed Assurance幸福的保证.ppt
- Botnets, detection and mitigation DNS-based techniques:僵尸网络的基础技术,检测和缓解DNS.ppt
- Boll Weevil CaptureRecognition Device - Course Website …棉子象鼻虫capturerecognition设备课程网站….ppt
- Boundary Conditions - worldcollegesinfo:边界条件worldcollegesinfo.ppt
最近下载
- 1信息安全概述 .pptx VIP
- 2023年06月贵州省毕节市七星关区纪委区监委所属事业单位面向全区公开考调10名工作人员笔试题库含答案解析.docx VIP
- 糖尿病相关试题 答案糖尿病相关试题 附答案.doc VIP
- 社会工作实务(初级)考试重点梳理.pdf VIP
- XFT 635-2023 消防用红外热像仪.pdf VIP
- 医务人员职业道德医德医风培训动态PPT模板.pptx VIP
- IEEE C57.12.52-2012 国外国际标准.pdf VIP
- ups放电测试报告.docx VIP
- 儿童IgE介导食物过敏诊断和管理专家共识(2024)PPT课件.pptx VIP
- 大金空调接线及地址设定.pdf
文档评论(0)