Distributed multi-hop cooperative communication in dense wireless sensor networks

Chen, Min; Qiu, Meikang; Liao, Linxia; Park, Jong-An; Ma, Jun

doi:10.1007/s11227-010-0382-6

Cited by 17 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4, we compare SRCR with GPSR and LACR in average path length. SRCR (Fitted) is drawn by the fitted formula 2 2 0.2017 (log ) +1.2127 L N , which agrees with our conclusion in (6). Long hops realized by cooperative links are used in LACR and SRCR, so both of them have shorter path length than GPSR.…”

Section: A Average Path Lengthsupporting

confidence: 83%

Scalable Random Cooperation Routing protocol for large-scale wireless sensor networks

Ren

Sheng

Liu

2013

2013 IEEE 24th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops)

View full text Add to dashboard Cite

Scalability is a key factor in designing routing protocols for large-scale extended wireless sensor networks. The bottleneck problem of scalability is how to cut down the average path length with tolerable overhead. In this paper, a scalable routing protocol for large-scale wireless sensor networks, referred to as SRCR (Scalable Random Cooperation Routing protocol), is proposed based on the small world theory and cooperative transmission. In SRCR, each node finds its friends to match the small world phenomenon by using a distributed algorithm. Specifically, long range cooperative links are established between a node and its friends through cooperative transmission. Benefit from both friends and the cooperative links, the average path length is reduced significantly. We show that in a network with N nodes uniformly distributed in an square region, the average path length of SRCR is asymptotically 2 2 log O N , while the routing overhead is acceptable. Simulation results show that SRCR performs better than some other protocols, considering end-to-end delay, network throughput, and routing overhead together.

show abstract

Section: A Average Path Lengthsupporting

confidence: 83%

Scalable Random Cooperation Routing protocol for large-scale wireless sensor networks

Ren

Sheng

Liu

2013

2013 IEEE 24th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC Workshops)

View full text Add to dashboard Cite

show abstract

“…Due to vehicle movement, the cluster's communication between nodes became less reliable. Chen et al 21 presented a novel passive multi‐hop clustering technique to address these issues. The clustering algorithm is based on a multi‐hop clustering algorithm that guarantees cluster penetration and resilience.…”

Section: Related Workmentioning

confidence: 99%

Multi‐hoped cooperative communication‐based wireless underground sensor network design

Kanthavel

Priyadharshini

Sudha³

et al. 2022

Int J Communication

View full text Add to dashboard Cite

Summary Deepwater utilization and underwater sound communication with inadequate bandwidth, elongated propagation interruption, signal failure issues, and sensor node malfunction due to ecological circumstances are the limitations of the underwater wireless sensor network. Further, the challenges in underground wireless sensor network (WSN) include superior bandwidth, high power expenses, information handling, and cross‐layer design. On the other hand, cooperative communications facilitate competent employment of communication resources, by permitting nodes in a network to work together in information communication. As wireless sensor networks adapt to multi‐hop transmission in high data traffic, there is a high demand for achieving energy efficiency. Moreover, in the course of proximity nodes to the sink, an energy hole is started for the extended network lifetime. This paper proposes the design of multi‐hoped cooperative communication‐based wireless underground sensor networks that guarantees energy efficiency in a hostile environment. In addition, network coverage and connectivity improvement are also improved by this proposed design.

show abstract

“…On the other hand, it has been proposed in Ref. [7] that the sensing range of S 1 can be partitioned into at most N 2 1 − N 1 + 2 patches. Since two or more sensors may contain the same patch, the number of patches in sensing ranges of sensors in the shaded section satisfies…”

Section: -5mentioning

confidence: 99%

“…A wireless sensor network (WSN) consists of many intelligent sensor nodes deployed in a monitored region. [1,2] Each sensor is capable of sensing, processing, storing environmental information, and further communicating with other sensors to implement complicated tasks. [3−5] Tracking multiple targets is an important and fundamental subject of wireless sensor networks.…”

Section: Introductionmentioning

confidence: 99%

A target group tracking algorithm for wireless sensor networks using azimuthal angle of arrival information

2012

View full text Add to dashboard Cite

In this paper, we explore the technology of tracking a group of targets with correlated motions in a wireless sensor network. Since a group of targets moves collectively and is restricted within a limited region, it is not worth consuming scarce resources of sensors in computing the trajectory of each single target. Hence, in this paper, the problem is modeled as tracking a geographical continuous region covered by all targets. A tracking algorithm is proposed to estimate the region covered by the target group in each sampling period. Based on the locations of sensors and the azimuthal angle of arrival (AOA) information, the estimated region covering all the group members is obtained. Algorithm analysis provides the fundamental limits to the accuracy of localizing a target group. Simulation results show that the proposed algorithm is superior to the existing hull algorithm due to the reduction in estimation error, which is between 10% and 40% of the hull algorithm, with a similar density of sensors. And when the density of sensors increases, the localization accuracy of the proposed algorithm improves dramatically.

show abstract

Distributed multi-hop cooperative communication in dense wireless sensor networks

Cited by 17 publications

References 19 publications

Scalable Random Cooperation Routing protocol for large-scale wireless sensor networks

Scalable Random Cooperation Routing protocol for large-scale wireless sensor networks

Multi‐hoped cooperative communication‐based wireless underground sensor network design

A target group tracking algorithm for wireless sensor networks using azimuthal angle of arrival information

Contact Info

Product

Resources

About