Distributed Binary Unique Number Generator for MANET Address Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing address allocation methods in Mobile Ad-Hoc Networks (MANETs) face challenges such as high overhead in duplicate address detection, privacy issues due to predictable address generation, infeasibility of centralized solutions, and inefficient address space utilization, particularly in dynamic and high-mobility environments.
Innovation Solution
A Distributed Binary Unique Number Generator function that uses a pair of parameters (n, s) to generate a new pair (n+2s, s+1) for address configuration, eliminating the need for duplicate address detection and ensuring unique addresses without a centralized server, optimizing address space utilization and handling network partitions and mergers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If stateless auto-configuration approaches are used with Duplicate Address Detection, then address uniqueness is ensured, but network overhead increases significantly
Solution Approach 1:
The patent applies preliminary action by pre-dividing the address space into disjoint sets before nodes join the network. Each node is pre-assigned a unique address from its designated set, eliminating the need for post-assignment duplicate detection. This proactive approach ensures address uniqueness is established before nodes become active, avoiding the overhead of DAD mechanisms.
Solution Approach 2:
The patent segments the address space into multiple disjoint sets, with each node or node group assigned to a specific set. This segmentation ensures that nodes from different sets cannot generate conflicting addresses, as the sets are mutually exclusive. The segmentation is maintained through the distributed binary unique number generator that systematically allocates addresses from predefined disjoint sets.
2Device complexity
If centralized address allocation servers are used, then address management is simplified, but feasibility decreases in highly mobile MANET environments
Solution Approach 1:
The patent implements self-service by enabling nodes to autonomously generate and allocate addresses from their predefined sets without requiring centralized server intervention. Each node maintains its own state and uses the distributed binary unique number generator to autonomously manage its address space, making the system adaptable to dynamic mobile environments where centralized infrastructure is unavailable.
Solution Approach 2:
The patent applies dynamics by making the address allocation system adaptive to changing network topologies and node mobility. The distributed binary unique number generator dynamically adjusts address assignments based on local node state and network conditions, allowing the system to function effectively in highly mobile MANETs where centralized control would be impractical.
3Ease of manufacture
If traditional IP-based address assignment schemes like DHCP are used, then address allocation is standardized, but applicability decreases in MANET environments without permanent infrastructure
Solution Approach 1:
The patent replaces the mechanical centralized server-based DHCP system with a distributed autonomous address generation mechanism. Instead of relying on a permanent infrastructure server, nodes use the distributed binary unique number generator to autonomously create addresses, substituting the centralized mechanical system with a distributed computational approach suitable for MANETs.
Solution Approach 2:
The patent changes the fundamental parameters of address allocation by transitioning from server-controlled dynamic allocation to node-autonomous generation based on distributed binary math. The system uses parameters like node state values and binary operations to generate addresses locally, fundamentally changing how address allocation works compared to traditional DHCP mechanisms.
4Productivity
If address space is allocated without systematic division, then allocation speed increases, but address conflicts and duplications occur
Solution Approach 1:
The patent segments the address space into disjoint sets that are systematically allocated to different nodes or node groups. This segmentation ensures that nodes receive addresses from non-overlapping ranges, guaranteeing uniqueness while maintaining efficient allocation. The systematic division prevents conflicts before they can occur, balancing speed and reliability.
Solution Approach 2:
The patent applies preliminary action by pre-establishing the disjoint address sets and assigning them to nodes before actual communication begins. This pre-assignment ensures that when nodes become active, their addresses are already determined and conflict-free, enabling rapid deployment without the need for slow DAD processes while maintaining absolute address uniqueness.
Data Source
AI summary
A distributed network address allocation method is disclosed. For this purpose, an apparatus is provided for use as or in a node of the network. The apparatus comprises a portion (2, 3, 4) for maintaining a seed value n and a state value s. An address (8) of the node is determined from the seed value n by address setting portion (6). A portion (9) is provided for receiving a request from a new node wishing to join the network and itself adapted to perform the method. A portion (10, 12) is provided for generating a proposed seed value using the formula (n+2s) and a proposed state value using the formula (s+1). A portion (14) is provided for offering the proposed seed and state values to the new node. A portion (18) is provided for updating the node's state value s to be the same as that accepted by the new node, if the proposed seed and state values are accepted by the new node. This provides unique address allocation to nodes in a Mobile Ad-Hoc Network.