In this paper, the idea of interest coverage is provided to form clusters in sensor network, which mean that the distance among data trends gathered by neighbor sensors is so small that, in some period, those sensors ...In this paper, the idea of interest coverage is provided to form clusters in sensor network, which mean that the distance among data trends gathered by neighbor sensors is so small that, in some period, those sensors can be clustered, and certain sensor can be used to replace the cluster to form the virtual sensor network topology. In detail, the Jensen-Shannon Divergence (JSD) is used to characterize the distance among different distributions which represent the data trend of sensors. Then, based on JSD, a hierarchical clustering algorithm is provided to form the virtual sensor network topology. Simulation shows that the proposed approach gains more than 50% energy saving than Sta- tistical Aggregation Methods (SAM) which transmitted data gathered by sensor only when the differ- ence among data exceed certain threshold.展开更多
Overlay networks have emerged as a useful approach to providing a general framework for new applications and services that are to be implemented without significantly changing the IP-layer network infrastructure.Overl...Overlay networks have emerged as a useful approach to providing a general framework for new applications and services that are to be implemented without significantly changing the IP-layer network infrastructure.Overlay routing has been used as an alternative to the default best effort Internet routing for the absence of end-to-end Quality of Service(QoS). While the former has recently been investigated, the conflict of QoS restraints and resource optimization remains unsolved. Recent studies have shown that overlay paths can give better latency, loss rate and TCP throughput. In this paper, a multi-dimensional QoS objective model based on the analysis of multiple QoS constraints has been presented, and a routing algorithm to optimise the overlay resource of its nodes and links is then proposed.In fact, the algorithm obtained multiple QoS values using probability theory to achieve the routing according to the multi-dimensional QoS objective vector of the QoS objective model. Simulation results reveals that the algorithm works better than other existing algorithms in balancing the network resources, and applications with stringent QoS requirements could be run.展开更多
In this paper, we proposed a scheme based on Monte Carlo algorithm to test whether or not the nodes are redundant for realizing the node density control in the sensor network. The computational complexity is only O(n)...In this paper, we proposed a scheme based on Monte Carlo algorithm to test whether or not the nodes are redundant for realizing the node density control in the sensor network. The computational complexity is only O(n). We also established the coverage collision detection and back-off mechanism applied in the wireless sensor network. The simulation results show that the system can cover all the interested area with the smallest number of nodes and a coverage void will not appear during the course of state-transition. The coverage collision detection and back-off mechanism proposed in this article can be applied when the nodes have either synchronous or asynchronous mechanism. It also provides a stable stage with the length of the time that can be adjusted.展开更多
Global synchronization of a class of directed dynamical networks with switching topologies is investigated.It is found that if there is a directed spanning tree in the fixed time-average of network topology and the ti...Global synchronization of a class of directed dynamical networks with switching topologies is investigated.It is found that if there is a directed spanning tree in the fixed time-average of network topology and the time-averageis achieved sufficiently fast,then the network will reach global synchronization for sufficiently large coupling strength.展开更多
Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the di...Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the difference between the barrier coverage and blanket coverage. In this paper, we propose two algorithms, namely, local tree based no-way and back (LTNWB) algorithm and sensor minimum cut sets (SMCS) algorithm, for the opened and closed belt regions to determine the degree of the barrier coverage of WSN. Our main objective is to minimize the complexity of these algorithms. For the opened belt region, both algorithms work well, and for the closed belt region, they will still come into existence while some restricted conditions are taken into consideration. Finally, the simulation results demonstrate the feasibility of the proposed algorithms.展开更多
基金the National Natural Science Foundation of China (No.60472067)Jiangsu Education Bureau (5KJB510091)State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications (BUPT).
文摘In this paper, the idea of interest coverage is provided to form clusters in sensor network, which mean that the distance among data trends gathered by neighbor sensors is so small that, in some period, those sensors can be clustered, and certain sensor can be used to replace the cluster to form the virtual sensor network topology. In detail, the Jensen-Shannon Divergence (JSD) is used to characterize the distance among different distributions which represent the data trend of sensors. Then, based on JSD, a hierarchical clustering algorithm is provided to form the virtual sensor network topology. Simulation shows that the proposed approach gains more than 50% energy saving than Sta- tistical Aggregation Methods (SAM) which transmitted data gathered by sensor only when the differ- ence among data exceed certain threshold.
基金supported by the National Natural Science Foundation of China under Grant No.61071126the National Science and Technology Major Projects of New Generation Broadband Wireless Mobile Communication Network under Grants No.2010ZX0300400201,No.2010ZX03003-001,No.2010ZX03004-001-01,No.2011ZX03002-001-02
文摘Overlay networks have emerged as a useful approach to providing a general framework for new applications and services that are to be implemented without significantly changing the IP-layer network infrastructure.Overlay routing has been used as an alternative to the default best effort Internet routing for the absence of end-to-end Quality of Service(QoS). While the former has recently been investigated, the conflict of QoS restraints and resource optimization remains unsolved. Recent studies have shown that overlay paths can give better latency, loss rate and TCP throughput. In this paper, a multi-dimensional QoS objective model based on the analysis of multiple QoS constraints has been presented, and a routing algorithm to optimise the overlay resource of its nodes and links is then proposed.In fact, the algorithm obtained multiple QoS values using probability theory to achieve the routing according to the multi-dimensional QoS objective vector of the QoS objective model. Simulation results reveals that the algorithm works better than other existing algorithms in balancing the network resources, and applications with stringent QoS requirements could be run.
文摘In this paper, we proposed a scheme based on Monte Carlo algorithm to test whether or not the nodes are redundant for realizing the node density control in the sensor network. The computational complexity is only O(n). We also established the coverage collision detection and back-off mechanism applied in the wireless sensor network. The simulation results show that the system can cover all the interested area with the smallest number of nodes and a coverage void will not appear during the course of state-transition. The coverage collision detection and back-off mechanism proposed in this article can be applied when the nodes have either synchronous or asynchronous mechanism. It also provides a stable stage with the length of the time that can be adjusted.
基金Supported by the Natural Science Foundation of Hohai University under Grant No.2008429211
文摘Global synchronization of a class of directed dynamical networks with switching topologies is investigated.It is found that if there is a directed spanning tree in the fixed time-average of network topology and the time-averageis achieved sufficiently fast,then the network will reach global synchronization for sufficiently large coupling strength.
文摘Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the difference between the barrier coverage and blanket coverage. In this paper, we propose two algorithms, namely, local tree based no-way and back (LTNWB) algorithm and sensor minimum cut sets (SMCS) algorithm, for the opened and closed belt regions to determine the degree of the barrier coverage of WSN. Our main objective is to minimize the complexity of these algorithms. For the opened belt region, both algorithms work well, and for the closed belt region, they will still come into existence while some restricted conditions are taken into consideration. Finally, the simulation results demonstrate the feasibility of the proposed algorithms.
