GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
An analysis of a large scale habitat monitoring application
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Revisiting the lifetime of wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Proceedings of the 3rd international conference on Embedded networked sensor systems
Connectivity in wireless ad-hoc networks with a log-normal radio model
Mobile Networks and Applications
On traffic load distribution and load balancing in dense wireless multihop networks
EURASIP Journal on Wireless Communications and Networking
Effect of jamming signals on wireless ad hoc and sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Maximizing throughput with multiple power levels in a random access infrastructure-less radio system
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Wireless Personal Communications: An International Journal
Computers & Mathematics with Applications
Hi-index | 0.01 |
The energy expended by sensor nodes in data communication makes up a significant quantum of their total energy consumption. Consequently, a mathematical model that can accurately predict the communication traffic load of a sensor node is critical for designing efficient sensor network protocols. In this paper, we present an analytical model for estimating the per-node traffic load in a multi-hop wireless sensor network. We consider a typical scenario wherein, the sensor nodes periodically sense the environment and forward the collected samples to a sink using greedy geographic routing. The analysis incorporates the idealistic circular coverage radio model as well as a realistic model, log-normal shadowing. Our results confirm that irrespective of the radio model, the traffic load generally increases as a function of the node's proximity to the sink. However, in the immediate vicinity of the sink, the two radio models yield quite contrasting results. The ideal radio model reveals the existence of a volcano region near the sink, where the traffic load drops significantly. On the contrary, with the log-normal shadowing model, the opposite effect is observed, wherein the traffic load actually increases at a much higher rate as one approaches the sink, resulting in the formation of a mountain peak. The results from our analysis are validated by extensive simulations.