The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In some environment, randomly deployed sensor nodes could not satisfy the requirements of wireless sensor network. Therefore, it is necessary to use mobile sensor nodes in some special conditions. And after moving nodes are deployed randomly, they could be relocated according to the real-time situation of network coverage degree. This paper proposes a hexagonal grid-based sensor deployment algorithm,...
Because of restricted resources, wireless sensor networks need to consider synthetically the price of networks, and costs of communication and computing and so on. Aiming at the localization problem for mobile beacon node in wireless sensor network, this paper uses the ant colony algorithmpsilas characteristics which is self-organized, adaptive, dynamic optimization, integrating the hop number into...
Coverage control is a basic research problem in wireless sensor networks (WSNs). This paper proposes a distance optimization based coverage control algorithm, which utilizes ant colony algorithm to place sensor nodes to an appropriate position and optimize the moving path of mobile sensor nodes. The proposed algorithm not only guarantees the biggest coverage of wireless sensor networks, but also reduces...
The problem of computing a route for a mobile agent to local regions or specified nodes in a distributed sensor network is considered, both in a single region or multi-region cases. With all specified nodes visited, this paper formulates the route computation problem in terms of minimizing an objective function, which is directly proportional to the energy consumption and path loss. Further, we propose...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.