• Title/Summary/Keyword: Routing metric

Search Result 112, Processing Time 0.016 seconds

Reliable multi-hop communication for structural health monitoring

  • Nagayama, Tomonori;Moinzadeh, Parya;Mechitov, Kirill;Ushita, Mitsushi;Makihata, Noritoshi;Ieiri, Masataka;Agha, Gul;Spencer, Billie F. Jr.;Fujino, Yozo;Seo, Ju-Won
    • Smart Structures and Systems
    • /
    • v.6 no.5_6
    • /
    • pp.481-504
    • /
    • 2010
  • Wireless smart sensor networks (WSSNs) have been proposed by a number of researchers to evaluate the current condition of civil infrastructure, offering improved understanding of dynamic response through dense instrumentation. As focus moves from laboratory testing to full-scale implementation, the need for multi-hop communication to address issues associated with the large size of civil infrastructure and their limited radio power has become apparent. Multi-hop communication protocols allow sensors to cooperate to reliably deliver data between nodes outside of direct communication range. However, application specific requirements, such as high sampling rates, vast amounts of data to be collected, precise internodal synchronization, and reliable communication, are quite challenging to achieve with generic multi-hop communication protocols. This paper proposes two complementary reliable multi-hop communication solutions for monitoring of civil infrastructure. In the first approach, termed herein General Purpose Multi-hop (GPMH), the wide variety of communication patterns involved in structural health monitoring, particularly in decentralized implementations, are acknowledged to develop a flexible and adaptable any-to-any communication protocol. In the second approach, termed herein Single-Sink Multi-hop (SSMH), an efficient many-to-one protocol utilizing all available RF channels is designed to minimize the time required to collect the large amounts of data generated by dense arrays of sensor nodes. Both protocols adopt the Ad-hoc On-demand Distance Vector (AODV) routing protocol, which provides any-to-any routing and multi-cast capability, and supports a broad range of communication patterns. The proposed implementations refine the routing metric by considering the stability of links, exclude functionality unnecessary in mostly-static WSSNs, and integrate a reliable communication layer with the AODV protocol. These customizations have resulted in robust realizations of multi-hop reliable communication that meet the demands of structural health monitoring.

The Asymptotic Throughput and Connectivity of Cognitive Radio Networks with Directional Transmission

  • Wei, Zhiqing;Feng, Zhiyong;Zhang, Qixun;Li, Wei;Gulliver, T. Aaron
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.227-237
    • /
    • 2014
  • Throughput scaling laws for two coexisting ad hoc networks with m primary users (PUs) and n secondary users (SUs) randomly distributed in an unit area have been widely studied. Early work showed that the secondary network performs as well as stand-alone networks, namely, the per-node throughput of the secondary networks is ${\Theta}(1/\sqrt{n{\log}n})$. In this paper, we show that by exploiting directional spectrum opportunities in secondary network, the throughput of secondary network can be improved. If the beamwidth of secondary transmitter (TX)'s main lobe is ${\delta}=o(1/{\log}n)$, SUs can achieve a per-node throughput of ${\Theta}(1/\sqrt{n{\log}n})$ for directional transmission and omni reception (DTOR), which is ${\Theta}({\log}n)$ times higher than the throughput with-out directional transmission. On the contrary, if ${\delta}={\omega}(1/{\log}n)$, the throughput gain of SUs is $2{\pi}/{\delta}$ for DTOR compared with the throughput without directional antennas. Similarly, we have derived the throughput for other cases of directional transmission. The connectivity is another critical metric to evaluate the performance of random ad hoc networks. The relation between the number of SUs n and the number of PUs m is assumed to be $n=m^{\beta}$. We show that with the HDP-VDP routing scheme, which is widely employed in the analysis of throughput scaling laws of ad hoc networks, the connectivity of a single SU can be guaranteed when ${\beta}$ > 1, and the connectivity of a single secondary path can be guaranteed when ${\beta}$ > 2. While circumventing routing can improve the connectivity of cognitive radio ad hoc network, we verify that the connectivity of a single SU as well as a single secondary path can be guaranteed when ${\beta}$ > 1. Thus, to achieve the connectivity of secondary networks, the density of SUs should be (asymptotically) bigger than that of PUs.