اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Lesson in Scaling 6LoWPAN -- Minimal Fragment Forwarding in Lossy Networks
110
0
0.0
(
0
)
نشر من قبل
Martine Sophie Lenders
تاريخ النشر
2019
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper evaluates two forwarding strategies for fragmented datagrams in the IoT: hop-wise reassembly and a minimal approach to directly forward fragments. Minimal fragment forwarding is challenged by the lack of forwarding information at subsequent fragments in 6LoWPAN and thus requires additional data at nodes. We compared the two approaches in extensive experiments evaluating reliability, end-to-end latency, and memory consumption. In contrast to previous work and due to our alternate setup, we obtained different results and conclusions. Our findings indicate that direct fragment forwarding should be deployed only with care, since higher packet transmission rates on the link-layer can significantly reduce its reliability, which in turn can even further reduce end-to-end latency because of highly increased link-layer retransmissions.
قيم البحث
اقرأ أيضاً
LoRaWAN is one of the leading Low Power Wide Area Network (LPWAN) architectures. It was originally designed for systems consisting of static sensor or Internet of Things (IoT) devices and static gateways. It was recently updated to introduce new feat
ures such as nano-second timestamps which open up applications to enable LoRaWAN to be adopted for mobile device tracking and localisation. In such mobile scenarios, devices could temporarily lose communication with the gateways because of interference from obstacles or deep fading, causing throughput reduction and delays in data transmission. To overcome this problem, we propose a new data forwarding scheme. Instead of holding the data until the next contact with gateways, devices can forward their data to nearby devices that have a higher probability of being in contact with gateways. We propose a new network metric called Real-Time Contact-Aware Expected Transmission Count (RCA-ETX) to model this contact probability in real-time. Without making any assumption on mobility models, this metric exploits data transmission delays to model complex device mobility. We also extend RCA-ETX with a throughput-optimal stochastic backpressure routing scheme and propose Real-Time Opportunistic Backpressure Collection (ROBC), a protocol to counter the stochastic behaviours resulting from the dynamics associated with mobility. To apply our approaches seamlessly to LoRaWAN-enabled devices, we further propose two new LaRaWAN classes, namely Modified Class-C and Queue-based Class-A. Both of them are compatible with LoRaWAN Class-A devices. Our data-driven experiments, based on the London bus network, show that our approaches can reduce data transmission delays up to $25%$ and provide a $53%$ throughput improvement in data transfer performance.
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topolog
y and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a reliable greedy position based routing approach to forward packets to the node present in the edge of the transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that packet delivery ratio is improved considerably compared to other routing techniques of VANET.
In the paradigm of mobile Ad hoc networks (MANET), forwarding packets originating from other nodes requires cooperation among nodes. However, as each node may not want to waste its energy, cooperative behavior can not be guaranteed. Therefore, it is
necessary to implement some mechanism to avoid selfish behavior and to promote cooperation. In this paper, we propose a simple quid pro quo based reputation system, i.e., nodes that forward gain reputation, but lose more reputation if they do not forward packets from cooperative users (determined based on reputation), and lose less reputation when they chose to not forward packets from non-cooperative users. Under this framework, we model the behavior of users as an evolutionary game and provide conditions that result in cooperative behavior by studying the evolutionary stable states of the proposed game. Numerical analysis is provided to study the resulting equilibria and to illustrate how the proposed model performs compared to traditional models.
Routing in NDN networks must scale in terms of forwarding table size and routing protocol overhead. Hyperbolic routing (HR) presents a potential solution to address the routing scalability problem, because it does not use traditional forwarding table
s or exchange routing updates upon changes in network topologies. Although HR has the drawbacks of producing sub-optimal routes or local minima for some destinations, these issues can be mitigated by NDNs intelligent data forwarding plane. However, HRs viability still depends on both the quality of the routes HR provides and the overhead incurred at the forwarding plane due to HRs sub-optimal behavior. We designed a new forwarding strategy called Adaptive Smoothed RTT-based Forwarding (ASF) to mitigate HRs sub-optimal path selection. This paper describes our experimental investigation into the packet delivery delay and overhead under HR as compared with Named-Data Link State Routing (NLSR), which calculates shortest paths. We run emulation experiments using various topologies with different failure scenarios, probing intervals, and maximum number of next hops for a name prefix. Our results show that HRs delay stretch has a median close to 1 and a 95th-percentile around or below 2, which does not grow with the network size. HRs message overhead in dynamic topologies is nearly independent of the network size, while NLSRs overhead grows polynomially at least. These results suggest that HR offers a more scalable routing solution with little impact on the optimality of routing paths.
With the increasing adoption of intelligent transportation systems and the upcoming era of autonomous vehicles, vehicular services (such as, remote driving, cooperative awareness, and hazard warning) will face an ever changing and dynamic environment
. Traffic flows on the roads is a critical condition for these services and, therefore, it is of paramount importance to forecast how they will evolve over time. By knowing future events (such as, traffic jams), vehicular services can be dimensioned in an on-demand fashion in order to minimize Service Level Agreements (SLAs) violations, thus reducing the chances of car accidents. This research departs from an evaluation of traditional time-series techniques with recent Machine Learning (ML)-based solutions to forecast traffic flows in the roads of Torino (Italy). Given the accuracy of the selected forecasting techniques, a forecast-based scaling algorithm is proposed and evaluated over a set of dimensioning experiments of three distinct vehicular services with strict latency requirements. Results show that the proposed scaling algorithm enables resource savings of up to a 5% at the cost of incurring in an increase of less than 0.4% of latency violations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
