期刊名称：International Journal of Computer Science and Engineering Communications
电子版ISSN：2347-8586
出版年度：2015
期号：3910
页码：1047-1051
出版社：Scientist Link Group of Publications
摘要：Wireless sensor Network is designed to deal with the intermittent connectivity among mobile nodes due to mobility and it is used to reduce the energy consumption of nodes and to prevent the formation of energy holes. In Order to improve the quality of the Service of the system , we need to obtain best optimal path through the query node however, these benefits are dependent on the path taken by the mobile sink, particularly in delay-sensitive applications, as all sensed data must be collected within a given time constraint. An approach proposed to address this challenge is to form a hybrid moving pattern in which a mobile-sink node only visits rendezvous points (RPs), as opposed to all nodes. Sensor nodes that are not RPs forward their sensed data via multihopping to the nearest RP. The fundamental problem then becomes computing a tour that visits all these RPs within a given delay bound. Identifying the optimal tour, however, is an NP-hard problem. To address this problem, a heuristic called weighted rendezvous planning (WRP) is proposed, whereby each sensor node is assigned a weight corresponding to its hop distance from the tour and the number of data packets that it forwards to the closest RP.
