Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
180
On Minimum-Energy Broadcasting
- in All Wireless Networks, in the proc. of IEEE LCN'2001
"... and topology control in wireless ad hoc networks Network wide broadcasting in Mobile Ad Hoc Networks (MANET) provides important control and route establishment functionality for a number of unicast and multicast protocols. We present an overview of the recent progress of broadcasting and multicastin ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
and multicasting in wireless ad hoc networks. We discuss two energy models that could be used for broadcast: one is non-adjustable power and one is adjustable power. If the power consumed at each node is not adjustable, minimizing the total power used by a reliable broadcast tree is equivalent to the minimum
On minimum-energy broadcasting in all-wireless networks
- In Proceedings of the 26th Annual IEEE Conference on Local Computer Networks (LCN 2001
, 2001
"... We study the construction of the source-initiated (one-to-all) wireless broadcast tree to minimize the total required power for a given source node, a group of intended destination nodes and a given propagation constant, i.e., the power attenuation constant λ. The Minimum-Energy Broadcasting (MEB) p ..."
Abstract
-
Cited by 52 (0 self)
- Add to MetaCart
We study the construction of the source-initiated (one-to-all) wireless broadcast tree to minimize the total required power for a given source node, a group of intended destination nodes and a given propagation constant, i.e., the power attenuation constant λ. The Minimum-Energy Broadcasting (MEB
Localized minimum-energy broadcasting in Ad-Hoc Networks
, 2003
"... In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from a source node to reach all the other nodes in an ad-hoc wireless network. In all existing solutions each node requires glob ..."
Abstract
-
Cited by 123 (6 self)
- Add to MetaCart
In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from a source node to reach all the other nodes in an ad-hoc wireless network. In all existing solutions each node requires
Minimum-Energy Broadcast Routing in Dynamic Wireless Networks ∗
, 2011
"... One of the new challenges facing research in wireless networks is the design of algorithms and protocols that are energy aware. A good example is the minimum-energy broadcast routing problem for a static network in the plane, which attracted a great deal of attention these past years. The problem is ..."
Abstract
- Add to MetaCart
One of the new challenges facing research in wireless networks is the design of algorithms and protocols that are energy aware. A good example is the minimum-energy broadcast routing problem for a static network in the plane, which attracted a great deal of attention these past years. The problem
Minimum energy broadcast with few senders
- Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, USA, 2007, LNCS 4549
"... Abstract. Broadcasting a message from a given source node to all other nodes is a fundamental task during the operation of a wireless network. In many application scenarios the network nodes have only a limited energy supply, hence minimizing the energy consumption of any communication task prolongs ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. Broadcasting a message from a given source node to all other nodes is a fundamental task during the operation of a wireless network. In many application scenarios the network nodes have only a limited energy supply, hence minimizing the energy consumption of any communication task
Minimum-energy Broadcast in Simple Graphs with Limited Node Power
- in Proc. IASTED Int. Conf. on Parallel and Distributed Computing and Systems
, 2001
"... The minimum-energy broadcasting problem in wireless networks consists of finding a transmission radius vector for all stations in such a way that the total transmission power of the whole network is least possible. The minimum-energy broadcast problem may by modeled by an edge weighted complete grap ..."
Abstract
-
Cited by 36 (0 self)
- Add to MetaCart
The minimum-energy broadcasting problem in wireless networks consists of finding a transmission radius vector for all stations in such a way that the total transmission power of the whole network is least possible. The minimum-energy broadcast problem may by modeled by an edge weighted complete
Constructing minimum-energy broadcast trees in wireless ad hoc networks
- In Proc. Int’l Symp. Mobile Ad hoc Networking and Computing
, 2002
"... In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We con-sider two fundamental problems related to power consump-tion in this kind of network. One is the minimum-energy broadcast tree ..."
Abstract
-
Cited by 120 (7 self)
- Add to MetaCart
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We con-sider two fundamental problems related to power consump-tion in this kind of network. One is the minimum-energy broadcast tree
Minimum-energy broadcast routing in static ad hoc wireless networks
, 2001
"... Abstract | Energy conservation is a critical issue in ad hoc wireless networks for node and network life, as the nodes are powered by batteries only. One major approach for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption. Th ..."
Abstract
-
Cited by 138 (9 self)
- Add to MetaCart
. This optimization problem is referred to as minimum-energy routing. While minimum-energy unicast routing can be solved in polynomial time by shortest-path algorithms, it remains open whether minimum-energy broadcast routing can be solved in polynomial time, despite of the NP-hardness of its general graph version
Minimum-Energy Broadcast Using Practical Directional Antennas in All-Wireless Networks
- IN: PROC. OF IEEE INFOCOM, IEEE COMPUTER SOCIETY PRESS, LOS ALAMITOS
, 2006
"... Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio transmission has been studied and shown to be NP-complete for omnidirectional antennas. In this paper, we investigate the min ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio transmission has been studied and shown to be NP-complete for omnidirectional antennas. In this paper, we investigate
A Decentralized Approach to Minimum-Energy Broadcasting in Static Ad Hoc Networks
"... Abstract. Due to the limited resources of most wireless ad hoc and sensor networks, minimizing the cost of commonly used broadcasts is of utmost importance. This has led to work in the minimum energy broadcasting problem. Most solutions require global topology knowledge, however, this information is ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. Due to the limited resources of most wireless ad hoc and sensor networks, minimizing the cost of commonly used broadcasts is of utmost importance. This has led to work in the minimum energy broadcasting problem. Most solutions require global topology knowledge, however, this information
Results 1 - 10
of
180
