In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work invo...In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.展开更多
本文在Ad hoc网络中提出了一种基于区块链技术的多路径QoS(quantity of service)路由算法(BMQR)。该算法依据网络内节点的移动性、连通性和通信距离组建类似区块群,在群内通过QoS约束寻找由主节点和备选节点组成的多路径路由。通过实验...本文在Ad hoc网络中提出了一种基于区块链技术的多路径QoS(quantity of service)路由算法(BMQR)。该算法依据网络内节点的移动性、连通性和通信距离组建类似区块群,在群内通过QoS约束寻找由主节点和备选节点组成的多路径路由。通过实验仿真,BMQR算法较传统的AODV(Ad hoc on-demand distance vector routing)算法在路由的稳定性和投包率方面展示出了巨大的优越性。展开更多
The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range comm...The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.展开更多
In the internet of battlefield things, ammunition is becoming networked and intelligent, which depends on location information. Therefore, this paper focuses on the self-organized network collaborative localization of...In the internet of battlefield things, ammunition is becoming networked and intelligent, which depends on location information. Therefore, this paper focuses on the self-organized network collaborative localization of munitions with an aerial three-dimensional(3D) highly-dynamic topographic structure under a satellite denied environment. As for aerial networked munitions, the measurement of munitions is objectively incomplete due to the degenerated and interrupted link of munitions. For this reason, a cluster-oriented collaborative localization method is put forward in this paper. Multidimensional scaling(MDS) was first integrated with a trilateration localization method(TLM) to construct a relative localization algorithm for determining the relative location of a mobile cluster network. The information related to relative velocity was then combined into a collaborative localization framework to devise a TLM-vMDS algorithm. Finally, an iterative refinement algorithm based on scaling by majorizing a complicated function(SMACOF) was employed to effectively eliminate the influence of incomplete link observation on localization accuracy. Compared with the currently available advanced algorithms, the proposed TLM-vMDS algorithm achieves higher localization accuracy and faster convergence for a cluster of extensively networked munitions, and also offers better numerical stability and robustness for highspeed motion models.展开更多
The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significan...The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.展开更多
Vehicle Ad hoc Networks(VANETs)have high mobility and a rando-mized connection structure,resulting in extremely dynamic behavior.Several challenges,such as frequent connection failures,sustainability,multi-hop data tr...Vehicle Ad hoc Networks(VANETs)have high mobility and a rando-mized connection structure,resulting in extremely dynamic behavior.Several challenges,such as frequent connection failures,sustainability,multi-hop data transfer,and data loss,affect the effectiveness of Transmission Control Protocols(TCP)on such wireless ad hoc networks.To avoid the problem,in this paper,mobility-aware zone-based routing in VANET is proposed.To achieve this con-cept,in this paper hybrid optimization algorithm is presented.The hybrid algo-rithm is a combination of Ant colony optimization(ACO)and artificial bee colony optimization(ABC).The proposed hybrid algorithm is designed for the routing process which is transmitting the information from one place to another.The optimal routing process is used to avoid traffic and link failure.Thefitness function is designed based on Link stability and Residual energy.The validation of the proposed algorithm takes solution encoding,fitness calculation,and updat-ing functions.To perform simulation experiments,NS2 simulator software is used.The performance of the proposed approach is analyzed based on different metrics namely,delivery ratio,delay time,throughput,and overhead.The effec-tiveness of the proposed method compared with different algorithms.Compared to other existing VANET algorithms,the hybrid algorithm has proven to be very efficient in terms of packet delivery ratio and delay.展开更多
Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,local...Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.展开更多
基金supported in part by the National Natural Science Foundations of CHINA(Grant No.61771392,No.61771390,No.61871322 and No.61501373)Science and Technology on Avionics Integration Laboratory and the Aeronautical Science Foundation of China(Grant No.201955053002 and No.20185553035)。
文摘In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.
文摘本文在Ad hoc网络中提出了一种基于区块链技术的多路径QoS(quantity of service)路由算法(BMQR)。该算法依据网络内节点的移动性、连通性和通信距离组建类似区块群,在群内通过QoS约束寻找由主节点和备选节点组成的多路径路由。通过实验仿真,BMQR算法较传统的AODV(Ad hoc on-demand distance vector routing)算法在路由的稳定性和投包率方面展示出了巨大的优越性。
文摘The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.
文摘In the internet of battlefield things, ammunition is becoming networked and intelligent, which depends on location information. Therefore, this paper focuses on the self-organized network collaborative localization of munitions with an aerial three-dimensional(3D) highly-dynamic topographic structure under a satellite denied environment. As for aerial networked munitions, the measurement of munitions is objectively incomplete due to the degenerated and interrupted link of munitions. For this reason, a cluster-oriented collaborative localization method is put forward in this paper. Multidimensional scaling(MDS) was first integrated with a trilateration localization method(TLM) to construct a relative localization algorithm for determining the relative location of a mobile cluster network. The information related to relative velocity was then combined into a collaborative localization framework to devise a TLM-vMDS algorithm. Finally, an iterative refinement algorithm based on scaling by majorizing a complicated function(SMACOF) was employed to effectively eliminate the influence of incomplete link observation on localization accuracy. Compared with the currently available advanced algorithms, the proposed TLM-vMDS algorithm achieves higher localization accuracy and faster convergence for a cluster of extensively networked munitions, and also offers better numerical stability and robustness for highspeed motion models.
基金supported by the National Natural Science Foundation of China(62231020)the Youth Innovation Team of Shaanxi Universities。
文摘The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.
文摘Vehicle Ad hoc Networks(VANETs)have high mobility and a rando-mized connection structure,resulting in extremely dynamic behavior.Several challenges,such as frequent connection failures,sustainability,multi-hop data transfer,and data loss,affect the effectiveness of Transmission Control Protocols(TCP)on such wireless ad hoc networks.To avoid the problem,in this paper,mobility-aware zone-based routing in VANET is proposed.To achieve this con-cept,in this paper hybrid optimization algorithm is presented.The hybrid algo-rithm is a combination of Ant colony optimization(ACO)and artificial bee colony optimization(ABC).The proposed hybrid algorithm is designed for the routing process which is transmitting the information from one place to another.The optimal routing process is used to avoid traffic and link failure.Thefitness function is designed based on Link stability and Residual energy.The validation of the proposed algorithm takes solution encoding,fitness calculation,and updat-ing functions.To perform simulation experiments,NS2 simulator software is used.The performance of the proposed approach is analyzed based on different metrics namely,delivery ratio,delay time,throughput,and overhead.The effec-tiveness of the proposed method compared with different algorithms.Compared to other existing VANET algorithms,the hybrid algorithm has proven to be very efficient in terms of packet delivery ratio and delay.
文摘Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.
