&lt;title&gt;Data dissemination using gossiping in wireless sensor networks&lt;/title&gt;

Medidi, Muralidhar; Ding, Jin; Medidi, Sirisha

doi:10.1117/12.606406

Cited by 5 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For 7DS we compare with its P-P scheme 8 ( [2]). In the 7DS P-P scheme, each mobile device O periodically broadcasts its native query.…”

Section: The 7ds and Peoplenet Algorithmsmentioning

confidence: 99%

“…For example, the SPIN protocol uses meta-data negotiation before initiating the real data operation to minimize the redundant data transmission, hence, save energy over classical flooding. However, the meta-data exchange is based on broadcasting, which incurs flooding storm problems and therefore is not efficient in bandwidth utilization (see [8]). …”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Mobile Peer-to-Peer Data Dissemination with Resource Constraints

Wolfson

Tanner

2007

2007 International Conference on Mobile Data Management

View full text Add to dashboard Cite

show abstract

“…For 7DS we compare with its P-P scheme 8 ( [2]). In the 7DS P-P scheme, each mobile device O periodically broadcasts its native query.…”

Section: The 7ds and Peoplenet Algorithmsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Mobile Peer-to-Peer Data Dissemination with Resource Constraints

Wolfson

Tanner

2007

2007 International Conference on Mobile Data Management

View full text Add to dashboard Cite

show abstract

“…For instance, on unstructured networks those algorithms may be slow or impose a high overhead, are not scalable with the size of the network and do not necessarily return any valid result [8,9], whereas search on structured networks is bounded but the maintenance of the structure is expensive, especially in mobile environments [10].…”

Section: Introductionmentioning

confidence: 98%

Improving robustness of P2P applications in mobile environments

Roczniak

Saddik

2009

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

Mobile P2P networks possess particular characteristics which make accessibility of services deployed on peers a challenge. This has to be taken into account when considering robustness of applications that depend on successfully accessing a set of services. While ensuring robustness is traditionally handled through replication or redundancy, those solutions are not readily applicable to decentralized and dynamic networks. Instead, current solutions are based on efficient P2P structure maintenance or unstructured network search algorithms. A novel and alternative method proposed in this paper is based on the observation that some redundancy may exist between services offered on the network, a fact which could be used to recreate an unavailable service from services accessible to a peer. Instead of adding redundancy to the system, our solution exploits the already existing redundancy to improve robustness of mobile P2P applications. We model the interaction with services as finite-state transducers and propose a heuristic to obtain redundancy between any pair of services. Then, a set of algorithms that uses this inter-service redundancy to recreate the interaction with one service from the other is discussed. The computational cost is polynomial with respect to services' size, and in practice, the non-redundant functionality and related control need to be implemented locally.

show abstract

“…P2P data dissemination is an active research domain where various schemes, algorithms and mechanism have been proposed [1][2][3] to overcome the dynamicity and scalability of a network. Traditionally in peer-to-peer systems these concerns are handled by replication or redundancy in centralized and static networks [4].…”

Section: Introductionmentioning

confidence: 99%

Evaluation framework for adaptive context-aware routing in large scale mobile peer-to-peer systems

Yasar

Preuveneers

Berbers

2010

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

The proliferation of novel wireless network technologies creates new opportunities for complex peerto-peer information dissemination systems. A key challenge that remains in this area is how to select the best algorithms and protocols to communicate effectively on a large scale. In this paper, we focus in particular on large scale mobile networks where effectiveness depends on the requirements of the application at hand and on the context of the peers in the network. We propose a framework for context-aware adaptive information sharing that allows the evaluation of and comparison with alternative information routing protocols using network metrics to measure a variety of quality attributes of the information dissemination protocols. These metrics can then be used to verify which protocol is best suited for a particular application. We illustrate our evaluation framework with different information dissemination protocols in an inter-vehicle communication scenario.

show abstract

<title>Data dissemination using gossiping in wireless sensor networks</title>

Cited by 5 publications

References 0 publications

Mobile Peer-to-Peer Data Dissemination with Resource Constraints

Mobile Peer-to-Peer Data Dissemination with Resource Constraints

Improving robustness of P2P applications in mobile environments

Evaluation framework for adaptive context-aware routing in large scale mobile peer-to-peer systems

Contact Info

Product

Resources

About