Performance Evaluation of Intercluster Multi-hop Communication Large-Scale Sensor Networks

Yuichi, Kiri; Sugano, Masashi; Murata, Masayuki

doi:10.1109/cit.2006.145

Cited by 6 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is obvious that increasing the number of sensor nodes in the network makes more complicated the network. Due to the advantages mentioned above, the multi-hop network structure is preferred as a connection form for large-scale WSN applications (Kiri et al, 2006). An example of a multi-hop WSN structure is shown in Figure 1.…”

Section: Introductionmentioning

confidence: 99%

Effect of Relay-Priority Mechanism on Multi-hop Wireless Sensor Networks

Ari¹,

Çıbuk²,

Aggun³

2017

Bitlis Eren University Journal of Science and Technology

View full text Add to dashboard Cite

In multi-hop Wireless Sensor Networks (WSN), sensor nodes which cannot communicate directly with the Coordinator Node(CN) can communicate with CN thanks to the other joined sensor nodes. The multi-hop WSN structure is preferred for large-scale WSNs and that consist of multiple sensor and CN. As in the networks sensor node count increase, hop count increase as well. Because of this, end-to-end delay increases. Unless it is taken prevention, end-to-end delays reach a level that negatively effects on network performance in multi-hop WSN. In this study, for multi-hop WSNs, it is aimed to design a new a relay-priority mechanism which will reduce the end-to-end delay. This is a method that will reach the CN with a minimum hop count while joining the node. Thanks to the minimum hop, end-to-end delay is reduced. Performance analysis of this study was done in Riverbed (OPNET) Modeler simulation environment.

show abstract

Section: Introductionmentioning

confidence: 99%

Effect of Relay-Priority Mechanism on Multi-hop Wireless Sensor Networks

Ari¹,

Çıbuk²,

Aggun³

2017

Bitlis Eren University Journal of Science and Technology

View full text Add to dashboard Cite

show abstract

“…Furthermore, retransmitting packets additionally consumes the limited battery power of sensor nodes. Kiri et al (2006) study multi-hop sensor networks, where two or more wireless hops are used to convey information from a source to a destination. They investigate the characteristics of sensor networks by comparing TDMA (time division multiple access) with CSMA/CA (carrier sense multiple access with collision avoidance).…”

Section: Introductionmentioning

confidence: 99%

TDMA scheduling problem avoiding interference in multi-hop wireless sensor networks

Sasaki

Furuta

Ukai

et al. 2016

JAMDSM

View full text Add to dashboard Cite

In this paper, we consider a multi-hop sensor network, where the network topology is a tree, TDMA (time division multiple access) is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node (the base station) located on the root of the tree through the network. It is reported that if a transmission schedule that avoids interference between sensor nodes completely can be computed, TDMA is preferable to CSMA/CA (carrier sense multiple access with collision avoidance) in performance. In general, the TDMA scheduling problem to find the shortest schedule is formulated as a combinatorial optimization problem, where each combination corresponds to a schedule. However, solving such a combinatorial optimization problem is difficult, especially for large-scale multi-hop sensor networks. The reason of the difficulty is that the number of the combinations increases exponentially with the increase of the number of nodes. In this paper, to formulate the TDMA scheduling problem, we propose a min-max model and a min-sum model. The min-max model yields the shortest schedule, but it is difficult to solve large-scale problems. The min-sum model does not guarantee providing the shortest schedule; however, it may give us good schedules over a short amount of computation time, compared to the min-max model. Numerical examples show that the min-sum model can provide good schedules in a reasonable CPU time, even when the min-max model fails to compute the shortest schedule in a reasonable CPU time.

show abstract

Computational Method Using Quantum Annealing for TDMA Scheduling Problem in Wireless Sensor Networks

Ishizaki¹

2019

2019 13th International Conference on Signal Processing and Communication Systems (ICSPCS)

View full text Add to dashboard Cite

Performance Evaluation of Intercluster Multi-hop Communication Large-Scale Sensor Networks

Cited by 6 publications

References 6 publications

Effect of Relay-Priority Mechanism on Multi-hop Wireless Sensor Networks

Effect of Relay-Priority Mechanism on Multi-hop Wireless Sensor Networks

TDMA scheduling problem avoiding interference in multi-hop wireless sensor networks

Computational Method Using Quantum Annealing for TDMA Scheduling Problem in Wireless Sensor Networks

Contact Info

Product

Resources

About