Dynamic Time Slot Selection for Vehicular Ad Hoc Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In vehicular ad hoc networks, existing time slot selection methods for wireless communication protocols like TDMA and CSMA/CA face challenges in ensuring reliable message transmission due to mobility and topology changes, leading to potential collisions and inefficiencies in channel access.
Innovation Solution
A method and system for selecting proper time slots in a wireless communication network based on TDMA protocol, where a vehicle scans for free time slots, broadcasts messages, and checks acknowledge information to determine if all neighboring nodes have received the message, adjusting time slot selection if collisions or topology changes occur, ensuring reliable communication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If TDMA protocol is used for time slot selection in vehicular ad hoc networks, then channel access efficiency is improved, but reliability of message transmission deteriorates due to mobility and topology changes
Solution Approach 1:
The patent implements dynamic time slot selection where vehicles continuously monitor channel occupancy and adjust their transmission slots based on real-time observations. The system transitions from static pre-assigned slots to dynamic slot selection, allowing vehicles to adapt to mobility-induced topology changes while maintaining efficient channel utilization through centralized coordination.
Solution Approach 2:
The patent employs feedback mechanisms where vehicles broadcast their intended transmission slots and receive acknowledgments from neighboring vehicles. This feedback loop enables the system to detect conflicts and adjust slot assignments dynamically, ensuring reliable message transmission despite changing network conditions while maintaining high channel access efficiency through coordinated slot selection.
2Adaptability or versatility
If CSMA/CA protocol is used for time slot selection, then adaptability to topology changes is improved, but channel access efficiency deteriorates due to potential collisions
Solution Approach 1:
The patent introduces a centralized coordinator that acts as an intermediary between vehicles, managing time slot assignments and conflict resolution. This mediator consolidates the distributed decision-making process, providing adaptability to topology changes through centralized control while preventing collisions through coordinated slot allocation, thus improving channel access efficiency compared to pure CSMA/CA approaches.
Solution Approach 2:
The patent implements preliminary slot selection where vehicles declare their intended transmission slots in advance before actual transmission. This preliminary action allows the system to detect and resolve potential conflicts before they occur, maintaining adaptability to topology changes while preventing collisions that would reduce channel access efficiency.
3Reliability
If dynamic time slot adjustment is implemented to handle mobility, then message transmission reliability is improved, but system complexity increases
Solution Approach 1:
The patent implements a universal slot selection mechanism that handles multiple functions through a single coordinated process: slot assignment, conflict detection, collision avoidance, and adaptation to topology changes. This multi-functional approach improves message transmission reliability while minimizing system complexity by consolidating control logic in a centralized coordinator rather than requiring complex distributed algorithms at each vehicle.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method for communicating messages in a channel of a wireless communication network is provided. In the channel, successive cycles, each of which including a predetermined number of successive time slots, are defined. The method may include: a first node obtaining a first list of its neighboring nodes before a first qth time slot; broadcasting a first message in the first qth time slot; receiving acknowledge information from other nodes within the network for one cycle after the first qth time slot; obtaining a second list of its neighboring nodes after the first qth time slot; and determining whether qth time slots are proper for communicating messages by the first node by checking whether all nodes on both the first and the second lists have received the first message based on the received acknowledge information, each piece of which indicates whether a corresponding node has received the first message.