Distally-extending muscle fibers across involved joints: study of long muscles and tendons of wrist and ankle in late-term fetuses and adult cadavers

Shaohe Wang(Shaohe Wang),Shogo Hayashi(Shogo Hayashi ),Zhe-Wu Jin(Zhe-Wu Jin),Ji Hyun Kim(Ji Hyun Kim),Masahito Yamamoto(Masahito Yamamoto ),Gen Murakami(Gen Murakami ),Shinichi Abe(Shinichi Abe ) 대한해부학회 2023 Anatomy & Cell Biology Vol.56 No.1

It is unclear whether forearm and crural muscle fibers extend distally across the wrist and ankle joints, respectively. We hypothesized, in late-term fetuses, an over-production of muscle bellies extending over the joint. Muscle fibers in histological sections from unilateral wrists and ankles of 16 late-term fetuses (30–40 weeks) were examined and compared with 15 adult cadavers. Muscle fibers of the flexor digitorum profundus (FDP) and flexor digitorum superficialis (FDS) in fetuses, especially muscle bellies to the third and fourth fingers, were found to extend far distally beyond the radiocarpal joint. The extensor digitorum and extensor pollicis longus on the extensor side of the wrist were found to carry distally-extending muscle fibers, but these fibers did not extend beyond the distal end of the radius. In the ankle, most muscle bundles in the flexor hallucis longus (FHL), fibularis brevis (FB) and extensor digitorum longus extended distally beyond the talocrural joint, with most FB muscle fibers reaching the level of the talocalcaneal joint. In adult cadavers, muscle fibers of the FDP and FHL did not reach the levels of the radiocarpal and talocrural joints, respectively, whereas the FB muscle belly always reached the talocalcaneal joint. Similarly, some of the FDS reached the level of the radiocarpal joint. Generally, infants’ movements at the wrist and ankle could result in friction injury to over-extended muscle. However, the calcaneal and FDP tendons might protect the FB and FDS tendons, respectively, from friction stress.

Frequency-Code Domain Contention in Multi-antenna Multicarrier Wireless Networks

Shaohe Lv,Yiwei Zhang,Wen Li,Yong Lu,Xuan Dong,Xiaodong Wang,Xingming Zhou 한국통신학회 2016 Journal of communications and networks Vol.18 No.2

Coordination among users is an inevitable but timeconsumingoperation in wireless networks. It severely limit thesystem performance when the data rate is high. We present FCMAC,a novel MAC protocol that can complete a contention withinone contention slot over a joint frequency-code domain. When anode takes part in the contention, it generates randomly a contentionvector (CV), which is a binary sequence of length equalto the number of available orthogonal frequency division multiplexing(OFDM) subcarriers. In FC-MAC, different user is assignedwith a distinct signature (i.e., PN sequence). A node sendsthe signature at specific subcarriers and uses the sequence of theON/OFF states of all subcarriers to indicate the chosen CV. Meanwhile,every node uses the redundant antennas to detect the CVsof other nodes. The node with the minimum CV becomes the winner. The experimental results show that, the collision probabilityof FC-MAC is as low as 0.05% when the network has 100 nodes. In comparison with IEEE 802.11, contention time is reduced by50–80% and the throughput gain is up to 200%.

Frequency-Code Domain Contention in Multi-antenna Multicarrier Wireless Networks

Lv, Shaohe,Zhang, Yiwei,Li, Wen,Lu, Yong,Dong, Xuan,Wang, Xiaodong,Zhou, Xingming The Korea Institute of Information and Commucation 2016 Journal of communications and networks Vol.18 No.2

Coordination among users is an inevitable but time-consuming operation in wireless networks. It severely limit the system performance when the data rate is high. We present FC-MAC, a novel MAC protocol that can complete a contention within one contention slot over a joint frequency-code domain. When a node takes part in the contention, it generates randomly a contention vector (CV), which is a binary sequence of length equal to the number of available orthogonal frequency division multiplexing (OFDM) subcarriers. In FC-MAC, different user is assigned with a distinct signature (i.e., PN sequence). A node sends the signature at specific subcarriers and uses the sequence of the ON/OFF states of all subcarriers to indicate the chosen CV. Meanwhile, every node uses the redundant antennas to detect the CVs of other nodes. The node with the minimum CV becomes the winner. The experimental results show that, the collision probability of FC-MAC is as low as 0.05% when the network has 100 nodes. In comparison with IEEE 802.11, contention time is reduced by 50-80% and the throughput gain is up to 200%.

Energy-efficient Routing in MIMO-based Mobile Ad hoc Networks with Multiplexing and Diversity Gains

( Hu Shen ),( Shaohe Lv ),( Xiaodong Wang ),( Xingming Zhou ) 한국인터넷정보학회 2015 KSII Transactions on Internet and Information Syst Vol.9 No.2

It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%.

Distributed Collision-Resolvable Medium Access Control for Wireless LANs with Interference Cancellation Support

( Hu Shen ),( Shaohe Lv ),( Xiaodong Wang ),( Xingming Zhou ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.8

Medium access control is critical in wireless networks for efficient spectrum utilization. In this paper, we introduce a novel collision resolution method based on the technique of known interference cancellation, and propose a new MAC protocol named as CR-MAC, in which AP tries to decode all the collided data packets by combining partial retransmissions and known interference cancellation. As the collided transmissions are fully utilized, less retransmission is required, especially in a crowded network. The NS-2simulation and MATLAB numerical results show that, under various network settings, CR-MAC performs much better than the IEEE 802.11 DCF in terms of the aggregation throughput and the expected packet delay.

A Genetic Approach for Joint Link Scheduling and Power Control in SIC-enable Wireless Networks

( Xiaodong Wang ),( Hu Shen ),( Shaohe Lv ),( Xingming Zhou ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.4

Successive interference cancellation (SIC) is an effective means of multi-packet reception to combat interference at the physical layer. We investigate the joint optimization issue of channel access and power control for capacity maximization in SIC-enabled wireless networks. We propose a new interference model to characterize the sequential detection nature of SIC. Afterward, we formulize the joint optimization problem, prove it to be a nondeterministic polynomial-time-hard problem, and propose a novel approximation approach based on the genetic algorithm (GA). Finally, we discuss the design and parameter setting of the GA approach and validate its performance through extensive simulations.

DMRUT-MCDS: Discovery Relationships in the Cyber-Physical Integrated Network

Hongliang Lu,지아농챠오,Weiping Zhu,Xianlong Jiao,Shaohe Lv,Xiaodong Wang 한국통신학회 2015 Journal of communications and networks Vol.17 No.6

In recent years, we have seen a proliferation of mobilenetwork- enabled smart objects, such as smart-phones and smartwatches, that form a cyber-physical integrated network to connect the cyber and physical worlds through the capabilities of sensing, communicating, and computing. Discovery of the relationship between smart objects is a critical and nontrivial task in cyber-physical integrated network applications. Aiming to find the most stable relationship in the heterogeneous and dynamic cyber-physical network, we propose a distributed and efficient relationship-discovery algorithm, called dynamically maximizing remaining unchanged time with minimum connected dominant set (DMRUT-MCDS) for constructing a backbone with the smallest scale infrastructure. In our proposed algorithm, the impact of the duration of the relationship is considered in order to balance the size and sustain time of the infrastructure. The performance of our algorithm is studied through extensive simulations and the results show that DMRUT-MCDS performs well in different distribution networks.

Cooperative Control Feedback: On Backoff Misbehavior of CSMA/CA MAC in Channel-Hopping Cognitive Radio Networks

Quan Liu,Yong Lu,Gang Hu,Shaohe Lv,Xiaodong Wang,Xingming Zhou 한국통신학회 2018 Journal of communications and networks Vol.20 No.6

Due to dynamic channel availability in cognitive radionetworks (CRNs), rendezvous problem is known as the mostchallenging issue in the design of media access control (MAC)protocol, which is a key step for secondary users (SUs) to startcommunication. With the concept of blind rendezvous, numerouschannel-hopping sequence (CHS) based rendezvous schemeshave been proposed to solve this problem in these years. Currently,little attention is paid to the design of a carrier sensing multipleaccess/collision avoidance (CSMA/CA) MAC based on theserendezvous schemes and also the rendezvous de-synchronizationproblem brought by multiple rendezvous networking paradigminto MAC design. To this end, we propose a cooperative channelhoppingbased CSMA/CA MAC (named CoCH-CSMA/CA MAC)which works on the top of existing CHS based rendezvous schemes. Resulting from the rendezvous de-synchronization problem, a newtype of collision, named false collision, is identified. As a SU cannotdiscern the false collision by itself, we design a cooperative controlfeedback scheme which employs correlation-based signal detectionto reduce the coordination overhead of cooperation and helps SUsto avoid backoff misbehavior. Moreover, we analyze the behavior ofour MAC protocol and its advantage. Extensive simulations provethat the cooperative control feedback scheme can effectively alleviatethe impact of rendezvous de-synchronization problem on backoffmisbehavior and improve network performance.