Wireless Multi-Hop Node Scheduling for Neighbor Discovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional Time Synchronized Channel Hopping (TSCH) communication technologies face challenges in quickly discovering neighboring nodes due to high collision rates and limited broadcast cell allocation, leading to prolonged neighbor discovery times or failure to find specific nodes.
Innovation Solution
A communication system where each node has a unique transmission cell with a determined transmission timing and channel based on a controlled schedule, allowing nodes to transmit network advertising packets at distinct times and channels, reducing collisions and enabling efficient neighbor discovery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If conventional TSCH communication is used for neighbor discovery, then nodes can form a wireless multi-hop network, but neighbor discovery takes too much time and may fail to find specific nodes
Solution Approach 1:
The patent segments the neighbor discovery process into two distinct phases: (1) reception of network advertising packets from other nodes, and (2) active transmission of packets to discover additional neighbors. This segmentation allows the system to efficiently receive advertisements while dedicating specific time slots for active discovery, thereby reducing overall discovery time and improving reliability without causing collisions.
Solution Approach 2:
The patent implements preliminary action by having nodes pre-configure their transmission parameters including transmission power, packet interval, and transmission schedule before neighbor discovery begins. The first node determines transmission power based on expected distances to neighboring nodes, and sets up transmission slots in advance. This preliminary configuration enables efficient neighbor discovery without requiring time-consuming adjustments during the discovery process.
2Productivity
If multiple nodes transmit network advertising packets simultaneously, then neighbor discovery can be performed in parallel, but collision rate increases and discovery efficiency decreases
Solution Approach 1:
The patent applies periodic action by implementing a structured transmission schedule where nodes alternate between receiving network advertising packets and transmitting their own packets in dedicated time slots. The first node transmits packets at predetermined intervals with controlled packet intervals, creating a periodic pattern that avoids random collisions while maintaining systematic neighbor discovery. This periodic structure ensures that transmissions are coordinated and collisions are minimized.
Solution Approach 2:
The patent implements dynamics by allowing the first node to adaptively determine transmission power based on expected distances to neighboring nodes and to adjust packet intervals dynamically. The system transitions from static simultaneous transmission to dynamic coordinated transmission where timing and power levels are optimized based on network conditions and node positions, thereby improving both efficiency and reliability.
Data Source
AI summary
According to an embodiment, a communication system includes a plurality of nodes that forms a wireless multi-hop network. Transmission timings of network advertising packets transmitted from the plurality of nodes are controlled based on a transmission schedule in which each of the plurality of nodes has one transmission cell at a location different from other nodes. One of the nodes includes a processor and a wireless communication controller. The processor determines a transmission timing of the corresponding network advertising packet based on the transmission schedule. The wireless communication controller transmits the network advertising packet at the transmission timing.