Evaluation of Low Intensity Laser Therapy In Myofascial Pain Syndrome

Limited studies have demonstrated that low intensity laser therapy (LILT) may have a therapeutic effect on the treatment of myofascial pain syndrome (MPS). Sixty (60) patients with MPS and having one active trigger point in the anterior masseter and anterior temporal muscles were selected and assigned randomly to six groups (n=10): Groups I to III were treated with GaAIAS (780 nm) laser, applied in continuous mode and in a meticulous way, twice a week, for four weeks. Energy was set to 25 J/cm(2), 60 J/cm2 and 105 J/cm2, respectively. Groups IV to VI were treated with placebo applications, simulating the same parameters as the treated groups. Pain scores were assessed just before, then immediately after the fourth application, immediately after the eighth application, at 15 days and one month following treatment. A significant pain reduction was observed over time (p<0.001). The analgesic effect of the LILT was similar to the placebo groups. Using the parameters described in this experiment, LILT was effective in reducing pain experienced by patients with myofascial pain syndrome. Thus, it was not possible to establish a treatment protocol. Analyzing the analgesic effect of LILT suggests it as a possible treatment of MPS and may help to establish a clinical protocol for this therapeutic modality.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.