Multiple People Picking Assignment and Routing Optimization Based on Genetic Algorithm

In order to improve the picking efficiency,reduce the picking time,this paper take artificial picking operation of a certain distribution center which has double-area warehouse as the studying object.Discuss the picking task allocation and routing problems.Establish the TSP model of order-picking system.Create a heuristic algorithm bases on the Genetic Algorithm(GA)which help to solve the task allocating problem and to get the associated order-picking routes.And achieve the simulation experiment with the Visual 6.0C++platform to prove the rationality of the model and the effectiveness of the arithmetic.

Adaptive swarm-based routing in communication networks

Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features, including adaptation, robustness and distributed, decentralized nature, which are well suited for routing in modern communication networks. This paper describes an adaptive swarm-based routing algorithm that increases convergence speed, reduces routing instabilities and oscillations by using a novel variation of reinforcement learning and a technique called momentum.Experiment on the dynamic network showed that adaptive swarm-based routing learns the optimum routing in terms of convergence speed and average packet latency.

POWER-AWARE ROUTING BASED ON DSR FOR MOBILE AD HOC NETWORKS

Energy consumption is a crucial design concern in Mobile Ad hoc NETworks (MANETs) since nodes are powered by batteries with limited energy, whereas Dynamic Source Routing (DSR) protocol does not take the energy limitation of MANET nodes into account. This paper proposes an energy-saving routing algorithm based on DSR: Power Aware Routing protocol based on DSR (PAR-DSR). The design objective of PAR-DSR is to select energy-efficient paths. The main features of PAR-DSR are: (1) Nodes use the Signal Attenuation Rate (SAR) to conduct power control operations; (2) Minimum path cost as metric to balance the traffic and energy consumption of wireless nodes. The simulation results show that PAR-DSR can greatly reduce the energy consumption of MANET nodes. The average node lifetime of PAR-DSR is 50%-77% longer than that of DSR.

Tree Based Energy and Congestion Aware Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.

A Network-Based VPN Architecture Using Virtual Routing

A network-based Virtual Private Network (VPN) architecture by using fundamental routing mechanism is proposed. This network is a virtual overlay network based on the relay of IP-in-IP tunneling of virtual routing modules. The packet format employs the encapsulation of IPSec ESP(Encapsulating Security Payload), an impact path code and an extended DS(Differentiated Services) code to support multi-path routing and QoS. Comparing with other models of VPN, this network system can be deployed in the current network with little investment, and it is easy to implement. The simulation result shows its performance is better than the traditional VPN system of black box mode.

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.

Improved Secure Trust-based Location-Aided Routing Model for MANETs

In view of the security weakness in resisting the active attacks by malicious nodes in mobile ad hoc networks,the trust metric is introduced to defend those attacks by loading a trust model on the previously proposed Distance-Based LAR.The improved Secure Trust-based Location-Aided Routing algorithm utilizes direct trust and recommendation trust to prevent malicious nodes with low trust values from joining the forwarding.Simulation results reveal that ST-LAR can resist attacks by malicious nodes effectively;furthermore,it also achieves better performance than DBLAR in terms of average end-to-end delay,packet delivery success ratio and throughput.

Trusted Routing Based on Identity-Based Threshold Signature for Opportunistic Networks

In opportunistic Networks,compromised nodes can attack social context-based routing protocols by publishing false social attributes information.To solve this problem,we propose a security scheme based on the identity-based threshold signature which allows mobile nodes to jointly generate and distribute the secrets for social attributes in a totally self-organized way without the need of any centralized authority.New joining nodes can reconstruct their own social attribute signatures by getting enough partial signature services from encounter opportunities with the initial nodes.Mobile nodes need to testify whether the neighbors can provide valid attribute signatures for their routing advertisements in order to resist potential routing attacks.Simulation results show that:by implementing our security scheme,the network delivery probability of the social context-based routing protocol can be effectively improved when there are large numbers of compromised nodes in opportunistic networks.

Customizing Service Path Based on Polymorphic Routing Model in Future Networks

The current Internet has evolved during the last decade to a global provider of diverse applications. However, the underlying structure of routing and addressing has not evolved in the same pace and is somewhat inflexible. How to provide diverse routing services, support emerging communication paradigms based on limited and definite network resources has become an urgent challenge. This paper investigates the adaptive matching between routing and application through network function decomposition and composition, and proposes a polymorphic routing model to support diverse applications and emerging communication paradigms. The model splits complex routing functions into its constituents, and derives customized routing mechanisms supporting various applications by composing the routing constituents. The derivation process is modeled as a Markov Decision Process (MDP), and a polymorphic derivation algorithm is also proposed to derive customized routing instances for diverse applications. The model enables the network to self-adjust routing services dynamically to adapt to the different requirements of applications, supports coexistence of multiple routing modes and communication paradigms, and provides a feasible solution for the network compatibility and evolvement. We describe the key design and demonstrate the feasibility of polymorphic derivation by simulations. We also present case studies that demonstrate key functionalities the polymorphic routing model enables.

Energy-Efficient Content-Based Routing in Internet of Things

The?convergence of the Internet, sensor networks, and Radio Frequency Identification (RFID) systems has ushered to the concept of Internet of Things (IoT) which is capable of connecting daily things, making them smart through sensing, reasoning, and cooperating with other things. Further, RFID technology enables tracking of an object and assigning it a unique ID. IoT has the potential for a wide range of applications relating to healthcare, environment, transportation, cities… Moreover, the middleware is a basic component in the IoT architecture. It handles heterogeneity issues among IoT devices and provides a common framework for communication. More recently, the interest has focusing on developing publish/subscribe middleware systems for the IoT to allow asynchronous communication between the IoT devices. The scope of our paper is to study routing protocols for publish/subscribe schemes that include content and context-based routing. We propose an Energy-Efficient Content-Based Routing (EECBR) protocol for the IoT that minimizes the energy consumption. The proposed algorithm makes use of a virtual topology that is constructed in a centralized manner and then routes the events from the publishers to the intended interested subscribers in a distributed manner. EECBR has been simulated using Omnet++. The simulation results show that EECBR has a significant performance in term of the energy variance compared to the other schemes.

A Destination Based Routing Protocol for Context Based Clusters in VANET

Today, vehicular ad-hoc network (VANET) is a hot research topic due to its many applications like collision avoidance, congestion road notification, parking lot availability, road-side business advertisements, etc. All these applications have hard delay constraints i.e. the messages should reach the target location within certain time limits. So, there must be efficient routing in VANET which meets these delay constraints. In this paper, two techniques are proposed to minimize the data traffic and delay in VANET. Firstly, a context based clustering is proposed which takes into consideration various parameters in cluster formation-location of vehicle, direction of vehicle, velocity of vehicle, interest list of vehicle [1] and destination of vehicle. Secondly, a destination based routing protocol is proposed for these context based clusters for efficient inter-cluster communication.

Destination Based Stable Clustering Algorithm and Routing for VANET

Now in modern telecommunication, one of the big topic research is a Vehicle Ad-hoc Network “VANET” (V2V). This topic is one of an “issues of the day” because research has problematic topic due to its many application-questions, what we need to solve: avoid collisions, any accidents on a way, and notifications about congestions on the road, available car parking, road-side commercial-business ads, and etcetera. These like application forms creating big delay constraining’s i.e. the instant data should reach the destination within certain time limits. Therefore, we need a really efficient stable clustering method and routing in vehicle ad-hoc network which will be resistant to network delays and meets network requirements. The methods are proposed in the paper for optimization VANETs data traffic as well as to minimizing delay. First, here is presented, a stable clustering algorithm based on the destination, contextually take into consideration various physical parameters for cluster formation such as location of the vehicle and its direction, vehicle speed and destination, as well as a possible list of interests of the vehicle. And also the next main process is to depend on these “five parameters” we can calculate the “Cluster Head Eligibility” of each car. Second, based on this “Cluster Head Eligibility”, described cluster head selection method. Third, for efficient communication between clusters, present a routing protocol based on the “destination”, which considered an efficient selecting method of next forwarding nodes, which is calculated by using “FE” metric.

An Efficient Priority Based Routing Technique That Maximizes the Lifetime and Coverage of Wireless Sensor Networks

Recent development in sensor technologies makes wireless sensor networks (WSN) very popular in the last few years. A limitation of most popular sensors is that sensor nodes have a limited battery capacity that leads to lower the lifetime of WSN. For that, it raises the need to develop energy efficient solutions to keep WSN functioning for the longest period of time. Due to the fact that most of the nodes energy is spent on data transmission, many routing techniques in the literature have been proposed to expand the network lifetime such as the Online Maximum Lifetime heuristics (OML) and capacity maximization (CMAX). In this paper, we introduce an efficient priority based routing power management heuristic in order to increase both coverage and extend lifetime by managing the power at the sensor level. We accomplished that by setting priority metric in addition to dividing the node energy into two ratios;one for the sensor node originated data and the other part is for data relays from other sensors. This heuristic, which is called pERPMT (priority Efficient Routing Power Management Technique), has been applied to two well know routing techniques. Results from running extensive simulation runs revealed the superiority of the new methodology pERPMT over existing heuristics. The pEPRMT increases the lifetime up to 77% and 54% when compared to OML and CMAX respectively.

A Scalable Architecture Supporting QoS Guarantees Using Traffic Engineering and Policy Based Routing in the Internet

The study of Quality of Service (QoS) has become of great importance since the Internet is used to support a wide variety of new services and applications with its legacy structure. Current Internet architecture is based on the Best Effort (BE) model, which attempts to deliver all traffic as soon as possible within the limits of its abilities, but without any guarantee about throughput, delay, packet loss, etc. We develop a three-layer policy based architecture which can be deployed to control network resources intelligently and support QoS sensi-tive applications such as real-time voice and video streams along with standard applications in the Internet. In order to achieve selected QoS parameter values (e.g. loss, delay and PDV) within the bounds set through SLAs for high priority voice traffic in the Internet, we used traffic engineering techniques and policy based routing supported by Border Gateway Protocol (BGP). Use of prototype and simulations validates function-ality of our architecture.

An Enhanced Energy Efficiency Tree-Based Hierarchical Routing Based on Additional Connections

Instrumented is defined as a key characteristic in the upcoming smart cites, which demands a higher Wireless Sensor Networks (WSNs) performance. Tree-based Hierarchical Routing (THR) is a routing protocol for WSNs static scenarios. THR hierarchically maps WSN area into a routing tree. However, fixed topology and hierarchical architecture leads to unbalanced energy overhead distribution and inflexible routes selection. To uniformly distribute routing energy overhead, reduce routing hops and extend network life cycle, we designed an enhanced THR routing protocol based on additional connections such as Neighbors, Brothers and Nephews. Based on these connections, three actions were introduced which are Shortcut, Overhead Balancing and Adoption. A simulation for different network loads on OMNet++4.1 is issued, and realized this THR routing in Chipcon SmartRF04?EB embedded boards based on Zigbee in a point-to-point topology. According to the simulation results and experiment data, this proposal obviously improved the latency performance, reduced energy overhead and extended the network’s life cycle.

Honey Badger Algorithm Based Clustering with Routing Protocol for Wireless Sensor Networks

Wireless sensor network(WSN)includes a set of self-organizing and homogenous nodes employed for data collection and tracking applications.It comprises a massive set of nodes with restricted energy and processing abilities.Energy dissipation is a major concern involved in the design of WSN.Clustering and routing protocols are considered effective ways to reduce the quantity of energy dissipation using metaheuristic algorithms.In order to design an energy aware cluster-based route planning scheme,this study introduces a novel Honey Badger Based Clustering with African Vulture Optimization based Routing(HBAC-AVOR)protocol for WSN.The presented HBAC-AVOR model mainly aims to cluster the nodes in WSN effectually and organize the routes in an energy-efficient way.The presented HBAC-AVOR model follows a two stage process.At the initial stage,the HBAC technique is exploited to choose an opti-mal set of cluster heads(CHs)utilizing afitness function involving many input parameters.Next,the AVOR approach was executed for determining the optimal routes to BS and thereby lengthens the lifetime of WSN.A detailed simulation analysis was executed to highlight the increased outcomes of the HBAC-AVOR protocol.On comparing with existing techniques,the HBAC-AVOR model has outperformed existing techniques with maximum lifetime.

Performance Comparison between Delay-Tolerant and Non-Delay-Tolerant Position-Based Routing Protocols in VANETs

Vehicular ad hoc networks (VANETs) are a new emerging recently developed advanced technology that allows a wide group of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). There are various routing protocol categories used in VANETs, like unicast, multicast, and broadcast protocols. In unicast position-based protocols, the routing decisions are based on the geographic position of the vehicles. This does not require establishment or maintenance of routes but needs location services to determine the position of the destination. Non-delay-tolerant network protocols (non-DTN), also identified as minimum delay protocols, are aimed at minimizing the delivery time of the information. Delay-tolerant protocols (DTN) are used in a variety of operating environments, including those that are subject to failures and interruptions and those with high delay, such as VANETs. This paper discusses the comparison between non-DTN and DTN routing protocols belonging to the unicast delay-tolerant position-based category. The comparison was conducted using the NS2 simulator, and the simulations of three non-DTN routing protocols and three DTN routing protocols were recorded. Simulation results show that the DTN routing protocols outperform in delivery ratio compared to the non-DTN routing protocols, but they lead to more average delay due to buffering, the processing algorithm, and priority calculation. In conclusion, non-DTN protocols are more suitable for the city environment since the distance between nodes is relatively smaller and the variations in the network topology are slower than they are on highways. On the other hand, DTN protocols are more suitable for highways due to the buffering of packets until a clear route to destination is available.

A Solution for Scalable Routing in Depth Divisions-Based DUSNs via Adding a Scalable Parameter to Control Depth Clusters: Creating an Energy Efficient and Low Delay NI-Independent Communication Protocol

Due to effectiveness of network layer on general performance of networks, designing routing protocols is very important for lifetime and traffic efficiency in wireless sensor networks. So in this paper, we are going to represent an efficient and scalable version of depth-based routing (DBR) protocol that is limited by depth divisions-policy. In fact the new version is a network information independent routing protocol for acoustic communications. Proposed method by use of depth clustering is able to reduce consumed energy and end-to-end delay in dense underwater sensor networks (DUSNs) and this issue is proved by simulation.

Mathematical Model with Energy and Clustering Energy Based Routing Protocols as Remediation to the Directional Source Aware Routing Protocol in Wireless Sensor Networks

In this paper, a routing protocol for wireless sensor network, baptized energy based protocol (EBP) is proposed. Wireless sensor network presents many challenges and constraints, and one of the major constraints is the routing problem. Due to the limited energy of sensor nodes, routing in this type of network shall perform efficiently to maximize the network lifetime. One of the proposed algorithms is the directional source aware routing protocol (DSAP) which, after simulation, showed a lot of limitations and drawbacks. The modified directional source aware routing protocol (MDSAP) was proposed by the authors of this paper to address some of the DSAP’s limitations but remains limited to a fixed topology, fixed source and stationary nodes. So EBP is proposed and operated under different scenarios and showed, after its simulation using TinyOS, many advantages in terms of load balancing, free looping, minimizing packet error rate and maximizing network lifetime.

Performance Analysis of Grid Based AODV Routing Algorithm for AD Hoc Wireless Networks

In many traditional On Demand routing algorithms in Ad hoc wireless networks, a simple flooding mechanism is used to broadcast route request (RREQ) packets when there is a need to establish a route from a source node to a destination node. The broadcast of RREQ may lead to high channel contention, high packet collisions, and thus high delay to establish the routes, especially with high density networks. Ad hoc on Demand Distance Vector Routing Protocol (AODV) is one among the most effective Reactive Routing Protocols in MANETs which use simple flooding mechanism to broadcast the RREQ. It is also used in Wireless Sensor Networks (WSN) and in Vehicular Ad hoc Networks (VANET). This paper proposes a new modified AODV routing protocol EGBB-AODV where the RREQ mechanism is using a grid based broadcast (EGBB) which reduces considerably the number of rebroadcast of RREQ packets, and hence improves the performance of the routing protocol. We developed a simulation model based on NS2 simulator to measure the performance of EGBB-AODV and compare the results to the original AODV and a position-aware improved counter-based algorithm (PCB-AODV). The simulation experiments that EGBB-AODV outperforms AODV and PCB-AODV in terms of end-to-end delay, delivery ratio and power consumption, under different traffic load, and network density conditions.