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...
In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs for maintaining...
When monitoring environments with wireless sensor networks, optimal sensor deployment is a fundamental issue and an effective means to achieve desired performance. Selecting best sensor deployment has a dependence on the deployment environments. Existing works address sensor deployment within three types of environments including one dimensional line, 2-D field and 3-D space. However, in many applications...
Multipath traffic engineering has been studied to disperse traffic flows on an IP network and guarantee end-to-end quality of service. We propose to apply k shortest simple paths as the multiple paths between an edge and the center router of a network and also try to disperse the traffic between them. The new heuristic k shortest simple path algorithm proposed in this paper is called k-shortest paths...
In this paper, we formulate coverage requirements of the sensor network as a minimum-cost connectivity guaranteed point k-coverage problem. An improved ant colony algorithm (EasiDesign) is proposed to achieve the approximate solution to this optimization problem. We made modifications in the convergence strategy and the ant state transition rule of the general ant colony optimization. Considering...
We study the problem of computing an energy-efficient data delivery scheme in wireless sensor networks that leverages the knowledge of a set of trajectories of mobile sinks in the network to route data from the sensors to the mobile sinks. Sensors collect data from the environment and instead of directly sending them to the mobile sinks (henceforth simply “sinks”), they route data to a number of selected...
Wireless sensor networks which are consisted of limited sensing, processing and communication equipments have prominent role in nowadays real-life applications. Efficient robust routing is a key feature in information processing in wireless sensor networks, especially in the presence of high-loss regions which occur due to harsh environment, hardware or software faults. In this paper, we propose a...
Expected growth in use and implementation of wireless sensor networks (WSNs) in different environments and for different applications creates new security challenges. In WSNs, a malicious node may initiate incorrect path information, change the contents of data packets, and even hijack one or more genuine network nodes. As the network reliability completely depends on individual nodespsila presence...
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.