Abstract

Broadcasting is a fundamental operation in any wireless networks, more so in wireless ad hoc sensor networks, where each sensor node has limited transmission range as well as battery power. Although broadcasting in wireless ad hoc sensor networks has many advantages but it can cause serious problems like-broadcast storm, which could cause a lot of contention, redundant retransmission, collision and most importantly, drain immense amount of energy from limited battery powered sensor nodes. In this work, our objective is to reduce the number of retransmission and energy consumption of sensor nodes by using the duty cycle property of wireless ad hoc sensor networks. We propose a preamble-based broadcasting technique for wireless ad hoc sensor networks. We show that in dense wireless ad hoc sensor networks a small size preamble can give maximum network-wide data dissemination rather than using the large preamble, which will only consume immense amount of energy during packet reception.

Highlights

  • Wireless ad hoc sensor networks are a set of wireless sensor nodes which communicate with each other without any pre-existing routing infrastructure for communication, and mostly rely on their neighbor nodes to relay their data up to the destination node instead of directly communicating with the destination node or sink

  • Broadcasting is a fundamental operation in any wireless networks, more so in wireless ad hoc sensor networks, where each sensor node has limited transmission range and battery power

  • Broad-casting in wireless ad hoc sensor networks has many advantages but it can cause serious problems like—broadcast storm, which could cause a lot of contention, redundant, retransmission, collision and most importantly, drain immense amount of energy from limited battery powered sensor nodes

Read more

Summary

Introduction

Wireless ad hoc sensor networks are a set of wireless sensor nodes (mobile or static) which communicate with each other without any pre-existing routing infrastructure for communication, and mostly rely on their neighbor nodes to relay their data up to the destination node instead of directly communicating with the destination node or sink These sensor nodes have several resource constraints such as limited memory, battery power, and signal processing, computational and communication capabilities. It consumes most of the network resources as a large number of duplicate packets flooded repeatedly This can leads to serious redundancy, contention and collision in any wireless network and is referred as the “broadcast storm problem” [4]. In the counter-based scheme, a host will drop the packet if the number of duplicates received crosses a threshold. An alternate classification of broadcasting techniques found in [5] has four categories: simple flooding, probability-based, area-based, and neighbor knowledge-based schemes

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call