Resource limitations of sensor nodes in wireless sensor networks (WSN) bound the performance on its implementations. Main\r\nconcern becomes utilizing these limited resources (CPU, memory, bandwidth, battery) as efficient as possible. Their efficiency is\r\nmostly affected by the applied routing algorithm, which carries gathered data to inclined/intended destinations. In this paper, a\r\nnovel routing algorithm, stateless weight routing (SWR), is proposed. The SWR differs from other protocols in many ways. Major\r\nfeature of the SWR is its simplicity. It is a completely stateless protocol without requiring any network or neighborhood information\r\nfor routing. This feature decreases packet transmissions and energy consumption dramatically. For reliability, data flows to the\r\nsink node overmultiple paths.Moreover, nodes have the ability of recovering from voids. Nodes process each packet independently\r\nand apply an adaptive approach according to the current conditions. These mechanisms are part of the applied simple routing algorithm,\r\nthe SWR. The resultant of these features assures flexibility and smartness at nodes and in the network. Therefore, topological\r\nchanges have a little effect on data packet transmissions. Performance evaluation of the proposed approach shows that the SWR is\r\nscalable forWSNs whose topology change instantly and frequently as well as remain stationary.
Loading....