TDMA-Based On-Demand Capacity Allocation in MANETs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for multi-hop data delivery in military Mobile Ad-hoc Networks (MANETs) are inefficient, requiring excessive background traffic, long latencies, and reliance on centralized nodes, which limits the dynamic allocation of communication capacity and leads to suboptimal use of over-the-air resources.
Innovation Solution
A method and system utilizing Time Division Multiple Access (TDMA) waveform for on-demand allocation of communication capacity, where nodes request and reserve time slots dynamically, allowing for efficient data transmission with unlimited hop forwarding by transmitting access requests during predetermined slots and receiving responses in subsequent slots, minimizing latency and background traffic.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If existing algorithms are used for assigning capacity to users in MANET, then data delivery can be achieved, but background traffic becomes excessive and channel resource acquisition takes too long
Solution Approach 1:
The patent implements preliminary action by establishing reserved time slots in advance for data transmission. Nodes pre-allocate specific TDMA time slots for potential data transmissions, so when data needs to be transmitted, the node can immediately use the pre-reserved slot without needing to negotiate or acquire channel resources at that moment. This eliminates the time-consuming channel acquisition process while maintaining efficient data delivery.
Solution Approach 2:
The patent segments the channel access process into distinct phases: a reservation phase where nodes indicate their data transmission intentions, and a execution phase where actual data transmission occurs in pre-allocated time slots. This segmentation allows nodes to separate the decision-making process from the transmission process, reducing background traffic during data delivery while maintaining the ability to quickly acquire channel resources when needed.
2Productivity
If existing algorithms are used for assigning capacity to users in MANET, then data delivery can be achieved, but the use of over-the-air resources becomes inefficient
Solution Approach 1:
The patent implements dynamic resource allocation where time slots are not permanently assigned but are reserved on-demand based on actual data transmission needs. Nodes dynamically indicate their reservation status in each epoch, and time slots are allocated only when needed. This dynamic approach ensures that over-the-air resources are efficiently utilized by avoiding transmissions when there is no data to send, while still providing quick access when data needs to be transmitted.
Solution Approach 2:
The patent changes the parameter of time slot allocation from static to dynamic by introducing a reservation mechanism. Instead of fixed assignments, nodes can reserve time slots by setting appropriate bits in their transmitted data during reservation epochs. This parameter change allows the system to adapt to varying traffic conditions, improving overall resource efficiency while maintaining high data delivery efficiency when needed.
3Productivity
If existing algorithms are used for assigning capacity to users in MANET, then data delivery can be achieved, but end-to-end data transport latencies are relatively long
Solution Approach 1:
The patent reduces end-to-end latency by performing preliminary reservation of time slots. When a node has data to transmit, it can indicate its reservation need in advance during a reservation epoch, and the actual data transmission can occur in the next available reserved slot without negotiation delays. This preliminary action eliminates the handshaking and arbitration delays that contribute to long latencies in existing algorithms.
Solution Approach 2:
The patent enables nodes to skip the traditional channel acquisition and arbitration processes by using pre-reserved time slots. When data needs to be transmitted, the node can directly transmit in its reserved slot without going through the time-consuming processes of channel sensing, arbitration, and negotiation. This skipping of intermediate steps dramatically reduces end-to-end transport latency while maintaining efficient resource use.
4Productivity
If existing algorithms are used for assigning capacity to users in MANET, then data delivery can be achieved, but they often require use of a centralized node to arbitrate and assign access
Solution Approach 1:
The patent implements a self-service mechanism where each node independently manages its own time slot reservations and transmissions. Nodes autonomously indicate their reservation needs by setting bits in their transmitted data during reservation epochs, and they independently use their reserved slots for transmission without requiring arbitration from a centralized node. This distributed self-service approach eliminates the need for complex centralized arbitration while maintaining efficient data delivery.
Solution Approach 2:
The patent creates a universal reservation mechanism that all nodes in the network can use independently. Each node follows the same protocol for indicating reservations and using time slots, making the system universally applicable without requiring specialized centralized control. This multi-functional approach allows any node to act as both a data source and a potential relay, simplifying the overall network architecture while maintaining high data delivery efficiency.
Data Source
AI summary
On-demand allocation of communication capacity in a Mobile ad hoc Network (MANET) involves initiating in a first node of the MANET, a request for network communication capacity. The request is initiated by wirelessly transmitting an access request in a first epoch, during an access request time slot of a TDMA waveform. The access request is directed to one-hop neighbor nodes with which the first node can communicate directly. The first node determines whether the access request has been granted based on one or more responses received from the one-hop neighbor nodes. These responses include an indication by each of the one-hop neighbor nodes regarding their availability to accommodate the access request. The first node subsequently uses network communication capacity granted to it for communicating data.