Address assignment method for resource-constrained nodes in tree-shaped ubiquitous network

An allocation method and node technology, applied in the field of ubiquitous network communication, can solve problems such as unsatisfactory address allocation strategy and address format, frequent topology changes, etc., to achieve the effect of solving frequent changes and ensuring effectiveness

Inactive Publication Date: 2013-02-27
SUZHOU INST FOR ADVANCED STUDY USTC
View PDF3 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The purpose of the present invention is to provide an address allocation method for resource-limited nodes in a tree-shaped ubiquitous network, which solves the problems i

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Address assignment method for resource-constrained nodes in tree-shaped ubiquitous network
  • Address assignment method for resource-constrained nodes in tree-shaped ubiquitous network
  • Address assignment method for resource-constrained nodes in tree-shaped ubiquitous network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0026] The ubiquitous network in this embodiment is a tree network. Except for the root node, other nodes have one and only one parent node, leaf nodes have no child nodes, and intermediate nodes can have multiple child nodes. The root node is connected to the gateway device.

[0027] 1. Local address generation, encoding and management of nodes

[0028] The local address is an integer type, and its length is in bytes (octet). The length of the local address is scalable, depending on the needs of the network scale. The bit value of the highest bit of the address is 0. If the address length is greater than 1 byte, the remaining bytes of the address start with binary bit 10. When a series of local addresses are connected sequentially, it can be used to mark the start byte of each local address. The schematic is shown in Table 1.

[0029] Table 1 Local address encoding format

[0030]

[0031] Local addresses whose significant bits are all zeros are reserved and not used....

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an address assignment method for resource-constrained nodes in a tree-shaped ubiquitous network. A unique root node exists in the tree-shaped ubiquitous network, the other nodes only have one father node, a middle node is provided with a plurality of sub nodes, and leaf nodes are not provided with child nodes. The method is characterized by comprising the following steps of: in the case that to-be-assigned nodes are non-root nodes, trying to request the father node to add the to-be-assigned nodes in the tree-shaped ubiquitous network, and assigning addresses for the to-be-assigned nodes by the father node of the to-be-assigned nodes according to a local address coded format; and in the case that the to-be-assigned nodes are root nodes, assigning addresses for self nodes by the to-be-assigned nodes according to the local address coded format or assigning addresses for the root nodes by a network gateway according to the local address coded format. According to the method, the power consumption of the nodes is reduced, and the problems caused by network topology and the frequent change of the node addresses can be greatly solved.

Description

technical field [0001] The invention belongs to the technical field of ubiquitous network communication, and in particular relates to a resource-limited node address allocation method in a ubiquitous network based on the IEEE 802.15.4 standard. Background technique [0002] DHCP (Dynamic Host Configuration Protocol) is a centralized address allocation protocol for traditional TCP / IP networks. The goals of the DHCP protocol design include realizing the automatic configuration of the client without manual intervention, being compatible with the traditional BOOTP (Bootstrap Protocol) protocol, and a single server can provide services for multiple subnets at the same time through the relay agent. The DHCP protocol is widely used in the TCP / IP network, but when this mechanism is applied to the ubiquitous network or the Internet of Things, it will face many challenges. [0003] The DHCP protocol cannot adapt to the dynamics of the ubiquitous network topology. In the application ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L29/12
Inventor 黄刘生周有松徐宏力马全增盛敏朝
Owner SUZHOU INST FOR ADVANCED STUDY USTC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap