透過您的圖書館登入
IP:3.147.45.90
  • 期刊
  • OpenAccess

An Efficient Algorithm for Conflict Free Address Auto Configuration in Self Configurable Networks

並列摘要


Evolution of self configurable networks posses unpredictable challenges which are not faced by the traditional wireless networks. No standard solutions are available in the literature to overcome these problems. Due to faster growing field and importance of these networks we cannot ignore the challenges imposed by the networks. Self configurable networks like Adhoc network, wireless sensor network and mesh network, they are in just evolution phases. In Adhoc networks nodes are capable to form a temporary network dynamically without the support of any centralized infrastructure. They are highly cooperative nodes. In WSN networks are formed to fulfil the spatial requirement. And mesh network is more complicated than any other network. Address auto-configuration of nodes is an important issue on self-organizing networks and discussed very little by the researchers. In this study we have discussed about the issues and challenges for the address auto configuration problems in various situations in the self configurable networks and considering delay, throughput, route discovery time, route request time as important factors we have proposed a novel and an efficient algorithm for conflict free address auto configuration in self configurable networks.

延伸閱讀