Link availability modeling for routing algorithms to reduce the link break time in MANETs

2011 ◽  
Author(s):  
Ming Yu ◽  
Wei Liu ◽  
Tian Xing
Keyword(s):  
Routing Algorithms ◽  
Break Time ◽  
Availability Modeling ◽  
Link Availability

scholarly journals A Combined Modified OpportunisticNeighbor Selection and Vehicle Localization Routing Approach for Improved Connectivity in Indian Road Scenario

2018 ◽  
Vol 7 (3.16) ◽  
pp. 52
Author(s):  
Jothy. N ◽  
Jayanthi. K ◽  
Gunasundari. R
Keyword(s):  
High Mobility ◽  
Routing Algorithms ◽  
Link Quality ◽  
Delivery Ratio ◽  
Network Partitioning ◽  
Vehicle Localization ◽  
End To End Delay ◽  
End To End ◽  
Neighbor Selection ◽  
Link Availability

In the recent years, VANET is becoming a spectacular research area in wireless networks. The high mobility vehicular node in VANET dynamically changes the network topology resulting in highly unstable vehicle connectivity. This induces network partitioning and hence ensuring link availability remains to be a challenging task.  To surpass these issues, design of efficient VANET routing algorithms is necessary. The routing design for VANET scenario is highly complex and challenging making the existing AODV, greedy, cluster based routing algorithms to suffer from degraded link quality resulting in high end-to-end delay and significant packet loss. Although Opportunistic Neighbor Selection (ONS) scheme proves to be a better routing logic, it does not seem to always ensure link availability at road intersections, particularly in Indian road scenario, where multi road lane discipline is very hard to implement. To overcome these limitations, a combination of Modified Opportunistic Neighbor Selection (MONS) and Vehicle Localization (VL) routing logic for adoption in Indian road sector has been proposed in this paper. This paper addresses the connectivity challenges and provides better solution to achieve improved performance. In this work, two specific scenarios namely: varied mobility/node density rates is considered by treating the other fixed inorder to evaluate the suitability of the proposed logic in terms of packet delivery ratio, end-to-end delay.  

Perencanaan Pengendalian Kualitas Produk Pakaian Bayi dengan Metode Six Sigma Pada CV. AGP

JEMAP ◽  
2020 ◽  
Vol 3 (1) ◽  
Author(s):  
Albertus Reynaldo Kurniawan ◽  
Bayu Prestianto
Keyword(s):  
Quality Control ◽  
Continuous Improvement ◽  
Six Sigma ◽  
Screen Printing ◽  
Control Method ◽  
Operational Performance ◽  
Machine Maintenance ◽  
Quality Product ◽  
Break Time ◽  
And Control

Quality control becomes an important key for companies in suppressing the number of defective produced products. Six Sigma is a quality control method that aims to minimize defective products to the lowest point or achieve operational performance with a sigma value of 6 with only yielding 3.4 defective products of 1 million product. Stages of Six Sigma method starts from the DMAIC (Define, Measure, Analyze, Improve and Control) stages that help the company in improving quality and continuous improvement. Based on the results of research on baby clothes products, data in March 2018 the percentage of defective products produced reached 1.4% exceeding 1% tolerance limit, with a Sigma value of 4.14 meaning a possible defect product of 4033.39 opportunities per million products. In the pareto diagram there were 5 types of CTQ (Critical to Quality) such as oblique obras, blobor screen printing, there is a fabric / head cloth code on the final product, hollow fabric / thin fabric fiber, and dirty cloth. The factors caused quality problems such as Manpower, Materials, Environtment, and Machine. Suggestion for consideration of company improvement was continuous improvement on every existing quality problem like in Manpower factor namely improving comprehension, awareness of employees in producing quality product and improve employee's accuracy, Strength Quality Control and give break time. Materials by making the method of cutting the fabric head, the Machine by scheduling machine maintenance and the provision of needle containers at each employees desk sewing and better environtment by installing exhaust fan and renovating the production room.

SATCOM system control concepts for increased link availability

1974 ◽  
Author(s):  
A. INCE ◽  
D. BROWN ◽  
J. MIDGLEY
Keyword(s):  
System Control ◽  
Link Availability

Data Object Routing Algorithms for Data Aware Networking

2019 ◽  
Vol 7 (4) ◽  
pp. 644-646
Author(s):  
O.Koteswara Rao ◽  
Y K Sundara Krishna ◽  
G K Mohan Devarakonda
Keyword(s):  
Routing Algorithms ◽  
Data Object

scholarly journals Opportunistic Network Algorithms for Internet Traffic Offloading in Music Festival Scenarios

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3315
Author(s):  
Aida-Ștefania Manole ◽  
Radu-Ioan Ciobanu ◽  
Ciprian Dobre ◽  
Raluca Purnichescu-Purtan
Keyword(s):  
High Performance ◽  
Geographical Area ◽  
Mobility Model ◽  
Routing Algorithms ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Key Factors ◽  
Network Algorithms ◽  
Music Festival ◽  
Social Metrics

Constant Internet connectivity has become a necessity in our lives. Hence, music festival organizers allocate part of their budget for temporary Wi-Fi equipment in order to sustain the high network traffic generated in such a small geographical area, but this naturally leads to high costs that need to be decreased. Thus, in this paper, we propose a solution that can help offload some of that traffic to an opportunistic network created with the attendees’ smartphones, therefore minimizing the costs of the temporary network infrastructure. Using a music festival-based mobility model that we propose and analyze, we introduce two routing algorithms which can enable end-to-end message delivery between participants. The key factors for high performance are social metrics and limiting the number of message copies at any given time. We show that the proposed solutions are able to offer high delivery rates and low delivery delays for various scenarios at a music festival.

scholarly journals Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks

2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Geographic Routing ◽  
Routing Algorithms ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Effective Manner

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.

Sign in / Sign up

Export Citation Format

Share Document