Addressing and Routing Scheme for Distributed Systems
First Claim
Patent Images
1. A method for allocating logical address optimally to a device at the time of network association with a wireless communication network system, comprising the steps of:
- calculating the optimum number of router nodes required at any depth ‘
n’
by personal area network controller (PC) based on the configurable parameter ‘
margin’
, ‘
network directionality’ and
‘
directionality factor’
of the network to cover the area fully;
developing a logical address allocation algorithm based on the value of said optimum number of router nodes required at any depth (n) and configurable parameters which includes number of end device (Cm) a router node can have as its child, the number of depth after which again each router node have the opportunity to have configurable number of router nodes as its child and network policy for allocating additional child router node address among the peer nodes;
calculating the number of router nodes and end device nodes said router node can have as its child, based on said address allocation algorithm;
calculating the area, said router node needs to cover, based on neighboring nodes location and its capability information;
receiving beacon frame from all its neighboring router nodes and building neighbor table by unassociated node, wherein neighbor table contains all the information transmitted in beacon frame and required for association procedure along with its approximate distance from said unassociated node;
transmitting an association request by said unassociated nodes containing said neighbor table information to one of said neighboring router node based on its preference which includes signal strength of received beacon, personal area network identity and depth of said router node;
accumulating all the association requests and then processing it by said router node to calculate its approximate location based on the said neighbor table information transmitted as part of association request by said unassociated nodes and said router node'"'"'s own neighbor table information;
finding out number of full function device unassociated nodes said router node can have as its child router nodes within the margin which are relatively equidistant from the neighboring router nodes i.e. it forms the network relatively homogeneous than other possible nodes; and
associating said full function device unassociated nodes which are relatively equidistant from neighboring router nodes as its child router nodes and associating other nodes as its child end device nodes,whereby the network uses the address in optimum manner and enables the network to grow longer, also the data routing is faster since the address is allocated based on the formula, the shortest path can be calculated based on the address allocation formula.
0 Assignments
0 Petitions
Accused Products
Abstract
The embodiments herein relate to distributed systems and more particularly, to logical address allocation and data routing in a distributed systems. A plurality of methods for logical address allocation are disclosed, which the network adapts based on the configurable parameters and the network working environment. Since the nodes are allocated logical address based on the algorithm, while routing the data packet each node calculates the shortest path next hop towards the destination based on the algorithm used for addressing and forward the data.
-
Citations
29 Claims
-
1. A method for allocating logical address optimally to a device at the time of network association with a wireless communication network system, comprising the steps of:
-
calculating the optimum number of router nodes required at any depth ‘
n’
by personal area network controller (PC) based on the configurable parameter ‘
margin’
, ‘
network directionality’ and
‘
directionality factor’
of the network to cover the area fully;developing a logical address allocation algorithm based on the value of said optimum number of router nodes required at any depth (n) and configurable parameters which includes number of end device (Cm) a router node can have as its child, the number of depth after which again each router node have the opportunity to have configurable number of router nodes as its child and network policy for allocating additional child router node address among the peer nodes; calculating the number of router nodes and end device nodes said router node can have as its child, based on said address allocation algorithm; calculating the area, said router node needs to cover, based on neighboring nodes location and its capability information; receiving beacon frame from all its neighboring router nodes and building neighbor table by unassociated node, wherein neighbor table contains all the information transmitted in beacon frame and required for association procedure along with its approximate distance from said unassociated node; transmitting an association request by said unassociated nodes containing said neighbor table information to one of said neighboring router node based on its preference which includes signal strength of received beacon, personal area network identity and depth of said router node; accumulating all the association requests and then processing it by said router node to calculate its approximate location based on the said neighbor table information transmitted as part of association request by said unassociated nodes and said router node'"'"'s own neighbor table information; finding out number of full function device unassociated nodes said router node can have as its child router nodes within the margin which are relatively equidistant from the neighboring router nodes i.e. it forms the network relatively homogeneous than other possible nodes; and associating said full function device unassociated nodes which are relatively equidistant from neighboring router nodes as its child router nodes and associating other nodes as its child end device nodes, whereby the network uses the address in optimum manner and enables the network to grow longer, also the data routing is faster since the address is allocated based on the formula, the shortest path can be calculated based on the address allocation formula. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 18, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29)
-
-
15. A method for allocating logical address optimally to a device at the time of network association with a wireless communication network system, comprising the steps of:
-
configuring the full function device with the prior information of network growth beyond it for reserving the logical addresses, for case where user has no prior information of network growth beyond said full function device, the full function device is configured accordingly to indicate that it has no prior information about the network growth; receiving beacon frame from all its neighboring router nodes and building neighbor table by unassociated node, wherein neighbor table contains all the information transmitted in beacon frame and required for association procedure along with its approximate distance from said unassociated node; transmitting the association request by unassociated nodes as part of its association procedure, association request containing the information about its said logical address requirement, which is said configured value for full function device and null for reduced function device; accumulating the association request for configurable period (TASSOC — RES) by said router nodes and then adding the address requirements of each said association request to get the total address requirement;checking the available logical addresses for distribution by said router nodes, whether all the association requests requirement can be fulfilled; allocating the requested number of logical addresses to the associating nodes which have specified their requirements, provided said router node has sufficient availability of logical addresses; alternatively, in case said router node does not have sufficient availability of logical addresses to meet all the requests, taking address reallocation mechanism (ARM), which on success said router node allocating the logical addresses as per request in said association requests, otherwise allocating the available logical addresses proportionally based on requested values in said association requests and availability of logical addresses with said router node; allocating the logical addresses to said unassociated nodes based on network configurable parameters, node'"'"'s depth and availability of logical addresses where said unassociated nodes have not specified its logical address requirement in said association request; and propagating the network configurable parameters by said router node to all associating nodes, whereby the logical address is allocated based on the associating node'"'"'s requirement and network configurable parameters which prudently uses the available logical address and thus improves the chance of all the unassociated node getting associated with the network. - View Dependent Claims (16, 17, 25)
-
Specification