Energy Efficient Expanding Ring Search

Park, I.; Pu, Ida

doi:10.1109/ams.2007.35

Cited by 23 publications

(16 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This design is also present in recent work by [31] and [50] for server cluster environments. Other work has focused mainly on turning idle machines off, to save power as shown in [6][9] [24] and [33] for datacenters.…”

Section: Related Workmentioning

confidence: 68%

Low-energy automated scheduling of computing resources

Bodenstein

Hedwig

Neumann

2011

Proceedings of the 1st ACM/IEEE Workshop on Autonomic Computing in Economics

View full text Add to dashboard Cite

The cost of electricity for datacenters is a substantial operational cost that can and should be managed, not only for saving energy, but also due to the ecologic commitment inherent to power consumption. This work proposes, formalizes and numerically evaluates LEAS, a low-energy scheduling model, for clearing scheduling markets, based on the maximization of welfare, subject to utility-level dependant energy costs. We promote energyefficient policies in management of datacenters, to enhance the efficiency of modernized datacenters. We focus specifically on linear power models, and the implications of the inherent fixed costs related to energy consumption of modern datacenters. We rigorously test the model by running multiple simulation scenarios derived from real workload traces, and evaluate the results using common statistical methods. We conclude with positive results and implications for long-term sustainable management of modern datacenters.

show abstract

Section: Related Workmentioning

confidence: 68%

Low-energy automated scheduling of computing resources

Bodenstein

Hedwig

Neumann

2011

Proceedings of the 1st ACM/IEEE Workshop on Autonomic Computing in Economics

View full text Add to dashboard Cite

show abstract

“…Probably, the first implementation of ERS technique, with respect to routing in mobile wireless ad hoc networks (MANETs), is done in the AODV protocol [22]. Subsequent uses of ERS in MANETs are described in [50][51][52].…”

Section: Related Workmentioning

confidence: 99%

Anycast tree-based routing in mobile wireless sensor networks with multiple sinks

Kostin¹,

Fanaeian

Al-Wattar³

2015

Wireless Netw

View full text Add to dashboard Cite

A routing scheme for wireless sensor networks with mobile sensors and mobile multiple sinks is proposed and studied. The scheme is based on expanding ring search, anycast messaging and reactive mode with maintaining route state information in sensors. As a result of a successful routing request issued by the sensor, it becomes a member of a routing tree with some sink as a root. Anycast messaging is used only at the stage of establishing a path from a sensor to a sink. Replies from sinks are always forwarded in unicast mode. This considerably reduces network traffic and, as a result, energy consumption by sensors. To take into account routing conditions for network nodes in receiving messages from different directions, the receiving area of each node is assumed to consist of a number of sectors, considered as independent links with random change of link states in time. The proposed routing scheme was investigated with the use of a detailed simulation model, implemented in terms of a class of extended Petri nets. In simulation the following performance metrics were investigated versus time-to-live value: response ratio, relative network traffic and relative energy consumption. These metrics were considered for a number of combinations of parameters, such as the number of sinks, sensor availability and link availability. The results of simulation were compared with published characteristics of a similar model, in which sensors do not maintain any routing state information, and is proved to outperform it.

show abstract

“…Kim et al [10] presented a technique of estimating NTT that divides a time difference between the source node and the destination node by the number of hops. In addition, Park et al [11] proposed a blocking ERS (B-ERS for short). One of the differences from the TTL-ERS is that the B-ERS does not resume its route search procedure from the source node each time a rebroadcast is required.…”

Section: Related Workmentioning

confidence: 99%

An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks

Hong

Lee

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. AODV routing protocol is intended for use by mobile nodes in adhoc wireless networks. Even though it performs well in static and low-mobility environments, the performance degrades rapidly with increasing mobility. Our primary concern is to enhance the performance of AODV by reducing the volume of the control packets like RREQ and RREP during the route discovery process effectively due to the node mobility. The propagation delays of the all possible links vary according to changes in its topology. Carefully adjusting the values of these network parameters can reduce the occurrences of the control packets. Thus, we propose a novel method of smoothly adjusting them based on AIAD (additive increase additive decrease) under a consideration of current network status. We have tested our proposed method with both the conventional AODV and the method using timestamp based on the three performance metrics; i.e., node mobility, node velocity, and node density, to compare their performances.

show abstract

Energy Efficient Expanding Ring Search

Cited by 23 publications

References 1 publication

Low-energy automated scheduling of computing resources

Low-energy automated scheduling of computing resources

Anycast tree-based routing in mobile wireless sensor networks with multiple sinks

An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks

Contact Info

Product

Resources

About