Current Issue : April - June Volume : 2013 Issue Number : 2 Articles : 6 Articles
Saving energy while preserving accuracy is of paramount importance to target tracking in wireless sensor networks. ?is paper\r\npresents an energy-efficient selection of cooperative nodes. In the proposed method, the target detection probability is estimated\r\nby single-node processing based on particle ??lter. ?en, an ob??ective function for collaborative target tracking in wireless sensor\r\nnetworks is constructed according to the information utility and the remaining energy of sensor nodes. With this understanding,\r\na dynamic node selection scheme based on genetic algorithms is proposed, which can optimize the tradeoff between the accuracy\r\nof tracking and the energy cost of nodes. Simulations demonstrate its superior performance in estimating the target location and\r\nsaving sensor nodes energy....
?e localization and tracking technology for a three-dimensional target, which is a kernel problem in the military area, has received\r\nmore and more attention. ?is paper proposes a closed-loop system to detect 3D maneuvering targets, including data acquisition,\r\nthe direction of arrival (DOA) estimation, the triangle localization, and a tra??ectory prediction. ?is system ??rstly uses several\r\nL-shaped sensor arrays to sample the signals of maneuvering targets. ?en the 2D ESPRIT algorithm and a maximum likelihood\r\nalgorithm are introduced to achieve the positions of the spatial targets. ?irdly an autoregressive (AR) particle ??lter (PF) algorithm\r\nis realized to predict the locations in the next moment. Finally the localization process is directed by using the predicted positions\r\nto form a positive feedback closed loop. Experiment results show that this system can enhance the robustness and accuracy of the\r\nlocalization and tracking for three-dimensional maneuvering targets...
Advances in embedded systems and mobile communication have led to the emergence of smaller, cheaper, and more intelligent\r\nsensing units. As of today, these devices have been used in many sensor network applications focused at monitoring environmental\r\nparameters in areas with relative large geographical extent. However, in many of these applications, management is often\r\ncentralized and hierarchical. This approach imposes some major challenges in the context of large-scale and highly distributed\r\nsensor networks. In this paper, we present a multilayered, middleware platform for sensor networks offering transparent data\r\naggregation, control, and management mechanisms to the application developer. Furthermore, we propose the use of multiagent\r\nsystems (MASs) to create a computing environment capable of managing and optimizing tasks autonomously. In order to ensure\r\nthe scalability of the distributed data fusion, we propose a three-step procedure to balance the workload among machines using\r\nmobile agent technology...
A low-cost yet effective localization scheme for wireless sensor networks (WSNs) is presented in this study. ?e proposed scheme\r\nuses only two anchor nodes and uses bilateration to estimate the coordinates of unknown nodes. Many localization algorithms for\r\nWSNs require the installation of extra components, such as a GPS, ultrasonic transceiver, and unidirectional antenna, to sensors.\r\n?e proposed localization scheme is range-free (i.e., not demanding any extra devices for the sensors). In this scheme, two anchor\r\nnodes are installed at the bottom-le? corner (Sink X) and the bottom-right corner (Sink Y) of a square monitored region of the WSN.\r\nSensors are identi??ed with the same minimum hop counts pair to Sink X and Sink Y to form a zone, and the estimated location of\r\neach unknown sensor is adjusted according to its relative position in the zone. ?is study compares the proposed scheme with the\r\nwell-known DV-Hop method. Simulation results show that the proposed scheme outperforms the DV-Hop method in localization\r\naccuracy, communication cost, and computational complexity...
Smart grid is a network of computers and power infrastructures that monitor and control energy usage by collecting data from\r\nthe power grid. It can gather and distribute information about the behavior of all consumers in order to improve the efficiency,\r\nreliability, economics, safety, and sustainability of electricity services. In this paper, we propose a self-certi??ed P??C-based privacypreserving\r\ndata aggregation scheme in smart grid to increase computation efficiency and achieve privacy protection of end users.\r\nTo realize the anonymous aggregation of multidimensional data, we adopt the Chinese Remainder ?eorem and homomorphic\r\nproperty of Paillier cryptosystem to achieve it. Comparing our scheme with Lu et al.�s scheme, the result shows that our scheme has\r\nmore advantages over Lu et al.�s scheme in terms of computational costs of the user, GW, and OA. A??er adopting batch veri??cation\r\ntechnique, the computational cost of GW is constant in our scheme, however, that of GW is linear with the number of the users in\r\nLu et al.�s scheme. Furthermore, our scheme also supports the anonymity of the user�s identity. It indicates that the local gateway\r\nGW does not know the real identity of the resident user such that the privacy of the user is better protected....
Vehicular sensor network (VSN) is a promising technology which could be widely applied to monitor the physical world in urban\r\nareas. In such a scenario, the efficient data delivery plays a central role. Existing schemes, however, cannot choose an optimal route,\r\nsince they either ignore the impact of vehicular distribution on connectivity, or make some unreasonable assumptions on vehicular\r\ndistribution. In this paper, we propose a traffic-aware data delivery scheme (TADS). ?e basic idea of TADS is to choose intersections\r\nto forward packets dynamically as the route from a source to destination based on link quality and remaining Euclidean distance\r\nto destination. Speci??cally, we ??rst present an optimal utility function as the criteria of intersection selection. Besides the packet\r\nforwarding through intersections, we also propose an improved geographically greedy routing algorithm for packet forwarding in\r\nstraightway mode. Moreover, in order to decrease the routing overhead brought by the traffic information gathering, we build a\r\ntraffic condition prediction model to estimate the link quality. ?e simulation results show that our TADS outperforms existing\r\nworks on packet delivery ratio, end-to-end delay, and routing overhead....
Loading....