Results 1  10
of
34
Optimized Broadcast Protocol for Sensor Networks
 IEEE Transactions on Computers (TC
, 2005
"... ..."
(Show Context)
Optimized stateless broadcasting in wireless multihop networks
 In INFOCOM
, 2006
"... Abstract — In this paper we present a simple and stateless ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
(Show Context)
Abstract — In this paper we present a simple and stateless
Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks
 In Proceedings of The 2005 Conference on Communication in Distributed Systems (KiVS
, 2005
"... Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANET). Unfortunately, most broadcast solutions are tailored to one class of MANETs with respect to node density and node mobility and are unlikely to operate well in other cl ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
(Show Context)
Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANET). Unfortunately, most broadcast solutions are tailored to one class of MANETs with respect to node density and node mobility and are unlikely to operate well in other classes. In this paper, we introduce hypergossiping, a novel adaptive broadcast algorithm that combines two strategies. Hypergossiping uses adaptive gossiping to efficiently distribute messages within single network partitions and implements an efficient heuristic to distribute them across partitions. Simulation results in ns2 show that hypergossiping operates well for a broad range of MANETs with respect to node densities, mobility levels and network loads. Key words: MANET, adaptive broadcast, network partitioning 1
The expected size of the rule k dominating set
 Algorithmica
, 2006
"... Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. Here we consider the “average case”performance of Rule k for the model of random unit disk graphs constructed from n random points in an ℓn × ℓn square. If k ≥ 3 an ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. Here we consider the “average case”performance of Rule k for the model of random unit disk graphs constructed from n random points in an ℓn × ℓn square. If k ≥ 3 and ℓn = o ( √ n), then the expected size of the Rule k dominating set is Θ(ℓ 2 n) as n → ∞. If ℓn ≤ √ n, then expected size of the minimum CDS is also Θ(ℓ 2 n). 10 log n
Reliable gossipbased broadcast protocol in mobile ad hoc networks
 in MSN
, 2005
"... Abstract. Based on existing reliable broadcast protocols in MANETs, we propose a novel reliable broadcast protocol that uses clustering technique and gossip methodology. We combine local retransmission and gossip mechanisms to provide reliability in MANETs. The proposed protocol can dynamically chan ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Based on existing reliable broadcast protocols in MANETs, we propose a novel reliable broadcast protocol that uses clustering technique and gossip methodology. We combine local retransmission and gossip mechanisms to provide reliability in MANETs. The proposed protocol can dynamically change system parameters for reliable broadcast communication in order to improve the adaptability in the rapidly changing network environment. In our proposed protocol, the adaptive gossip probability is explored to make the protocol insensitive to changing environment. In sparse or boundary areas, a large gossip probability is adopted in order to improve the reliability; while in dense or inner areas, a small gossip probability is used to alleviate the contention and collision. Theoretical analysis shows that the proposed protocol has high delivery ratio and low endtoend delay for broadcasting. 1
An efficient distributed broadcasting algorithm for ad hoc networks
 SpringerVerlag Berlin Heidelberg
"... In this paper, we propose a distributed broadcasting algorithm for wireless ad hoc networks. In the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exists a ring that contains all its neighbors. The proposed algorithm is more efficien ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
In this paper, we propose a distributed broadcasting algorithm for wireless ad hoc networks. In the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exists a ring that contains all its neighbors. The proposed algorithm is more efficient than the existing broadcasting algorithms in the literatures. That is, the size of the forwarding nodes found by our algorithm is smaller and the running time is faster than other broadcasting algorithms. Reducing the number of forwarding nodes will decrease the probability of transmission collision, and hence improve the packet delivery ratio. The algorithm runs in O(d 2) time, where d is the maximum node degree. The full coverage is not guaranteed but as shown by the simulation results, the probability of full coverages can be over 99 percent when the network contains 100 or more nodes. 1.
A Feasibility Study on Disseminating Spatiotemporal Information via Vehicular Adhoc Networks
, 2007
"... Abstract — In this paper we study the feasibility of disseminating reports about resources via vehicular adhoc networks. Each disseminated report represents information about a spatialtemporal event, such as the availability of a parking slot at a particular time. The simple flooding algorithm is ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract — In this paper we study the feasibility of disseminating reports about resources via vehicular adhoc networks. Each disseminated report represents information about a spatialtemporal event, such as the availability of a parking slot at a particular time. The simple flooding algorithm is used for dissemination in a VANET. The feasibility is analyzed by comparing the effectiveness of VANET with that of clientserver. The performance measure integrates throughput and response time, the two traditional measures for evaluation of data dissemination algorithms. The comparison is based on realistic simulation of vehicle mobility in a real road network and of the 802.11 protocol. The comparison enables determining the superior architecture (VANET or clientserver) for a given environment. I.
Broadcast Flooding Revisited: Survivability and Latency
 In Proc. of the 26th IEEE International Conference on Computer Communications (INFOCOM
, 2007
"... ..."
(Show Context)
Comparison of two CDS algorithms on random unit ball graphs
, 2004
"... This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominating sets. The stochastic model is that instances are random unit ball graphs formed from n random points in an ℓn × ℓn × ℓn cube. The first algorithm, widely known as “Rule 1 ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominating sets. The stochastic model is that instances are random unit ball graphs formed from n random points in an ℓn × ℓn × ℓn cube. The first algorithm, widely known as “Rule 1”, is proved to be ineffective asymptotically: if ℓn = O ( 3 � n), then with asymptotic probability one Rule 1 selects a log n dominating set that consists of all but o(n) nodes in the network. In contrast, the expected size of Dai Li and Wu’s Rule 4 dominating set is Θ(ℓ 3 n). This latter performance is optimal insofar as the minimum connected dominating set also has Θ(ℓ 3 n) vertices ’on average’. These conclusions are three dimensional analogues of the two dimensional results in [18] and [19].
A Survey of Message Diffusion Protocols in Mobile Ad Hoc Networks
"... For the last twenty years, mobile communications have experienced an explosive growth. In particular, one area of mobile communication, the Mobile Ad hoc Networks (MANETs), has attracted significant attention due to its multiple applications and its challenging research problems. On the other hand, ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
For the last twenty years, mobile communications have experienced an explosive growth. In particular, one area of mobile communication, the Mobile Ad hoc Networks (MANETs), has attracted significant attention due to its multiple applications and its challenging research problems. On the other hand, the nodes mobility in these networks has introduced new challenges for the routing protocols, especially when the mobility induces multiple disconnections in the network. In this survey, we present an overview of this issue and a detailed discussion of the major factors involved. In particular, we show how messages can be efficiently disseminated in different types of MANETs. Keywords Mobile computing, mobile adhoc networks, opportunistic