Hierarchical data dissemination scheme for large scale sensor networks

Visvanathan, Arvind; Youn, Jong-Hoon; Deogun, Jitender S.

doi:10.1109/icc.2005.1494949

Cited by 34 publications

(28 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The last type of topology-based method is cluster/hierarchy-based methods, such as [6] and [7]. In cluster/ hierarchy-based methods, moving objects are grouped into clusters based on the topology of the networks and the cluster heads are randomly selected.…”

Section: Figure 3 Experimental Results Of Varying Object Numbermentioning

confidence: 99%

A Spatio-Temporal Approach to Selective Data Dissemination in Mobile Peer-to-Peer Networks

Luo

Wolfson

2007

2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07)

View full text Add to dashboard Cite

Abstract-We examine data dissemination in mobile peer-to-peer networks, where moving objects communicate with each other via short-range wireless technologies such as IEEE 802.11 or Bluetooth. Given the memory and bandwidth/energy constraints at moving objects, the ideal mobile peer-to-peer dissemination method is for each moving object to store and transmit only the reports that are new to other objects encountered in the future. However, in practice no object can know the states of all the other objects due to the distributed and dynamic nature of mobile peer-to-peer networks. Thus, predicting the novelty probability of a report is important for efficient data dissemination in mobile peer-to-peer networks. In this paper we propose a decentralized spatio-temporal approach to selective data dissemination. In this approach, the novelty probability of a report is estimated based on both spatial and temporal attributes (AGE and DISTANCE) of the report and each moving object only stores and transmits the reports with the highest novelty probabilities. We study different strategies of using novelty factors to compute the novelty probability. Extensive experiments are conducted to test and analyze the performance of different strategies. The experimental results determine the best strategy and demonstrate its superiority against existing mobile peer-topeer methods.

show abstract

Section: Figure 3 Experimental Results Of Varying Object Numbermentioning

confidence: 99%

A Spatio-Temporal Approach to Selective Data Dissemination in Mobile Peer-to-Peer Networks

Luo

Wolfson

2007

2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07)

View full text Add to dashboard Cite

show abstract

“…Additionally, the reverse path vector changes with sink mobility which often causes more frequent control packet flooding. To support sink mobility a number of solutions have been presented that falls into either of the two approaches; construction and maintenance of sourceinitiated hierarchy of data dissemination nodes [7,8] and dissemination trees (source-oriented [9] and sink-oriented [10]). These solutions try to minimize the overhead and delay associated with tracking sink mobility by limiting its effects locally.…”

Section: Introductionmentioning

confidence: 99%

A quadtree-based hierarchical data dissemination for mobile sensor networks

Mir

2007

Telecommun Syst

View full text Add to dashboard Cite

The envisioned sensor network architecture where some of the nodes may be mobile poses several new challenges to this special type of ad hoc wireless network. Recently, researchers have proposed several data dissemination protocols based on either some hierarchical structure mainly constructed by a source node or source/sink oriented dissemination tree to support mobile sinks. However, such a source-initiated hierarchical structure results in significant resource consumption as the number of source-sink pairs are increased. Additionally, stimulus mobility aggravates the situation, where several sources may build a separate data forwarding hierarchy along the stimulus moving path. In this paper, we propose a new data dissemination protocol that exploits "Quadtree-based network space partitioning" to provide more efficient routing among multiple mobile stimuli and sink nodes. A common hierarchy of cluster-head nodes is constructed where the data delivery to mobile sinks is independent of the current position of mobile stimuli. Therefore, the overhead needed for hierarchy (route) maintenance is lower. Simulation results show that our work significantly reduces average energy consumption while maintaining comparably higher data delivery ratio.

show abstract

“…This situation can lead to excessive energy drain and increased packet collisions. Similar in spirit of the TTDD, Hierarchical Data Dissemination Scheme (HDDS) [6] is based on constructing a different hierarchy of data dissemination nodes from each source to potentially multiple sinks. In their work, a data forwarding node performs a load balancing by making another level of forwarding nodes.…”

Section: Related Workmentioning

confidence: 99%

“…Moreover, the reverse path vector changes with sink mobility which often causes more frequent flooding. In order to support sink mobility [5] and [6] proposed source-initiated hierarchal structure to the number of stationary or mobile sinks. However, the overhead of per source node grid construction and maintenance make these solutions unsuitable in presence of mobile stimulus.…”

Section: Introductionmentioning

confidence: 99%

A Quadtree-Based Data Dissemination Protocol for Wireless Sensor Networks with Mobile Sinks

Mir

2006

Personal Wireless Communications

View full text Add to dashboard Cite

Abstract. The envisioned sensor network architecture where some of the nodes may be mobile poses several new challenges to this special type of ad hoc wireless network. Recently, researchers have proposed several data dissemination protocols based on some hierarchical structure mainly constructed by a source node to support mobile sinks. However, such a source-initiated hierarchical structure results in significant resource consumption as the number of source-sink pairs are increased. Additionally, stimulus mobility aggravates the situation, where several sources may build a separate data forwarding hierarchy along the stimulus moving path. In this paper, we propose a new data dissemination protocol that exploits "Quadtree-based network space partitioning" to provide more efficient routing among multiple mobile stimuli and sink nodes. Simulation results show that our work significantly reduces average energy consumption while maintaining comparably higher data delivery ratio.

show abstract

Hierarchical data dissemination scheme for large scale sensor networks

Cited by 34 publications

References 11 publications

A Spatio-Temporal Approach to Selective Data Dissemination in Mobile Peer-to-Peer Networks

A Spatio-Temporal Approach to Selective Data Dissemination in Mobile Peer-to-Peer Networks

A quadtree-based hierarchical data dissemination for mobile sensor networks

A Quadtree-Based Data Dissemination Protocol for Wireless Sensor Networks with Mobile Sinks

Contact Info

Product

Resources

About