Star-Structure Network Coding for Multiple Unicast Sessions in Wireless Mesh Networks

Shafieinejad, Alireza; Hendessi, Faramarz; Fekri, Faramarz

doi:10.1007/s11277-013-1143-7

Cited by 6 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Where ASN represents the total number of time slots from the beginning of the TSCH network, ASN = (k*s+t s ), k is the time slot period, s is the time slot frame size, t s representing the time slot. (Where 0≤t s ≤ s − 1, 0 ≤ CH offset ≤ | | HS | |) where the IEEE 802.15.4e network running at the 2.4 GHz has a total of 16 (11)(12)(13)(14)(15)(16)(17)(18)(19)(20)(21)(22)(23)(24)(25)(26) channels.…”

Section: Channel Selectionmentioning

confidence: 99%

“…Without considering the influence of other nodes, given any node, the probability of channel idle is 1-a /(MN). A typical K = 6 star topology network [15], because of the state of channel multiplexing, when a channel is used by a node, it is set that adjacent K−1 nodes will disable the channel. This typical value will be adopted in the subsequent research of this paper.…”

Section: Performance Analysis Of Hcamentioning

confidence: 99%

“…The fourth line of the algorithm divides the dynamic and static channels. Lines 6-10 show that when the amount of information is less than a certain value, the information between nodes is transferred in the dynamic channel, and lines [12][13][14][15][16] show that when the amount of information between nodes is greater than a certain value, it is transferred in the static channel. Line 17 shows the division of dynamic and static channel proportion.…”

Section: Ahca Algorithm Mechanismmentioning

confidence: 99%

See 2 more Smart Citations

An improved fast transform algorithm based on adaptive hybrid channel allocation in TSCH networks

Zhu

et al. 2020

J Wireless Com Network

View full text Add to dashboard Cite

Time Slotted Channel Hopping (TSCH) is one of the five access behavior technologies defined in the IEEE 802.15.4e standard. Research shows that the wireless sensor network with single dynamic and static channel allocation in TSCH mode has higher performance. The clogging rate results in unnecessary energy waste. Therefore, this paper proposes an adaptive hybrid channel allocation strategy (AHCA) to measure the link quality change of wireless sensor networks in TSCH mode. The strategy estimates the part of the channel quality and determines whether the node wants to transmit on this channel and the optimal channel for node information transmission. According to the change of the amount of information transmitted, the hybrid channel allocation scheme of the dynamic and static channel ratio is adaptively adjusted to reduce the energy consumption of the information transmission process. This article performs experimental simulation on Contiki-NG. The experimental results show that the proposed scheme has shorter transmission time and lower congestion rate than the single dynamic static channel allocation wireless sensor network. The more reasonable and effective measurement, analysis and use of channel resources can fundamentally increase the amount of information transfer in wireless sensor networks per unit time, and thus extend the lifetime of wireless sensor networks.

show abstract

Section: Channel Selectionmentioning

confidence: 99%

Section: Performance Analysis Of Hcamentioning

confidence: 99%

Section: Ahca Algorithm Mechanismmentioning

confidence: 99%

See 1 more Smart Citation

An improved fast transform algorithm based on adaptive hybrid channel allocation in TSCH networks

Zhu

et al. 2020

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…In real world, we can find a class of regular networks [17][18][19], which is constructed like a path network, and each component looks like a star, circle, or clique. In order to carry out our research, we must construct some networks with such characteristics.…”

Section: Construction Of the Extended-path Networkmentioning

confidence: 99%

The Exact Controllability of the Molecular Graph Networks

Wei

Zhao

et al. 2019

Journal of Chemistry

View full text Add to dashboard Cite

In this paper, we mainly study the exact controllability of several types of extended-path molecular graph networks. Based on the construction of extended-path molecular graph networks with C 3 , C 4 , or K 4 , using the determinant operation of the matrix and the recursive method, the exact characteristic polynomial of these networks is deduced. According to the definition of minimum driver node number N D , the exact controllability of these networks is obtained. Moreover, we give the minimum driver node sets of partial small networks.

show abstract

“…It's shown that the exact controllability theory is more powerful than structural controllability. There is a class of regular star networks, which have been found in many fields [24][25][26]. In this paper, we explore the exact controllability of these networks.…”

Section: Introductionmentioning

confidence: 99%

Exact controllability of a star-type network

Zhou

Yuan

et al. 2015

The 27th Chinese Control and Decision Conference (2015 CCDC)

View full text Add to dashboard Cite

Star networks are very popular in network science, ranging from mathematical networks to computer networks. The ultimate goal of exploring these star network systems lies in controlling the dynamical processes. In this paper, we construct a star-type network and give its characteristic polynomial, which directly expresses the exact controllability of this complex network. Our results have an effect on the controllability of such systems in reality that have star feature.

show abstract

Star-Structure Network Coding for Multiple Unicast Sessions in Wireless Mesh Networks

Cited by 6 publications

References 15 publications

An improved fast transform algorithm based on adaptive hybrid channel allocation in TSCH networks

An improved fast transform algorithm based on adaptive hybrid channel allocation in TSCH networks

The Exact Controllability of the Molecular Graph Networks

Exact controllability of a star-type network

Contact Info

Product

Resources

About