Wireless sensor networks have enabled information gathering from a large geographical region and present unprecedented opportunities for a broad spectrum of monitoring applications. In this paper, we propose a data-ce...
详细信息
Coverage and energy efficiency are two important concerns in wireless sensor networks. In this paper, a coverage and energy efficient (CEE) task assigning strategy is presented The basic idea of CEE is to assign task;...
详细信息
ISBN:
(纸本)0769524052
Coverage and energy efficiency are two important concerns in wireless sensor networks. In this paper, a coverage and energy efficient (CEE) task assigning strategy is presented The basic idea of CEE is to assign task;according to node's coverage degree and remaining energy. Based on this idea, grid-based coverage and energy efficient (GCEE) information gathering protocol is designed GCEE is simulated with NS-2. How the various parameters affect the fraction of the survived nodes and the area energy balancing of the network is shown in simulation results.
Two difficulties in designing data-centric routes [2,3,4,5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computational complexity resulting from the coupling of...
详细信息
ISBN:
(纸本)3540264221
Two difficulties in designing data-centric routes [2,3,4,5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computational complexity resulting from the coupling of routing and in-network data fusion. In this paper, we study combined routing and source coding with explicit side information in wireless sensor networks. Our data aggregation model is built upon the observation that in many physical situations the side information that provides the most coding gain comes from a small number of nearby sensors. Based on this model, we propose a routing strategy that separately routes the explicit side information to achieve data compression and cost minimization. The overall optimization problem is NP hard since it has the minimum Steiner tree as a subproblem. We propose a suboptimal algorithm based on maximum weight branching and the shortest path heuristic for the Steiner tree problem. The worst case and average performances of the algorithm are studied through analysis and simulation.
The topology of a wireless sensor network has a significant effect on the network performance. Although topology control algorithms can optimize the network topology, the resultant topology is usually changeable. In t...
详细信息
ISBN:
(纸本)0769524052
The topology of a wireless sensor network has a significant effect on the network performance. Although topology control algorithms can optimize the network topology, the resultant topology is usually changeable. In this paper, we focus on how to maintain the network connectivity while reducing the maintenance overhead as some nodes fail. A distributed topology maintenance algorithm based on the shortest path tree is proposed In this algorithm, nodes in immediate surroundings of a faulty node are first triggered to respond, and if they couldn't ensure that the network is connected, the other related nodes are further triggered Simulation results show that the proposed scheme can efficiently maintain the network connectivity with significant reduction in the overhead for topology maintenance.
LEACH protocol for wireless sensor network has attracted intensive attention because of its energy efficient, Simplicity and load balancing. LEACH is a cluster-based protocol, and the numbers of cluster heads and clus...
详细信息
ISBN:
(纸本)0769524052
LEACH protocol for wireless sensor network has attracted intensive attention because of its energy efficient, Simplicity and load balancing. LEACH is a cluster-based protocol, and the numbers of cluster heads and cluster members generated by LEACH are important parameters for achieving better performance. This paper presents a simulation analysis of the statistical characteristics of the numbers of cluster heads and cluster members for LEACH protocol by means of Monte Carlo method. The simulation results have been compared with the analytical results, and coincidence between them has been observed The results indicate that the numbers of cluster head,;and cluster members vary in a not narrow ranged, and the probability that there is only one cluster head or there is no cluster head is high when the desired value of cluster heads is small.
Due to the fragility of small sensors, their finite energy supply and the loss of packets in the wireless channel, reports from sensors may not reach the sink node. In this paper we consider the problem of sensor data...
详细信息
Multiple beam antennas can receive (or transmit) data on multiple beams simultaneously. The aim of this paper is to show the limitations of using ieee 802.11 distributed coordination function (DCF) based schemes for m...
详细信息
Source localization is a challenging issue for multisensor multitarget detection, tracking and estimation problems in wireless distributedsensor networks. In this paper, a novel source localization method, called pas...
详细信息
For wireless sensor networks, localization is crucial due to the dynamic nature of deployment. In relative localization, nodes use the distance measurements to estimate their positions relative to some coordinate syst...
详细信息
ISBN:
(纸本)0769523285
For wireless sensor networks, localization is crucial due to the dynamic nature of deployment. In relative localization, nodes use the distance measurements to estimate their positions relative to some coordinate system. In absolute localization, a few nodes (called anchors) need to know their absolute positions, and all the other nodes are absolutely localized in the coordinate system of the anchors. Relative and absolute localization methods differ in both the performance and the cost. We present a new approach to relative localization that we refer to as: Simple Hybrid Absolute-Relative Positioning (SHARP). In SHARP, a relative localization method (M1) is used to relatively localize N-r reference nodes. Then, an absolute localization method (M2) uses these N-r nodes as anchors to localize the rest of the nodes. Choosing N-r, M1, and M2 gives a wide range of performance-cost tuning. We have done extensive simulation using the multidimensional scaling (MDS) method as M1 and the Ad-hoc Positioning System (APS) method as M2. While previous research shows that MDS gives better localization results than APS, our simulation shows that SHARP outperforms MDS if both the localization error and the cost are considered.
Key establishment and management is the core of security protocols for wireless sensor networks deployed in the hostile environment. Due to the strict resource constraints, traditional asymmetric key cryptosystems, su...
详细信息
暂无评论