Search results
1 – 10 of 37Ishita Seth, Kalpna Guleria and Surya Narayan Panda
The internet of vehicles (IoV) communication has recently become a popular research topic in the automotive industry. The growth in the automotive sector has resulted in…
Abstract
Purpose
The internet of vehicles (IoV) communication has recently become a popular research topic in the automotive industry. The growth in the automotive sector has resulted in significant standards and guidelines that have engaged various researchers and companies. In IoV, routing protocols play a significant role in enhancing communication safety for the transportation system. The high mobility of nodes in IoV and inconsistent network coverage in different areas make routing challenging. This paper aims to provide a lane-based advanced forwarding protocol for internet of vehicles (LAFP-IoV) for efficient data distribution in IoV. The proposed protocol’s main feature is that it can identify the destination zone by using position coordinates and broadcasting the packets toward the direction of destination. The novel suppression technique is used in the broadcast method to reduce the network routing overhead.
Design/methodology/approach
The proposed protocol considers the interferences between different road segments, and a novel lane-based forwarding model is presented. The greedy forwarding notion, the broadcasting mechanism, and the suppression approach are used in this protocol to reduce the overhead generated by standard beacon forwarding procedures. The SUMO tool and NS-2 simulator are used for the vehicle's movement pattern and to simulate LAFP-IoV.
Findings
The simulation results show that the proposed LAFP-IoV protocol performs better than its peer protocols. It uses a greedy method for forwarding data packets and a carry-and-forward strategy to recover from the local maximum stage. This protocol's low latency and good PDR make it ideal for congested networks.
Originality/value
The proposed paper provides a unique lane-based forwarding for IoV. The proposed work achieves a higher delivery ratio than its peer protocols. The proposed protocol considers the lanes while forwarding the data packets applicable to the highly dense scenarios.
Details
Keywords
Miao Ye, Lin Qiang Huang, Xiao Li Wang, Yong Wang, Qiu Xiang Jiang and Hong Bing Qiu
A cross-domain intelligent software-defined network (SDN) routing method based on a proposed multiagent deep reinforcement learning (MDRL) method is developed.
Abstract
Purpose
A cross-domain intelligent software-defined network (SDN) routing method based on a proposed multiagent deep reinforcement learning (MDRL) method is developed.
Design/methodology/approach
First, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between the root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to acquire global network state information in real time. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a network traffic state prediction mechanism is designed to improve awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time.
Findings
Experimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput and reduce the network delay and packet loss rate compared to those of the Dijkstra and open shortest path first (OSPF) routing methods.
Originality/value
Message transmission and message synchronization for multicontroller interdomain routing in SDN have long adaptation times and slow convergence speeds, coupled with the shortcomings of traditional interdomain routing methods, such as cumbersome configuration and inflexible acquisition of network state information. These drawbacks make it difficult to obtain global state information about the network, and the optimal routing decision cannot be made in real time, affecting network performance. This paper proposes a cross-domain intelligent SDN routing method based on a proposed MDRL method. First, the network is divided into multiple subdomains managed by multiple local controllers, and the state information of each subdomain is flexibly obtained by the designed SDN multithreaded network measurement mechanism. Then, a cooperative communication module is designed to realize message transmission and message synchronization between root and local controllers, and socket technology is used to ensure the reliability and stability of message transmission between multiple controllers to realize the real-time acquisition of global network state information. Finally, after the optimal intradomain and interdomain routing paths are adaptively generated by the agents in the root and local controllers, a prediction mechanism for the network traffic state is designed to improve awareness of the cross-domain intelligent routing method and enable the generation of the optimal routing paths in the global network in real time. Experimental results show that the proposed cross-domain intelligent routing method can significantly improve the network throughput and reduce the network delay and packet loss rate compared to those of the Dijkstra and OSPF routing methods.
Details
Keywords
Punsara Hettiarachchi, Subodha Dharmapriya and Asela Kumudu Kulatunga
This study aims to minimize the transportation-related cost in distribution while utilizing a heterogeneous fixed fleet to deliver distinct demand at different geographical…
Abstract
Purpose
This study aims to minimize the transportation-related cost in distribution while utilizing a heterogeneous fixed fleet to deliver distinct demand at different geographical locations with a proper workload balancing approach. An increased cost in distribution is a major problem for many companies due to the absence of efficient planning methods to overcome operational challenges in distinct distribution networks. The problem addressed in this study is to minimize the transportation-related cost in distribution while using a heterogeneous fixed fleet to deliver distinct demand at different geographical locations with a proper workload balancing approach which has not gained the adequate attention in the literature.
Design/methodology/approach
This study formulated the transportation problem as a vehicle routing problem with a heterogeneous fixed fleet and workload balancing, which is a combinatorial optimization problem of the NP-hard category. The model was solved using both the simulated annealing and a genetic algorithm (GA) adopting distinct local search operators. A greedy approach has been used in generating an initial solution for both algorithms. The paired t-test has been used in selecting the best algorithm. Through a number of scenarios, the baseline conditions of the problem were further tested investigating the alternative fleet compositions of the heterogeneous fleet. Results were analyzed using analysis of variance (ANOVA) and Hsu’s MCB methods to identify the best scenario.
Findings
The solutions generated by both algorithms were subjected to the t-test, and the results revealed that the GA outperformed in solution quality in planning a heterogeneous fleet for distribution with load balancing. Through a number of scenarios, the baseline conditions of the problem were further tested investigating the alternative fleet utilization with different compositions of the heterogeneous fleet. Results were analyzed using ANOVA and Hsu’s MCB method and found that removing the lowest capacities trucks enhances the average vehicle utilization with reduced travel distance.
Research limitations/implications
The developed model has considered both planning of heterogeneous fleet and the requirement of work load balancing which are very common industry needs, however, have not been addressed adequately either individually or collectively in the literature. The adopted solution methodologies to solve the NP-hard distribution problem consist of metaheuristics, statistical analysis and scenario analysis are another significant contribution. The planning of distribution operations not only addresses operational-level decision, through a scenario analysis, but also strategic-level decision has also been considered.
Originality/value
The planning of distribution operations not only addresses operational-level decisions, but also strategic-level decisions conducting a scenario analysis.
Details
Keywords
Mohammed-Alamine El Houssaini, Abdellah Nabou, Abdelali Hadir, Souad El Houssaini and Jamal El Kafi
Ad hoc mobile networks are commonplace in every aspect of our everyday life. They become essential in many industries and have uses in logistics, science and the military…
Abstract
Purpose
Ad hoc mobile networks are commonplace in every aspect of our everyday life. They become essential in many industries and have uses in logistics, science and the military. However, because they operate mostly in open spaces, they are exposed to a variety of dangers. The purpose of this study is to introduce a novel method for detecting the MAC layer misbehavior.
Design/methodology/approach
The proposed novel approach is based on exponential smoothing for throughput prediction to address this MAC layer misbehavior. The real and expected throughput are processed using an exponential smoothing algorithm to identify this attack, and if these metrics exhibit a trending pattern, an alarm is then sent.
Findings
The effect of the IEEE 802.11 MAC layer misbehavior on throughput was examined using the NS-2 network simulator, as well as the approval of our novel strategy. The authors have found that a smoothing factor value that is near to 0 provides a very accurate throughput forecast that takes into consideration the recent history of the updated values of the real value. As for the smoothing factor values that are near to 1, they are used to identify MAC layer misbehavior.
Originality/value
According to the authors’ modest knowledge, this new scheme has not been proposed in the state of the art for the detection of greedy behavior in mobile ad hoc networks.
Details
Keywords
Mengdi Zhang, Aoxiang Chen, Zhiheng Zhao and George Q. Huang
This research explores mitigating carbon emissions and integrating sustainability in e-commerce logistics by optimizing the multi-depot pollution routing problem with time windows…
Abstract
Purpose
This research explores mitigating carbon emissions and integrating sustainability in e-commerce logistics by optimizing the multi-depot pollution routing problem with time windows (MDPRPTW). A proposed model contrasts non-collaborative and collaborative decision-making for order assignment among logistics service providers (LSPs), incorporating low-carbon considerations.
Design/methodology/approach
The model is substantiated using improved adaptive large neighborhood search (IALNS), tabu search (TS) and oriented ant colony algorithm (OACA) within the context of e-commerce logistics. For model validation, a normal distribution is employed to generate random demand and inputs, derived from the location and requirements files of LSPs.
Findings
This research validates the efficacy of e-commerce logistics optimization and IALNS, TS and OACA algorithms, especially when demand follows a normal distribution. It establishes that cooperation among LSPs can substantially reduce carbon emissions and costs, emphasizing the importance of integrating sustainability in e-commerce logistics optimization.
Research limitations/implications
This paper proposes a meta-heuristic algorithm to solve the NP-hard problem. Methodologies such as reinforcement learning can be investigated in future work.
Practical implications
This research can help logistics managers understand the status of sustainable and cost-effective logistics operations and provide a basis for optimal decision-making.
Originality/value
This paper describes the complexity of the MDPRPTW model, which addresses both carbon emissions and cost reduction. Detailed information about the algorithm, methodology and computational studies is investigated. The research problem encompasses various practical aspects related to routing optimization in e-commerce logistics, aiming for sustainable development.
Details
Keywords
Hiwa Esmaeilzadeh, Alireza Rashidi Komijan, Hamed Kazemipoor, Mohammad Fallah and Reza Tavakkoli-Moghaddam
The proposed model aims to consider the flying hours as a criterion to initiate maintenance operation. Based on this condition, aircraft must be checked before flying hours…
Abstract
Purpose
The proposed model aims to consider the flying hours as a criterion to initiate maintenance operation. Based on this condition, aircraft must be checked before flying hours threshold is met. After receiving maintenance service, the model ignores previous flying hours and the aircraft can keep on flying until the threshold value is reached again. Moreover, the model considers aircraft age and efficiency to assign them to flights.
Design/methodology/approach
The aircraft maintenance routing problem (AMRP), as one of the most important problems in the aviation industry, determines the optimal route for each aircraft along with meeting maintenance requirements. This paper presents a bi-objective mixed-integer programming model for AMRP in which several criteria such as aircraft efficiency and ferrying flights are considered.
Findings
As the solution approaches, epsilon-constraint method and a non-dominated sorting genetic algorithm (NSGA-II), including a new initializing algorithm, are used. To verify the efficiency of NSGA-II, 31 test problems in different scales are solved using NSGA-II and GAMS. The results show that the optimality gap in NSGA-II is less than 0.06%. Finally, the model was solved based on real data of American Eagle Airlines extracted from Kaggle datasets.
Originality/value
The authors confirm that it is an original paper, has not been published elsewhere and is not currently under consideration of any other journal.
Details
Keywords
Nidhi Sharma and Ravindara Bhatt
Privacy preservation is a significant concern in Internet of Things (IoT)-enabled event-driven wireless sensor networks (WSNs). Low energy utilization in the event-driven system…
Abstract
Purpose
Privacy preservation is a significant concern in Internet of Things (IoT)-enabled event-driven wireless sensor networks (WSNs). Low energy utilization in the event-driven system is essential if events do not happen. When events occur, IoT-enabled sensor network is required to deal with enormous traffic from the concentration of demand data delivery. This paper aims to explore an effective framework for safeguarding privacy at source in event-driven WSNs.
Design/methodology/approach
This paper discusses three algorithms in IoT-enabled event-driven WSNs: source location privacy for event detection (SLP_ED), chessboard alteration pattern (SLP_ED_CBA) and grid-based source location privacy (GB_SLP). Performance evaluation is done using simulation results and security analysis of the proposed scheme.
Findings
The sensors observe bound events or sensitive items within the network area in the field of interest. The open wireless channel lets an opponent search traffic designs, trace back and reach the start node or the event-detecting node. SLP_ED and SLP_ED_CBA provide better safety level results than dynamic shortest path scheme and energy-efficient source location privacy protection schemes. This paper discusses security analysis for the GB_SLP. Comparative analysis shows that the proposed scheme is more efficient on safety level than existing techniques.
Originality/value
The authors develop the privacy protection scheme in IoT-enabled event-driven WSNs. There are two categories of occurrences: nominal events and critical events. The choice of the route from source to sink relies on the two types of events: nominal or critical; the privacy level required for an event; and the energy consumption needed for the event. In addition, phantom node selection scheme is designed for source location privacy.
Details
Keywords
Zabih Ghelichi, Monica Gentili and Pitu Mirchandani
This paper aims to propose a simulation-based performance evaluation model for the drone-based delivery of aid items to disaster-affected areas. The objective of the model is to…
Abstract
Purpose
This paper aims to propose a simulation-based performance evaluation model for the drone-based delivery of aid items to disaster-affected areas. The objective of the model is to perform analytical studies, evaluate the performance of drone delivery systems for humanitarian logistics and can support the decision-making on the operational design of the system – on where to locate drone take-off points and on assignment and scheduling of delivery tasks to drones.
Design/methodology/approach
This simulation model captures the dynamics and variabilities of the drone-based delivery system, including demand rates, location of demand points, time-dependent parameters and possible failures of drones’ operations. An optimization model integrated with the simulation system can update the optimality of drones’ schedules and delivery assignments.
Findings
An extensive set of experiments was performed to evaluate alternative strategies to demonstrate the effectiveness for the proposed optimization/simulation system. In the first set of experiments, the authors use the simulation-based evaluation tool for a case study for Central Florida. The goal of this set of experiments is to show how the proposed system can be used for decision-making and decision-support. The second set of experiments presents a series of numerical studies for a set of randomly generated instances.
Originality/value
The goal is to develop a simulation system that can allow one to evaluate performance of drone-based delivery systems, accounting for the uncertainties through simulations of real-life drone delivery flights. The proposed simulation model captures the variations in different system parameters, including interval of updating the system after receiving new information, demand parameters: the demand rate and their spatial distribution (i.e. their locations), service time parameters: travel times, setup and loading times, payload drop-off times and repair times and drone energy level: battery’s energy is impacted and requires battery change/recharging while flying.
Details
Keywords
Radha Subramanyam, Y. Adline Jancy and P. Nagabushanam
Cross-layer approach in media access control (MAC) layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data…
Abstract
Purpose
Cross-layer approach in media access control (MAC) layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in wireless sensor network (WSN) and Internet of Things (IoT) applications. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes. Game theory optimization for distributed may increase the network performance. The purpose of this study is to survey the various operations that can be carried out using distributive and adaptive MAC protocol. Hill climbing distributed MAC does not need a central coordination system and location-based transmission with neighbor awareness reduces transmission power.
Design/methodology/approach
Distributed MAC in wireless networks is used to address the challenges like network lifetime, reduced energy consumption and for improving delay performance. In this paper, a survey is made on various cooperative communications in MAC protocols, optimization techniques used to improve MAC performance in various applications and mathematical approaches involved in game theory optimization for MAC protocol.
Findings
Spatial reuse of channel improved by 3%–29%, and multichannel improves throughput by 8% using distributed MAC protocol. Nash equilibrium is found to perform well, which focuses on energy utility in the network by individual players. Fuzzy logic improves channel selection by 17% and secondary users’ involvement by 8%. Cross-layer approach in MAC layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in WSN and IoT applications. Cross-layer and cooperative communication give energy savings of 27% and reduces hop distance by 4.7%. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes.
Research limitations/implications
Other optimization techniques can be applied for WSN to analyze the performance.
Practical implications
Game theory optimization for distributed may increase the network performance. Optimal cuckoo search improves throughput by 90% and reduces delay by 91%. Stochastic approaches detect 80% attacks even in 90% malicious nodes.
Social implications
Channel allocations in centralized or static manner must be based on traffic demands whether dynamic traffic or fluctuated traffic. Usage of multimedia devices also increased which in turn increased the demand for high throughput. Cochannel interference keep on changing or mitigations occur which can be handled by proper resource allocations. Network survival is by efficient usage of valid patis in the network by avoiding transmission failures and time slots’ effective usage.
Originality/value
Literature survey is carried out to find the methods which give better performance.
Details
Keywords
Marcel Peppel, Stefan Spinler and Matthias Winkenbach
The e-commerce boom presents new challenges for last-mile delivery (LMD), which may be mitigated by new delivery technologies. This paper evaluates the impact of mobile parcel…
Abstract
Purpose
The e-commerce boom presents new challenges for last-mile delivery (LMD), which may be mitigated by new delivery technologies. This paper evaluates the impact of mobile parcel lockers (MPL) on costs and CO2 equivalent (CO2e) emissions in existing LMD networks, which include home delivery and shipments to stationary parcel lockers.
Design/methodology/approach
To describe customers’ preferences, we design a multinomial logit model based on recipients’ travel distance to pick-up locations and availability at home. Based on route cost estimation, we define the operating costs for MPLs. We devise a mathematical model with binary decision variables to optimize the location of MPLs.
Findings
Our study demonstrates that integrating MPLs leads to additional cost savings of 8.7% and extra CO2e emissions savings of up to 5.4%. Our analysis of several regional clusters suggests that MPLs yield benefits in highly populous cities but may result in additional emissions in more rural areas where recipients drive longer distances to pick-ups.
Originality/value
This paper designs a suitable operating model for MPLs and demonstrates environmental and economic savings. Moreover, it adds recipients’ availability at home to receive parcels improving the accuracy of stochastic demand. In addition, MPLs are evaluated in the context of several regional clusters ranging from large cities to rural areas. Thus, we provide managerial guidance to logistics service providers how and where to deploy MPLs.
Details