Combined hybrid routing algorithm for WPAN

Abstract

Wireless sensor/actuator networks (“sensornets”) represents a new computing class consisting of large number of nodes which are often embedded in their distributed operating environments. The emergence of this new computing class raises many system design challenges. One of the major challenges is to develop a very lightweight routing protocol which can run on this low powered, low memory equipped tiny devices. Traditional routing algorithm such as DV, AODV, Link-State, Dijkstra etc requires routing table along with other data structure which is not suitable in the case of sensornets. ZigBee alliance has proposed a routing protocol which works on mathematical formula and consumes less resources but it has limitation on network breadth depth etc. We addressed network depth problem in our paper “Address Borrowing in Wireless Personal Area Network” [1], addressed network breadth problem in our papers “Single Level Address Reorganization In Wireless Personal Area Network” [2] & “Multilevel Address Reorganization Type 2 I N Wireless Personal Area Network”[3]. Similarly we tried to tackle linear network problem in our paper “WPAN Routing Using Huffman Technique” [4]. We have addressed link failure problem of dynamic network in our paper “Multi Channel Personal Area Network (MCPAN) Formation and Routing” [5]. Now here in this paper we will discuss about a routing framework which can be applied in any operating space. It uses all the techniques discussed so far in above mentioned papers. In real world almost all the operating space is asymmetric in nature.