抽象的

A Movement of Mobile Sink In Wireless Sensor Networks to Conserve Energy

R.Janci Rani, C.Tharanidharan

Energy is the major constraint in wireless sensor network. In multi hop network, which are the nodes located near to sink node consume high energy because of responsible for forwarding data from nodes that are farther away. The battery drained in a short time. In Proposed system, we introduce mobile sinks for data gathering multiple sensors in wireless sensor network. Initially we have to find rendezvous points (RP) in wireless sensor network. An approach proposed to handle this challenge is to make a hybrid moving pattern within which a mobile-sink node solely visits rendezvous points (RPs), as hostile all nodes. Sensor nodes that don't seem to be RPs forward their detected knowledge via multi hopping to the closest RP. The basic drawback then becomes computing a tour that visits of these RPs among a given delay certain. Distinctive the best tour, however, is NP-hard drawback. To handle this drawback, a heuristic known as weighted rendezvous planning (WRP) is projected, whereby every sensing element node is appointed a weight equivalent to its hop distance from the tour and also the variety of information packets that it forwards to the nearest RP. WRP is valid via intensive technique, and our results demonstrate that WRP permits a mobile sink to retrieve all detected knowledge among a given point in time whereas preserving the energy expenditure of sensor nodes. a lot of specifically, WRP reduces energy consumption by twenty second and will increase network life by a quarter mile, as compared with existing algorithms.

免责声明: 此摘要通过人工智能工具翻译,尚未经过审核或验证

索引于

学术钥匙
研究圣经
引用因子
宇宙IF
参考搜索
哈姆达大学
世界科学期刊目录
学者指导
国际创新期刊影响因子(IIJIF)
国际组织研究所 (I2OR)
宇宙

查看更多