Abstract
Among routing protocols of wireless sensor networks, hierarchical routing protocols are more efficient, in general, because they involve less sensor nodes for data transmission. However, when events happen regionally and dynamically, unnecessary overheads occur in hierarchical routing protocols. In this paper, we propose a regional cell routing protocol to overcome the overheads of conventional hierarchical routing protocols: The protocol organizes cells with sensor nodes which have sensed similar events and it selects representative nodes in the cells. The representative nodes collects data in the cells and then the nodes compress data and deliver them to the sink node. Our simulation results show that the proposed routing protocol has improved its performance in terms of energy and latency by comparing with other routing protocols of wireless sensor networks.
Sign-in/Register to access full text options 
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
