The IEEE 802.11p is a standard in a vehicular communication system, known as Wireless Access in Vehicular Environment (WAVE). An implementation of that standard as the MAC Protocol in a high-density of nodes in Vehicu...The IEEE 802.11p is a standard in a vehicular communication system, known as Wireless Access in Vehicular Environment (WAVE). An implementation of that standard as the MAC Protocol in a high-density of nodes in Vehicular Ad-Hoc Networks (VANETs) may create a performance drawback, in particular for packet loss and delay whenever collisions happen. Introducing Time Division Multiple Access (TDMA) schemes can improve the performance. However, TDMA scheduling is difficult to manage the case of high-density of traffic, the high mobility of vehicles, and dynamic network topology. This journal proposes a clustered-based TDMA by traffic priority in VANETs. The clustered traffic is defined as high and low traffic priority and embedded in TDMA MAC Header. The evaluation result obtained through NS3 Simulator shows that the proposed approach performed better in a high-density of nodes.展开更多
Research on wide area ad hoc networks is of great significance due to its application prospect in long-range networks such as aeronautical and maritime networks,etc.The design of MAC protocols is one of the most impor...Research on wide area ad hoc networks is of great significance due to its application prospect in long-range networks such as aeronautical and maritime networks,etc.The design of MAC protocols is one of the most important parts impacting the whole network performance.In this paper,we propose a dis-tributed TDMA-based MAC protocol called Dynamic Self Organizing TDMA(DSO-TDMA)for wide area ad hoc networks.DSO-TDMA includes three main features:(1)In a distributed way,nodes in the network select transmitting slots according to the congestion situation of the local air interface.(2)In a selforganization way,nodes dynamically adjust the resource occupancy ratio according to the queue length of neighbouring nodes within two-hop range.(3)In a piggyback way,the control information is transmitted together with the payload to reduce the overhead.We design the whole mechanisms,implement them in NS-3 and evaluate the performance of DSO-TDMA compared with another dynamic TDMA MAC protocol,EHR-TDMA.Results show that the end-to-end throughput of DSO-TDMA is at most 51.4%higher than that of EHR-TDMA,and the average access delay of DSO-TDMA is at most 66.05%lower than that of EHR-TDMA.展开更多
Cluster-based scenic area is a special form within the scenic area system, scenic areas are always scattered with diversified landscape resources, thus planning should be made according to actual conditions of the loc...Cluster-based scenic area is a special form within the scenic area system, scenic areas are always scattered with diversified landscape resources, thus planning should be made according to actual conditions of the local area, and pertinent measures should be applied. Through elaborating the detail work in the overall planning of Jingyanggang Scenic Area, such as landscape division, spatial layout and sightseeing structure, the authors discussed several problems should be paid more attention in the planning of cluster-based scenic areas.展开更多
Similarity matching and this paper, a saliency-based information presentation are two matching algorithm is proposed key factors in information retrieval. In for user-oriented search based on the psychological studies...Similarity matching and this paper, a saliency-based information presentation are two matching algorithm is proposed key factors in information retrieval. In for user-oriented search based on the psychological studies on human perception, and major emphasis on the saliently similar aspect of objects to be compared is placed and thus the search result is more agreeable for users. After relevant results are obtained, the cluster-based browsing algorithm is adopted for search result presentation based on social network analysis. By organizing the results in clustered lists, the user can have a general understanding of the whole collection by viewing only a small part of results and locate those of major interest rapidly. Experimental results demonstrate the advantages of the proposed algorithm over the traditional work.展开更多
Underwater wireless sensor networks(UWSNs) have attracted wide attention in recent years.The capacity research on it is still in the initial stage,lacking adequate performance evaluation for network construction.This ...Underwater wireless sensor networks(UWSNs) have attracted wide attention in recent years.The capacity research on it is still in the initial stage,lacking adequate performance evaluation for network construction.This paper will focus on this subject by theoretical analysis and simulation,aiming to provide some insights for the actual UWSNs construction.According to the structure features of cluster-based UWSNs and the propagation characteristics of underwater acoustic signal,with the combination of signal to interference plus noise ratio,we define some capacity performance metrics,such as outage probability and transmission capacity.Based on the theory of stochastic geometry,a network capacity analytical model used in the cluster-based UWSNs is presented.The simulation results verify the validity of the theoretical analysis,and the cause of error between theoretical and simulation results has also been clearly explained.展开更多
In many applications such as computational fluid dynamics and weather prediction, as well as image processing and state of Markov chain etc., the grade of matrix n is often very large, and any serial algorithm cannot ...In many applications such as computational fluid dynamics and weather prediction, as well as image processing and state of Markov chain etc., the grade of matrix n is often very large, and any serial algorithm cannot solve the problems. A distributed cluster-based solution for very large linear equations is discussed, it includes the definitions of notations, partition of matrix, communication mechanism, and a master-slaver algorithm etc., the computing cost is O（n^3/N）, the memory cost is O（n^2/N）, the I/O cost is O（n^2/N）, and the com- munication cost is O（Nn ）, here, N is the number of computing nodes or processes. Some tests show that the solution could solve the double type of matrix under 10^6 × 10^6 effectively.展开更多
In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based o...In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based on a random key pre-distribution scheme using clustering,we present a novel random key revoca-tion protocol,which is suitable for large scale networks greatly and removes compromised information efficiently.The revocation protocol can guarantee network security by using less memory consumption and communication load,and combined by centralized and distributed revoca-tion,having virtues of timeliness and veracity for revoca-tion at the same time.展开更多
为了解决现有方法难以对宽带跳频时分多址(frequency hopping-time division multiple access,FH-TDMA)辐射源网群定位的问题,提出一种仅利用波达方向(direction of arrival,DOA)信息的多站定位及网群划分方法。首先通过模拟滤波对各站...为了解决现有方法难以对宽带跳频时分多址(frequency hopping-time division multiple access,FH-TDMA)辐射源网群定位的问题,提出一种仅利用波达方向(direction of arrival,DOA)信息的多站定位及网群划分方法。首先通过模拟滤波对各站接收到的信号进行频段划分,通过基于多相滤波的数字信道化方法把信号输出到多个信道中;然后通过直接定位(direct position determination,DPD)算法计算得出各时隙辐射源的位置;最后先通过不同参数的基于密度的噪声应用空间聚类(density-based spatial clustering of applications with noise,DBSCAN)算法选择出最佳的辐射源定位结果,再根据提出的基于先验信息的改进K-means聚类算法进行网群划分。所提方法实现了采样率和信号处理速率的降低,且无需站间严格的时间同步。结果表明,所提方法有效估计出了辐射源的数量、位置,以及网群划分情况。展开更多
Multihop cellular networks is an exciting and a fledgling area of wireless communication which offers huge potential in terms of coverage enhancement, data-rates, power reduction, and various other quality of service ...Multihop cellular networks is an exciting and a fledgling area of wireless communication which offers huge potential in terms of coverage enhancement, data-rates, power reduction, and various other quality of service improvements. However, resource allocation in MCN is an NP-hard problem. Hence, significant research needs to be done in this field in order to efficiently design the radio network. In this paper, optimal position of relay stations in a hierarchical cluster-based two-hop cellular network is investigated. Vector algebra has been used to derive general equation for carrier-to-interference ratio (C/I) of a mobile station. It has been observed that when the transmit power of base station (BS) and the gateway (GTW)/relay station (RS) are same, the RSs should be located close to mid-point of BS and the edge of the cell. However, significantly, when the transmit power of the BS is greater than that of the GTW, then the RSs should be placed closer to the edge of the cell, in order to maximize the minimum C/I at any point in the cell. This in turn results in higher modulation technique at the physical layer, and hence, a higher data-rate to all the users in the system.展开更多
Optimal resource allocation with an objective of maximizing the system capacity is an NP-hard problem in multihop cellular networks. Hence, different heuristic algorithms have been developed over the years that would ...Optimal resource allocation with an objective of maximizing the system capacity is an NP-hard problem in multihop cellular networks. Hence, different heuristic algorithms have been developed over the years that would improve the network system capacity. In this paper, a novel cluster-based architecture is proposed for a two-hop cellular network whereby the transmission distance between any communicating pair is restricted to half the cell radius. In this design, a given radio resource is used by two simultaneously communicating pairs in every hexagonal cell, but for only half the time slot period. The characteristic feature of this cluster-based design is that it enables a frequency reuse ratio of one. The proposed hierarchical system is analyzed and tested under realistic propagation conditions including lognormal shadowing. It has been observed that the system capacity of a cluster-based design is 2.5 times that obtained from the single-hop cellular system with no relaying. In addition, the cluster-based design achieves higher capacity compared to state-of-the-art two-hop algorithms. This is an important finding since the hierarchical cluster-based approach has fewer degrees of freedom in the selection of the routing path for the end-to-end connection. Practical routing algorithms should be able to benefit from this.展开更多
文摘The IEEE 802.11p is a standard in a vehicular communication system, known as Wireless Access in Vehicular Environment (WAVE). An implementation of that standard as the MAC Protocol in a high-density of nodes in Vehicular Ad-Hoc Networks (VANETs) may create a performance drawback, in particular for packet loss and delay whenever collisions happen. Introducing Time Division Multiple Access (TDMA) schemes can improve the performance. However, TDMA scheduling is difficult to manage the case of high-density of traffic, the high mobility of vehicles, and dynamic network topology. This journal proposes a clustered-based TDMA by traffic priority in VANETs. The clustered traffic is defined as high and low traffic priority and embedded in TDMA MAC Header. The evaluation result obtained through NS3 Simulator shows that the proposed approach performed better in a high-density of nodes.
文摘Research on wide area ad hoc networks is of great significance due to its application prospect in long-range networks such as aeronautical and maritime networks,etc.The design of MAC protocols is one of the most important parts impacting the whole network performance.In this paper,we propose a dis-tributed TDMA-based MAC protocol called Dynamic Self Organizing TDMA(DSO-TDMA)for wide area ad hoc networks.DSO-TDMA includes three main features:(1)In a distributed way,nodes in the network select transmitting slots according to the congestion situation of the local air interface.(2)In a selforganization way,nodes dynamically adjust the resource occupancy ratio according to the queue length of neighbouring nodes within two-hop range.(3)In a piggyback way,the control information is transmitted together with the payload to reduce the overhead.We design the whole mechanisms,implement them in NS-3 and evaluate the performance of DSO-TDMA compared with another dynamic TDMA MAC protocol,EHR-TDMA.Results show that the end-to-end throughput of DSO-TDMA is at most 51.4%higher than that of EHR-TDMA,and the average access delay of DSO-TDMA is at most 66.05%lower than that of EHR-TDMA.
文摘Cluster-based scenic area is a special form within the scenic area system, scenic areas are always scattered with diversified landscape resources, thus planning should be made according to actual conditions of the local area, and pertinent measures should be applied. Through elaborating the detail work in the overall planning of Jingyanggang Scenic Area, such as landscape division, spatial layout and sightseeing structure, the authors discussed several problems should be paid more attention in the planning of cluster-based scenic areas.
基金Supported by the Fund for Basic Research of National Non-Profit Research Institutes(No.XK2012-2,ZD2012-7-2)the Fund for Preresearch Project of ISTIC(No.YY201208)
文摘Similarity matching and this paper, a saliency-based information presentation are two matching algorithm is proposed key factors in information retrieval. In for user-oriented search based on the psychological studies on human perception, and major emphasis on the saliently similar aspect of objects to be compared is placed and thus the search result is more agreeable for users. After relevant results are obtained, the cluster-based browsing algorithm is adopted for search result presentation based on social network analysis. By organizing the results in clustered lists, the user can have a general understanding of the whole collection by viewing only a small part of results and locate those of major interest rapidly. Experimental results demonstrate the advantages of the proposed algorithm over the traditional work.
基金supported by National Natural Science Foundation of China(No.61101164)
文摘Underwater wireless sensor networks(UWSNs) have attracted wide attention in recent years.The capacity research on it is still in the initial stage,lacking adequate performance evaluation for network construction.This paper will focus on this subject by theoretical analysis and simulation,aiming to provide some insights for the actual UWSNs construction.According to the structure features of cluster-based UWSNs and the propagation characteristics of underwater acoustic signal,with the combination of signal to interference plus noise ratio,we define some capacity performance metrics,such as outage probability and transmission capacity.Based on the theory of stochastic geometry,a network capacity analytical model used in the cluster-based UWSNs is presented.The simulation results verify the validity of the theoretical analysis,and the cause of error between theoretical and simulation results has also been clearly explained.
文摘In many applications such as computational fluid dynamics and weather prediction, as well as image processing and state of Markov chain etc., the grade of matrix n is often very large, and any serial algorithm cannot solve the problems. A distributed cluster-based solution for very large linear equations is discussed, it includes the definitions of notations, partition of matrix, communication mechanism, and a master-slaver algorithm etc., the computing cost is O（n^3/N）, the memory cost is O（n^2/N）, the I/O cost is O（n^2/N）, and the com- munication cost is O（Nn ）, here, N is the number of computing nodes or processes. Some tests show that the solution could solve the double type of matrix under 10^6 × 10^6 effectively.
基金supported by the Ministry of Education Doctor Foundation in China under Grant No. 20050699037
文摘In recent years,several random key pre-distribution schemes have been proposed to bootstrap keys for encryption,but the problem of key and node revocation has received relatively little attention.In this paper,based on a random key pre-distribution scheme using clustering,we present a novel random key revoca-tion protocol,which is suitable for large scale networks greatly and removes compromised information efficiently.The revocation protocol can guarantee network security by using less memory consumption and communication load,and combined by centralized and distributed revoca-tion,having virtues of timeliness and veracity for revoca-tion at the same time.
文摘为了解决现有方法难以对宽带跳频时分多址(frequency hopping-time division multiple access,FH-TDMA)辐射源网群定位的问题,提出一种仅利用波达方向(direction of arrival,DOA)信息的多站定位及网群划分方法。首先通过模拟滤波对各站接收到的信号进行频段划分,通过基于多相滤波的数字信道化方法把信号输出到多个信道中;然后通过直接定位(direct position determination,DPD)算法计算得出各时隙辐射源的位置;最后先通过不同参数的基于密度的噪声应用空间聚类(density-based spatial clustering of applications with noise,DBSCAN)算法选择出最佳的辐射源定位结果,再根据提出的基于先验信息的改进K-means聚类算法进行网群划分。所提方法实现了采样率和信号处理速率的降低,且无需站间严格的时间同步。结果表明,所提方法有效估计出了辐射源的数量、位置,以及网群划分情况。
文摘Multihop cellular networks is an exciting and a fledgling area of wireless communication which offers huge potential in terms of coverage enhancement, data-rates, power reduction, and various other quality of service improvements. However, resource allocation in MCN is an NP-hard problem. Hence, significant research needs to be done in this field in order to efficiently design the radio network. In this paper, optimal position of relay stations in a hierarchical cluster-based two-hop cellular network is investigated. Vector algebra has been used to derive general equation for carrier-to-interference ratio (C/I) of a mobile station. It has been observed that when the transmit power of base station (BS) and the gateway (GTW)/relay station (RS) are same, the RSs should be located close to mid-point of BS and the edge of the cell. However, significantly, when the transmit power of the BS is greater than that of the GTW, then the RSs should be placed closer to the edge of the cell, in order to maximize the minimum C/I at any point in the cell. This in turn results in higher modulation technique at the physical layer, and hence, a higher data-rate to all the users in the system.
文摘Optimal resource allocation with an objective of maximizing the system capacity is an NP-hard problem in multihop cellular networks. Hence, different heuristic algorithms have been developed over the years that would improve the network system capacity. In this paper, a novel cluster-based architecture is proposed for a two-hop cellular network whereby the transmission distance between any communicating pair is restricted to half the cell radius. In this design, a given radio resource is used by two simultaneously communicating pairs in every hexagonal cell, but for only half the time slot period. The characteristic feature of this cluster-based design is that it enables a frequency reuse ratio of one. The proposed hierarchical system is analyzed and tested under realistic propagation conditions including lognormal shadowing. It has been observed that the system capacity of a cluster-based design is 2.5 times that obtained from the single-hop cellular system with no relaying. In addition, the cluster-based design achieves higher capacity compared to state-of-the-art two-hop algorithms. This is an important finding since the hierarchical cluster-based approach has fewer degrees of freedom in the selection of the routing path for the end-to-end connection. Practical routing algorithms should be able to benefit from this.
