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.
We study the optimum scheduling of a pushing-based information delivery system, where information is sent from a server to mobile users by using server-initiated pushing actions. Information arrives at the server at random. The server adopts a “hold-then-serve” strategy, where new information is temporarily stored in queue for a later one-time transmission. Based on the current queue status, at any...
Aiming at farmland information monitoring in remote mountain areas, using wireless sensor networks (WSNs) and unmanned aerial vehicle (UAV) is a good way to collect the information. However, UAV has some limitations, such as energy, that have limitation on the work time of UAV. Therefore, the path planning for UAV is an important factor in order to gather data correctly. Considering the irregularity...
Conventional hydraulic actuator is controlled by mechanically connected orifices valve. The controllability of this method is poor and the energy consumption is huge especially under the over-running condition. So a novel system configuration of the hydraulic excavator is presented to improve the problem mentioned above, in which boom cylinder, stick cylinder and swing motor are controlled with separate...
In this paper, we study the optimum estimation of a continuous-time random process by using discrete-time samples taken by a sensor powered by energy harvesting power sources. The system employs a best-effort sensing scheme to cope with the stochastic nature of the energy harvesting sources. The best-effort sensing scheme defines a set of equally-spaced candidate sensing instants, and the sensor performs...
For saving energy and balancing the energy load among nodes, an energy-efficient data gathering algorithm (EDGA) based on clustering is proposed in this paper, which is used to gather data in wireless sensor networks. Firstly, the nodes compete for becoming a clusterhead according to residual energy and the distribution of neighbor nodes. Secondly, the clusterhead selects the active nodes according...
Data gathering is one of the most important operations in wireless sensor networks. Since the nodes operate on limited power, it is a critical task to design an energy-efficient data gathering algorithm. In this paper, we propose an energy-efficient data gathering algorithm (EDGA) in which the network is grouped into clusters (each with a clusterhead) and the nodes form chains in each cluster. Firstly,...
We consider the transmission completion time minimization problem in a single-user energy harvesting wireless communication system. In this system, both the data packets and the harvested energy are modelled to arrive at the source node randomly. Our goal is to adaptively change the transmission rate according to the traffic load and available energy, such that the transmission completion time is...
For monitoring burst events in a kind of reactive wireless sensor networks (WSNs), a novel scheme of dynamic clustering routing algorithm (DCRA) based on support degree is proposed. The new approach lets sensors decide whether become a clusterhead (CH) according to the support degree coming from neighbors. Unlike traditional distributed clustering algorithms, DCRA combines energy, load balancing and...
In wireless sensor networks, energy is scarce resource such that its conservation and efficient use is a major issue. Therefore, a key goal of routing design in WSNs is to save energy and at the mean time increase the network lifetime. In this paper, we propose an on-demand multipath routing algorithm from the viewpoint of probability, named MRAP. The goal of MRAP is to balance the energy consumption...
These nodes have limited energy supply in wireless sensor networks. Thus energy consumption is the main concern while developing routing algorithm in wireless sensor networks. In this paper, we propose a multi-path routing algorithm based on Rumor Routing, called EBMRR (Energy-Balance Multipath Rumor Routing), which is probabilistic approach that attempts to find multipath according to residual energy...
The energy constraint sensor nodes operate on limited batteries, so the energy consumption is a key design criterion for the routing protocols in wireless sensor networks. Comparing with single path routing algorithm, multi-path routing algorithm can balance the network energy distribution and extend the network lifetime better. In this paper, we propose an Ant Colony- Based Multi-path Routing Algorithm,...
In this paper, a crosstalk-avoidance (CA) bus coding approach is developed to produce area-efficient, low-power codes for global data busses. Proposed codes are codes without memory using shielding boundary strategy. Related code generation algorithm is also developed. The probabilistic distribution of input data could be included to reduce the power consumption. The performance improvement of CA...
In wireless sensor networks, energy is the very important network resources. How enhances the effectiveness of the pitch point and the network energy under the limited energy condition, enables the network work as long as possible, is one kind of this network design essential target. Chaotic neural network can achieve this kind of item, and had proven quicker restrain through the simulation, found...
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.