Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,903
Local Broadcasting, Minimum Broadcast Time
"... The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is known as the Minimum Broadcast Time Problem or the Local Broadcasting Problem. Finding an optimal broadcast using a local ..."
Abstract
- Add to MetaCart
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is known as the Minimum Broadcast Time Problem or the Local Broadcasting Problem. Finding an optimal broadcast using a local
Persistent Localized Broadcasting in VANETs
- in "IEEE Journal on Selected Areas in Communications", 2012
"... Abstract—We present a communication protocol, called LINGER, for persistent dissemination of delay-tolerant informa-tion to vehicular users, within a geographical area of interest. The goal of LINGER is to dispatch and confine information in local-ized areas of a mobile network with minimal protocol ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
successfully drive the information toward a region of interest from a far away source and keep it local with negligible overhead. We show the effectiveness of such an approach in the support of localized broadcasting, in terms of both percentage of informed vehicles and information delivery delay, and we
Local Broadcasting in the Physical Interference Model
, 2008
"... In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node knows how many nodes there are in its geographical proximity, and another, which makes no assumptions about topology know ..."
Abstract
-
Cited by 22 (2 self)
- Add to MetaCart
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node knows how many nodes there are in its geographical proximity, and another, which makes no assumptions about topology
Towards tight bounds for local broadcasting
, 2012
"... Abstract. We consider the local broadcasting problem in the SINR model, which is a basic prim-itive for gathering initial information among n wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a log2 n additive term) ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Abstract. We consider the local broadcasting problem in the SINR model, which is a basic prim-itive for gathering initial information among n wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a log2 n additive term
Localized broadcasting in ad hoc networks
- In Wireless Ad Hoc and Sensor Networks, Ahmed Safwat
"... Abstract Broadcast is the process of sending a message from one node to all other nodes in an ad hoc network. It is a fundamental operation for communication in ad hoc networks as it allows for the update of network information and route discov-ery as well as other operations. The chapter presents a ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
a comprehensive review and analysis of existing localized solutions on broadcast, where only local knowledge is required. The techniques reviewed include optimized broadcast techniques such as multipoint relay and dominating set based broadcasting with fixed transmission radii, resource awareness
Ethernet: Distributed packet switching for local computer networks
- COMMUN. ACM
, 1976
"... Ethernet is a branching broadcast communication system for carrying digital data packets among locally distributed computing stations. The packet transport mechanism provided by Ethernet has been used to build systems which can be viewed as either local computer networks or loosely coupled multipr ..."
Abstract
-
Cited by 468 (2 self)
- Add to MetaCart
Ethernet is a branching broadcast communication system for carrying digital data packets among locally distributed computing stations. The packet transport mechanism provided by Ethernet has been used to build systems which can be viewed as either local computer networks or loosely coupled
On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model
- In Proc. 9th Internat. Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS’13
, 2013
"... Abstract. We consider the distributed construction of a deterministic local broadcasting schedule in the SINR model of interference. During the execution of such a schedule each node should be able to transmit one message to its neighbors. Our construction requires only O( ∆ logn) time slots, where ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. We consider the distributed construction of a deterministic local broadcasting schedule in the SINR model of interference. During the execution of such a schedule each node should be able to transmit one message to its neighbors. Our construction requires only O( ∆ logn) time slots, where
Cooperative strategies and capacity theorems for relay networks
- IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of ..."
Abstract
-
Cited by 739 (19 self)
- Add to MetaCart
channel knowl-edge is available at the transmitters, and cases where local user co-operation is permitted. The results further extend to multisource and multidestination networks such as multiaccess and broadcast relay channels.
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
"... Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcast has been addressed in the context of the radio network model that is characterized by a shared channel, and where a tra ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
transmission is heard by all nodes within the sender’s neighborhood. This basic defining feature of the radio network model can be termed as the reliable local broadcast assumption. However, in actuality, wireless networks do not exhibit such perfect and predictable behavior. Thus any attempt at distributed
An O (logn) distributed approximation algorithm for local broadcasting in unstructured wireless networks
"... Abstract—The unstructured multi-hop radio network model, with asynchronous wake-up, no collision detection and little knowledge on the network topology, is proposed for capturing the particularly harsh characteristics of initially deployed wireless ad hoc and sensor networks. In this paper, assuming ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
, assuming such a practical model, we study a fundamental problem of both theoretical and practical interests—the local broadcasting problem. Given a set of nodes V where each node wants to broadcast a message to all its neighbors that are within a certain local broadcasting range R, the problem
Results 1 - 10
of
1,903
