End-to-End Asynchronous Optical Packet Transmission, Scheduling, and Buffering

Author(s):  
John P. Mack ◽  
John M. Garcia ◽  
Henrik N. Poulsen ◽  
Emily F. Burmeister ◽  
Biljana Stamenic ◽  
...  
2019 ◽  
Vol 89 ◽  
pp. 236-248 ◽  
Author(s):  
Antonio Capone ◽  
Yuan Li ◽  
Michał Pióro ◽  
Di Yuan

In today’s worlds, Mobile Ad-Hoc Network (MANET) plays most important role in the field networks technology in the world. The MANET has been rapidly rising and becoming significant from the last decade. A MANET is a kind of wireless network which has been set-up without requirement of fixed infrastructure where mobile nodes are connected over wireless link. Due to moving nature of the devices, the network topology is unstable and will change dynamically. That’s why stable routing in MANET cannot work properly. In this research paper, a new routing algorithm is proposed to get better routing performance in the MANET. The proposed algorithm designed based on the number of neighbors in the network. Planned algorithm is the improvement of GBR-CNR-LN (GBR-CNR with less neighbors) by calculating the stay time between the selected neighbor nodes and the transmission nodes. If the stay time of sender node is more than the packet transmission time then the selected node is the efficient neighbor selection. The algorithm is implemented and results are analyzed. The results of this paper show the usefulness of the proposed algorithm. The Evaluation of AODV protocol was carried out using Python and outcome of this evaluation showed that proposed Algorithm gave better results than GBR-CNR with less neighbor in terms of End-to-End delay, Number of control message transferred(Routing Overhead) and Network Load. The proposed Algorithm (GC-ENS) decrease Average End-to-End delay 52.54 %, reduce Average Routing Overhead 60.54% and decline the Average load on Network 61.17%.


Sensors ◽  
2019 ◽  
Vol 19 (21) ◽  
pp. 4821 ◽  
Author(s):  
Yating Gao ◽  
Guixia Kang ◽  
Jianming Cheng

Cooperative routing, combining cooperative communication in the physical layer and routing technology in the network layer, is one of the most widely used technologies for improving end-to-end transmission reliability and delay in the wireless multi-hop networks. However, the existing cooperative routing schemes are designed based on an optimal fixed-path routing so that the end-to-end performance is greatly restricted by the low spatial efficiency. To address this problem, in this paper an opportunistic cooperative packet transmission (OCPT) scheme is explored by combining cooperative communication and opportunistic routing. The proposed scheme divides the multi-hop route into multiple virtual multiple-input-multiple-output (MIMO) transmissions. Before each transmission, based on the idea of opportunistic routing, a cluster head (CH) is introduced to determine the multiple transmitters and multiple receivers to form a cluster. Then, the single-hop transmission distance is defined as the metric of forward progress to the destination. Each intra-cluster cooperative packet transmission is formulated as a transmit beamforming optimization problem, and an iterative optimal beamforming policy is proposed to solve the problem and maximize the single-hop transmission distance. CH organizes multiple transmitters to cooperatively transmit packets to multiple receivers with the optimized transmit beamforming vector. Finally, according to the transmission results, the cluster is updated and the new cooperative transmission is started. Iteratively, the transmission lasts until the destination has successfully received the packet. We comprehensively evaluate the OCPT scheme by comparing it with conventional routing schemes. The simulation results demonstrate that the proposed OCPT scheme is effective on shortening the end-to-end transmission delay, increasing the number of successful packet transmissions and improving the packet arrival ratio and transmission efficiency.


Sign in / Sign up

Export Citation Format

Share Document