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.
Minimizing the number of external control pins is one of the most important optimization objectives in digital microfluidic biochip (DMFB) designs especially as the chip size gets even bigger. So far, only few works focus on this issue for general-purpose DMFBs. In this paper, we present a pin count minimization algorithm based on sophisticated electrode chaining on regular or irregular electrode...
In this paper, we aim to develop scheduling policies to maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. This enhanced physical layer capability enables the system to accumulate information even when the link between two nodes is not good and a packet cannot be decoded within a slot. The result is an...
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...
Refering to single area crawler model based on p2p-chord network, designed and implemented a multi-area crawler model based on own design Skipnet-YL network which based on Skipnet protocol. It use better performance router protocol Skipnet-YL and the idea of SuperNodes and OSPF. Sequentially, it can solve the problem of low performance and the large of communication traffic during increasing nodes...
The optimal resources configuration of equipment maintenance support is kind of typical series-parallel system combinatorial optimization problem. Ants' routing behavior model has many resemblances to the resources configuration of equipment maintenance support. According to this and using ant colony algorithm to the protection of resources allocation optimization, the ability of optimization for...
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,...
For wireless ad hoc or sensor networks, non-flooding, guaranteed delivery routing protocols are preferred because of limited energy. In this paper we introduce TCGR, a tree cover based geographic routing protocol for wireless networks. We assign to each node a set of short labels such that nodes are embedded in a metric space induced by one or multiple trees. Based on the embedding, we use only greedy...
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...
A distance labeling scheme for trees labels the nodes of a tree in such a way that distance queries between any nodes of the tree can be inferred just by looking at their corresponding labels. The natural measure to evaluate the quality of a distance labeling scheme is by its label size, that is the maximal number of bits stored in a label. For arbitrary n-node trees, the current state of the art...
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, we investigate the properties of cycles for node representation in the star graph. Cycles can be in any order. The position for each symbol in the ordinary cycle is fixed and the ordinary cycle can not be nested into any other cycle. However, cyclic shift operations on symbols in a none-ordinary cycle are allowed and none-ordinary cycle can be nested into any other cycle. The number...
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.