Networking Articles Overview
0 likes161 views
- The first article proposes a new packet length optimization technique called DPLC for wireless sensor networks. DPLC dynamically adjusts packet lengths depending on distance and power to improve energy efficiency. It describes the DPLC design and evaluates its performance through testing. - The second article describes MT-Deluge, a multithreaded design for efficient information dissemination in wireless sensor networks. It separates coding and radio operations into different threads to allow concurrent processing and reduce dissemination delays. Testing shows MT-Deluge improves energy efficiency over existing approaches. - The third article discusses issues with the existing FlexRay automotive communication protocol. It proposes a cooperative scheduling scheme called CoEfficient to address problems like data loss and delays. CoEfficient
Networking Articles Overview
- 1. Articles Overview - Dynamic Packet Length Control in Wireless Sensor Networks : This article proposes new packet length optimization technique for wireless networks through automatically setting parameters depending on the distance and power level. It describes DPLC design for receiver and sender using fragmentation or aggregation technique. DPLC monitors outgoing packets and sets granularity in order to dynamically change packet length. I analysis section of the article authors analyze energy efficiency of the DPLC and proposes way to improve its energy consumption by minimizing duty cycle with on a packet length at the link from node n to its parent. Also article proposes ways to improve DPLC’s convergence time. In the final part paper provides implantation of DPLC by showing programming interfaces. Then evaluates testing results by comparative study on the performances of different schemes integrated with CTP in order to validate the DPLC algorithm, it's energy efficiency and reliability. - Exploiting Concurrency for Efficient Dissemination in Wireless Sensor Networks : This article describes MT-Deluge as new multithreaded design for efficient dissemination in sensor networks. MT-Deluge separates coding operations and radio operations to different threads , also it reduces dissemination delay. MT Deluge is based on Rateless Deluge.. Article provides two examples of network node architecture - sequential and parallel, explains existing ways to send packet in this node structure.Paper explins exiting single-threaded node design where receiver(RX) and transmitter (TX) can can only one receive or transmit one page at a time . Multithreaded design (used by MT- Deluge) on the other hand have separate threads for computation operations (for encode/decoding) and for radio operations (to transmit page) and they can work concurrently, this also improves energy efficiency by 49%. . One of the problems with multithreaded architecture is radio thread have to wait while computing thread decode/encode packet. MT Deluge partially solves this issue by introducing incremental decoding algorithm. Using testing set, it was experimentally determine that MT- Deluge radio and computation thread run concurrently 75% of
- 2. operation time. The minimum number of packet that have to be received before decoding starts is 2 and so the maximum run time of concurrent threads is the 82.3%(for multiloop line topology). For Grid network topology MT - Deluge have less relative delay reduction and works better then Rateless Deluge. MT Deluge is more energy efficient than Rateless Deluge (~31%) expensively when the power level is very high. - Cooperative and Efficient Real-Time Scheduling for Automotive Communications: The article introduces FelxRay as existing network communication protocol used in automobiles and discusses main issues that this protocol have due to radiation, interferences and temperature changes. Two main problems with FlexRay protocol are : separate scheduling winch can result in data loss and performance issues, another one is reliability problem which cause delays for real-time data transmission. CoEfficient scheduling scheme for FlexRay is proposed to address above mentioned issues . FlexRay uses two types of messages for real-time systems - time- and event- triggered besides it uses both static and dynamic segments to send messages. FlexRay have scheduling tables which it uses for sending dynamic messages in priority queue and stores static messages in the associated buffer in the CHI. Transmission of dynamic messages can be classified as soft aperiodic tasks and retransmission as hard aperiodic task .FLexRay classifies task based on their priority, it computes maximum amounts of slacks available for aperiodic processing at a set level of priority. and adds it to the system. CoEfficient used in FlexRay for reliability purposes as it is used to select frames to be retransmitted based on transmission probability that satisfies defined probability equation. Also CoEfficient helps to facilitate execution of specific task by determining probability when specific task can be expected to be executed. Compared to standard FelxRay implementation CoEfficient has better run-time as it has reduced latency , besides it has better bandwidth usage ~50% increase ( when using 25 or 50 or 75 or 100 minislots for dynamic messages) and CoEfficent wins from 2 to 5 milliseconds of transmission latency .