Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
The algorithmic beauty of plants
The algorithmic beauty of plants
Learning-Enforced Time Domain Routing to Mobile Sinks in Wireless Sensor Fields
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Adaptive sink mobility in event-driven multi-hop wireless sensor networks
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
Mobile Element Scheduling with Dynamic Deadlines
IEEE Transactions on Mobile Computing
Sink repositioning for enhanced performance in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
There are 2 well-known ways to optimize energy efficiency in wireless sensor networks (WSN). The first one is to deploy multiple sinks in wireless sensor networks to balance the energy consumption among the wireless sensor nodes. The second technique is to move the sink navigating through wireless sensor network to redirect traffic flow while gathering sensed data timely and efficiently. Both ways will try to reduce the famous bottleneck problem that cause wireless sensor nodes energy nearest to base station depleted very quickly. We evaluated the performance of wireless sensor network using minimum spanning tree algorithm specifically Prim's Algorithm in order to know the bottleneck effect on wireless sensor network and propose a better solution performance based on Fermat Spiral model. We show that such a solution reduces the bottleneck problem, increases the energy efficiency of the network and produces greater data transmission throughput.