ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Performance Study of Node Placement in Sensor Networks
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
IEEE Transactions on Mobile Computing
Performance study of node placement for congestion control in wireless sensor networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Covering Points of Interest with Mobile Sensors
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Wireless Sensor Networks (WSN) are composed of constrained devices and deployed in unattended and hostile environments. Most papers presenting solutions for WSN evaluate their work over random topologies to highlight some of their "good" performances. They rarely study these behaviors over more than one topology. Yet, the topology used can greatly impact the routing performances. This is what we demonstrate in this paper. We present a study of the impact of network topology on algorithms performance in Wireless Sensor Networks and illustrate it with geographic routing. Geographic routing is a family of routing algorithms using nodes coordinates to route data packet from source to destination. We measure the impact of different network topologies from realistic ones to regular and unrealistic ones through extensive simulations. Studied algorithms are common geographic greedy algorithms with different heuristics from the literature. We show that different topologies can lead to a difference of up to 25% on delivery ratio and average route length and more than 100% on overall cost of transmissions.