Simulating Classic Flooding Protocol to Minimize Redundancy in Large Scale Wireless Sensor Networks

Technological developments in the state of art for integrated circuit design have enforced computational devices to become smaller, faster and cheaper. In wireless communication a networking technique, "Wireless Sensor Networks" (WSNs), is currently under tremendous research and has drawn much attention from researchers and users in the recent decade. WSN provides several scopes for users and major challenges for researchers as such networks are used in applications that includes target tracking, monitoring of traffic, habitat, seashore and radiation levels from nuclear reactors, besides this the task of detecting seismic activities and enemy spotting can also be accomplished. These applications are critical and also user specific. The deployment and placement of sensor nodes to form a wireless sensor network bears vital importance, since the node placement or deployment requires serious computational efforts along with lot of resources constraints. The effective functioning of the constructed sensor network also relies on routing protocols, associated algorithms and concerned architecture. This paper outlines a basic approach towards random placement of sensor nodes and the associated transmit and receive count in an assigned area comparative results are evaluated and simulation is perform using Snetsim, an event driven simulator, available as open source.