A distibuted optimal local double loop(DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions a...A distibuted optimal local double loop(DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter (d) and average hop distance (a) for this class of networks are [square-root 3N -2] less-than-or-equal-to d less-than-or-equal-to [square-root 3N+1] and (5N/9(N-1)) (square-root 3N-1.8) < a < (5N/9 (N-1)). (square-root 3N - 0.23), respectively (N is the number of nodes in the network. (3 less-than-or-equal-to N less-than-or-equal-to 10(4)). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed. The correctness of the algorithm has been also verified by simulating.展开更多
Network localization serves as a fundamental component for enabling various position based operations in multi-agent systems,facilitating tasks like target searching and formation control by providing accurate positio...Network localization serves as a fundamental component for enabling various position based operations in multi-agent systems,facilitating tasks like target searching and formation control by providing accurate position information for all nodes in the network.Network localization focuses on the challenge of determining the positions of nodes within a network,relying on the known positions of anchor nodes and internode relative measurements.Over the past few decades,distributed network localization has garnered significant attention from researchers.This paper aims to provide a review of main results and advancements in the field of distributed network localization,with a particular focus on the perspective of graph Laplacian.Owning to its favorable characteristics,graph Laplacian unifies various network localization,even when dealing with diverse types of internode relative measurements,into a unified protocol framework,which can be constructed by a linear method and ensure the global convergence.展开更多
The standardized IEEE ,802. II distributed coordination function （ DCF） provides a contention-based distributed channel access mechanism for mobile stations to share the wireless medium. However, when stations are m...The standardized IEEE ,802. II distributed coordination function （ DCF） provides a contention-based distributed channel access mechanism for mobile stations to share the wireless medium. However, when stations are mobile or portable units, power consumption becomes a primary issue since terminals are usually battery driven. This paper proposes an analytical model that calculates the energy efficiency of both the basic and the RTS/CTS access mechanisms of the IEEE 802. II protocol. The model is validated with simulation results using NS-2 simulation package. The effects of the network size, the average packet length, the initial contention window and maximum backoff stages on the energy efficiency of both access mechanisms are also investigated. Results show that the basic scheme has low energy efficiency at large packet length and large network size, and depends strongly on the number of stations and the backoff procedure parameters. Conversely, the RTS/CTS mechanism provides higher energy efficiency when the network size is large, and is more robust to variations in the backoff procedure parameters.展开更多
文摘A distibuted optimal local double loop(DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter (d) and average hop distance (a) for this class of networks are [square-root 3N -2] less-than-or-equal-to d less-than-or-equal-to [square-root 3N+1] and (5N/9(N-1)) (square-root 3N-1.8) < a < (5N/9 (N-1)). (square-root 3N - 0.23), respectively (N is the number of nodes in the network. (3 less-than-or-equal-to N less-than-or-equal-to 10(4)). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed. The correctness of the algorithm has been also verified by simulating.
基金supported by the National Key Research and Development Program of China under Grant No.2021YFB1715700the National Natural Science Foundation of China under Grant Nos.U23A20325,62173118,and 62350710214.
文摘Network localization serves as a fundamental component for enabling various position based operations in multi-agent systems,facilitating tasks like target searching and formation control by providing accurate position information for all nodes in the network.Network localization focuses on the challenge of determining the positions of nodes within a network,relying on the known positions of anchor nodes and internode relative measurements.Over the past few decades,distributed network localization has garnered significant attention from researchers.This paper aims to provide a review of main results and advancements in the field of distributed network localization,with a particular focus on the perspective of graph Laplacian.Owning to its favorable characteristics,graph Laplacian unifies various network localization,even when dealing with diverse types of internode relative measurements,into a unified protocol framework,which can be constructed by a linear method and ensure the global convergence.
文摘The standardized IEEE ,802. II distributed coordination function （ DCF） provides a contention-based distributed channel access mechanism for mobile stations to share the wireless medium. However, when stations are mobile or portable units, power consumption becomes a primary issue since terminals are usually battery driven. This paper proposes an analytical model that calculates the energy efficiency of both the basic and the RTS/CTS access mechanisms of the IEEE 802. II protocol. The model is validated with simulation results using NS-2 simulation package. The effects of the network size, the average packet length, the initial contention window and maximum backoff stages on the energy efficiency of both access mechanisms are also investigated. Results show that the basic scheme has low energy efficiency at large packet length and large network size, and depends strongly on the number of stations and the backoff procedure parameters. Conversely, the RTS/CTS mechanism provides higher energy efficiency when the network size is large, and is more robust to variations in the backoff procedure parameters.
