文章基本信息

标题：Wireless Networks Range of Node Communication Is Equal to Radius of Node at Centred Disk
本地全文：下载
作者：M.Sudha ; B.Saravanan
期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2017
卷号：6
期号：12
页码：22514
DOI：10.15680/IJIRSET.2017.0612054
出版社：S&S Publications
摘要：Graph theory is one of the basic tool for analysing computer networks such as wireless mesh network,Adhoc network, sensor networks. Conventional graph theory is not accurately describe the node and link of wirelessnetwork so it is not used for modern complex wireless networks and also the random graph and weighted graph theorynot clearly illustrate the properties of wireless networks. To overcome these problem a new idea is developed, that iscalled Polychromatic set. In this paper, I introduced the concept of Polychromatic set theory for describing the nodeand link in wireless network for efficient routing scheme. The estimation result shows it is simple, effective. Theperformance is better compare than any other conventional routing method. It can be achieved by ns-2 simulator.
关键词：weighted graph; Conventional graph; Polychromatic sets; Routing; wireless ad hoc networks.