WO2020114111A1 - 基于RPL路由协议的IPv6节点移动管理方法 - Google Patents

基于RPL路由协议的IPv6节点移动管理方法 Download PDF

Info

Publication number
WO2020114111A1
WO2020114111A1 PCT/CN2019/112156 CN2019112156W WO2020114111A1 WO 2020114111 A1 WO2020114111 A1 WO 2020114111A1 CN 2019112156 W CN2019112156 W CN 2019112156W WO 2020114111 A1 WO2020114111 A1 WO 2020114111A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
message
mobile
rssi
dao
Prior art date
Application number
PCT/CN2019/112156
Other languages
English (en)
French (fr)
Inventor
王平
蒲宬亘
尹彦丹
杨钊
Original Assignee
重庆邮电大学
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 重庆邮电大学 filed Critical 重庆邮电大学
Priority to JP2021531355A priority Critical patent/JP7185962B2/ja
Priority to EP19893491.1A priority patent/EP3893553A4/en
Priority to US17/298,576 priority patent/US11706687B2/en
Publication of WO2020114111A1 publication Critical patent/WO2020114111A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/16—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/125—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality using a measured number of retransmissions as a link metric
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/34—Modification of an existing route
    • H04W40/36—Modification of an existing route due to handover
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the invention belongs to the technical field of wireless sensor networks and relates to an IPv6 wireless sensor network node mobility management method based on RPL routing protocol.
  • IPv6 Wireless Sensor Network Wireless Sensor Network
  • wireless sensor networks are widely used in various industries with their unique advantages, including military defense, agricultural environment, medical monitoring, smart home, industrial control and logistics management.
  • static wireless sensor networks are no longer suitable for some application environments that require mobile operations, so there has been the idea of adding mobile nodes to traditional networks.
  • mobility in IPv6 wireless sensor networks will cause some problems, such as data loss due to node disconnection during handover, and negative impact on application performance. It is particularly important to introduce node mobility management methods in IPv6 networks.
  • IPv6-based mobility technologies have been proposed in the field of IPv6 wireless sensor networks. Although they can solve the mobility problems of nodes in wireless sensor networks, there are still excessive delays in the process of mobile detection and mobile handover. The problem of complicated interaction and data loss.
  • an IPv6 wireless sensor network node mobility management method is proposed, which is implemented in combination with existing routing protocols.
  • the IETF RoLL working group has developed an RPL routing protocol for low-power and lossy networks (Routing Protocol for Low Power and Lossy Networks), and RoLL's design of the internal mechanism of the RPL routing protocol is for static networks , Making the RPL routing protocol not very suitable for mobile scenarios.
  • the present invention proposes an IPv6 wireless sensor network node mobility management method based on the RPL routing protocol .
  • the present invention provides an IPv6 wireless sensor network based on the RPL routing protocol in order to reduce the delay and energy consumption in the node movement detection process and the optimal parent node selection process, and improve the end-to-end packet arrival rate Node mobility management method.
  • This method is based on the bidirectional link quality index and improves the RPL control message to complete the selection of the optimal parent node of the mobile node.
  • a caching mechanism is designed for data in network communication to prevent the loss of data sent to the mobile node.
  • This method enables IPv6 wireless sensor network nodes to have a mobility management function, implements the node's mobile switching and data caching functions, can improve the accuracy of node movement detection in IPv6 wireless sensor networks, and reduces the link switching delay of mobile nodes and Node energy consumption avoids data packet loss during node movement and improves network reliability.
  • the present invention provides the following technical solutions:
  • An IPv6 wireless sensor network node mobility management method based on RPL routing protocol includes the following steps:
  • S1 In an IPv6 wireless sensor network with a mobile node, when the mobile node sends a message to its parent node, the parent node receives the message and records the received signal strength indication (ReceivedSignalStrengthIndication, RSSI) of this link ), then put the recorded RSSI in the corresponding ACK frame payload and reply to the mobile node. At this time, the mobile node will obtain the RSSI of the bidirectional communication link; if the mobile node does not interact with the parent node for a period of time, the mobile The node will actively send a beacon request frame to obtain RSSI;
  • RSSI received Signal Strength indication
  • the mobile node After obtaining the RSSI of the bidirectional communication link with the parent node, the mobile node obtains the average received signal strength indication (Average RSSI, ARSSI) using the average filtering method, and compares the ARSSI with the set threshold, if the ARSSI is less than the threshold, It is determined that the node is moving and is far away from the parent node, but at this time the mobile node will not immediately disconnect the current link; otherwise, skip to step S1;
  • Average RSSI Average received signal strength indication
  • each node calculates the back-off time according to the RSSI of the request message and the distributed competition algorithm newly designed by this method, and according to the back-off time
  • the mobile node replies with a Directed Acyclic Graph Information Object (DIO) message with a representation; that is, each node reverts back to the mobile node for a period of time based on the RSSI value and the node delay backoff algorithm.
  • DIO Directed Acyclic Graph Information Object
  • the node with the largest RSSI will reply first. The first node to reply is the best new parent node. If other nodes hear DIO messages that reply to the mobile node, they will cancel their fallback process. And no longer reply DIO message to the mobile node; in this process, all nodes reply only one DIO message, and do not reset the Trickle timer;
  • the mobile node After finding the new parent node, the mobile node sends a Disconnected Destination Advertisement Object (Disconnected DAO) message to the original parent node, requesting to disconnect the original link and clear the old routing table, and then forward the DAO The message reaches the upper node, delete all routing entries related to the mobile node; at the same time, the mobile node sends a Connected (DAO) message to the new parent node, requesting to connect to the new parent node and update the routing table; then forward the DAO message Text to the upper level node until a complete communication path is established;
  • DAO Disconnected Destination Advertisement Object
  • the improved ACK frame format formed by putting RSSI in the ACK frame payload includes: frame control bits, sequence number, RSSI, and frame check sequence (Frame Check Sequence (FCS)).
  • FCS Frame Check Sequence
  • the distributed competition algorithm specifically includes: after receiving the DIS message with the mobile identity, the candidate node calculates the respective back-off time according to RSSI, activates the built-in timer and determines the time based on its own back-off time. The window starts competing for response. The larger the RSSI, the smaller the back-off time, and the shorter the calculator overflow time.
  • the calculation formula is as follows:
  • RSSI n is the RSSI of node n
  • RSSI max is the maximum RSSI between the two nodes
  • t h is the set maximum delay time in microseconds.
  • step S4 when the mobile node finds a new parent node in the multicast DIS message, other nodes will also send corresponding DIO messages. Therefore, the DIO message sent by the candidate parent node after the distributed competition algorithm needs to be performed Mobile identification, the method adopted is that when the node encapsulates the DIO message in the MAC layer, the 8th bit of the MAC frame control field is set to the DIO identification bit to identify the response to the DIO message with the mobile identification DIS message.
  • step S4 all candidate nodes will also remain in the listening state during the timing process until their timer overflows to generate an interrupt, and the candidate node with the highest RSSI value (the node with the best link quality before the mobile node) will end first. Timed, if the remaining candidate nodes listen to the DIO message with the mobile ID, they will interrupt the timing and do not reply the DIO message with the ID to the mobile node; if the DIO message with the ID is not heard until the end of the time, then The candidate node will reply the marked DIO message to the mobile node.
  • step S4 the candidate node whose timer expires competes for the DIO message response right, first marks the DIO message, and then unicasts the DIO message to the mobile node.
  • the Trickle timer is not reset in this step to avoid network congestion.
  • step S7 the IPv6 address of the cache node is placed in the cache header of the 6LoWPAN message of the cache data to form a new 6LoWPAN cache header format including: header type, flag bit, source address length and short address identification bit, purpose Address long and short address identification bits, packet source IPv6 address and packet destination IPv6 address.
  • the present invention can effectively reduce the link switching delay of the node movement process in the IPv6 wireless sensor network, ensure the stability of the network link, and improve the reliability of the network.
  • the optimal parent node is selected without disconnecting the original link, and then the delayed back-off and optimal selection of the candidate node are completed through the improved DIS and DAO messages.
  • the original RPL routing protocol it completed the process of mobile detection, optimal selection, and mobile handover, effectively solving the problems of high latency and high energy consumption in the mobile handover process of IPv6 wireless sensor networks.
  • the present invention can effectively improve the end-to-end transmission success rate of messages in the IPv6 wireless sensor network and improve the transmission reliability of the network.
  • the present invention modifies the 6LoWPAN header of the cached data to ensure that the mobile node can normally receive the data before the switch during the mobile switching process or after the link switching, and avoids the loss of data.
  • FIG. 1 is a schematic flowchart of the mobile management method according to the present invention.
  • FIG. 2 is a diagram of an ACK frame format according to the present invention.
  • FIG. 3 is a diagram of the DIS message frame format of the RPL protocol according to the present invention.
  • FIG. 4 is a frame format diagram of a disconnected DAO message of the RPL protocol according to the present invention.
  • FIG. 5 is a diagram of the connection DAO message frame format of the RPL protocol according to the present invention.
  • FIG. 6 is a diagram of the 6LoWPAN header frame format according to the present invention.
  • FIG. 1 is a schematic flowchart of a method for managing mobility of an IPv6 wireless sensor network node based on an RPL routing protocol according to the present invention.
  • the method detects node movement based on RSSI of a bidirectional link, and multicasts DIS messages and responses with a mobile ID by multicasting
  • the fallback algorithm completes the optimal parent node selection, designs a caching algorithm for data in network communication, caches the data to the new parent node or root node, and redesigns the 6LoWPAN message header.
  • the specific implementation process of the node mobility management method is as follows:
  • Step1 In an IPv6 wireless sensor network with a mobile node, when the mobile node sends a message to its parent node, the parent node receives the message and records the RSSI of this link, and then places the recorded RSSI in the corresponding The ACK frame payload is returned to the mobile node, at which time the mobile node will obtain the RSSI of the two-way communication link. If the mobile node does not interact with the parent node for a period of time, the mobile node will actively send a beacon request frame to obtain the RSSI.
  • Step2 After obtaining the RSSI of the bidirectional communication link, the mobile node obtains the ARSSI through the mean value filtering method, and compares the ARSSI with the set threshold. If the ARSSI is less than the threshold, it is determined that the node is moving and is moving away from the parent node. The node will not immediately disconnect the current link; otherwise, skip to Step1.
  • Step3 After detecting that it is far away from the parent node, the mobile node starts to multicast DIS messages with mobile identification and find new parent nodes around.
  • Step4 After the non-leaf nodes around the mobile node receive the DIS message with the mobile ID, each node calculates the fallback time according to the RSSI of the request message and the distributed competition algorithm, and responds to the mobile node according to the fallback time. Identified DIO message.
  • the non-leaf nodes obtain their own RSSIs, and each node calculates the fallback time according to the RSSI and the distributed competition algorithm newly designed by this method, and then replies to the mobile node with a DIO message according to the fallback time.
  • the node with the largest RSSI will reply first, and the first node to reply is the best new parent node. If other nodes hear DIO messages that reply to the mobile node, then cancel their own fallback process, and do not Then reply the mobile node with DIO message; in this process, all nodes reply with only one DIO message, and do not reset the Trickle timer.
  • the distributed competition algorithm is specifically: after receiving the DIS message with the mobile identity, the candidate node calculates the respective back-off time according to RSSI, enables the built-in timer and starts the contention response in the time window according to its own back-off time, RSSI The larger the value, the smaller the back-off time and the shorter the timer overflow time; the calculation formula is as follows:
  • t n is the back-off time of node n
  • RSSI n is the RSSI of node n
  • RSSI max is the maximum RSSI between the two nodes
  • t h is the set maximum back-off time in microseconds.
  • the sent DIO message carries the mobile identification. Specifically, when the node encapsulates the DIO message in the MAC layer, the 8th bit of the MAC frame control field is set to the DIO identification bit to identify the response to the DIO report with the mobile identification DIS message Text.
  • step S4 all candidate nodes will remain in the listening state during the timing process until their timer overflows and an interrupt is generated.
  • the candidate node with the highest RSSI value (the node with the best link quality before the mobile node) will end first Timing. If the remaining candidate nodes listen to the DIO message with the mobile ID, the timer is interrupted and the DIO message with the ID is not returned to the mobile node; if the DIO message with the ID is not heard until the end of the time, the candidate The node will reply the marked DIO message to the mobile node.
  • step S4 the candidate node whose timer expires competes for the DIO message response right, first marks the DIO message, and then unicasts the DIO message to the mobile node. Unlike the corresponding DIO message in the original RPL protocol, the Trickle timer will not be reset in this step to avoid network congestion.
  • Step5 After finding the new parent node, the mobile node sends a disconnect DAO message to the original parent node, requesting to disconnect the original link and clear the old routing table, and then forwarding the DAO message to the upper node, deleting all and mobile Node-related routing entries; At the same time, send a connection DAO message to the new parent node, request to connect the new parent node and update the routing table, and then forward the DAO message to the upper node until the complete communication path is established.
  • Step6 Determine the data to be cached; after the mobile node disconnects the original link, if there is no data sent to the mobile node during the disconnection process, the current mobility management process ends; otherwise the original parent node will be the data sent to the mobile node Look for the cache node. If the original parent node receives the disconnected DAO message, the data sent to the mobile node will be cached to the new parent node; if the original parent node does not receive the disconnected DAO message for other reasons, the data will be cached To the root node of the network.
  • Step7 After the original parent node confirms the cache node, that is, after finding the cache location for the data, the IPv6 address of the cache node is placed in the 6LoWPAN cache header of the cache data, and then the data is forwarded to the cache node for caching. .
  • Step8 After the mobile node is connected to the new parent node and the network routing table is updated, the cache node sends the cached data to the mobile node, and the mobile management process is completed.
  • FIG. 2 is a diagram of the ACK frame payload format according to the present invention.
  • the main contents of the ACK frame format are: frame control bits, sequence number, RSSI, FCS, wherein the RSSI length is 8 bits.
  • FIG. 3 is a diagram of the DIS message frame format of the RPL protocol according to the present invention.
  • the DIS message with a mobile identifier includes an optional type description field (Type), an optional length (Length), and an optional item address (DestinationAddress). ;
  • the Option of the DIS message must have a type description field with a value of 0x0A and a length of 8 bits; Length is the number of bytes of the improved DIS Option with a length of 8 bits; Destination Address is the reserved destination address bit, which The length is determined by the length of the long address or short address.
  • FIG. 4 is a frame format diagram of a disconnected DAO message of the RPL protocol according to the present invention.
  • the Option of the disconnected DAO message includes an option type description field (Type), an option length (Length), and a disconnect request identifier (Disconnect Req), New Parent Address (New Parent Address); where Type value is 0x0A, length is 8 bits; Length is Option bytes, length is 8 bits; Disconnect Req is request to disconnect the original connection flag bit, length It is 8 bits; NewParentAddress is the IPv6 address of the new parent node, and its length is determined by the length of the long address or short address.
  • Type value is 0x0A, length is 8 bits
  • Length is Option bytes, length is 8 bits
  • Disconnect Req is request to disconnect the original connection flag bit, length It is 8 bits
  • NewParentAddress is the IPv6 address of the new parent node, and its length is determined by the length of the long address or short address.
  • FIG. 5 is a diagram of the connection DAO message frame format of the RPL protocol according to the present invention.
  • the Option of the connection DAO message includes an option type description field (Type), an option length (Length), and a disconnect request identifier (Connect Req) 1.
  • the original parent address (Old Parent Address); where Type is 0x0B and the length is 8 bits; Length is the number of Option bytes and the length is 8 bits; Connect Req is the connection request flag bit and the length is 8 bits; Old Parent Address is the original parent IPv6 address, and its length is determined by the length of the long address or short address.
  • FIG. 6 is a frame format diagram of a 6LoWPAN cache header according to the present invention.
  • the newly designed 6LoWPAN cache header includes a header type (Head Type), a flag bit (F), a source address length address identifier (O), and a destination address Long and short address identification bit (D), packet source IPv6 address (Origination) Address, packet destination IPv6 address (Destination) Address.
  • Head Type is 0xF0 and the length is 8 bits; the length of F, O and D is 1 bit each; the length of OriginationAddress and DestinationAddress is determined by the length of the long address or the short address.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明涉及一种基于RPL路由协议的IPv6无线传感网节点移动管理方法，现有的IPv6无线传感网移动性方法未考虑节点移动带来的网络拓扑变化，位置更新缓慢、数据转发速度低等问题。本发明首先将RSSI放在ACK帧中，以检测节点的移动状态，提高移动检测准确率；其次，在兼容原始RPL路由协议的前提下，改进DIS和DAO的可选项实现最优父节点的选择和路由表的更新；最后，设计缓存方法防止发送到移动节点的报文在移动过程中丢失，并设计新的6LoWPAN头部以完成报文缓存。本发明使得节点具有移动管理功能，实现节点的移动切换和数据缓存，提高IPv6无线传感网中节点移动检测的准确度，降低移动节点链路切换延时和能量消耗，避免节点移动过程中的数据包丢失，提高网络的可靠性。

Description

基于RPL路由协议的IPv6节点移动管理方法
本申请要求于2018年12月4日提交中国专利局、申请号为201811476188.1、发明名称为“一种基于RPL路由协议的IPv6无线传感网节点移动管理方法”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明属于无线传感器网络技术领域，涉及一种基于RPL路由协议的IPv6无线传感网节点移动管理方法。
背景技术
IPv6无线传感器网络(Wireless Sensor Network)一直是当前研究热点，具有功能多、部署灵活、低功耗、低成本等特性。目前无线传感器网络以其独特的优势在各行各业广泛应用，主要包括军事国防、农业环境、医疗监护、智能家居、工业控制和物流管理等。近年来，由于无线传感器网络新的应用需求不断增加，使得静态的无线传感器网络不再适用于一些需要移动作业的应用环境，因此便有了在传统网络中加入移动节点的构想。但是，IPv6无线传感器网络下的移动性会导致一些问题，如切换过程中节点断开导致数据丢失，对应用性能造成负面影响等，在IPv6网络中引入节点移动管理方法就显得尤为重要。
目前在IPv6无线传感器网络领域中已经提出了多种基于IPv6的移动性技术，虽能解决无线传感器网络中节点的移动性问题，但在移动检测、移动切换过程中仍存在着延时过高、交互过程复杂、数据丢失的问题。为此提出一种IPv6无线传感网节点移动管理方法，并结合已有的路由协议进行实现。IETF RoLL工作组针对低功耗有损网络制定了RPL路由协议(Routing Protocol for Low Power and Lossy Networks,低功耗有损网络路由协议)，而RoLL对RPL路由协议内在机制的设计是针对静态网络的，使得RPL路由协议不能很好的适用于移动场景。
为了确保无线传感器网络对移动性支持的要求，针对移动过程选择最优父节点出现的高延时、切换时的数据丢失问题，本发明提出一种基于RPL路由 协议的IPv6无线传感网节点移动管理方法。
发明内容
有鉴于此，本发明为了降低节点移动检测过程和最优父节点选择过程中的延时和能量消耗，提高端到端的数据包到达率，提供了一种基于RPL路由协议的IPv6无线传感网节点移动管理方法。该方法根据双向链路质量指标，并且通过改进RPL控制报文完成移动节点的最优父节点的选择；此外，为网络通信中的数据设计缓存机制，以防发送到移动节点的数据丢失。该方法使得IPv6无线传感网节点具有移动管理功能，实现了节点的移动切换和数据缓存功能，可提高IPv6无线传感网中节点移动检测的准确度，降低了移动节点链路切换延时和节点能量消耗，避免节点移动过程中的数据包丢失，提高了网络的可靠性。
为达到上述目的，本发明提供如下技术方案：
一种基于RPL路由协议的IPv6无线传感网节点移动管理方法，包括以下步骤：
S1：在有移动节点的IPv6无线传感网中，当移动节点向其父节点发送报文后，父节点收到报文并记录此条链路的接收信号强度指示(Received Signal Strength Indication，RSSI)，之后将记录的RSSI放入对应的ACK帧载荷中回复给移动节点，此时移动节点将获得双向通信链路的RSSI；若移动节点一段时间内没有与父节点进行报文交互，则移动节点会主动发送信标请求帧获取RSSI；
S2：移动节点获得与父节点的双向通信链路的RSSI后，利用平均值滤波方法获得平均接收信号强度指示(Average RSSI，ARSSI)，并将ARSSI与设定的阈值比较，若ARSSI小于阈值，则判定节点正在移动，且正在远离父节点，但此时移动节点不会立刻断开当前链路；否则跳至步骤S1；
S3：移动节点检测到自己正在远离父节点后，开始多播带有移动标识的有向非循环图信息请求(Directed Acyclic Graph Information Solicitation，DIS)报文，在周围寻找新的父节点；
S4：移动节点周围的非叶子节点收到有移动标识的DIS报文后，每个节点根据请求报文的RSSI和本方法新设计的分布式竞争算法计算回退时间，并根据回退时间向移动节点回复带有表示的有向非循环图信息对象(Directed  Acyclic Graph Information Object，DIO)报文；即每个节点根据RSSI的值以及节点延时回退算法回退一段时间再向移动节点回复DIO报文，拥有最大RSSI的节点将最先回复，最先回复的节点为最优的新父节点，如果其他节点监听到了有回复给移动节点的DIO报文，则取消自己的回退过程，并且不再向移动节点回复DIO报文；此过程中，所有节点只回复一个DIO报文，且不复位Trickle定时器；
S5：移动节点找到新的父节点后，发送断开目的地通告对象(Disconnected Destination Advertisement Object，Disconnected DAO)报文给原父节点，请求断开原有链路并清除旧路由表，然后转发DAO报文到上一级节点，删除所有与移动节点有关的路由条目；同时移动节点发送连接(Connected DAO)报文给新的父节点，请求连接新的父节点并更新路由表；然后转发DAO报文至上一级节点，直到建立完整的通信路径；
S6：确认待缓存数据，移动节点断开原有链路后，若断开过程中没有数据需要发送给移动节点，则本次移动管理过程结束；否则原父节点将为发送给移动节点的数据寻找缓存节点，若原父节点收到了断开DAO报文，则将发送给移动节点的数据将缓存到新的父节点处；若原父节点由于其他原因没有收到断开DAO报文，则数据缓存到网络根节点处；
S7：原父节点确认缓存节点后，即为数据寻找到缓存位置后，将缓存节点的IPv6地址放在缓存数据的6LoWPAN报文的缓存头部中，然后将数据转发到缓存节点处进行缓存；
S8：移动节点连接到新父节点并且更新网络路由表后，缓存节点将缓存的数据发送给移动节点，至此，本次移动管理过程结束。
进一步，步骤S1中，所述将RSSI放在ACK帧载荷中后形成的改进型ACK帧格式包括：帧控制位、序列号、RSSI和帧校验序列(Frame Check Sequence，FCS)。
进一步，步骤S3中，所述有移动标识的DIS报文Option格式包括：类型说明域、长度和目的地址；当DIS报文中的Option Type＝0x0A时，表示此DIS报文为移动节点所发送。。
进一步，步骤S4中，所述分布式竞争算法具体为：候选节点接收到有移动标识的DIS报文后，根据RSSI计算各自的回退时间，启用内置计时器并根据自身的回退时间在时间窗口开始竞争响应，RSSI越大，回退时间越小，计 算器溢出时间越短，计算公式如下：
Figure PCTCN2019112156-appb-000001
其中，t n为节点n的回退时间，RSSI n为节点n的RSSI，RSSI max为两个节点间最大的RSSI，t h为设定的最大延时时间，单位微秒。
进一步，步骤S4中，移动节点在多播DIS报文寻找新父节点时，其他节点也会发送相应DIO报文，因此，需要对候选父节点在进行分布式竞争算法后发送的DIO报文进行移动标识，采取的方法是节点在MAC层封装DIO报文时，将MAC帧控制域的第8位设置为DIO标识位，以标识响应带有移动标识DIS报文的DIO报文。
进一步，步骤S4中，所有候选节点在计时过程中也会保持监听状态直到其计时器溢出产生中断，RSSI值最大的候选节点(与移动节点之前链路质量最好的节点)将会最先结束计时，其余的候选节点若监听到带有移动标识的DIO报文，则中断计时且不回复带标识的DIO报文给移动节点；若直至计时结束都没有监听到带标识的DIO报文，则该候选节点将向移动节点回复带标识的DIO报文。
进一步，步骤S4中，计时器结束的备选节点竞争到DIO报文响应权，首先对DIO报文进行标记，然后单播此DIO报文给移动节点。该实施方式中，与原始RPL协议影响DIO报文方式不同，本步骤中不会复位Trickle定时器，避免造成网络阻塞。
进一步，步骤S5中，所述断开DAO报文的Option格式包括：类型说明域、长度、断开请求标识和新父节点IPv6地址；当DAO报文的Option Type＝0x0A时，表示此DAO报文被标识为断开DAO报文，以请求断开当前链路。
进一步，步骤S5中，所述连接DAO报文的Option格式包括：类型说明域、长度、连接请求标识和原父节点IPv6地址；当DAO报文的Option Type＝0x0B时，表示此DAO报文被标识为连接DAO报文，以请求建立新的链路。
进一步，步骤S7中，将缓存节点的IPv6地址放在缓存数据的6LoWPAN报文的缓存头部中形成新的6LoWPAN缓存头部格式包括：头部类型、标志位、源地址长短地址标识位、目的地址长短地址标识位、数据包源IPv6地址和数据包目的IPv6地址。
本发明的有益效果在于：
1)本发明能够有效的降低IPv6无线传感网中节点移动过程的链路切换延时，保证网络链路稳定，提高网络的可靠性。通过双向链路的RSSI移动检测，在不断开原有链路的情况下选择最优父节点，然后通过改良后的DIS、DAO报文完成候选节点的延时回退和最优选择，在兼容原有RPL路由协议的同时，完成了移动检测、最优选择、移动切换过程，有效地解决了IPv6无线传感网移动切换过程的高延时、高能耗问题。
2)本发明能够有效的提高IPv6无线传感网中报文端到端的传输成功率，提高网络的传输可靠性。本发明通过为发送给移动节点的数据设计缓存算法，修改缓存数据的6LoWPAN头部，保证移动节点在移动切换过程中或者链路切换后能正常接收到切换前的数据，避免了数据的丢失。
附图说明
为了使本发明的目的、技术方案和有益效果更加清楚，本发明提供如下附图进行说明：
图1为本发明所述的移动管理方法流程示意图；
图2为本发明所述的ACK帧格式图；
图3为本发明所述的RPL协议的DIS报文帧格式图；
图4为本发明所述的RPL协议的断开DAO报文帧格式图；
图5为本发明所述的RPL协议的连接DAO报文帧格式图；
图6为本发明所述的6LoWPAN头部帧格式图。
具体实施方式
下面将结合附图，对本发明的优选实施例进行详细的描述。
图1是本发明所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法流程示意图，该方法根据双向链路的RSSI检测节点的移动，通过多播有移动标识的DIS报文和回退算法完成最优的父节点选择，为网络通信中的数据设计缓存算法，将数据缓存到新的父节点或根节点处，并重新设计6LoWPAN报文头部。如图1所示，该节点移动管理方法具体实现过程如下：
Step1：在有移动节点的IPv6无线传感网中，当移动节点向其父节点发送报文后，父节点收到报文并记录此条链路的RSSI，之后将记录的RSSI放在对应的ACK帧载荷中回复给移动节点，此时移动节点将获得双向通信链路的RSSI。若移动节点一段时间内没有与父节点进行报文交互，则移动节点会主动 发送信标请求帧获取RSSI。
Step2：移动节点获得双向通信链路的RSSI后，通过平均值滤波方法获得ARSSI，将ARSSI与设定的阈值比较，若ARSSI小于阈值，则判定节点正在移动且正在远离父节点，但此时移动节点不会立刻断开当前链路；否则跳至步骤Step1。
Step3：移动节点检测到自己正在远离父节点后，开始多播带有移动标识的DIS报文，在周围寻找新的父节点。
Step4：移动节点周围的非叶子节点收到有移动标识的DIS报文后，每个节点根据请求报文的RSSI和分布式竞争算法计算回退时间，并根据回退时间向移动节点回复带有标识的DIO报文。
即，非叶子节点获得各自的RSSI，每个节点根据RSSI以及本方法新设计的分布式竞争算法计算回退时间，并根据回退时间再向移动节点回复DIO报文。其中，拥有最大RSSI的节点将最先回复，最先回复的节点为最优的新父节点，如果其他节点监听到了有回复给移动节点的DIO报文，则取消自己的回退过程，并且不再向移动节点回复DIO报文；此过程中，所有节点只回复一个DIO报文，且不复位Trickle定时器。
其中，分布式竞争算法具体为：候选节点接收到有移动标识的DIS报文后，根据RSSI计算各自的回退时间，启用内置计时器并根据自身的回退时间在时间窗口开始竞争响应，RSSI越大，回退时间越小，计时器溢出时间越短；计算公式如下：
Figure PCTCN2019112156-appb-000002
其中，t n为节点n的回退时间，RSSI n为节点n的RSSI，RSSI max为两个节点间最大的RSSI，t h为设定的最大回退时间，单位微秒。
需要说明的是，移动节点在多播DIS报文寻找新父节点时，不仅候选节点发送DIO报文，其他节点也会相应发送DIO报文，因此，需要对候选节点在进行分布式竞争算法后发送的DIO报文进行移动标识，具体为，节点在MAC层封装DIO报文时，将MAC帧控制域的第8位设置为DIO标识位，以标识响应带有移动标识DIS报文的DIO报文。
另外，步骤S4中，所有候选节点在计时过程中也会保持监听状态直到其 计时器溢出产生中断，RSSI值最大的候选节点(与移动节点之前链路质量最好的节点)将会最先结束计时。其余的候选节点若监听到带有移动标识的DIO报文，则中断计时且不回复带标识的DIO报文给移动节点；若直至计时结束都没有监听到带标识的DIO报文，则该候选节点将向移动节点回复带标识的DIO报文。
此外，步骤S4中，计时器结束的备选节点竞争到DIO报文响应权，首先对DIO报文进行标记，然后单播此DIO报文给移动节点。与原始RPL协议相应DIO报文不同，本步骤中不会复位Trickle定时器，避免造成网络阻塞。
Step5：移动节点找到新的父节点后，发送断开DAO报文给原父节点，请求断开原有链路并清除旧路由表，然后转发DAO报文到上一级节点，删除所有与移动节点有关的路由条目；同时发送连接DAO报文给新的父节点，请求连接新的父节点并更新路由表，然后转发DAO报文至上一级节点，直到建立完整的通信路径。
Step6：确定待缓存数据；移动节点断开原有链路后，若断开过程中没有发送给移动节点的数据，则本次移动管理过程结束；否则原父节点将为发送给移动节点的数据寻找缓存节点，若原父节点收到了断开DAO报文，则将发送给移动节点的数据将缓存到新的父节点处；若原父节点由于其他原因没有收到断开DAO报文，则数据缓存到网络根节点处。
Step7：原父节点确认缓存节点后，即为数据寻找到缓存位置后，将缓存节点的IPv6地址放在缓存数据的6LoWPAN缓存头部中，然后将数据转发到缓存节点处进行缓存。。
Step8：移动节点连接到新父节点并且更新网络路由表后，缓存节点将缓存的数据发送给移动节点，至此，本次移动管理过程结束。
图2为本发明所述的ACK帧载荷格式图；ACK帧格式的主要内容为：帧控制位、序列号、RSSI、FCS，其中RSSI长度为8位。
图3为本发明所述的RPL协议的DIS报文帧格式图，具有移动标识的DIS报文包含可选项类型说明域(Type)、可选项长度(Length)、可选项目的地址(Destination Address)；其中DIS报文的Option须有一个类型说明域，值为0x0A，长度为8位；Length为改进的DIS Option的字节数，长度为8位；Destination Address为预留的目的地址位，其长度由长地址或短地址的长度决定。
图4为本发明所述的RPL协议的断开DAO报文帧格式图，断开DAO报文的Option包含可选项类型说明域(Type)、可选项长度(Length)、断开请求标识(Disconnect Req)、新父节点地址(New Parent Address)；其中Type值为0x0A，长度为8位；Length为Option的字节数，长度为8位；Disconnect Req为请求断开原有连接标志位，长度为8位；New Parent Address为新父节点IPv6地址，其长度由长地址或短地址的长度决定。
图5为本发明所述的RPL协议的连接DAO报文帧格式图，连接DAO报文的Option包含可选项类型说明域(Type)、可选项长度(Length)、断开请求标识(Connect Req)、原父节点地址(Old Parent Address)；其中Type值为0x0B，长度为8位；Length为Option的字节数，长度为8位；Connect Req为连接请求标志位，长度为8位；Old Parent Address为原父节点IPv6地址，其长度由长地址或短地址的长度决定。
图6为本本发明所述的6LoWPAN缓存头部帧格式图，新设计的6LoWPAN缓存头部包括头部类型(Head Type)、标志位(F)、源地址长短地址标识位(O)、目的地址长短地址标识位(D)、数据包源IPv6地址(Origination Address)、数据包目的IPv6地址(Destination Address)。其中Head Type值为0xF0,长度为8位；F、O、D长度各为1位；Origination Address、Destination Address长度由长地址或短地址的长度决定。
最后说明的是，以上优选实施例仅用以说明本发明的技术方案而非限制，尽管通过上述优选实施例已经对本发明进行了详细的描述，但本领域技术人员应当理解，可以在形式上和细节上对其作出各种各样的改变，而不偏离本发明权利要求书所限定的范围。

Claims (9)

  1. 一种基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，该方法包括以下步骤：
    S1：在有移动节点的IPv6无线传感网中，当移动节点向其父节点发送报文后，父节点接收到报文并记录此条链路的接受信号强度指示(Received Signal Strength Indication，RSSI)，之后将记录的RSSI放入对应的ACK帧载荷中回复给移动节点，此时移动节点将获得双向通信链路的RSSI；若移动节点一段时间内没有与父节点进行报文交互，则移动节点会主动发送信标请求帧获取RSSI；
    S2：移动节点获得与父节点的双向通信链路的RSSI后，利用平均值滤波方法获得平均接收信号强度指示(Average RSSI，ARSSI)，并将ARSSI与设定的阈值进行比较。若ARSSI小于阈值，则判定节点正在移动且正在远离父节点，但此时移动节点不会立刻断开当前链路，否则跳至步骤S1；
    S3：移动节点检测到自己正在远离父节点后，开始多播带有移动标识的有向非循环图信息请求(Directed Acyclic Graph Information Solicitation，DIS)报文，在周围寻找新的父节点；
    S4：移动节点周围的非叶子节点收到带有移动标识的DIS报文后，每个节点根据请求报文的RSSI和分布式竞争算法计算回退时间，并根据回退时间向移动节点回复带有标识的有向非循环图信息对象(Directed Acyclic Graph Information Object，DIO)报文；
    S5：移动节点找到新的父节点后，发送断开目的地通告对象(Disconnected Destination Advertisement Object，Disconnected DAO)报文给原父节点，请求断开原有链路并清除旧路由表，然后转发DAO报文到上一级节点，删除所有与移动节点有关的路由条目；同时移动节点发送连接DAO(Connected DAO)报文给新的父节点，请求连接新的父节点并更新路由表，然后转发DAO报文至上一级节点，直到建立完整的通信路径；
    S6：确认待缓存数据；移动节点断开原有链路后，若断开过程中没有数据需要发送给移动节点，则本次移动管理过程结束；否则，原父节点需要为发送 给移动节点的数据寻找缓存节点；若原父节点收到了断开DAO报文，则将发送给移动节点的数据缓存到新的父节点处；若原父节点由于其他原因没有收到断开DAO报文，则将数据缓存到网络根节点处；
    S7：原父节点确认缓存节点后，即为数据寻找到缓存位置后，将缓存节点的IPv6地址放在缓存数据的6LoWPAN报文的缓存头部中，然后将数据转发到缓存节点处进行缓存；
    S8：移动节点连接到新父节点并且更新网络路由表后，缓存节点将缓存的数据发送给移动节点，至此，本次移动管理过程结束。
  2. 根据权利要求1所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，步骤S1中，所述将RSSI放在ACK帧载荷中后，形成的改进型ACK帧格式包括：帧控制位、序列号、RSSI和帧校验序列(Frame Check Sequence，FCS)。
  3. 根据权利要求1所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，步骤S3中，所述有移动标识的DIS报文Option格式包括：类型说明域、长度和目的地址；当DIS控制报文中的Option Type＝0x0A时，表示此DIS控制报文为移动节点所发送。
  4. 根据权利要求1所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，步骤S4中，所述分布式竞争算法具体为：候选节点接收到有移动标识的DIS报文后，根据RSSI计算各自的回退时间，启用内置计时器并根据自身的回退时间在时间窗口开始竞争响应，RSSI越大，回退时间越小，计时器溢出时间越短；计算公式如下：
    Figure PCTCN2019112156-appb-100001
    其中，t n为节点n的回退时间，RSSI n为节点n的RSSI，RSSI max为两个节点间最大的RSSI，t h为设定的最大回退时间，单位微秒。
  5. 根据权利要求1所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，步骤S4中，移动节点在多播DIS报文寻找新父节点时，对候选父节点在进行分布式竞争算法后发送的DIO报文进行移动标识； 采取的方法是节点在MAC层封装DIO报文时，将MAC帧控制域的第8位设置为DIO标识位，以标识响应带有移动标识DIS报文的DIO报文。
  6. 根据权利要求1所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，步骤S4中，所有候选节点在计时过程中也会保持监听状态直到其计时器溢出产生中断，RSSI值最大的候选节点(与移动节点之前链路质量最好的节点)将会最先结束计时，其余的候选节点若监听到带有移动标识的DIO报文，则中断计时且不回复带标识的DIO报文给移动节点；若直至计时结束都没有监听到带标识的DIO报文，则该候选节点将向移动节点回复带标识的DIO报文。
  7. 根据权利要求1所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，步骤S4中，计时器结束的备选节点竞争到DIO报文响应权，首先对DIO报文进行标记，然后单播此DIO报文给移动节点。8、根据权利要求1所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，步骤S5中，所述断开DAO报文的Option格式包括：类型说明域、长度、断开请求标识和新父节点IPv6地址；当DAO报文的Option Type＝0x0A时，表示此DAO报文被标识为断开DAO报文，以请求断开当前链路。
  8. 根据权利要求1所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，步骤S5中，所述连接DAO报文的Option格式包括：类型说明域、长度、连接请求标识和原父节点IPv6地址；当DAO报文的Option Type＝0x0B时，表示此DAO报文被标识为连接DAO报文，以请求建立新的链路。
  9. 根据权利要求1所述的基于RPL路由协议的IPv6无线传感网节点移动管理方法，其特征在于，步骤S7中，将缓存节点的IPv6地址放在缓存数据的6LoWPAN报文的缓存头部中形成新的6LoWPAN缓存头部格式包括：头部类型、标志位、源地址长短地址标识位、目的地址长短地址标识位、数据包源IPv6地址和数据包目的IPv6地址。
PCT/CN2019/112156 2018-12-04 2019-10-21 基于RPL路由协议的IPv6节点移动管理方法 WO2020114111A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
JP2021531355A JP7185962B2 (ja) 2018-12-04 2019-10-21 ＲＰＬルーティングプロトコルによるＩＰｖ６ノード移動管理方法
EP19893491.1A EP3893553A4 (en) 2018-12-04 2019-10-21 IPV6 NODE MOBILITY MANAGEMENT METHOD BASED ON AN RPL ROUTING PROTOCOL
US17/298,576 US11706687B2 (en) 2018-12-04 2019-10-21 IPV6 node mobility management method based on RPL routing protocol

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811476188.1A CN109640372B (zh) 2018-12-04 2018-12-04 一种基于RPL路由协议的IPv6无线传感网节点移动管理方法
CN201811476188.1 2018-12-04

Publications (1)

Publication Number Publication Date
WO2020114111A1 true WO2020114111A1 (zh) 2020-06-11

Family

ID=66070993

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/112156 WO2020114111A1 (zh) 2018-12-04 2019-10-21 基于RPL路由协议的IPv6节点移动管理方法

Country Status (5)

Country Link
US (1) US11706687B2 (zh)
EP (1) EP3893553A4 (zh)
JP (1) JP7185962B2 (zh)
CN (1) CN109640372B (zh)
WO (1) WO2020114111A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112929960A (zh) * 2021-02-04 2021-06-08 重庆邮电大学 一种支持IPv6且提高无线传感网络确定性的方法
CN113993179A (zh) * 2021-11-23 2022-01-28 国网信息通信产业集团有限公司 一种物联网中多信道通信方法及装置
WO2022127588A1 (zh) * 2020-12-18 2022-06-23 展讯半导体(成都)有限公司 一种无线移动通信方法及装置

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109640372B (zh) * 2018-12-04 2022-05-06 重庆邮电大学 一种基于RPL路由协议的IPv6无线传感网节点移动管理方法
CN111083775B (zh) * 2019-11-06 2021-12-17 重庆邮电大学 一种基于RPL路由协议的IPv6无线传感网时间同步方法
CN111314977A (zh) * 2020-02-14 2020-06-19 重庆邮电大学 一种IPv6的移动感知路由的设计方法
CN111385201A (zh) * 2020-03-17 2020-07-07 重庆邮电大学 一种基于双向父节点决策的rpl路由方法
CN112822723B (zh) * 2021-01-15 2022-04-05 重庆邮电大学 一种面向6TiSCH网络的移动节点快速切换方法
CN113242586A (zh) * 2021-04-25 2021-08-10 重庆邮电大学 一种可靠的基于链路节能的移动性rpl路由方法
JP2023042172A (ja) * 2021-09-14 2023-03-27 株式会社東芝 無線中継装置、ゲートウェイ装置及び無線システム
US11902161B1 (en) 2022-08-17 2024-02-13 Cisco Technology, Inc. Virtual network for virtual phone applications
CN115348652B (zh) * 2022-10-18 2023-03-24 苏州浪潮智能科技有限公司 一种无线低功耗有损网络的节点模式设置方法及其装置
CN117097665B (zh) * 2023-10-18 2024-01-19 杭州联芯通半导体有限公司 一种父节点选择方法、装置、电子设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101827416A (zh) * 2010-04-02 2010-09-08 华为技术有限公司 无线传感器网络中节点切换方法、网络及网络节点
WO2015021638A1 (zh) * 2013-08-15 2015-02-19 华为技术有限公司 一种判断节点移动的方法和设备
WO2015027406A1 (zh) * 2013-08-28 2015-03-05 华为技术有限公司 一种无线传感网络中首选父节点的选择方法及装置
CN105848238A (zh) * 2015-01-16 2016-08-10 中国科学院上海高等研究院 基于多参数的无线传感器网络IPv6路由方法
CN109640372A (zh) * 2018-12-04 2019-04-16 重庆邮电大学 一种基于RPL路由协议的IPv6无线传感网节点移动管理方法

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6904021B2 (en) 2002-03-15 2005-06-07 Meshnetworks, Inc. System and method for providing adaptive control of transmit power and data rate in an ad-hoc communication network
JP4578917B2 (ja) 2003-10-03 2010-11-10 富士通株式会社 自己組織化マルチホップ無線アクセスネットワーク用の装置、方法及び媒体
US8451744B2 (en) * 2010-08-16 2013-05-28 Cisco Technology, Inc. Partitioning directed acyclic graph (DAG) topologies
US9344256B2 (en) * 2013-09-18 2016-05-17 Cisco Technology, Inc. Dominating set identification for path computation based on directed acyclic graph membership
US10277476B2 (en) * 2014-01-06 2019-04-30 Cisco Technology, Inc. Optimizing network parameters based on a learned network performance model
US9853883B2 (en) 2015-05-08 2017-12-26 Cisco Technology, Inc. Device mobility in a mesh network
US20160380776A1 (en) * 2015-06-29 2016-12-29 Cisco Technology, Inc. Secured neighbor discovery registration upon device movement
CN113365294A (zh) 2015-08-28 2021-09-07 德克萨斯仪器股份有限公司 用于有向无环图网络配置的节点和方法
CN106559348A (zh) * 2015-09-25 2017-04-05 中国电力科学研究院 一种智能6LoWPAN边界路由实现方法及边界路由器
JP6801191B2 (ja) 2016-02-24 2020-12-16 沖電気工業株式会社 無線通信システム、無線通信装置、及び無線通信プログラム
CN106604344B (zh) * 2016-11-28 2021-11-16 中国电力科学研究院 一种基于rpl的用电信息系统及其组网和通信方法
WO2018113394A1 (en) * 2016-12-19 2018-06-28 Huawei Technologies Co., Ltd. Apparatus and method for optimized route invalidation using modified no-path dao signaling
CN108574970B (zh) 2017-03-07 2020-09-04 华为技术有限公司 父节点选择方法、网络节点及系统
CN112075101A (zh) * 2018-05-02 2020-12-11 匹克赛拉株式会社 无线路径控制方法、无线通信系统、无线节点及无线路径控制程序
EP3606213B1 (en) * 2018-08-02 2020-12-30 Mitsubishi Electric R&D Centre Europe B.V. Method for managing a network and apparatus for implementing the same
US10813032B2 (en) * 2018-11-14 2020-10-20 Landis+Gyr Innovations, Inc. Systems and methods for neighboring node discovery in a network
US11683379B2 (en) * 2019-04-16 2023-06-20 Landis+Gyr Innovations, Inc. Efficient message transmission and loop avoidance in an RPL network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101827416A (zh) * 2010-04-02 2010-09-08 华为技术有限公司 无线传感器网络中节点切换方法、网络及网络节点
WO2015021638A1 (zh) * 2013-08-15 2015-02-19 华为技术有限公司 一种判断节点移动的方法和设备
WO2015027406A1 (zh) * 2013-08-28 2015-03-05 华为技术有限公司 一种无线传感网络中首选父节点的选择方法及装置
CN105848238A (zh) * 2015-01-16 2016-08-10 中国科学院上海高等研究院 基于多参数的无线传感器网络IPv6路由方法
CN109640372A (zh) * 2018-12-04 2019-04-16 重庆邮电大学 一种基于RPL路由协议的IPv6无线传感网节点移动管理方法

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
ALVI SHEERAZ : "On route maintenance and recovery mechanism of RPL", 2017 13TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC), JUNE 26—30, 2017, no. 13, 19 July 2017 (2017-07-19), pages 1933 - 1938, XP033125573, DOI: 10.1109/IWCMC.2017.7986579 *
CHARLIE CHEN ET AL: "Service-Aware Node Migration for Low-Power and Lossy Networks", IP.COM, 2 November 2017 (2017-11-02), pages 1 - 15, XP013176314, ISSN: 1533-0001 *
See also references of EP3893553A4 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022127588A1 (zh) * 2020-12-18 2022-06-23 展讯半导体(成都)有限公司 一种无线移动通信方法及装置
CN112929960A (zh) * 2021-02-04 2021-06-08 重庆邮电大学 一种支持IPv6且提高无线传感网络确定性的方法
CN112929960B (zh) * 2021-02-04 2022-07-12 重庆邮电大学 一种支持IPv6且提高无线传感网络确定性的方法
CN113993179A (zh) * 2021-11-23 2022-01-28 国网信息通信产业集团有限公司 一种物联网中多信道通信方法及装置
CN113993179B (zh) * 2021-11-23 2024-01-09 国网信息通信产业集团有限公司 一种物联网中多信道通信方法及装置

Also Published As

Publication number Publication date
CN109640372A (zh) 2019-04-16
EP3893553A1 (en) 2021-10-13
EP3893553A4 (en) 2022-08-17
US11706687B2 (en) 2023-07-18
CN109640372B (zh) 2022-05-06
US20220053405A1 (en) 2022-02-17
JP7185962B2 (ja) 2022-12-08
JP2022510342A (ja) 2022-01-26

Similar Documents

Publication Publication Date Title
WO2020114111A1 (zh) 基于RPL路由协议的IPv6节点移动管理方法
RU2682930C2 (ru) Выбор маршрута в беспроводных сетях
US7209978B2 (en) Arrangement in a router of a mobile network for optimizing use of messages carrying reverse routing headers
EP2381722B1 (en) Arrangement for providing network prefix information from attached mobile routers to a clusterhead in a tree-based ad hoc mobile network
US9681345B2 (en) Data transmission method for mobile receiver in publish/subscribe system
KR101588887B1 (ko) 멀티-홉 기반의 인터넷 프로토콜을 사용하는 네트워크에서 이동 노드의 이동성 지원 방법 및 그 네트워크 시스템
US20090219832A1 (en) Fast configuration of a default router for a mobile node in a mobile communication system
CA2457454A1 (en) A system and method for performing soft handoff in a wireless data network
CN100456742C (zh) 移动互联网协议路由处理方法和系统及路由器
WO2006110370A2 (en) Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network
JP2009529265A (ja) 動的ルータ広告を使用する高速ハンドオーバのための方法及びシステム
WO2008098439A1 (fr) Procédé et système pour commutation d'acheminement
WO2013071823A1 (zh) 一种切换过程中路由优化的方法及系统及接入网元
CN103796271A (zh) 一种适用于树型无线传感网的IPv6路由器冗余方法
Din et al. Emerging mobile communication technologies for healthcare system in 5G network
CN103024720B (zh) 6LoWPAN的网络移动性管理方法
CN102026330A (zh) 一种提高自组织网络可用性的方法
JPWO2005032061A1 (ja) 階層型レイヤ２ネットワーク
US11206590B2 (en) Method for realizing wireless network convergence
CN105873163A (zh) 一种能量优化的无线传感器网络路由方法
RU2405282C2 (ru) Выбор маршрута в беспроводных сетях
Pagtzis et al. Proactive mobility for future IP wireless access networks
WO2010057379A1 (zh) 一种发送数据的方法和装置
Li et al. Path management scheme to support mobile station in wireless mesh networks for U-healthcare applications
CN114189898A (zh) 一种基于RPL路由协议的IPv6无线传感网点对点路由方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19893491

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2021531355

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019893491

Country of ref document: EP

Effective date: 20210705