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 the application of wireless sensor networks (WSNs), energy efficiency is always an important topic for extending the network lifetime. Scheduling the operation modes of sensors can reduce the energy wasted by redundant sensors, but frequent alterations of sensors' modes and different data transmission routes influence the reliability of the WSN. In this paper, a novel algorithm for maximizing the...
Since sensors are energy-limited in a wireless sensor network (WSN), how to balance the energy consumption among the sensors in the network so as to prolong the lifetime of the whole network is a critical research topic in the development of WSNs. In this paper, a novel ant routing optimization (ARO) algorithm is proposed for taking advantage of the redundant sensors in the network to help relay the...
Research into maximizing the network lifetime is one of the most significant and challenging areas in wireless sensor networks (WSNs). By arranging sensors and sinks to realize target coverage and network connectivity respectively, an efficient schedule of sensors and sinks can prolong the network lifetime. However, the arrangements of sensors and sinks correlate with each other because each sensor...
Maximizing the lifetime of a sensor network by scheduling operations of sensors is an effective way to construct energy efficient wireless sensor networks. After the random deployment of sensors in the target area, the problem of finding the largest number of disjoint sets of sensors, with every set being able to completely cover the target area, is nondeterministic polynomial-complete. This paper...
Knowledge of topology in wireless sensor networks is significant for network management and maintenance. In this paper, a conditional probability of data loss theorem is proposed for wireless sensor networks based on the data aggregation paradigm.al probability of data loss theorem. It reveals the relationship between conditional probabilities of sensor data loss given different conditions. Based...
The SET k-cover problem is an NP-complete combinatorial optimization problem, which is derived from constructing energy efficient wireless sensor networks (WSNs). The goal of the problem is to find a way to divide sensors into disjoint cover sets, with every cover set being able to fully cover an area and the number of cover sets maximized. Instead of using deterministic algorithms or simple genetic...
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.