Exploiting model independence for parallel PCS network simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
A Sleep-Awake Protocol for Information Propagation in Smart Dust Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Towards realistic mobility models for mobile ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Energy Efficient Protocols for Sensing Multiple Events in Smart Dust Networks
ANSS '04 Proceedings of the 37th annual symposium on Simulation
ANSS '04 Proceedings of the 37th annual symposium on Simulation
Modeling and Evaluation of the Effect of Obstacles on the Performance of Wireless Sensor Networks
ANSS '06 Proceedings of the 39th annual Symposium on Simulation
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Simple and efficient geographic routing around obstacles for wireless sensor networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Efficient and robust data dissemination using limited extra network knowledge
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Real-world environment models for mobile network evaluation
IEEE Journal on Selected Areas in Communications
Near-optimal data propagation by efficiently advertising obstacle boundaries
Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We propose a simple obstacle model to be used while simulating wireless sensor networks. To the best of our knowledge, this is the first time such an integrated and systematic obstacle model for these networks has been proposed. We define several types of obstacles that can be found inside the deployment area of a wireless sensor network and provide a categorization of these obstacles based on their nature (physical and communication obstacles, i.e. obstacles that are formed out of node distribution patterns or have physical presence, respectively), their shape and their change of nature over time. We make an eXtension to a custom-made sensor network simulator (simDust) and conduct a number of simulations in order to study the effect of obstacles on the performance of some representative (in terms of their logic) data propagation protocols for wireless sensor networks. Our findings confirm that obstacle presence has a significant impact on protocol performance, and also that different obstacle shapes and sizes may affect each protocol in different ways. This provides an insight into how a routing protocol will perform in the presence of obstacles and highlights possible protocol shortcomings. Moreover, our results show that the effect of obstacles is not directly related to the density of a sensor network, and cannot be emulated only by changing the network density.