Many consumer products in the home environment are managed by the Wireless Sensor Networks (WSNs). However, the energy hole problem in the WSNs which with logical ring topology and uniformly distributed sensors is usually caused by the energy exhaustion of the sensors which distributed in the first radius range of the sink. This paper firstly analyzed the energy consumption model of the sensor, the data transmission model of the sensor, and the energy consumption distribution model of the WSNs. Then, a WSN Energy Hole Alleviating (WSNEHA) algorithm, which is based on the data forwarding and router selection strategy, is proposed. The WSNEHPA adopts the data forwarding and routing selection strategy to balance the energy consumption of the sensors in the first radius range of the sink. Experimental results demonstrate that WSNEHPA can efficiently balance the energy consumption of the sensors in the first radius range of the sink, and that the lifetime of the WSNs can be extended efficiently.
1 June 2015 in International Journal of Distributed Sensor Networks
Location information is crucial in the wireless sensor network. The nodes in wireless sensor networks are often deployed in the three-dimensional scenario. Therefore, the three-dimensional localization algorithm has become hot in wireless sensor networks. However, existing 3D localization algorithms have shortcomings, such as high complexity, low positioning accuracy, and great energy consumption. Aiming at the existing problems of the current 3D localization algorithms, an improved 3D localization algorithm based on Degree of Coplanarity (3D-IDCP) is proposed. The concept of coplanarity is added into the traditional DV-Distance algorithm to reduce the positioning error caused by anchor nodes which are coplanar. Those unknown nodes which have been located are promoted to assistant anchor nodes to improve the positioning coverage. The simulation results show that the proposed method is accurate in positioning and can enhance the positioning coverage.
During long-distance flight, unmanned aerial vehicles (UAVs) need to perform cross-domain authentication to prove their identity and receive information from the ground control station (GCS). However, the GCS needs to verify all drones arriving at the area it is responsible for, which leads to the GCS being unable to complete authentication in time when facing cross-domain requests from a large number of drones. Additionally, due to potential threats from attackers, drones and GCSs are likely to be deceived. To improve the efficiency and security of cross-domain authentication, we propose an efficient blockchain-based cross-domain authentication scheme for the Internet of Drones (BCDAIoD). By using a consortium chain with a multi-chain architecture, the proposed method can query and update different types of data efficiently. By mutual authentication before cross-domain authentication, drones can compose drone groups to lighten the authentication workload of domain management nodes. BCDAIoD uses the notification mechanism between domains to enable path planning for drones in advance, which can further improve the efficiency of cross-domain authentication. The performance of BCDAIoD was evaluated through experiments. The results show that the cross-domain authentication time cost and computational overhead of BCDAIoD are significantly lower those of than existing methods when the number of drones is large.