Reliability-Latency Tradeoffs for Data Gathering in Random-Access Wireless Sensor Networks

Zhang, Haibo; Shen, Hong; Kan, Haibin

doi:10.1007/11590354_87

Cited by 4 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, during the attempt probability computation period, each node needs to broadcast the <PNtab> to its neighbors, and all the links are expected to have fair throughput to fasten the convergence speed of the algorithm. In [10], we considered the attempt probability computation problem for one hop networks on the assumption that each node has the same attempt probability.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…The most relevant works include [7,9,10]. In [4], a generalized gradient ascent algorithm was proposed to self-learn the optimal attempt probability to maximize the throughput for each node.…”

Section: Related Workmentioning

confidence: 99%

“…where γ is the value for PHDR and h(i) is the number of hops from node v i to the BS. We perform the simulation on a data gathering tree composed of 88 sensors, which is constructed by the algorithm proposed in [10]. The results were obtained by 5000 runs with the same configuration.…”

Section: Performance Of the Modelmentioning

confidence: 99%

“…In [1], a hop-tree is constructed to gather sensor data. In [10], an algorithm for constructing a data gathering tree which can provide good trade-offs between reliability and latency was proposed. In this paper, we assume that the tree for data gathering has already been constructed.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks

Zhang

Shen

2006

20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)

View full text Add to dashboard Cite

In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collision induced by bursty traffic, we introduce a novel model based on random channel access scheme for data gathering. In our model, both data delivery reliability and latency are considered, and our goal is to tune the attempt probability for each sensor node so that the data gathering duration can be minimized on condition that each link in the data gathering tree can provide guaranteed per-hop packet delivery reliability. We formulate this problem as an optimization problem and propose a distributed heuristic algorithm which exploits only two hop neighbors information to solve it for tree networks. We evaluate the algorithm and the model by simulations, and results show that our algorithm has low computational complexity and our model can provide a good trade-off between reliability and latency for data gathering.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Performance Of the Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks

Zhang

Shen

2006

20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)

View full text Add to dashboard Cite

show abstract

“…Therefore, efficient realization of important computations on WSNs is attracting more and more attentions from both academia and industry. Closely related to energyefficient computation, power-saving routing and data gathering are also important problems for application of WSNs for which several results have been developed recently ( [13], [14], [15]). …”

Section: Introductionmentioning

confidence: 99%

Efficient Matrix Multiplication on Wireless Sensor Networks

Shen

Chen

2008

2008 Seventh International Conference on Grid and Cooperative Computing

Self Cite

View full text Add to dashboard Cite

Wireless Sensor Networks (WSN for short) have been widely used for data collecting and processing in various applications. This paper studies the problem of how to efficiently realize matrix multiplication on a WSN. Based on a widely accepted model of WSNs, we show the lower bound on the number of parallel steps needed by any algorithm for n×n matrix multiplication on a WSN of n 2 sensors with transmission radius r. We then present two parallel algorithms for matrix multiplication on a WSN which have the same time complexity as the lower bound. For both algorithms we analyze their main performance parameters including time cost, memory cost and energy-efficiency in detail

show abstract

Reliable and Real-Time Data Gathering in Multi-hop Linear Wireless Sensor Networks

Zhang

Shen

Tian

2006

Wireless Algorithms, Systems, and Applications

View full text Add to dashboard Cite

Reliability-Latency Tradeoffs for Data Gathering in Random-Access Wireless Sensor Networks

Cited by 4 publications

References 7 publications

Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks

Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks

Efficient Matrix Multiplication on Wireless Sensor Networks

Reliable and Real-Time Data Gathering in Multi-hop Linear Wireless Sensor Networks

Contact Info

Product

Resources

About