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.
Focusing on the issues of access management and consuming in energy routing network within the low-voltage distribution grid, this article studies the energy management mechanism from the perspective of routing topology, and the routing matrix is proposed to realize such mechanism. Firstly, we design a type of low-voltage energy router (ER), in which the renewable energy and 380V distribution grid...
This paper proposes a novel protocol, called an aggregation-based topology learning (ATL) protocol, to identify energy holes in a randomly deployed hierarchical wireless sensor network (HWSN). The approach taken in the protocol design is to learn the routing topology of a tree-structured HWSN in real-time, as an integral part of the sensed data collection and aggregation process in the network. The...
In Wireless sensor networks (WSN), how to collect the major amount of data and reduce the data size is a delinquent issue. The existing methods concentrated on the data similarities based on the threshold limit. Those approaches may reduce the number of wireless communications but may not guarantee the bandwidth requirements. To ensure the communication and bandwidth requirements, clusters are framed...
An established Intelligent Power Management (IPM) strategy for a Wireless Sensor Network (WSN) is based on the principal that redundant nodes can be hibernated to conserve their energy. Due to the hibernation, sensed data from the node will be unavailable, which essentially means that the WSN will be blind in the vicinity of the hibernating node. Numerous strategies have been proposed to maintain...
The increased industrial interest in wireless sensor networks demands a shift from optimizing protocols for energy-efficient reporting of sporadic events to developing solutions for high-rate real-time data collection and dissemination. We study time-optimal convergecast under the communication constraints of commodity sensor network platforms, and propose a novel convergecast model in which packet...
Sensor networks are composed of a great number of sensor nodes. Sensor nodes are typically energy restricted and hard to recharge, so reducing energy consumption has recently been a hot focus on wireless sensor network researches. One common approach is to make use of a logical structure, such as a grid, to construct an efficient routing topology for shorten the routing paths. This paper proposed...
Lifetime of multicast connection in a wireless ad-hoc network is constrained by routing topology as well as mobility, interference, noise and battery capacity. In order to optimize the multicast lifetime, a series of routing algorithms and cognitive network models with directional antennas have been proposed. However, these methods can only reach a sub-optimal level. In this paper, we propose an additional...
In this paper we propose a distributed congestion control algorithm for tree based communications in wireless sensor networks, that seeks to adaptively assign a fair and efficient transmission rate to each node. In our algorithm, each node monitors its aggregate output and input traffic rates. Based on the difference of the two, a node then decides either to increase or decrease the bandwidth allocable...
This paper presented an improved routing algorithm K-CSSP of structured P2P overlay networks based on clustering the nodespsila communication history of the CSSP. This routing algorithm computing the nodespsila stability via storing the nodespsila communication history distributed. The K-CSSP uses the K-means algorithm to cluster the CSSP nodes by the stabilities into K regions which inter-linked...
In this paper we analyze the performance of two different routing protocols specifically designed for Wireless Sensor Networks (WSNs) for real-time estimation, control, and monitoring. These protocols are designed to compensate for the lossy nature of the wireless links and the delay from sending messages over multiple hops from the sensors to the controller. The routing protocols are designed to...
In sensor networks, both energy and bandwidth are scarce resources. In the past, the energy efficient routing problem has been vastly studied in order to maximize network lifetime, but link bandwidth has been optimistically assumed to be abundant. As energy constraint affects how data should be routed, link bandwidth also affects not just the routing topology but also the allowed data rate on each...
Length-matching routing is a very important issue for PCB routing. Previous length-matching routers [1]-[3] all have assumptions on the routing topology whereas practical designs may be free of any topological constraint. In this paper, we propose a router that deals with general topology. Unlike previous routers, our router does not impose any restriction on the routing topology. Moreover, our router...
Low cost is always the favorite feature of consumer electronics. The purpose of this paper is to study the possibility of low-cost design for DDR2-1066 memory interface. The S-parameters simulations of the PCB, DDR2 controller and SDRAM packages were performed using the electromagnetic field solvers up to 3 GHz. Those broadband S-parameters were integrated with the chip SPICE models in the SPICE simulator...
To obtain a satisfactory performance in the wireless sensor network, optimal routing is the most important aspect. The lifetime of the sensor network depends mostly on the routing topology. In order to route the data in an efficient way, we propose an almost Delaunay triangulation routing approach, which could be generated locally. This routing graph is generated only once and can be used during the...
In this paper, we present the first work on the Steiner routing for 3D stacked ICs. In the 3D Steiner routing problem, the pins are located in multiple device layers, which makes it more general than its 2D counterpart. Our algorithm consists of two steps: tree construction and tree refinement. Our tree construction algorithm builds a delay-oriented Steiner tree under a given thermal profile. We show...
Dynamic path provisioning of 1OGbE using GMPLS E-NNI was successfully achieved between Japan and the US for the first time. Without exposing routing topology of individual network domains, end-to-end optical circuits were established via PXCs.
Pursuit-evasion games have been studied as a generalization of many control problems, and have been also used to study the viability of running control algorithms over sensor networks. We provide a method for computing performance bounds on a sample pursuit-evasion game, the classic lifeline game described by Rufus Isaacs. Given a routing topology and pairwise link probabilities, we compute an n-hop...
As the popularity of resource-constrained devices such as hand-held computers increases, a new network service off loading complex processing tasks towards computational resources located in the access- or core network, sounds very promising. In a consumer-oriented environment, characterized by a large diversity in connected devices, a transparent network-based request processing strategy offers a...
The state of the art in reliable multicasting protocols renders itself inadequate for group multicasting in environments where both intra-group and inter-group messages bridge several LANs. A particularly difficult situation arises if some LANs are managed by autonomous authorities. If autonomy is upheld, as a defacto condition, then LANs under different authorities can adopt different ordering criteria...
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.