Description:TECHNICAL FIELD
[0001] The present disclosure relates, in general, to the field of communication, and more specifically, relates to tactical communication over mesh networks.

BACKGROUND
[0002] A lot of development has happened in the field of Mobile Ad Hoc Networks (MANET) and networking radios. MANET is a network of mobile ad-hoc radios where the radios will automatically form and maintain the network. Usually, in the tactical scenario, MANET is meant for a mission-specific task for a predefined number of radios and a predefined number of hops for a particular area. The purpose of MANET is seamless communication among the radios for data and voice purposes. Delivering the information in a time-bound manner as per the mission is one of the key parameters. MANET should be able to self-form, self-heal and self-maintain the network. MANET offers multi-hop communication between radios not directly connected to each other by means of relaying information through the intermediate radios. This enables an enhanced coverage area for communication between radios in the network.
[0003] The traffic request from all the radios must be handled and allocation of the resources is required as per QoS parameters like priority, data type, transmission delay, throughput and the like. The resource can be frequency or time slots depending on the access mechanisms used. In the case of a TDMA-based network where only a single channel is used, slots are the prime resource that is required to transfer data. Usually in a TDMA structure, the time or epoch is divided into repeated patterns called frames. The frames are further divided into slots. The slot can be of the same size or variable size. The hop rate of the frequency hopping mode plays a major role in determining the size of the slot. The radios can use the slots to send and receive information in a predefined manner. TDMA has the advantage of collision-free transfers, but slots will be wasted if a particular radio does not have any information to transfer at that particular slot.
[0004] To utilize the TDMA scheme more efficiently dynamic TDMA (DTDMA) is used. There are many different ways in which DTDMA can be implemented. For a collision-free transmission; dynamic allocation of time slots in a frame is decided ahead of the transmission which requires additional overheads. To go with TDMA or DTDMA is a tradeoff to be made depending on parameters like requirements of the mission at hand, the complexity, overheads etc.
[0005] In a networking scenario, where the number of radios is more, it becomes more complicated. One of the key aspects of a TDMA-based system is to maintain the throughput of the network. As the network size increases the amount of control information essentially the connectivity information increases. This requires additional control slots to propagate connectivity globally to all radios in the network. There is an extra multiplication factor of the number radios in the backbone of the network to the additional slot requirement. This extra factor is composed of the number of radios in the backbone named leaf radios and root radios which is obtained from the computation of a connected dominating set of graphs of network connectivity.
[0006] Among the many popular routing schemes already available in the literature, one
technique involves applying the graph theory and tree traversal methods where any network can be represented by a connected dominating set. A connected dominating set of graph G is a set D of vertices, with two properties
• Any radio in D can reach any other radio D by a path that stays entirely within D. That is, D induces a connected sub-graph of G.
• Every radio in G either belongs to D or is adjacent to a radio in D. That is, D is a dominating set of G
[0007] An example of a system using TDMA is recited in a Patent document US8942197B2 that describes a mobile ad hoc network (MANET) where mobile nodes are configured to operate in a geographic area using a time division multiple access (TDMA) protocol and based upon a TDMA epoch including TDMA time slots.
[0008] Another example is recited in a patent US8675678B2 that discloses adaptive medium access control (AMAC) methods and systems, implemented in a decentralized fashion, in a wireless ad-hoc network, including a wireless mobile ad-hoc network (MANET). AMAC may include synchronizing periodic epochs of time and a state of a schedule with other nodes of the network.
[0009] The contention-free periods may be allocated amongst the nodes. AMAC may permit a node to initiate a transmission during a contention-free period allocated to the node and extend and complete the transmission during an immediately subsequent contention period. Throughput is managed by extending the transmission in the contention period.
[0010] In both of the above publications, there is a cushion of contention period in the TDMA frame which can be used for the extra requirement of slots to pack control information if required, however, contention period will incorporate unnecessary delay due to contention for radios to get access to the wireless channel for exchange of control information.
[0011] Yet another example is recited in a Patent document EP2777359B1 that exploits the capability of an improved MANET reference receiver to simultaneously receive the whole frequency range or several channels over a wideband frequency range, making these channel frequencies become part of a global MAC algorithm, namely, the simultaneous channel frequencies provide an additional dimension for the MAC algorithm. The Spectral efficiency is achieved at the cost of transceiver design making hardware complex in terms of RF filter designs and an extra dimension of frequency into MAC which increases the control information. It explains latency improvement but the relationship between throughput improvement due to multichannel and throughput loss due to control information and relaying is not defined.
[0012] There is, therefore, a need in the art to restrict the additional usage of slots meant for traffic by compressing the control information most importantly the connectivity information to fit within those fixed for control information. This is achieved through a lossless distributive exchange of connectivity information in a TDMA-based MANET with reduced overhead.
OBJECTS OF THE PRESENT DISCLOSURE
An object of the present disclosure is to provide a system that provides efficient utilization of network resources by a cooperative distribution of neighborhood connectivity information.
Another object of the present disclosure is to provide a system that provides the selection of root and leaf radio units to establish a structured backbone, enhancing the stability and reliability of the MANET.
Another object of the present disclosure is to provide a system that reduces overhead through compressed information forwarded by leaf radio units to root radio units.
Another object of the present disclosure is to provide a system that provides a root radio unit to consolidate and generate compressed network connectivity updates, providing dynamic and real-time adjustments to the network structure.
Another object of the present disclosure is to provide a system that utilizes the symmetric property of the matrix for the efficient reconstruction of the network connectivity matrix, ensuring accuracy and reliability.
Another object of the present disclosure is to provide a system that verifies that the reconstructed global network connectivity matrix is identical to the uncompressed one, ensuring lossless compression.
Another object of the present disclosure is to provide a system that achieves a compression ratio of 0.5 or less contributing to reduced overhead, optimizing the utilization of available network resources.
Another object of the present disclosure is to provide a system that compresses control information, including connectivity details to fit within fixed slots designated for control information, maximizing the usage of available bandwidth.
Another object of the present disclosure is to provide a system that provides a reduction in overhead and efficient use of slots contributing to an overall improvement in throughput, enhancing the performance of the MANET.
Yet another object of the present disclosure is to provide a system that adapts to changes in network size, providing scalability and flexibility in various deployment scenarios.

SUMMARY
The present disclosure relates in general, to the field of communication, and more specifically, relates to tactical communication over mesh networks. The main objective of the present disclosure is to overcome the drawbacks, limitations, and shortcomings of the existing system and solution, by providing a system and method for lossless distributive exchange of connectivity information in a TDMA-based MANET, the method includes assigning a plurality of radio units a unique identity in a network, wherein the unique identity pertains to softIDs that are consecutive integers based on an order in which each radio unit joins the network. Transmitting by each radio unit a neighborhood connectivity information halves in a frame to ensure cooperative distribution of information. Selecting a root radio unit and leaf radio units from the plurality of radio units to serve as a backbone for the network. Forwarding compressed neighborhood connectivity information by the leaf radio units to the root radio unit. Enabling the root radio unit to consolidate and generate a compressed network connectivity update to transmit to the plurality of radio units through the leaf radio units. Receiving the compressed network connectivity update to reconstruct a partial network connectivity matrix by the plurality of radio units. Reconstructing a global network connectivity matrix in every frame from the partial network connectivity matrix decoded in the present frame and previous frames. Verifying that the reconstructed global network connectivity matrix is identical to the one without compression, thereby ensuring lossless compression and facilitating compression ratio of 0.5 or lesser leading to reduced overhead.
MANET is a self-configuring, self-healing and self-maintaining network of any mobile radios participating in the mission. MANET does not rely on any infrastructure for its set-up and is capable of adapting to dynamic changes due to the mobility of the radios. MANET is capable of providing multi-hop communication between radios not directly connected to each other through the relay information by the intermediate radios. The multi-hop capability of MANET enhances the data coverage area of radios in the network. MANET described herein operates on the framework of Dynamic TDMA. Time is divided into frames of fixed duration. The frame is further divided into slots. The duration of the slot is fixed based on the hop rate in the frequency hopping mode of operation. The slots are further divided based on their assignments. Few slots are assigned fixed to all radios participating in the network. Few other slots within a frame are assigned dynamically based on the topology; for additional roles and requests of radios for traffic and voice in the network.
MANET described here works based on the global information of the network in terms of network size, network identity, the identity of participating radios and connectivity information of radios in the network. Every radio maintains this information which enables them to take additional
responsibilities within the network when required and for communicating to any radio in the network. Little information which is redundant is not transmitted always within the network.
An arbitrator or root radio exists in a network which is chosen dynamically based on the connectivity of the network. Arbitrator consolidates the neighborhood connectivity of all the participating radios to formulate the global network connectivity matrix. The current arbitrator uses this global network connectivity matrix to calculate the connected dominating set of the graph based on the connectivity. The new arbitrator is chosen from among the connected dominating set which is at a critical position within the network and the one with the maximum connectivity. The connected dominating set acts as the backbone of the network. Any radio can communicate to any other radio through a path that lies within this dominating set.
All radios of the connected dominating set excluding the arbitrator are called leaf radios. There is a fixed transmission order starting from leaf to arbitrator for sending the neighborhood connectivity of all radios; another transmission order from an arbitrator to leaf to send the reformulated global network connectivity matrix. Every radio sends its neighborhood connectivity in its fixed assigned slots. A few additional slots are used by the leaf radios to relay the consolidated neighborhood connectivity information of its connected radios and relay radios to the arbitrator and forward global network connectivity updates from arbitrator to all radios in the network.
In addition to the connectivity information, slots are constrained due to the packing of additional information like traffic requests and traffic allotment information. The amount of information to handle may increase exponentially according to the network size. Since the size of slots is already fixed; extra information about the growing network has to be handled using additional slots which is proportional to the number of radios in the backbone of the network viz. the number of leaf radios and arbitrator. This may result in bandwidth wastage of the order of leaf radios and arbitrators in the network. To avoid unnecessary usage of bandwidth for control by taking additional slots for transmitting connectivity information, compression of connectivity information is disclosed. The technique used compresses connectivity information by a factor of 0.5 or lesser.
The compression of connectivity information is as follows:
Connectivity is indicated using a single bit for connection and no connection.
The global network connectivity information is assumed to be bidirectional in the sense that connectivity is 1 if it is 1 from both directions. Directed connection if any is eliminated.
Global network connectivity is based on the neighbourhood connectivity received from all radios in the network.
For redundant information received from two different radios when network size is even, appropriate information is not decoded based on whether the frame is even or odd ensuring that only one side of the connectivity is decoded per frame.
The neighborhood connectivity of any radio is updated based on listening within its range.
Any radio sends only one-half of its neighborhood connectivity information in a frame; sends the other half in the following frame.
Arbitrator consolidates appropriate connectivity halves for the overall network connectivity update which it sends in the respective frame.
All radios in the network consolidate the network connectivity update received from the arbitrator in the present and previous frame to reconstruct the global network connectivity matrix.
Various objects, features, aspects, and advantages of the inventive subject matter will become more apparent from the following detailed description of preferred embodiments, along with the accompanying drawing figures in which like numerals represent like components.

BRIEF DESCRIPTION OF THE DRAWINGS
The following drawings form part of the present specification and are included to further illustrate aspects of the present disclosure. The disclosure may be better understood by reference to the drawings in combination with the detailed description of the specific embodiments presented herein.
FIG. 1 illustrates a basic TDMA frame.
FIG. 2A illustrates throughput drop due to additional usage of slots at Tslot = 2ms; TFrame = 250 ms; K = 32 ms; aFixed = 2; NLeaf = 6; Rbit = 1 Mbps; N = 64.
FIG. 2B illustrates a graph representing the throughput drop with the number of variable slots.
FIG. 3A to 3D illustrates ?_Evenfor N=5, ?_Oddfor N=5, ?_Even for N=4, ?_Odd for N=4.
FIG. 4 illustrates the random topology of eight radios, in accordance with an embodiment of the present disclosure.
FIG. 5 illustrates neighborhood connectivity and global network connectivity matrix based on actual information size, in accordance with an embodiment of the present disclosure.
FIG. 6 illustrates neighborhood connectivity and partial network connectivity matrix recovered based on the compressed information, in accordance with an embodiment of the present disclosure.
FIG. 7 illustrates the global network connectivity matrix ?, in accordance with an embodiment of the present disclosure.
FIG. 8 illustrates regenerated topology based on bidirectional assumption and global network connectivity matrix ?, in accordance with an embodiment of the present disclosure.
FIG. 9 illustrates an exemplary flow chart of a method for lossless distributive exchange of connectivity information in a TDMA-based MANET, in accordance with an embodiment of the present disclosure.

DETAILED DESCRIPTION
The following is a detailed description of embodiments of the disclosure depicted in the accompanying drawings. The embodiments are in such detail as to clearly communicate the disclosure. If the specification states a component or feature “may”, “can”, “could”, or “might” be included or have a characteristic, that particular component or feature is not required to be included or have the characteristic.
As used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.
The present disclosure relates to an effective method of lossless distributive exchange of connectivity information in a TDMA-based MANET leading to reduced overhead. Connectivity information sharing plays a vital role in communication in a network of radios. Connectivity information is used to calculate the backbone of the network. This backbone is used to broadcast control and data information. This backbone can include one root radio and many leaf radios. Every radio is given a unique identity called softID based on the order in which the radio joins the network. TDMA, the medium access control (MAC) protocol has fixed slots for control, additional slots for relaying of control and dynamic slots for data. As connectivity information increases exponentially with network size, there is an increase in slots for control and a decrease in slots for data leading to a throughput drop. A linear relationship between throughput drop and the number of additional slots has been claimed.
In the present disclosure throughput drop due to excess information, flow has been dealt with by cooperative distribution and compression of connectivity information. Every radio in the network, in a given frame cooperatively sends one-half of its connectivity information with well-defined boundaries of their softID. Compression and management of connectivity information by each radio and transformation of connectivity information, to generate a symmetric matrix without any compromise on the throughput and data round trip time. Further in this method, connectivity information is contained within the slots reserved for control information. This leads to a lossless compression technique. The overall compression ratio of 0.5 or lesser is achieved using this method. The present disclosure can be described in enabling detail in the following examples, which may represent more than one embodiment of the present disclosure.
In an aspect, the present disclosure relates to a method for lossless distributive exchange of connectivity information in a TDMA-based MANET, the method includes assigning a plurality of radio units a unique identity in a network, wherein the unique identity pertains to softIDs that are consecutive integers based on an order in which each radio unit joins the network. Transmitting by each radio unit neighborhood connectivity information halves in designated frames ensuring cooperative distribution of information. Selecting a root radio unit and leaf radio units from the plurality of radio units to serve as a backbone for the network. Forwarding compressed neighborhood connectivity information by the leaf radio units to the root radio unit. Enabling the root radio unit to consolidate and generate a compressed network connectivity update to transmit to the plurality of radio units through the leaf radio units. Receiving the compressed network connectivity update to reconstruct a partial network connectivity matrix by the plurality of radio units. Reconstructing a global network connectivity matrix in every frame from the partial network connectivity matrix decoded in present and previous designated frames. Verifying that the reconstructed global network connectivity matrix is identical to the one without compression, thereby ensuring lossless compression and facilitating a compression ratio of 0.5 or lesser leading to reduced overhead.
In an aspect, each radio unit transmits one-half of the neighborhood connectivity information succeeding its respective assigned softID in the designated frame, and the other half of the neighborhood connectivity information preceding its s respective assigned softID in a subsequent designated frame.
In another aspect, the neighborhood connectivity information is a binary array (0,1) of dimension 1 x?(N-1)/2?, whose elements are updated based on listening from an appropriate radio unit. In another aspect, each radio unit transmits its respective neighborhood connectivity information in halves during every alternate frame, ensuring that the information is compressed to one-half of the total information.
In another aspect, the backbone of the network is a set of radio units selected based on a connected dominating set, and the selected radio units define the root radio unit or arbitrator and leaf radio units based on corresponding functions.
In another aspect, the leaf radio units relay the compressed neighborhood connectivity information halves within the frame to the root radio unit in a specific transmission order defined as leaf-to-root order (L2R) in corresponding designated slots.
In another aspect, the root radio unit consolidates the neighborhood connectivity information to generate the compressed network connectivity update in designated frames and transmits the update to the plurality of radio units through the leaf radio units in a specific transmission order defined as root-to-leaf order (R2L).
In another aspect, the compressed network connectivity update of dimension N x (N-1)/2is received and reconstructed by the plurality of radio units to generate the partial network connectivity matrix of dimension N x N by applying a symmetric property of matrix.
In another aspect, the global network connectivity matrix of dimension N x N is reconstructed in every frame from the partial network connectivity matrix using a logical AND operation between matrices decoded in the present and previous designated frames.
[0054] The advantages achieved by the system of the present disclosure can be clear from the embodiments provided herein. The system enhances the efficiency of network utilization through the cooperative distribution of neighborhood connectivity information. This system features the strategic selection of root and leaf radio units, establishing a structured backbone that enhances the stability and reliability of the MANET. Overhead reduction is achieved by forwarding compressed information from leaf to root radio units, minimizing associated transmission overhead. The system enables the root radio unit to consolidate and generate compressed network connectivity updates dynamically, facilitating real-time adjustments to the network structure. Leveraging the symmetric property of the matrix ensures accurate and reliable reconstruction of the network connectivity matrix. Additionally, the system verifies the reconstructed global network connectivity matrix's entries, ensuring lossless compression. With a compression ratio of 0.5 or lesser, the system optimizes network resource utilization, and the compression of control information enables its accommodation within fixed control information slots, maximizing bandwidth usage. This approach contributes to an overall improvement in throughput, enhancing MANET performance. Furthermore, the system demonstrates adaptability to changes in network size, providing scalability and flexibility in diverse deployment scenarios. The description of terms and features related to the present disclosure shall be clear from the embodiments that are illustrated and described; however, the invention is not limited to these embodiments only. Numerous modifications, changes, variations, substitutions, and equivalents of the embodiments are possible within the scope of the present disclosure. Additionally, the invention can include other embodiments that are within the scope of the claims but are not described in detail with respect to the following description.
[0055] FIG. 1 illustrates a basic TDMA frame, in accordance with an embodiment of the present disclosure.
FIG. 1 shows a basic TDMA frame, where TFrame is the total duration of the frame. TTraffic is the duration of traffic in a frame. TFixed is the total duration of fixed assigned slots. Tvar is duration of control slots which is dynamically assigned based on the topology of the network. NLeaf is the total number of leaf radios in the network. Rbit is the number of bits transmitted per second. Tslot is the duration of slot. Nslot is the total number of slots of Tslot duration in TFrame. aFixed is the fixed factor representing the number of slots per leaf radio; avar is the variable factor representing the number of extra slots per leaf radio and arbitrator. K is a constant value defined for the network in terms of number of slots.
The total throughput of the system is given by
S_system= T_Traffic/T_Frame *R_bit
? T?_Traffic=T_Frame- (T_Fixed+T_Var)

(1.1)

T_Frame=? N?_Slot*T_Slot
(1.2)

? T?_Fixed = (K+?(a?_Fixed*N_Leaf))* T_Slot
(1.3)

? T?_Var = (1+a_Var)*(1+N_Leaf)*T_Slot
(1.4)

Ideally avar = 0; this term appears due to additional usage of slots to accommodate the connectivity information of the network.
The throughput drop due to avar is given by
? S?_drop= S_(System )^(a_Var=0)-S_(System )^(a_Var>0)
(2)
S_drop=(a_Var*?(1+N?_Leaf))/N_Slot *R_bit
(2.1)
The percentage of throughput drop is given by
?S^%?_drop=S_drop/(S_(System )^(a_Var=0) )* 100
(2.2)

?? S?^%?_drop=(a_Var*?(1+N?_Leaf)*T_Frame)/(N_Slot*T_Traffic^(a_Var=0) )*100
(2.3)
Where T_Traffic^(a_Var=0)is TTraffic when avar = 0, S_(System )^(a_Var=0) is the system throughput when avar = 0 and S_(System )^(a_Var>0) is the system throughput when avar > 0.
Hence throughput of the network is a factor ofT_Traffic/T_Frame .The percentage reduction in throughput due to additional usage of slots to accommodate the connectivity of the growing network increases linearly as the number of leaf radios and arbitrator or number of hops in the network.
FIG. 2A is a table showing the throughput drop for various values of avar. FIG. 2B is the graph showing the linear relationship of throughput drop to variable number of slots. Every increase of avar will result in a throughput drop of 7.78 percentage for a network of 7 hops or 6 leaf radios. Throughput drop is based on the topology of the network in terms of the number of leaf radios which is indirectly prompted due to enhanced information flow due to the increase in network size.
Since the MANET being designed is mission-specific. It is constrained to certain network size and number of hops. The network size of 64 described herein may lead to avar =1; which results in a throughput reduction of 7.78 percentage for Nleaf= 6. In this context the compression technique described results in a compression ratio of .5 which in turn reduces avar to 0.
Here, two different types of connectivity information are described. The neighborhood connectivity is the connectivity array exhibited by each radio based on its active listening in each frame in the network. Hence neighborhood connectivity of radio i in a network of size N is given by
R^i=[?_(i,0),?_(i,1),?_(i,2)……?_(i,j)…..?_(i,N-1)]
(3)
The neighborhood connectivity information is updated by all the radios based on their active listening in the network. This is transmitted by all radios in their fixed assigned slots. This is relayed to the root radio by the leaf radios. The leaf radios stack the neighborhood connectivity information of its connected radios and those received from its connected leaf radios and forward it to the arbitrator in the slot meant for the relaying of control information. The received information from all radios which are directly connected and those which are relayed by the leaf radios are stacked by the arbitrator which constitute the network connectivity update, which the root radio broadcast to all radios in the network. This is used by all the radios to reconstruct the global connectivity matrix. Hence the global network connectivity matrix of the network is based on the neighborhood connectivity received by arbitrator from all radios in the network.
The global network connectivity matrix is given by
[¦(?_0,0,?_0,1,?_0,2 ?,??_0,3………………..?_(0,N-1)@?_1,0,?_1,1,?_(1,2,) ?_1,3………………..?_(1,N-1)@?_2,0,?_2,1,?_(2,2,) ?_2,3………………..?_(2,N-1)@……………………………………………@……………………………………………@?_(i,0),?_(i,1),?_(i,2) ?,??_(i,3)………?_(i,j)……..?_(i,N-1)@……………………………………………@……………………………………………@?_(N-1,0),?_(N-1,1),?_(N-1,2) ?_(N-1,3)………………..?_(N-1,N-1) )]
(4)
where ?_(i,j)={0,1}. In R^i,?_(i,j) =1 if radio i listens an active transmission from radio j. Hence neighborhood connectivity is based purely on the reception; i.e. in R^j,?_(j,i) =1 if radio j listens an active transmission from radio i.
To construct matrix C of (4), the neighborhood connectivity of all the radios in the network viz. ? R?^0, R^1,? R?^2,…..R^i,….R^j,…..R^(N-1)as it appears in the network connectivity update is decoded and entries are updated as
? ??_(i,j)=?_(j,i)=1 ; if ?_(i,j)=1 and ?_(j,i)=1
? ??_(i,j)=?_(j,i)=0; elsewhere
(5)
Hence the graph or the global network connectivity; being considered is based on bidirectional assumption
?_(i,j)=?_(j,i)
This assumption ensures that matrix C is symmetric
C^T=C
(7)
The network connectivity update as broadcasted by the root radio constitutes the major portion of control information exchange which is equal to (N*N). Distributive exchange of connectivity information in addition to the symmetric property of global connectivity matrix which is prompted due to the bidirectional assumption of the links may help reduce the amount of connectivity information being transmitted in a frame.
The bidirectional assumption enables any radio to send only one-half of its information at any frame; as the other half is redundant. Hence every alternate frame; the radio sends the respective connectivity halves based on their softID. The softID is the unique identity assigned to the radio participating in the mission which is selected from a set of consecutive integers of size equal to the network size. This identity is assigned to the radios based on the order of time in which it join the network. Connectivity information of size equal to one-half of the network size is transmitted by each radio based on frame. Every frame is named, even, odd alternatively. The neighborhood connectivity information is sent by all the radios based on this frame classification.
R_Even^i=[?_(i,(i+1) mod N),?_(i,(i+2) mod N),….…?_(i,(i+j) mod N)…?_(i,(i+?(N-1)/2?) mod N)]
(8)
where 1=j=?(N-1)/2?
R_Odd^i=[?_(i,(i+N-?(N-1)/2?) mod N),……?_(i,(i+N-j) mod N)….??_(i,(i+N-2)mod N),??_(i,(i+N-1)mod N)]
(9)
where 1=j= ?(N-1)/2?;
The neighborhood connectivity corresponding to even frame ,R_Even^i is an array of ?(N-1)/2?connectivity information succeeding the softID. Similarly, R_Odd^i is an array of ?(N-1)/2? connectivity information preceding the softID send in odd frame.
This constitutes the partial connectivity information transmitted by each radio in its fixed assigned slots in a frame. This information is relayed to the root radio by the leaf radios. This softID-based neighborhood connectivity, cooperatively sent by all radios in the network in even fame, constitutes one-sided connectivity of all links present in the current topology. The other sided connectivity of all the links are sent by all radios in the odd frame.
The arbitrator consolidates the neighborhood connectivity halves received from all radios in the network to form the network connectivity update which contains one-half of the total information. This is broadcasted by the root radio to all radios through the leaf radios.
The network connectivity update as send by the root radio is obtained by stacking R_Even^i in even frame and R_Odd^i in odd frame where 1=i= N. This constitute a total of (N*(N-1)/2) information send by the root radio.
Based on bidirectional assumption, the following matrices are reconstructed by all the radios based on the network connectivity update received by them in appropriate frames.
?_Even=[¦(?_0,0,?_0,1,?_0,2………?_(0,l,) ? ??_(l+1,0 ) ………..?_(N-1,0)@?_0,1,?_1,1,?_(1,2,)………? ??_(1,l+1 ) ? ??_(l+2,1 )………..?_(N-1,1)@?_0,2,?_1,2,?_(2,2,)………? ??_(2,l+2 ) ? ??_(l+3,2 )………..?_(N-1,2)@……………………………………………@……………………………………………@?_(0,i),?_(1,i),……?_(i-1,i,),?_(i,i,) ? ??_(i,i+1,) ?…? ??_(i,i+j,)..?_(i,i+l,) ??_(l+i+1,i )………..?_(N-1,i)@?_(0,l),?_(1,l),?_(2,l)………?_(l,l),?_(l,l+1.)……..?_(l,N-1)@?_(k,0),?_(k,(k+l)modN,) ?_((k+l+1)modN,k,)………?_(k,k,) ?_(k,k+1,)………..?_(k,N-1)@……………………………………………@……………………………………………@……………………………………………@……………………………………………@?_(N-2,0),?_(N-2,1)………? ??_(N-2,l-1,) ? ??_(l,N-2,)………..?_(N-2,N-1)@?_(N-1,0),?_(N-1,1),………? ??_(N-1,l,) ? ??_(l+1,N-1,)………..?_(N-1,N-1) )]
(10)
where 1=j= ?(N-1)/2?;l=?(N-1)/2? i?(N-1)/2?

?_Odd=[¦(?_0,0,?_1,0,?_2,0………?_(l,0,) ? ??_(0,l+1 ) ………..?_(0,N-1)@?_1,0,?_1,1,?_(2,1,)………? ??_(l+1,1) ? ??_(1,l+2,)………..?_(1,N-1)@?_2,0,?_2,1,?_(2,2,)………? ??_(l+2,2 ) ? ??_(2,l+3 )………..?_(2,N-1)@……………………………………………@……………………………………………@?_(k,0),?_(k,(k+l)modN,) ?_((k+l+1)modN,k,)………?_(k,k,) ?_(k,k+1,)………..?_(k,N-1)@?_(l,0),?_(l,1),?_(l,2)………?_(l,l),?_(l+1,l,)……..?_(N-1,l)@?_(0,i),?_(1,i),……?_(i-1,i,),?_(i,i,) ? ??_(i,i+1,) ?…? ??_(i,i+j,)..?_(i,i+l,) ??_(l+i+1,i )………..?_(N-1,i)@……………………………………………@……………………………………………@……………………………………………@……………………………………………@?_(0,N-2),?_(1,N-2),………? ??_(l-2,N-2) ? ??_(N-2,l-1,)………..?_(N-1,N-2)@?_(0,N-1),?_(1,N-1),………? ??_(l-1,N-1,) ? ??_(N-1,l,)………..?_(N-1,N-1) )]
(11)

?Even and ?Odd are called the partial network connectivity matrices, reconstructed by all radios based on the partial information in the network connectivity update received and decoded by applying the symmetric property of matrix in even and odd frame respectively
The global network connectivity matrix ? is reconstructed from ?Odd and ?Even decoded in the present and previous frame by performing a logic AND operation. This operation eliminates any directed connection in the topology.
If the current frame is odd
?=?_odd^Present.?_Even^Prev
(12)
If the current frame is even
?=?_Even^Present.?_Odd^Prev

(13)
Where the superscripts Present denotes the current frame Prev denotes the previous frame for appropriate ?_Odd and ?_Evengiven by Equations (10) and (11) respectively. As it is evident from equations (10) and (11) only one half of the information is actually sent in each frame. Hence total number of bits actually sent is only one-half of the total information size. Hence the compression ratio achieved is given by
?=(Information Sent)/(Actual Information Size)
(14)
?=(N*(N-1)/2)/(N*N)= .5
(14.1)
Every radio sends one half of the connectivity information according to the network size N every frame. N depends on the total number of radios joined at any given instant of time. It keeps growing as new radios join the network until it reaches the limit of maximum network size or the number of hops to which it is configured. N can takes values even or odd. When N is odd is there no redundancy about any links in a given frame. When N is even there are few links which are redundant in a given frame, say ?_(i,j) and ?_(j,i) are transmitted by the radios i and j respectively in a given frame, same is repeated for the next frame. It is expected to decode only one out of these two links say ?_(i,j) in one frame and ?_(j,i) in the following frame. This is ensured by eliminating certain links while decoding using a certain procedure as follows. For every even frames among the neighborhood connectivity received by the radios, whose softID is in the range of 0 to N/2-1; all (N )/(2 ) bits transmitted are decoded . While decoding the bits transmitted by radios whose softID is in the range of N/2 to N-1 the N/2 th bit is eliminated. Similarly for all odd frames among the neighborhood connectivity transmitted by the radios, whose softID is in the range of 0 to N/2-1; 1 st bit is eliminated while decoding. For radios whose softID is in the range of N/2 to N-1 all (N )/(2 ) bits transmitted are decoded.
Based on bidirectional assumption, the following matrices are reconstructed by all the radios based on the network connectivity update received by them in appropriate frames.
?_Even=[¦(?_0,0,?_0,1,?_0,2………?_(0,l,) ? ??_(l+1,0 ) ………..?_(N-1,0)@?_0,1,?_1,1,?_(1,2,)………? ??_(1,l+1 ) ? ??_(l+2,1 )………..?_(N-1,1)@?_0,2,?_1,2,?_(2,2,)………? ??_(2,l+2 ) ? ??_(l+3,2 )………..?_(N-1,2)@……………………………………………@……………………………………………@?_(0,i),?_(1,i),……?_(i-1,i,),?_(i,i,) ? ??_(i,i+1,) ?…? ??_(i,i+j,)..?_(i,i+l,) ??_(l+i+1,i )………..?_(N-1,i)@?_(0,l),?_(1,l),?_(2,l)………?_(l,l),?_(l,l+1.)……..?_(l,N-1)@?_(k,0),?_(k,(k+l)modN,) ?_((k+l+1)modN,k,)………?_(k,k,) ?_(k,k+1,)………..?_(k,N-1)@……………………………………………@……………………………………………@……………………………………………@……………………………………………@?_(N-2,0),?_(N-2,1)………? ??_(N-2,l-1,) ? ??_(l,N-2,)………..?_(N-2,N-1)@?_(N-1,0),?_(N-1,1),………? ??_(N-1,l,) ? ??_(l+1,N-1,)………..?_(N-1,N-1) )]
(10)
where 1=j= ?(N-1)/2?;l=?(N-1)/2? i?(N-1)/2?

?_Odd=[¦(?_0,0,?_1,0,?_2,0………?_(l,0,) ? ??_(0,l+1 ) ………..?_(0,N-1)@?_1,0,?_1,1,?_(2,1,)………? ??_(l+1,1) ? ??_(1,l+2,)………..?_(1,N-1)@?_2,0,?_2,1,?_(2,2,)………? ??_(l+2,2 ) ? ??_(2,l+3 )………..?_(2,N-1)@……………………………………………@……………………………………………@?_(k,0),?_(k,(k+l)modN,) ?_((k+l+1)modN,k,)………?_(k,k,) ?_(k,k+1,)………..?_(k,N-1)@?_(l,0),?_(l,1),?_(l,2)………?_(l,l),?_(l+1,l,)……..?_(N-1,l)@?_(0,i),?_(1,i),……?_(i-1,i,),?_(i,i,) ? ??_(i,i+1,) ?…? ??_(i,i+j,)..?_(i,i+l,) ??_(l+i+1,i )………..?_(N-1,i)@……………………………………………@……………………………………………@……………………………………………@……………………………………………@?_(0,N-2),?_(1,N-2),………? ??_(l-2,N-2) ? ??_(N-2,l-1,)………..?_(N-1,N-2)@?_(0,N-1),?_(1,N-1),………? ??_(l-1,N-1,) ? ??_(N-1,l,)………..?_(N-1,N-1) )]
(11)

?Even and ?Odd are called the partial network connectivity matrices, reconstructed by all radios based on the partial information in the network connectivity update received and decoded by applying the symmetric property of matrix in even and odd frame respectively
The global network connectivity matrix ? is reconstructed from ?Odd and ?Even decoded in the present and previous frame by performing a logic AND operation. This operation eliminates any directed connection in the topology.
If the current frame is odd
?=?_odd^Present.?_Even^Prev
(12)
If the current frame is even
?=?_Even^Present.?_Odd^Prev

(13)
Where the superscripts Present denotes the current frame Prev denotes the previous frame for appropriate ?_Odd and ?_Evengiven by Equations (10) and (11) respectively. As it is evident from equations (10) and (11) only one half of the information is actually sent in each frame. Hence total number of bits actually sent is only one-half of the total information size. Hence the compression ratio achieved is given by
?=(Information Sent)/(Actual Information Size)
(14)
?=(N*(N-1)/2)/(N*N)= .5
(14.1)
Every radio sends one half of the connectivity information according to the network size N every frame. N depends on the total number of radios joined at any given instant of time. It keeps growing as new radios join the network until it reaches the limit of maximum network size or the number of hops to which it is configured. N can takes values even or odd. When N is odd is there no redundancy about any links in a given frame. When N is even there are few links which are redundant in a given frame, say ?_(i,j) and ?_(j,i) are transmitted by the radios i and j respectively in a given frame, same is repeated for the next frame. It is expected to decode only one out of these two links say ?_(i,j) in one frame and ?_(j,i) in the following frame. This is ensured by eliminating certain links while decoding using a certain procedure as follows. For every even frames among the neighborhood connectivity received by the radios, whose softID is in the range of 0 to N/2-1; all (N )/(2 ) bits transmitted are decoded . While decoding the bits transmitted by radios whose softID is in the range of N/2 to N-1 the N/2 th bit is eliminated. Similarly for all odd frames among the neighborhood connectivity transmitted by the radios, whose softID is in the range of 0 to N/2-1; 1 st bit is eliminated while decoding. For radios whose softID is in the range of N/2 to N-1 all (N )/(2 ) bits transmitted are decoded.
FIG. 3A is an even matrix reconstructed based on neighborhood connectivity sent by radios in even frames for a network of size 5, highlighted cells are the connectivity information actually sent by radios, rest of the cells are reconstructed based on symmetric property of the matrix. FIG. 3B is the corresponding odd matrix based on odd frames for the network of size 5. FIG. 3C is the even matrix reconstructed based on neighborhood connectivity sent on even frames for an even value of network size 4. FIG. 3D is the corresponding odd matrix. Based on neighborhood connectivity information halves sent by radios, there is redundancy about information sent by radios 0 and 2 for the link between them, similarly for radios 1 and 3. Redundancy is eliminated by decoding appropriate information as shaded in FIG. 3C for even matrix and FIG. 3D for odd matrix.
FIG. 4 is a random network topology of 8 radios explaining the bidirectional assumption of the graph. All the links except the link between Radio2 and Radio4 are bidirectional. Radio4 listens Radio2 but Radio2 does not listen Radio4 which is indicated using directional arrows FIG. 4.
Referring to FIG. 4, the communication system 400 for lossless distributive exchange of connectivity information in a TDMA-based MANET. The system 400 can include a plurality of radio units 402 (also referred to as radios 402, herein), each assigned a unique identity as softIDs, where the softIDs are consecutive integers based on an order in which each radio unit joins the network. The processor 404 is operatively coupled to the plurality of radio units, the processor configured to transmit, by each radio unit, neighborhood connectivity information halves in a frame, ensuring cooperative distribution of information.
The processor 404 can select a root radio unit and leaf radio units from the plurality of radio units to form a backbone for the network. Forward compressed neighborhood connectivity information by the leaf radio units to the root radio unit. Enable the root radio unit to consolidate and generate a compressed network connectivity update transmitted to the plurality of radio units through the leaf radio units. Receive the compressed network connectivity update and reconstruct a partial network connectivity matrix by the plurality of radio units. Reconstruct a global network connectivity matrix in every frame from the partial network connectivity matrix decoded in the present frame and previous frames. Verify that the reconstructed global network connectivity matrix is identical to the one without compression, ensuring lossless compression and facilitating a compression ratio of 0.5 or lesser, leading to reduced overhead.
The bidirectional assumption expels the link between Radio2 and Radio4 which is shown in FIG. 5. FIG. 5 is a table showing the neighborhood connectivity of various radios in the network and global network connectivity matrix of radio in the network without any compression. The neighborhood connectivity ? R ?^iis an array of sizes equal to network size. Every index of this array is the softID of various radios in the network. The value represented by 0 or 1 indicates connectivity based on listening. Hence the neighborhood connectivity of Radio4 shows connectivity with Radio2 as it listens Radio2; whereas the neighborhood connectivity of Radio2 does not show connectivity with Radio4 as it does not listen Radio4. The neighborhood connectivity as exhibited by various radios is transmitted in their fixed control slot. The arbitrator receiving this connectivity stacks the connectivity and broadcasts it to all radios in the root to leaf transmission order. All radios receive this information, reconstruct the matrix, and eliminates the connection between Radio2 and Radio4 based on the bidirectional assumption which is obtained from the global network connectivity matrix ?.
FIG. 6 is a table showing frame-based neighborhood connectivity and respective partial network connectivity matrix following the compression techniques as described by Equations 8, 9, 10 and 11. Every radio sends only one-half of its connectivity based on a frame designated as R_Even^iand? R?_Odd^i. Comparing it with ? R?^i of FIG. 5 only one-half of the information is sent in a frame. The network connectivity update hence sent by the arbitrator is R_Even^istacked together in even frame, ? R?_Odd^istacked together in odd frame, ensuring the total information sent being .5 of total information. The partial network connectivity matrices decoded appropriately based on frames by applying the symmetric property of matrix are designated ?_Even& and ? ??_Oddas is shown in FIG. 6. ?_Even does not indicate connectivity between Radio2 and Radio4 as it is based on information sent by Radio2, whereas ?odd indicates connectivity between Radio4 and Radio2 as it is based on information sent by Radio4.
The global network connectivity matrix ? is derived based on performing logic and
operation between ?_Even and ?_Odd received on the current and previous frames respectively. Hence the ? reduces to the one as shown in FIG. 7.
FIG.8 shows reconstructed topology or graph-based connectivity eliminating all the directed connections. This is based on the global network connectivity matrix reconstructed from compressed connectivity information sent by radios in various frames. This acts as the final topology for a network in a given frame, on which various operations like calculation of the connected dominating set to choose the dynamic arbitrator, leaf radios of the network, computation of optimal path between the source and destination for the exchange of traffic takes place.
The present disclosure of lossless compression of connectivity matrix based on the distributive exchange of connectivity matrix, utilizing the bidirectional assumption of the graph of any topology is explained. Connectivity information constitutes the major portion of control data propagating in the network. The amount of connectivity information increases exponentially with the network size. A linear relationship between throughput drops and number of additional slots, the total number of radios in the network backbone named leaf radios and arbitrator has been claimed using equations. Throughput drop due to excess information flow has been dealt by compressing the connectivity information. Every radio in the network, in a frame, by cooperative distribution sends one-half of its connectivity information with well-defined boundaries of their softID; which ensures the flow of information to restrict to a maximum value of 0.5 of total information. In general, the technique of lossless compression of connectivity information which constitute the control information propagated in the network, reduces the overhead, and offers an advantage of additional slots available for data which is reflected as the throughput enhancement of the system.
FIG. 9 illustrates an exemplary flow chart of a method for lossless distributive exchange of connectivity information in a TDMA-based MANET, in accordance with an embodiment of the present disclosure.
The method 900 includes at block 902, assigning a plurality of radio units a unique identity in a network, wherein the unique identity pertains to softIDs that are consecutive integers based on the order in which each radio unit joins the network.
At block 904, transmit by each radio unit a neighborhood connectivity information halves in a frame to ensure cooperative distribution of information.
At block 906, select a root radio unit and leaf radio units from the plurality of radio units to serve as a backbone for the network.
At block 908, forwarding compressed neighborhood connectivity information by the leaf radio units to the root radio units.
At block 910, enables the root radio units to consolidate and generate a compressed network connectivity update to transmit to the plurality of radio units through the leaf radio units.
At block 912, receive the compressed network connectivity update to reconstruct a partial network connectivity matrix by the plurality of radio units. At block 914, reconstruct a global network connectivity matrix in every frame from the partial network connectivity matrix decoded in present frame and previous frames. At block 916, verify that the reconstructed global network connectivity matrix is identical to the one without compression, thereby ensuring lossless compression and at block 918, facilitating a compression ratio of 0.5 or lesser leading to reduced overhead.
Each radio unit transmits one half of the neighborhood connectivity information succeeding its respective assigned softID in the frame, and other half of the neighborhood connectivity information preceding its respective assigned softID in a subsequent designated frames. The neighborhood connectivity information is a binary array (0,1) of dimension 1 x?(N-1)/2?, whose elements are updated based on listening from an appropriate radio unit. Each radio unit transmit its respective neighborhood connectivity information in halves during every alternate frame, ensuring that the information is compressed to one-half of the total information.
The backbone of the network is a set of radio units chosen based on a connected dominating set, and the selected radio units define the root radio unit or arbitrator and leaf radio units based on corresponding functions. The leaf radio units relay the compressed neighborhood connectivity information halves within the frame to the root radio unit in a specific transmission order defined as leaf-to-root order (L2R). The root radio unit consolidates the neighborhood connectivity information to generate the compressed network connectivity update in appropriate frames and transmits the update to the plurality of radio units through the leaf radio units in a specific transmission order defined as root-to-leaf order (R2L). The compressed network connectivity update of dimension N x (N-1)/2 is received and reconstructed by the plurality of radio units to generate the partial network connectivity matrix of dimension N x N by applying a symmetric property of the matrix.
The global network connectivity matrix is reconstructed in every frame from the partial network connectivity matrix using a logical AND operation between matrices decoded in the present and previous frames. A lossless compression is achieved by using the frame-based approach and cooperative decision on selecting the connectivity halves to be transmitted. Further, the throughput drop occurs due to an increase in network size leading to additional slots for control information. These additional slots are reduced by using this method.
Thus, the present invention overcomes the drawbacks, shortcomings, and limitations associated with existing solutions, and provides a system enhances the efficiency of network utilization through the cooperative distribution of neighborhood connectivity information. This system features the strategic selection of root and leaf radio units, establishing a structured backbone that enhances the stability and reliability of the MANET. Overhead reduction is achieved by forwarding compressed information from leaf to root radio units, minimizing associated transmission overhead. The system enables the root radio unit to consolidate and generate compressed network connectivity updates dynamically, facilitating real-time adjustments to the network structure. Leveraging the symmetric property of the matrix ensures accurate and reliable reconstruction of the network connectivity matrix. Additionally, the system verifies the reconstructed global network connectivity matrix's identity, ensuring lossless compression. With a compression ratio of 0.5 or less, the system optimizes network resource utilization, and the compression of control information enables its accommodation within fixed control information slots, maximizing bandwidth usage. This approach contributes to an overall improvement in throughput, enhancing MANET performance. Furthermore, the system demonstrates adaptability to changes in network size, providing scalability and flexibility in diverse deployment scenarios.
It will be apparent to those skilled in the art that the system 400 of the disclosure may be provided using some or all of the mentioned features and components without departing from the scope of the present disclosure. While various embodiments of the present disclosure have been illustrated and described herein, it will be clear that the disclosure is not limited to these embodiments only. Numerous modifications, changes, variations, substitutions, and equivalents will be apparent to those skilled in the art, without departing from the spirit and scope of the disclosure, as described in the claims.
ADVANTAGES OF THE PRESENT INVENTION
[00103] The present disclosure provides a system that provides efficient utilization of network resources by cooperative distribution of neighborhood connectivity information.
[00104] The present disclosure provides a system that provides the selection of root and leaf radio units and establishes a structured backbone, enhancing the stability and reliability of the MANET.
[00105] The present disclosure provides a system that reduces overhead through compressed information forwarded by leaf radio units to root radio units, minimizing the overhead associated with data transmission.
[00106] The present disclosure provides a system that provides a root radio unit to consolidate and generate compressed network connectivity updates, providing dynamic and real-time adjustments to the network structure.
[00107] The present disclosure provides a system that utilizes the symmetric property of the matrix for the efficient reconstruction of the network connectivity matrix, ensuring accuracy and reliability.
[00108] The present disclosure provides a system that verifies that the reconstructed global network connectivity matrix is identical to the uncompressed one, ensuring lossless compression.
[00109] The present disclosure provides a system that achieves a compression ratio of 0.5 or less contributes to reduced overhead, and optimises the utilization of available network resources.
[00110] The present disclosure provides a system that compresses control information, including connectivity details to fit within fixed slots designated for control information, maximizing the usage of available bandwidth.
[00111] The present disclosure provides a system that provides a reduction in overhead and efficient use of slots contributing to an overall improvement in throughput, enhancing the performance of the MANET.
[00112] The present disclosure provides a system that adapts to changes in network size, providing scalability and flexibility in various deployment scenarios.

, Claims:1. A method (900) for lossless distributive exchange of connectivity information in a time division multiple access (TDMA)-based Mobile Ad Hoc (MANET), the method comprising:
assigning (902) a plurality of radio units a unique identity in a network, wherein the unique identity pertains to softIDs that are consecutive integers based on an order in which each radio unit joins the network;
transmitting (904) by each radio unit a neighborhood connectivity information halves in designated frames ensuring cooperative distribution of information.;
selecting (906) a root radio unit and leaf radio units from the plurality of radio units to serve as a backbone for the network;
forwarding (908) compressed neighborhood connectivity information by the leaf radio units to the root radio unit;
enabling (910) the root radio unit to consolidate and generate a compressed network connectivity update to transmit to the plurality of radio units through the leaf radio units;
receiving (912) the compressed network connectivity update to reconstruct a partial network connectivity matrix by the plurality of radio units;
reconstructing (914) a global network connectivity matrix from the partial network connectivity matrix decoded in present and previous designated frames;
verifying (916) that the reconstructed global network connectivity matrix is identical to the one without compression, thereby ensuring lossless compression; and
facilitating (918) a compression ratio of 0.5 or lesser leading to reduced overhead.
The method as claimed in claim 1, wherein each radio unit of the plurality of radio units transmits one half of the neighborhood connectivity information succeeding its respective assigned softID in the designated frames, and the other half of the neighborhood connectivity information preceding its respective assigned softID in a subsequent designated frames.
The method as claimed in claim 1, wherein the neighborhood connectivity information is a binary array (0,1) of dimension 1 x?(N-1)/2?, whose elements are updated based on listening from an appropriate radio unit.
4. The method as claimed in claim 1, wherein each radio unit transmits their respective neighborhood connectivity information in halves during every alternate frame, ensuring that connectivity information is compressed to one-half of total information.
5. The method as claimed in claim 1, wherein the backbone of the network is a set of radio units selected based on a connected dominating set, and the selected radio units define the root radio unit or arbitrator and the leaf radio units based on corresponding functions.
6. The method as claimed in claim 1, wherein the leaf radio units relay the compressed neighborhood connectivity information halves within the designated frames to the root radio unit in a specific transmission order defined as a leaf-to-root order (L2R) in corresponding designated slots.
7. The method as claimed in claim 1, wherein the root radio unit consolidates the neighborhood connectivity information to generate the compressed network connectivity update in the designated frames and transmits the update to the plurality of radio units through the leaf radio units in the specific transmission order defined as root-to-leaf order (R2L).
The method as claimed in claim 1, wherein the compressed network connectivity update of dimension N x (N-1)/2is received and reconstructed by the plurality of radio units to generate the partial network connectivity matrix of dimension N x N by applying a symmetric property of matrix.
The method as claimed in claim 1, wherein the global network connectivity matrix of dimension N x N is reconstructed from the partial network connectivity matrix using a logical AND operation between matrices decoded in the present and previous designated frames.
A communication system (400) for lossless distributive exchange of connectivity information in a time division multiple access (TDMA)-based Mobile Ad Hoc (MANET), comprising:
a plurality of radio units (402), each assigned a unique identity as softIDs, where the softIDs are consecutive integers based on an order in which each radio unit joins the network;
a processor (404) operatively coupled to the plurality of radio units, the processor configured to:
transmit, by each radio unit, neighborhood connectivity information halves in designated frames, ensuring cooperative distribution of information;
select a root radio unit and leaf radio units from the plurality of radio units to form a backbone for the network;
forward compressed neighborhood connectivity information by the leaf radio units to the root radio unit;
enable the root radio unit to consolidate and generate a compressed network connectivity update transmitted to the plurality of radio units through the leaf radio units;
receive the compressed network connectivity update and reconstruct a partial network connectivity matrix by the plurality of radio units;
reconstruct a global network connectivity matrix from the partial network connectivity matrix decoded in the present and previous designated frames;
verify that the reconstructed global network connectivity matrix is identical to the one without compression, ensuring lossless compression; and
facilitate a compression ratio of 0.5 or lesser, leading to reduced overhead.