抽象的移动广告特设 networkistypicallycharacterized（ abstract a mobile ad hoc networkistypicallycharacterized）.docVIP

下载本文档

2
0
约1.9万字
约 6页
2017-01-10 发布于湖南
举报
版权申诉

抽象的移动广告特设 networkistypicallycharacterized（ abstract a mobile ad hoc networkistypicallycharacterized）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Bandwidth Optimization by Reliable-Path Determination in Mobile Ad-Hoc Networks Sriram Raghavan, Srikanth Akkiraju, Santhosh Sridhar, Dr. V Vaidehi*, Dr. Srikanth** *Department of Electronics, **AU-KBC Research Center, Madras Institute of Technology, Anna University, Chennai, India 600 044 *vaidehi@mail.mitindia.edu Abstract: A Mobile Ad Hoc Network is typically characterized by two sets of nodes, one set being more stationary than the other. It is observed that identifying this set of relatively stationary nodes critically facilitates the dual purpose of reducing the routing overhead and providing larger data bandwidth. It is therefore both interesting and expedient to study the behavior of a typical Mobile Ad Hoc Network and identify the sub-graph, which can impact these improvements where the application demands are high. It is particularly enlightening when scaled to a larger network, as one of the substantial factors affecting cost in an Ad Hoc network is the routing overhead. In this paper, a method is proposed to determine, dynamically, the most reliable path for routing in a Mobile Ad Hoc scenario and ensure that packets are routed along that path to guarantee enhanced data traffic routed per unit time owing to savings from route-discovery and to decrease normalized routing overhead. The Mobile Ad Hoc Network is modeled as a graph with the mobile units denoting the nodes of the graph and the set of reachable units as its neighbors and identifying the weakly connected sub-dominion of that graph, which is the most reliable path for routing. The propose algorithm recognizes those set of weakly connected nodes which are relatively stable when compared to other nodes hence requiring less routing and thus resulting in more number of data packets and ensuring better bandwidth utilization. Our algorithm proposes and confirms the dual betterments namely improvement in the utilization of bandwidth and reduction in the normalized routing overhead in any given