Beacon Scheduling in Multi-Hop Ad-Hoc Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In multi-hop ad-hoc communications, existing methods face overhead and collisions due to intercluster interference and energy consumption in beacon transmission, particularly in hierarchical routing schemes like WPANs, where TDMA and CSMA/CA protocols struggle to avoid collisions and optimize beacon slot allocation.
Innovation Solution
A beacon scheduling method using sequential clustering, where a base station sends beacon slot information through contention-free TDMA to a CSMA/CA node and gateway, allowing the cluster head to aggregate and assign non-colliding beacon slots, and the gateway uses the same frame for beacon relay, reducing collisions and energy consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TDMA scheme is used for beacon transmission in hierarchical routing, then collision avoidance among center nodes is improved, but intercluster interference occurs in multi-cluster environment
Solution Approach 1:
The network is segmented into multiple clusters, each with its own TDMA beacon schedule. By dividing the network into independent clusters with separate timing structures, the patent eliminates intercluster interference while maintaining collision avoidance within each cluster. Each cluster operates with its own set of non-overlapping beacon slots.
2Adaptability or versatility
If CSMA/CA scheme is used for data transmission, then medium access flexibility is improved, but collision probability increases as number of sensor nodes increases
Solution Approach 1:
The patent segments the medium access into two distinct phases: beacon transmission using TDMA for collision-free operation, and data transmission using CSMA/CA for flexibility. This segmentation allows each protocol to operate in its optimal mode without the drawbacks of the other.
Solution Approach 2:
The patent performs preliminary beacon slot assignment during cluster formation using TDMA. By pre-establishing non-colliding beacon slots for all nodes before data transmission begins, the system eliminates collisions during the critical beacon exchange phase, allowing CSMA/CA to operate effectively during data transmission.
3Reliability
If multiple beacon slots are allocated to reduce collisions, then collision avoidance is improved, but overhead and energy consumption increase
Solution Approach 1:
The patent changes the timing parameter structure by implementing sequential clustering with phased beacon schedules. Instead of allocating multiple simultaneous beacon slots, the system uses a single set of non-overlapping slots that are sequentially activated as clusters form, reducing the total number of active beacon transmissions and associated energy consumption.
Data Source
AI summary
A beacon scheduling method in multi-hop ad-hoc communications is provided. This method can prevent overhead in a manner that a base station (BS) transmits beacon slot information to a carrier sense multiple access (CSMA)/collision avoidance (CA) node (CN) and a gateway (GW) through contention-free time division multiple access (TDMA) communications at initial clustering, the CN and the GW performs a sequential clustering to forward the beacon slot information to a cluster head (CH), the CH aggregates joining messages from nodes and assigns non-colliding beacon slots to the nodes, and the GW uses a beacon slot frame of a beacon transmission period (BTP) used by its selected CH in a beacon reply period (BRP) as well. Accordingly, the CH does not need to separately perform the initialization to elect the beacon slot, and the GW also does not require a separate initialization to select the beacon relay slot.