QOS-aware error recovery in wireless body sensor networks using adaptive network coding.

Science.gov (United States)

Razzaque, Mohammad Abdur; Javadi, Saeideh S; Coulibaly, Yahaya; Hira, Muta Tah

2014-12-29

Wireless body sensor networks (WBSNs) for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS), in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network's QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts.

Thermal-Aware Multiconstrained Intrabody QoS Routing for Wireless Body Area Networks

OpenAIRE

Muhammad Mostafa Monowar; Mohammad Mehedi Hassan; Fuad Bajaber; Md. Abdul Hamid; Atif Alamri

2014-01-01

Wireless body area networks (WBANs) can be formed including implanted biosensors for health monitoring and diagnostic purposes. However, implanted biosensors could cause thermal damages on human tissue as it exhibits temperature rise due to wireless communication and processing tasks inside the human body. Again, Quality of Service (QoS) provisioning with multiconstraints (delay and reliability) is a striking requirement for diverse application types in WBANs to meet their objectives. This pa...

SDN-based QoS Aware Network Service Provisioning

DEFF Research Database (Denmark)

Caba, Cosmin Marius; Soler, José

2015-01-01

One of the applicability areas of SDN is for creating services for dynamic provisioning of network resources with strict QoS requirements. The research available in this field focuses mainly on the service logic implemented over the functionality of the SDN Controller (SDNC). However, there is much...... to be covered regarding the specific mechanisms used by the SDNC to enforce the QoS in the data plane devices. To this end, the current paper proposes a data plane QoS architecture, together with the invariants that have to be maintained by the SDNC in order to ensure predictable QoS for the network services....... More specifically, the paper will look into on demand provisioning of Virtual Circuits (VCs) with specific QoS, based on the SDN paradigm. The aim is to analyze and compare the strategies for network resources management for two cases: a coarse granular and a fine granular VC provisioning service...

Quality-of-Service Routing Using Path and Power Aware Techniques in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

R. Asokan

2008-01-01

Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile hosts dynamically forming a temporary network without the aid of any existing established infrastructure. Quality of service (QoS is a set of service requirements that needs to be met by the network while transporting a packet stream from a source to its destination. QoS support MANETs is a challenging task due to the dynamic topology and limited resources. The main objective of this paper is to enhance the QoS routing for MANET using temporally ordered routing algorithm (TORA with self-healing and optimized routing techniques (SHORT. SHORT improves routing optimality by monitoring routing paths continuously and redirecting the path whenever a shortcut path is available. In this paper, the performance comparison of TORA and TORA with SHORT has been analyzed using network simulator for various parameters. TORA with SHORT enhances performance of TORA in terms of throughput, packet loss, end-to-end delay, and energy.

Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem

Directory of Open Access Journals (Sweden)

Baozhen Yao

2014-02-01

Full Text Available This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity of the problem by changing the multi-depot open vehicle routing problem into an open vehicle routing problem with a dummy central depot in this paper. Then, ant colony optimization is used to solve the problem. To improve the performance of the algorithm, crossover operation and some adaptive strategies are used. Finally, the computational results for the benchmark problems of the multi-depot vehicle routing problem indicate that the proposed ant colony optimization is an effective method to solve the multi-depot vehicle routing problem. Furthermore, the computation results of the seafood product delivery problem from Dalian, China also suggest that the proposed ant colony optimization is feasible to solve the seafood product delivery routing problem.

A model of ant route navigation driven by scene familiarity.

Directory of Open Access Journals (Sweden)

Bart Baddeley

2012-01-01

Full Text Available In this paper we propose a model of visually guided route navigation in ants that captures the known properties of real behaviour whilst retaining mechanistic simplicity and thus biological plausibility. For an ant, the coupling of movement and viewing direction means that a familiar view specifies a familiar direction of movement. Since the views experienced along a habitual route will be more familiar, route navigation can be re-cast as a search for familiar views. This search can be performed with a simple scanning routine, a behaviour that ants have been observed to perform. We test this proposed route navigation strategy in simulation, by learning a series of routes through visually cluttered environments consisting of objects that are only distinguishable as silhouettes against the sky. In the first instance we determine view familiarity by exhaustive comparison with the set of views experienced during training. In further experiments we train an artificial neural network to perform familiarity discrimination using the training views. Our results indicate that, not only is the approach successful, but also that the routes that are learnt show many of the characteristics of the routes of desert ants. As such, we believe the model represents the only detailed and complete model of insect route guidance to date. What is more, the model provides a general demonstration that visually guided routes can be produced with parsimonious mechanisms that do not specify when or what to learn, nor separate routes into sequences of waypoints.

An Adaptive QoS Routing Solution for MANET Based Multimedia Communications in Emergency Cases

Science.gov (United States)

Ramrekha, Tipu Arvind; Politis, Christos

The Mobile Ad hoc Networks (MANET) is a wireless network deprived of any fixed central authoritative routing entity. It relies entirely on collaborating nodes forwarding packets from source to destination. This paper describes the design, implementation and performance evaluation of CHAMELEON, an adaptive Quality of Service (QoS) routing solution, with improved delay and jitter performances, enabling multimedia communication for MANETs in extreme emergency situations such as forest fire and terrorist attacks as defined in the PEACE project. CHAMELEON is designed to adapt its routing behaviour according to the size of a MANET. The reactive Ad Hoc on-Demand Distance Vector Routing (AODV) and proactive Optimized Link State Routing (OLSR) protocols are deemed appropriate for CHAMELEON through their performance evaluation in terms of delay and jitter for different MANET sizes in a building fire emergency scenario. CHAMELEON is then implemented in NS-2 and evaluated similarly. The paper concludes with a summary of findings so far and intended future work.

QoS Supported IPTV Service Architecture over Hybrid-Tree-Based Explicit Routed Multicast Network

Directory of Open Access Journals (Sweden)

Chih-Chao Wen

2012-01-01

Full Text Available With the rapid advance in multimedia streaming and multicast transport technology, current IP multicast protocols, especially PIM-SM, become the major channel delivery mechanism for IPTV system over Internet. The goals for IPTV service are to provide two-way interactive services for viewers to select popular program channel with high quality for watching during fast channel surfing period. However, existing IP multicast protocol cannot meet above QoS requirements for IPTV applications between media server and subscribers. Therefore, we propose a cooperative scheme of hybrid-tree based on explicit routed multicast, called as HT-ERM to combine the advantages of shared tree and source tree for QoS-supported IPTV service. To increase network utilization, the constrained shortest path first (CSPF routing algorithm is designed for construction of hybrid tree to deliver the high-quality video stream over watching channel and standard quality over surfing channel. Furthermore, the Resource Reservation Protocol- Traffic Engineering (RSVP-TE is used as signaling mechanism to set up QoS path for multicast channel admission control. Our simulation results demonstrated that the proposed HT-ERM scheme outperforms other multicast QoS-based delivery scheme in terms of channel switching delay, resource utilization, and blocking ratio for IPTV service.

Intelligent QoS routing algorithm based on improved AODV protocol for Ad Hoc networks

Science.gov (United States)

Huibin, Liu; Jun, Zhang

2016-04-01

Mobile Ad Hoc Networks were playing an increasingly important part in disaster reliefs, military battlefields and scientific explorations. However, networks routing difficulties are more and more outstanding due to inherent structures. This paper proposed an improved cuckoo searching-based Ad hoc On-Demand Distance Vector Routing protocol (CSAODV). It elaborately designs the calculation methods of optimal routing algorithm used by protocol and transmission mechanism of communication-package. In calculation of optimal routing algorithm by CS Algorithm, by increasing QoS constraint, the found optimal routing algorithm can conform to the requirements of specified bandwidth and time delay, and a certain balance can be obtained among computation spending, bandwidth and time delay. Take advantage of NS2 simulation software to take performance test on protocol in three circumstances and validate the feasibility and validity of CSAODV protocol. In results, CSAODV routing protocol is more adapt to the change of network topological structure than AODV protocol, which improves package delivery fraction of protocol effectively, reduce the transmission time delay of network, reduce the extra burden to network brought by controlling information, and improve the routing efficiency of network.

A Personalized QoS Prediction Approach for CPS Service Recommendation Based on Reputation and Location-Aware Collaborative Filtering.

Science.gov (United States)

Kuang, Li; Yu, Long; Huang, Lan; Wang, Yin; Ma, Pengju; Li, Chuanbin; Zhu, Yujia

2018-05-14

With the rapid development of cyber-physical systems (CPS), building cyber-physical systems with high quality of service (QoS) has become an urgent requirement in both academia and industry. During the procedure of building Cyber-physical systems, it has been found that a large number of functionally equivalent services exist, so it becomes an urgent task to recommend suitable services from the large number of services available in CPS. However, since it is time-consuming, and even impractical, for a single user to invoke all of the services in CPS to experience their QoS, a robust QoS prediction method is needed to predict unknown QoS values. A commonly used method in QoS prediction is collaborative filtering, however, it is hard to deal with the data sparsity and cold start problem, and meanwhile most of the existing methods ignore the data credibility issue. Thence, in order to solve both of these challenging problems, in this paper, we design a framework of QoS prediction for CPS services, and propose a personalized QoS prediction approach based on reputation and location-aware collaborative filtering. Our approach first calculates the reputation of users by using the Dirichlet probability distribution, so as to identify untrusted users and process their unreliable data, and then it digs out the geographic neighborhood in three levels to improve the similarity calculation of users and services. Finally, the data from geographical neighbors of users and services are fused to predict the unknown QoS values. The experiments using real datasets show that our proposed approach outperforms other existing methods in terms of accuracy, efficiency, and robustness.

Comparison of routing metrics for wireless mesh networks

CSIR Research Space (South Africa)

Nxumalo, SL

2011-09-01

Full Text Available in each and every relay node so as to find the next hop for the packet. A routing metric is simply a measure used for selecting the best path, used by a routing protocol. Figure 2 shows the relationship between a routing protocol and the routing... on its QoS-awareness level. The routing metrics that considered QoS the most were selected from each group. This section discusses the four routing metrics that were compared in this paper, which are: hop count (HOP), expected transmission count (ETX...

An agent-based QoS provisioning mechanism for WDM optical networks

Science.gov (United States)

Ouyang, Yong; Zeng, Qingji; Yue, Ling

2004-04-01

This paper addresses QoS provisioning mechanisms in the WDM optical networks. With the appearance of metropolitan optical network, a hierarchical metro and wide area optical network will be envisioned in the near future. This hierarchical optical transport network is often divided into optical domains by geography, administration and technology, which usually employ different QoS routing algorithms and policies. To provide end-to-end optical QoS is becoming a new challenge for the optical network design. In this paper, we first give an overview of issues on the QoS provisioning in data, control and management planes of the WDM optical network. And then three provisioning approaches are analyzed and compared. Finally, we propose an agent-based hybrid centralized/distributed QoS provisioning mechanism based on the concept of domain agent. This agent-based hybrid mechanism employs centralized approach in the domain and distributed approach between domains. It offers scalability and intra-domain optimal QoS routing. It also keeps independence and interoperability between domains.

QoS and energy aware cooperative routing protocol for wildfire monitoring wireless sensor networks.

Science.gov (United States)

Maalej, Mohamed; Cherif, Sofiane; Besbes, Hichem

2013-01-01

Wireless sensor networks (WSN) are presented as proper solution for wildfire monitoring. However, this application requires a design of WSN taking into account the network lifetime and the shadowing effect generated by the trees in the forest environment. Cooperative communication is a promising solution for WSN which uses, at each hop, the resources of multiple nodes to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modeling, optimizing a cooperative communication protocol based on RSSI and node energy consumption in a competitive context (RSSI/energy-CC), that is, an energy and quality-of-service aware-based cooperative communication routing protocol. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.

Effective ANT based Routing Algorithm for Data Replication in MANETs

Directory of Open Access Journals (Sweden)

N.J. Nithya Nandhini

2013-12-01

Full Text Available In mobile ad hoc network, the nodes often move and keep on change its topology. Data packets can be forwarded from one node to another on demand. To increase the data accessibility data are replicated at nodes and made as sharable to other nodes. Assuming that all mobile host cooperative to share their memory and allow forwarding the data packets. But in reality, all nodes do not share the resources for the benefits of others. These nodes may act selfishly to share memory and to forward the data packets. This paper focuses on selfishness of mobile nodes in replica allocation and routing protocol based on Ant colony algorithm to improve the efficiency. The Ant colony algorithm is used to reduce the overhead in the mobile network, so that it is more efficient to access the data than with other routing protocols. This result shows the efficiency of ant based routing algorithm in the replication allocation.

Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis

Directory of Open Access Journals (Sweden)

Rosario G. Garroppo

2013-01-01

Full Text Available The paper deeply analyzes a novel network-wide power management problem, called Power-Aware Routing and Network Design with Bundled Links (PARND-BL, which is able to take into account both the relationship between the power consumption and the traffic throughput of the nodes and to power off both the chassis and even the single Physical Interface Card (PIC composing each link. The solutions of the PARND-BL model have been analyzed by taking into account different aspects associated with the actual applicability in real network scenarios: (i the time for obtaining the solution, (ii the deployed network topology and the resulting topology provided by the solution, (iii the power behavior of the network elements, (iv the traffic load, (v the QoS requirement, and (vi the number of paths to route each traffic demand. Among the most interesting and novel results, our analysis shows that the strategy of minimizing the number of powered-on network elements through the traffic consolidation does not always produce power savings, and the solution of this kind of problems, in some cases, can lead to spliting a single traffic demand into a high number of paths.

QoS mapping algorithm for ETE QoS provisioning

Science.gov (United States)

Wu, Jian J.; Foster, Gerry

2002-08-01

End-to-End (ETE) Quality of Service (QoS) is critical for next generation wireless multimedia communication systems. To meet the ETE QoS requirements, Universal Mobile Telecommunication System (UMTS) requires not only meeting the 3GPP QoS requirements [1-2] but also mapping external network QoS classes to UMTS QoS classes. There are four Quality of Services (QoS) classes in UMTS; they are Conversational, Streaming, Interactive and Background. There are eight QoS classes for LAN in IEEE 802.1 (one reserved). ATM has four QoS categories. They are Constant Bit Rate (CBR) - highest priority, short queue for strict Cell Delay Variation (CDV), Variable Bit Rate (VBR) - second highest priority, short queues for real time, longer queues for non-real time, Guaranteed Frame Rate (GFR)/ Unspecified Bit Rate (UBR) with Minimum Desired Cell Rate (MDCR) - intermediate priority, dependent on service provider UBR/ Available Bit Rate (ABR) - lowest priority, long queues, large delay variation. DiffServ (DS) has six-bit DS codepoint (DSCP) available to determine the datagram's priority relative to other datagrams and therefore, up to 64 QoS classes are available from the IPv4 and IPv6 DSCP. Different organisations have tried to solve the QoS issues from their own perspective. However, none of them has a full picture for end-to-end QoS classes and how to map them among all QoS classes. Therefore, a universal QoS needs to be created and a new set of QoS classes to enable end-to-end (ETE) QoS provisioning is required. In this paper, a new set of ETE QoS classes is proposed and a mappings algorithm for different QoS classes that are proposed by different organisations is given. With our proposal, ETE QoS mapping and control can be implemented.

Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

YongQiang Li

2018-01-01

Full Text Available For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR, is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.

The Effect of Trail Pheromone and Path Confinement on Learning of Complex Routes in the Ant Lasius niger.

Science.gov (United States)

Czaczkes, Tomer J; Weichselgartner, Tobias; Bernadou, Abel; Heinze, Jürgen

2016-01-01

Route learning is key to the survival of many central place foragers, such as bees and many ants. For ants which lay pheromone trails, the presence of a trail may act as an important source of information about whether an error has been made. The presence of trail pheromone has been demonstrated to support route learning, and the effect of pheromones on route choice have been reported to persist even after the pheromones have been removed. This could be explained in two ways: the pheromone may constrain the ants onto the correct route, thus preventing errors and aiding learning. Alternatively, the pheromones may act as a 'reassurance', signalling that the learner is on the right path and that learning the path is worthwhile. Here, we disentangle pheromone presence from route confinement in order to test these hypotheses, using the ant Lasius niger as a model. Unexpectedly, we did not find any evidence that pheromones support route learning. Indeed, there was no evidence that ants confined to the correct route learned at all. Thus, while we cannot support the 'reassurance' hypothesis, we can rule out the 'confinement' hypothesis. Other findings, such as a reduction in pheromone deposition in the presence of trail pheromones, are remarkably consistent with previous experiments. As previously reported, ants which make errors on their outward journey upregulate pheromone deposition on their return. Surprisingly, ants which would go on to make an error down-regulate pheromone deposition on their outward journey, hinting at a capacity for ants to gauge the quality of their own memories.

The Effect of Trail Pheromone and Path Confinement on Learning of Complex Routes in the Ant Lasius niger.

Directory of Open Access Journals (Sweden)

Tomer J Czaczkes

Full Text Available Route learning is key to the survival of many central place foragers, such as bees and many ants. For ants which lay pheromone trails, the presence of a trail may act as an important source of information about whether an error has been made. The presence of trail pheromone has been demonstrated to support route learning, and the effect of pheromones on route choice have been reported to persist even after the pheromones have been removed. This could be explained in two ways: the pheromone may constrain the ants onto the correct route, thus preventing errors and aiding learning. Alternatively, the pheromones may act as a 'reassurance', signalling that the learner is on the right path and that learning the path is worthwhile. Here, we disentangle pheromone presence from route confinement in order to test these hypotheses, using the ant Lasius niger as a model. Unexpectedly, we did not find any evidence that pheromones support route learning. Indeed, there was no evidence that ants confined to the correct route learned at all. Thus, while we cannot support the 'reassurance' hypothesis, we can rule out the 'confinement' hypothesis. Other findings, such as a reduction in pheromone deposition in the presence of trail pheromones, are remarkably consistent with previous experiments. As previously reported, ants which make errors on their outward journey upregulate pheromone deposition on their return. Surprisingly, ants which would go on to make an error down-regulate pheromone deposition on their outward journey, hinting at a capacity for ants to gauge the quality of their own memories.

Multiple depots vehicle routing based on the ant colony with the genetic algorithm

Directory of Open Access Journals (Sweden)

ChunYing Liu

2013-09-01

Full Text Available Purpose: the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So, it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, in order to improve the efficiency of the multiple depots vehicle routing, the paper puts forward a fusion algorithm on multiple depots vehicle routing based on the ant colony algorithm with genetic algorithm. Design/methodology/approach: to achieve this objective, the genetic algorithm optimizes the parameters of the ant colony algorithm. The fusion algorithm on multiple depots vehicle based on the ant colony algorithm with genetic algorithm is proposed. Findings: simulation experiment indicates that the result of the fusion algorithm is more excellent than the other algorithm, and the improved algorithm has better convergence effective and global ability. Research limitations/implications: in this research, there are some assumption that might affect the accuracy of the model such as the pheromone volatile factor, heuristic factor in each period, and the selected multiple depots. These assumptions can be relaxed in future work. Originality/value: In this research, a new method for the multiple depots vehicle routing is proposed. The fusion algorithm eliminate the influence of the selected parameter by optimizing the heuristic factor, evaporation factor, initial pheromone distribute, and have the strong global searching ability. The Ant Colony algorithm imports cross operator and mutation operator for operating the first best solution and the second best solution in every iteration, and reserves the best solution. The cross and mutation operator extend the solution space and improve the convergence effective and the global ability. This research shows that considering both the ant colony and genetic algorithm

QoS frameworks for Multimedia Traffic in Mobile Adhoc Networks: A Comparative Review

Directory of Open Access Journals (Sweden)

S. Soni

2017-06-01

Full Text Available MANETs (Mobile Adhoc Networks has gained an increased interest by the research community. Regular intelligent exchanges of multimedia will be typical in MANET, though the extended motivation on QoS (Quality of Service. However, various properties of the discussed QoS framework are provisioned for QoS as a challenging concern. Providing QoS provisioning is, to a great degree, challenging in MANETs in view of bouncing correspondences, center point movability and nonattendance of central coordination. Thus, most of the research has focused on giving QoS guarantees in MANETs coordinating traditions. Though huge numbers of QoS coordinating procedures have been proposed in composing, focusing on different QoS estimations yet none of the prescribed or discussed frameworks achieves a universal course of action. There exist several genuine necessary research areas of focus such as QoS metric assurance and cost limit layout, source level scheduling framework and QoS coordinating. In this paper, working and connecting of various QoS frameworks for MANETs is investigated throughout several veritable focus areas of research. After a comparative review, it is concluded that there is still a good scope of research for proposing a QoS framework for MANETs which could have cross-layer advantages, resource reservation, connection admission control, multi-constrained QoS parameters, hard QoS assurance, proactive routing advantages etc.

QoS-aware ant routing with security constraints in optical fibre networks by using RGB pheromones

DEFF Research Database (Denmark)

Al-Momin, Mohammad; Lazaridis, Pavlos; Cosmas, John

2016-01-01

for these different traffic types. In this paper, a novel technology is proposed to satisfy the requirements of different traffic types which vary in terms of bandwidth, latency and security. Oyster Optics Technology has been used to introduce the security as a new significant QoS factor....

Energy Efficient Routing in Wireless Sensor Networks based on Ant ...

African Journals Online (AJOL)

PROF. O. E. OSUAGWU

2013-09-01

Sep 1, 2013 ... improved Ant System and their application in WSN routing process. The simulation results show ... and Mobile ad-hoc networks (MANETs) are inappropriate for ... Dorigo in 1992 in his PhD thesis, the first algorithm was aiming ...

Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm

Directory of Open Access Journals (Sweden)

Zhengyu Duan

2015-11-01

Full Text Available This article addresses the stochastic time-dependent vehicle routing problem. Two mathematical models named robust optimal schedule time model and minimum expected schedule time model are proposed for stochastic time-dependent vehicle routing problem, which can guarantee delivery within the time windows of customers. The robust optimal schedule time model only requires the variation range of link travel time, which can be conveniently derived from historical traffic data. In addition, the robust optimal schedule time model based on robust optimization method can be converted into a time-dependent vehicle routing problem. Moreover, an ant colony optimization algorithm is designed to solve stochastic time-dependent vehicle routing problem. As the improvements in initial solution and transition probability, ant colony optimization algorithm has a good performance in convergence. Through computational instances and Monte Carlo simulation tests, robust optimal schedule time model is proved to be better than minimum expected schedule time model in computational efficiency and coping with the travel time fluctuations. Therefore, robust optimal schedule time model is applicable in real road network.

Pithy Review on Routing Protocols in Wireless Sensor Networks and Least Routing Time Opportunistic Technique in WSN

Science.gov (United States)

Salman Arafath, Mohammed; Rahman Khan, Khaleel Ur; Sunitha, K. V. N.

2018-01-01

Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

Landmark memories are more robust when acquired at the nest site than en route: experiments in desert ants.

Science.gov (United States)

Bisch-Knaden, Sonja; Wehner, Rüdiger

2003-03-01

Foraging desert ants, Cataglyphis fortis, encounter different sequences of visual landmarks while navigating by path integration. This paper explores the question whether the storage of landmark information depends on the context in which the landmarks are learned during an ant's foraging journey. Two experimental set-ups were designed in which the ants experienced an artificial landmark panorama that was placed either around the nest entrance (nest marks) or along the vector route leading straight towards the feeder (route marks). The two training paradigms resulted in pronounced differences in the storage characteristics of the acquired landmark information: memory traces of nest marks were much more robust against extinction and/or suppression than those of route marks. In functional terms, this result is in accord with the observation that desert ants encounter new route marks during every foraging run but always pass the same landmarks when approaching the nest entrance.

IP access networks with QoS support

Science.gov (United States)

Sargento, Susana; Valadas, Rui J. M. T.; Goncalves, Jorge; Sousa, Henrique

2001-07-01

The increasing demand of new services and applications is pushing for drastic changes on the design of access networks targeted mainly for residential and SOHO users. Future access networks will provide full service integration (including multimedia), resource sharing at the packet level and QoS support. It is expected that using IP as the base technology, the ideal plug-and-play scenario, where the management actions of the access network operator are kept to a minimum, will be achieved easily. This paper proposes an architecture for access networks based on layer 2 or layer 3 multiplexers that allows a number of simplifications in the network elements and protocols (e.g. in the routing and addressing functions). We discuss two possible steps in the evolution of access networks towards a more efficient support of IP based services. The first one still provides no QoS support and was designed with the goal of reusing as much as possible current technologies; it is based on tunneling to transport PPP sessions. The second one introduces QoS support through the use of emerging technologies and protocols. We illustrate the different phases of a multimedia Internet access session, when using SIP for session initiation, COPS for the management of QoS policies including the AAA functions and RSVP for resource reservation.

Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

Directory of Open Access Journals (Sweden)

Haitao Xu

2018-01-01

Full Text Available As we all know, there are a great number of optimization problems in the world. One of the relatively complicated and high-level problems is the vehicle routing problem (VRP. Dynamic vehicle routing problem (DVRP is a major variant of VRP, and it is closer to real logistic scene. In DVRP, the customers’ demands appear with time, and the unserved customers’ points must be updated and rearranged while carrying out the programming paths. Owing to the complexity and significance of the problem, DVRP applications have grabbed the attention of researchers in the past two decades. In this paper, we have two main contributions to solving DVRP. Firstly, DVRP is solved with enhanced Ant Colony Optimization (E-ACO, which is the traditional Ant Colony Optimization (ACO fusing improved K-means and crossover operation. K-means can divide the region with the most reasonable distance, while ACO using crossover is applied to extend search space and avoid falling into local optimum prematurely. Secondly, several new evaluation benchmarks are proposed, which can objectively and comprehensively estimate the proposed method. In the experiment, the results for different scale problems are compared to those of previously published papers. Experimental results show that the algorithm is feasible and efficient.

Routing protocols for wireless sensor networks: What the literature says?

Directory of Open Access Journals (Sweden)

Amit Sarkar

2016-12-01

Full Text Available Routing in Wireless Sensor Networks (WSNs plays a significant role in the field of environment-oriented monitoring, traffic monitoring, etc. Here, wide contributions that are made toward routing in WSN are explored. The paper mainly aims to categorize the routing problems and examines the routing-related optimization problems. For achieving the motive, 50 papers from the standard journals are collected and primarily reviewed in a chronological way. Later, various features that are related to energy, security, speed and reliability problems of routing are discussed. Subsequently, the literature is analyzed based on the simulation environment and experimental setup, awareness over the Quality of Service (QoS and the deployment against various applications. In addition, the optimization of the routing algorithms and the meta-heuristic study of routing optimization are explored. Routing is a vast area with numerous unsolved issues and hence, various research gaps along with future directions are also presented.

Gis-Based Route Finding Using ANT Colony Optimization and Urban Traffic Data from Different Sources

Science.gov (United States)

Davoodi, M.; Mesgari, M. S.

2015-12-01

Nowadays traffic data is obtained from multiple sources including GPS, Video Vehicle Detectors (VVD), Automatic Number Plate Recognition (ANPR), Floating Car Data (FCD), VANETs, etc. All such data can be used for route finding. This paper proposes a model for finding the optimum route based on the integration of traffic data from different sources. Ant Colony Optimization is applied in this paper because the concept of this method (movement of ants in a network) is similar to urban road network and movements of cars. The results indicate that this model is capable of incorporating data from different sources, which may even be inconsistent.

Next Generation Network Routing and Control Plane

DEFF Research Database (Denmark)

Fu, Rong

proved, the dominating Border Gateway Protocol (BGP) cannot address all the issues that in inter-domain QoS routing. Thus a new protocol or network architecture has to be developed to be able to carry the inter-domain traffic with the QoS and TE consideration. Moreover, the current network control also...... lacks the ability to cooperate between different domains and operators. The emergence of label switching transport technology such as of Multi-Protocol Label Switching (MPLS) or Generalized MPLS (GMPLS) supports the traffic transport in a finer granularity and more dedicated end-to-end Quality...... (RACF) provides the platform that enables cooperation and ubiquitous integration between networks. In this paper, we investigate in the network architecture, protocols and algorithms for inter-domain QoS routing and traffic engineering. The PCE based inter-domain routing architecture is enhanced...

Enhanced ant colony optimization for inventory routing problem

Science.gov (United States)

Wong, Lily; Moin, Noor Hasnah

2015-10-01

The inventory routing problem (IRP) integrates and coordinates two important components of supply chain management which are transportation and inventory management. We consider a one-to-many IRP network for a finite planning horizon. The demand for each product is deterministic and time varying as well as a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, delivers the products from the warehouse to meet the demand specified by the customers in each period. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount of inventory and to construct a delivery routing that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (best integer) for each instance considered. We propose an enhanced ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. The computational experiments demonstrating the effectiveness of our approach is presented.

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

Directory of Open Access Journals (Sweden)

Lin Zhang

2017-03-01

Full Text Available With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR. This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service.

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

Science.gov (United States)

Zhang, Lin; Yin, Na; Fu, Xiong; Lin, Qiaomin; Wang, Ruchuan

2017-01-01

With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service. PMID:28282894

GIS-BASED ROUTE FINDING USING ANT COLONY OPTIMIZATION AND URBAN TRAFFIC DATA FROM DIFFERENT SOURCES

Directory of Open Access Journals (Sweden)

M. Davoodi

2015-12-01

Full Text Available Nowadays traffic data is obtained from multiple sources including GPS, Video Vehicle Detectors (VVD, Automatic Number Plate Recognition (ANPR, Floating Car Data (FCD, VANETs, etc. All such data can be used for route finding. This paper proposes a model for finding the optimum route based on the integration of traffic data from different sources. Ant Colony Optimization is applied in this paper because the concept of this method (movement of ants in a network is similar to urban road network and movements of cars. The results indicate that this model is capable of incorporating data from different sources, which may even be inconsistent.

Autonomous QoS Management and Policing in Unmanaged Local Area Networks

Directory of Open Access Journals (Sweden)

Christopher Köhnen

2015-01-01

Full Text Available The high increase of bandwidth-intensive applications like high definition video streaming in home and small office environments leads to QoS challenges in hybrid wired/wireless local area networks. These networks are often not QoS aware and may contain bottlenecks in their topology. In addition, they often have a hybrid nature due to the used access technology consisting of, for example, Ethernet, wireless, and PowerLAN links. In this paper, we present the research work on a novel autonomous system for hybrid QoS in local area networks, called QoSiLAN, which does not rely on network infrastructure support but on host cooperation and works independently of the access technology. We present a new QoS Signalling Protocol, policing and admission control algorithms, and a new lightweight statistical bandwidth prediction algorithm for autonomous resource management in LANs. This new QoS framework enables link based, access-medium independent bandwidth management without network support. We provide evaluation results for the novel bandwidth prediction algorithm as well as for the QoSiLAN framework and its protocol, which highlight the features, robustness, and the effectiveness of the proposed system.

On QoS guarantee in MPLS network with software deadline awareness

Science.gov (United States)

Gao, Yu; Jin, Yaohui; Cheng, Hong; Yu, Yingdi; Sun, Weiqiang; Guo, Wei; Hu, Weisheng

2007-11-01

With the increasing number of internet users, more and more real-time services are added into the network, such as IPTV, online-video, Voice over IP, etc. As we know, throughput is a highly important performance criterion for scheduling algorithms of networks. Besides throughput, these growing real-time services are very sensitive to delay variance termed as jitter. Therefore, high performance scheduling algorithm should achieve good performance in terms of throughput, delay, jitter and fairness together. Scheduling algorithm with deadline-awareness employed in packet switching plays a key role in QoS guarantees. Although traditional hard-deadline can provide guarantee on in-node delay-deadline criteria, the end-to-end delay-deadline criteria cannot be guaranteed due to the characteristic of hard-deadline, while the delay-deadline guaranteed throughput is low. Thus, soft-deadline scheduling algorithm has been proposed. In this paper, we investigate and compare the classical hard-deadline and soft-deadline switching algorithm. A new scheme "Bonus System" is proposed in order to realize the idea of soft-deadline switching algorithm. Bonus System based on soft-deadline is compared with classical Early-Deadline First scheme based on hard-deadline, which shows that Bonus System has better performance in End-to-End deadline guarantee.

Neighboring and Connectivity-Aware Routing in VANETs

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2014-01-01

Full Text Available A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR for vehicular ad hoc networks (VANETs is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments, and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

Science.gov (United States)

Mehic, M.; Fazio, P.; Voznak, M.; Partila, P.; Komosny, D.; Tovarek, J.; Chmelikova, Z.

2016-05-01

A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

Fault-tolerant and QoS based Network Layer for Security Management

Directory of Open Access Journals (Sweden)

Mohamed Naceur Abdelkrim

2013-07-01

Full Text Available Wireless sensor networks have profound effects on many application fields like security management which need an immediate, fast and energy efficient route. In this paper, we define a fault-tolerant and QoS based network layer for security management of chemical products warehouse which can be classified as real-time and mission critical application. This application generate routine data packets and alert packets caused by unusual events which need a high reliability, short end to end delay and low packet loss rate constraints. After each node compute his hop count and build his neighbors table in the initialization phase, packets can be routed to the sink. We use FELGossiping protocol for routine data packets and node-disjoint multipath routing protocol for alert packets. Furthermore, we utilize the information gathering phase of FELGossiping to update the neighbors table and detect the failed nodes, and we adapt the network topology changes by rerun the initialization phase when chemical units were added or removed from the warehouse. Analysis shows that the network layer is energy efficient and can meet the QoS constraints of unusual events packets.

Satellite network robust QoS-aware routing

CERN Document Server

Long, Fei

2014-01-01

Satellite Network Robust QoS-aware Routing presents a novel routing strategy for satellite networks. This strategy is useful for the design of multi-layered satellite networks as it can greatly reduce the number of time slots in one system cycle. The traffic prediction and engineering approaches make the system robust so that the traffic spikes can be handled effectively. The multi-QoS optimization routing algorithm can satisfy various potential user requirements. Clear and sufficient illustrations are also presented in the book. As the chapters cover the above topics independently, readers from different research backgrounds in constellation design, multi-QoS routing, and traffic engineering can benefit from the book.   Fei Long is a senior engineer at Beijing R&D Center of 54th Research Institute of China Electronics Technology Group Corporation.

Ant colony system (ACS with hybrid local search to solve vehicle routing problems

Directory of Open Access Journals (Sweden)

Suphan Sodsoon

2016-02-01

Full Text Available This research applied an Ant Colony System algorithm with a Hybrid Local Search to solve Vehicle Routing Problems (VRP from a single depot when the customers’ requirements are known. VRP is an NP-hard optimization problem and has usually been successfully solved optimum by heuristics. A fleet of vehicles of a specific capacity are used to serve a number of customers at minimum cost, without violating the constraints of vehicle capacity. There are meta-heuristic approaches to solve these problems, such as Simulated Annealing, Genetic Algorithm, Tabu Search and the Ant Colony System algorithm. In this case a hybrid local search was used (Cross-Exchange, Or-Opt and 2-Opt algorithm with an Ant Colony System algorithm. The Experimental Design was tested on 7 various problems from the data set online in the OR-Library. There are five different problems in which customers are randomly distributed with the depot in an approximately central location. The customers were grouped into clusters. The results are evaluated in terms of optimal routes using optimal distances. The experimental results are compared with those obtained from meta-heuristics and they show that the proposed method outperforms six meta-heuristics in the literature.

ADAPTIVE CLUSTER BASED ROUTING PROTOCOL WITH ANT COLONY OPTIMIZATION FOR MOBILE AD-HOC NETWORK IN DISASTER AREA

Directory of Open Access Journals (Sweden)

Enrico Budianto

2012-07-01

Full Text Available In post-disaster rehabilitation efforts, the availability of telecommunication facilities takes important role. However, the process to improve telecommunication facilities in disaster area is risky if it is done by humans. Therefore, a network method that can work efficiently, effectively, and capable to reach the widest possible area is needed. This research introduces a cluster-based routing protocol named Adaptive Cluster Based Routing Protocol (ACBRP equipped by Ant Colony Optimization method, and its implementation in a simulator developed by author. After data analysis and statistical tests, it can be concluded that routing protocol ACBRP performs better than AODV and DSR routing protocol. Pada upaya rehabilitasi pascabencana, ketersediaan fasilitas telekomunikasi memiliki peranan yang sangat penting. Namun, proses untuk memperbaiki fasilitas telekomunikasi di daerah bencana memiliki resiko jika dilakukan oleh manusia. Oleh karena itu, metode jaringan yang dapat bekerja secara efisien, efektif, dan mampu mencapai area seluas mungkin diperlukan. Penelitian ini memperkenalkan sebuah protokol routing berbasis klaster bernama Adaptive Cluster Based Routing Protocol (ACBRP, yang dilengkapi dengan metode Ant Colony Optimization, dan diimplementasikan pada simulator yang dikembangkan penulis. Setelah data dianalisis dan dilakukan uji statistik, disimpulkan bahwa protokol routing ACBRP beroperasi lebih baik daripada protokol routing AODV maupun DSR.

Distributed Fault-Tolerant Quality Of Service Routing in Hybrid Directional Wireless Networks

National Research Council Canada - National Science Library

Llewellyn, II, Larry C

2007-01-01

This thesis presents a distributed fault-tolerant routing protocol (EFDCB) for QoS supporting hybrid mobile ad hoc networks with the aim of mitigating QoS disruption time when network failures occur...

A self-optimizing scheme for energy balanced routing in Wireless Sensor Networks using SensorAnt.

Science.gov (United States)

Shamsan Saleh, Ahmed M; Ali, Borhanuddin Mohd; Rasid, Mohd Fadlee A; Ismail, Alyani

2012-01-01

Planning of energy-efficient protocols is critical for Wireless Sensor Networks (WSNs) because of the constraints on the sensor nodes' energy. The routing protocol should be able to provide uniform power dissipation during transmission to the sink node. In this paper, we present a self-optimization scheme for WSNs which is able to utilize and optimize the sensor nodes' resources, especially the batteries, to achieve balanced energy consumption across all sensor nodes. This method is based on the Ant Colony Optimization (ACO) metaheuristic which is adopted to enhance the paths with the best quality function. The assessment of this function depends on multi-criteria metrics such as the minimum residual battery power, hop count and average energy of both route and network. This method also distributes the traffic load of sensor nodes throughout the WSN leading to reduced energy usage, extended network life time and reduced packet loss. Simulation results show that our scheme performs much better than the Energy Efficient Ant-Based Routing (EEABR) in terms of energy consumption, balancing and efficiency.

DESIGNING DAILY PATROL ROUTES FOR POLICING BASED ON ANT COLONY ALGORITHM

Directory of Open Access Journals (Sweden)

H. Chen

2015-07-01

Full Text Available In this paper, we address the problem of planning police patrol routes to regularly cover street segments of high crime density (hotspots with limited police forces. A good patrolling strategy is required to minimise the average time lag between two consecutive visits to hotspots, as well as coordinating multiple patrollers and imparting unpredictability in patrol routes. Previous studies have designed different police patrol strategies for routing police patrol, but these strategies have difficulty in generalising to real patrolling and meeting various requirements. In this research we develop a new police patrolling strategy based on Bayesian method and ant colony algorithm. In this strategy, virtual marker (pheromone is laid to mark the visiting history of each crime hotspot, and patrollers continuously decide which hotspot to patrol next based on pheromone level and other variables. Simulation results using real data testifies the effective, scalable, unpredictable and extensible nature of this strategy.

Model-Checking Driven Design of QoS-Based Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhi Chen

2015-01-01

Full Text Available Accurate and reliable routing protocols with Quality of Service (QoS support determine the mission-critical application efficiency in WSNs. This paper proposes a model-checking design driven framework for designing the QoS-based routing protocols of WSNs, which involves the light-weight design process, the timed automata model, and the alternative QoS verification properties. The accurate feedback of continually model checking in the iterative design process effectively stimulates the parameter tuning of the protocols. We demonstrate the straightforward and modular characteristics of the proposed framework in designing a prototype QoS-based routing protocol. The prototype study shows that the model-checking design framework may complement other design methods and ensure the QoS implementation of the QoS-based routing protocol design for WSNs.

A Low-Jitter Wireless Transmission Based on Buffer Management in Coding-Aware Routing

Directory of Open Access Journals (Sweden)

Cunbo Lu

2015-08-01

Full Text Available It is significant to reduce packet jitter for real-time applications in a wireless network. Existing coding-aware routing algorithms use the opportunistic network coding (ONC scheme in a packet coding algorithm. The ONC scheme never delays packets to wait for the arrival of a future coding opportunity. The loss of some potential coding opportunities may degrade the contribution of network coding to jitter performance. In addition, most of the existing coding-aware routing algorithms assume that all flows participating in the network have equal rate. This is unrealistic, since multi-rate environments often appear. To overcome the above problem and expand coding-aware routing to multi-rate scenarios, from the view of data transmission, we present a low-jitter wireless transmission algorithm based on buffer management (BLJCAR, which decides packets in coding node according to the queue-length based threshold policy instead of the regular ONC policy as used in existing coding-aware routing algorithms. BLJCAR is a unified framework to merge the single rate case and multiple rate case. Simulations results show that the BLJCAR algorithm embedded in coding-aware routing outperforms the traditional ONC policy in terms of jitter, packet delivery delay, packet loss ratio and network throughput in network congestion in any traffic rates.

Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mann Raminder P

2005-01-01

Full Text Available Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.

Differential private collaborative Web services QoS prediction

KAUST Repository

Liu, An

2018-04-04

Collaborative Web services QoS prediction has proved to be an important tool to estimate accurately personalized QoS experienced by individual users, which is beneficial for a variety of operations in the service ecosystem, such as service selection, composition and recommendation. While a number of achievements have been attained on the study of improving the accuracy of collaborative QoS prediction, little work has been done for protecting user privacy in this process. In this paper, we propose a privacy-preserving collaborative QoS prediction framework which can protect the private data of users while retaining the ability of generating accurate QoS prediction. We introduce differential privacy, a rigorous and provable privacy model, into the process of collaborative QoS prediction. We first present DPS, a method that disguises a user’s observed QoS values by applying differential privacy to the user’s QoS data directly. We show how to integrate DPS with two representative collaborative QoS prediction approaches. To improve the utility of the disguised QoS data, we present DPA, another QoS disguising method which first aggregates a user’s QoS data before adding noise to achieve differential privacy. We evaluate the proposed methods by conducting extensive experiments on a real world Web services QoS dataset. Experimental results show our approach is feasible in practice.

Differential private collaborative Web services QoS prediction

KAUST Repository

Liu, An; Shen, Xindi; Li, Zhixu; Liu, Guanfeng; Xu, Jiajie; Zhao, Lei; Zheng, Kai; Shang, Shuo

2018-01-01

Collaborative Web services QoS prediction has proved to be an important tool to estimate accurately personalized QoS experienced by individual users, which is beneficial for a variety of operations in the service ecosystem, such as service selection, composition and recommendation. While a number of achievements have been attained on the study of improving the accuracy of collaborative QoS prediction, little work has been done for protecting user privacy in this process. In this paper, we propose a privacy-preserving collaborative QoS prediction framework which can protect the private data of users while retaining the ability of generating accurate QoS prediction. We introduce differential privacy, a rigorous and provable privacy model, into the process of collaborative QoS prediction. We first present DPS, a method that disguises a user’s observed QoS values by applying differential privacy to the user’s QoS data directly. We show how to integrate DPS with two representative collaborative QoS prediction approaches. To improve the utility of the disguised QoS data, we present DPA, another QoS disguising method which first aggregates a user’s QoS data before adding noise to achieve differential privacy. We evaluate the proposed methods by conducting extensive experiments on a real world Web services QoS dataset. Experimental results show our approach is feasible in practice.

Anticipation of Traffic Demands to Guarantee QoS in IP/Optical Networks

Directory of Open Access Journals (Sweden)

Carolina Pinart

2010-09-01

Full Text Available Traffic in the Internet backbone is expected to grow above a few Tbit/s in 2020. To cope with this, operators are moving to IP/optical network architectures, where IP is the convergence layer for all services. On the other hand, the quality of service (QoS requirements of future applications encompasses the individualization of services and the assurance of stricter quality parameters such as latency, jitter or capacity. In other words, future optical networks will not only transport more IP data, but they will also have to offer differentiated QoS requirements to services. Finally, some emerging applications, e.g., grid computing, need greater flexibility in the usage of network resources, which involves establishing and releasing connections as if they were virtualized resources controlled by other elements or layers. In this context, traffic-driven lightpath provisioning and service-plane approaches arise as very interesting candidate solutions to solve the main challenges described above. This work reviews the concepts of service-oriented and self-managed networks and relates them to propose an integrated approach to assure QoS by offering flow-aware networking in the sense that traffic demands will be anticipated in a suitable way, lightpaths will be established taking into account QoS information (i.e., impairments and complex services will be decomposed into optical connections so that the above techniques can be employed to assure QoS for any service.

Context-aware QoS provisioning for an M-health service platform

OpenAIRE

Wac, K.E.; Delgado Kloos, C.; Larrabeiti, D.; van Halteren, Aart; Bults, Richard G.A.; Lopez, A.M.; Broens, T.H.F.

2007-01-01

Inevitably, healthcare goes mobile. Recently developed mobile healthcare (i.e., m-health) services allow healthcare professionals to monitor mobile patient’s vital signs and provide feedback to this patient anywhere at any time. Due to the nature of current supporting mobile service platforms, m-health services are delivered with a best-effort, i.e., there are no guarantees on the delivered Quality of Service (QoS). In this paper, we argue that the use of context information in an m-health se...

QoS management of web services

CERN Document Server

Zheng, Zibin

2013-01-01

Quality-of-Service (QoS) is normally used to describe the non-functional characteristics of Web services and as a criterion for evaluating different Web services. QoS Management of Web Services presents an innovative QoS evaluation framework for these services. Moreover, three QoS prediction methods and two methods for creating fault-tolerant Web services are also proposed in this book. It not only provides the latest research findings, but also presents an excellent overview of the QoS management of Web services, making it a valuable resource for researchers and graduate students in service computing.   Zibin Zheng is an associate research fellow at the Shenzhen Research Institute, the Chinese University of Hong Kong, China. Professor Michael R. Lyu also works at the same institute.

Improved AODV route recovery in mobile ad-hoc networks using a genetic algorithm

Directory of Open Access Journals (Sweden)

Ahmad Maleki

2014-09-01

Full Text Available An important issue in ad-hoc on-demand distance vector (AODV routing protocols is route failure caused by node mobility in the MANETs. The AODV requires a new route discovery procedure whenever a route breaks and these frequent route discoveries increase transmission delays and routing overhead. The present study proposes a new method for AODVs using a genetic algorithm to improve the route recovery mechanism. When failure occurs in a route, the proposed method (GAAODV makes decisions regarding the QOS parameter to select source or local repair. The task of the genetic algorithm is to find an appropriate combination of weights to optimize end-to-end delay. This paper evaluates the metrics of routing overhead, average end-to-end delay, and packet delivery ratio. Comparison of the new algorithm and AODV (RFC 3561 using a NS-2 simulator shows that GAAODV obtains better results for the QOS parameters.

Stability-Aware Geographic Routing in Energy Harvesting Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Tran Dinh Hieu

2016-05-01

Full Text Available A new generation of wireless sensor networks that harvest energy from environmental sources such as solar, vibration, and thermoelectric to power sensor nodes is emerging to solve the problem of energy limitation. Based on the photo-voltaic model, this research proposes a stability-aware geographic routing for reliable data transmissions in energy-harvesting wireless sensor networks (EH-WSNs to provide a reliable routes selection method and potentially achieve an unlimited network lifetime. Specifically, the influences of link quality, represented by the estimated packet reception rate, on network performance is investigated. Simulation results show that the proposed method outperforms an energy-harvesting-aware method in terms of energy consumption, the average number of hops, and the packet delivery ratio.

DESIGNING APPLICATION OF ANT COLONY SYSTEM ALGORITHM FOR THE SHORTEST ROUTE OF BANDA ACEH CITY AND ACEH BESAR REGENCY TOURISM BY USING GRAPHICAL USER INTERFACE MATLAB

Directory of Open Access Journals (Sweden)

Durisman Durisman

2017-09-01

Full Text Available Banda Aceh city and Aceh Besar Regency are two of the leading tourism areas located in the province of Aceh. For travelling, there are some important things to be considered, such as determining schedule and distance of tourism. Every tourist certainly chooses the shortest route to reach the destination since it can save time, energy, and money. The purpose of this reserach is to develop a method that can be used in calculating the shortest route and applied to the tourism of Banda Aceh city and Aceh Besar regency. In this reserach, Ant Colony Optimization algorithm is used to determine the shortest route to tourism of Banda Aceh city and Aceh Besar regency. From the analysis made by using both manual calculation and  GUI MATLAB program application test, the shortest route can be obtained with a minimum distance of 120.85 km in one travel. Based on the test result, the application for tourism (in Banda Aceh city and Aceh Besar regency shortest route searching built by utilizing the Ant Colony Optimization algorithm can find optimal route.  Keyword: tourism, the shortest route, Ant Colony Optimization

Analysis of parameter estimation and optimization application of ant colony algorithm in vehicle routing problem

Science.gov (United States)

Xu, Quan-Li; Cao, Yu-Wei; Yang, Kun

2018-03-01

Ant Colony Optimization (ACO) is the most widely used artificial intelligence algorithm at present. This study introduced the principle and mathematical model of ACO algorithm in solving Vehicle Routing Problem (VRP), and designed a vehicle routing optimization model based on ACO, then the vehicle routing optimization simulation system was developed by using c ++ programming language, and the sensitivity analyses, estimations and improvements of the three key parameters of ACO were carried out. The results indicated that the ACO algorithm designed in this paper can efficiently solve rational planning and optimization of VRP, and the different values of the key parameters have significant influence on the performance and optimization effects of the algorithm, and the improved algorithm is not easy to locally converge prematurely and has good robustness.

An Improved MOEA/D for QoS Oriented Multimedia Multicasting with Network Coding

Directory of Open Access Journals (Sweden)

Zhaoyuan Wang

2015-08-01

Full Text Available Recent years witness a significant growth in multimedia applications. Among them, a stream of applications is real-time and requires one-to-many fast data transmission with stringent quality-of-service (QoS requirements, where multicast is an important supporting technology. In particular, with more and more mobile end users requesting real-time broadband multimedia applications, it is of vital importance to provide them with satisfied quality of experience. As network coding can offer higher bandwidth to users and accommodate more flows for networks than traditional routing, this paper studies the multicast routing problem with network coding and formulates it as a multi-objective optimization problem. As delay and packet loss ratio (PLR are two important performance indicators for QoS, we consider them as the two objectives for minimization. To address the problem above, we present a multi-objective evolutionary algorithm based on decomposition (MOEA/D, where an all population updating rule is devised to address the problem of lacking feasible solutions in the search space. Experimental results demonstrate the effectiveness of the proposed algorithm and it outperforms a number of state-of-the-art algorithms.

Performance evaluation of routing metrics for wireless mesh networks

CSIR Research Space (South Africa)

Nxumalo, SL

2009-08-01

Full Text Available for WMN. The routing metrics have not been compared with QoS parameters. This paper is a work in progress of the project in which researchers want to compare the performance of different routing metrics in WMN using a wireless test bed. Researchers...

Dynamic QoS Evaluation of Multimedia Contents in Wireless Networks by “Double-Boomerang” Watermarking

Directory of Open Access Journals (Sweden)

Gaetano Giunta

2010-03-01

Full Text Available This work presents a cooperative network-aware processing of multimedia content for dynamic quality of service management in wireless IP networks. Our technique can be also used for quality control in UMTS environments, exploiting the tracing watermarking recently introduced in literature. In this work, we use the transmitted video-sequences to monitor the QoS in a videoconference call. The video-sequence of every active user travels on the communication link, one time as video (transparent mode, one time as watermark (hidden mode describing a boomerang trajectory. The results obtained through our simulation trials confirm the validity of such approach. In fact, the advantages of distributing the management process are (i an easier and more precise localization of the cause of QoS problems, (ii a better knowledge of local situations, (iii a lower complexity for a single QoS agent and (iv an increase in possible actions.

Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Roy Sohini

2015-09-01

Full Text Available Wireless Sensor Network (WSN has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC.

An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks.

Science.gov (United States)

Abba, Sani; Lee, Jeong-A

2015-08-18

We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network.

Automatic provisioning of end-to-end QoS into the home

DEFF Research Database (Denmark)

Brewka, Lukasz Jerzy; Skoldström, Pontus; Nelis, Jelle

2011-01-01

Due to a growing number of high bandwidth applications today (such as HDTV), and an increasing amount of network and cloud based applications, service providers need to pay attention to QoS in their networks. We believe there is a need for an end-to-end approach reaching into the home as well....... The Home Gateway (HG) as a key component of the home network is crucial for enabling the end-to-end solutions. UPnP-QoS has been proposed as an inhome solution for resource reservations. In this paper we assess a solution for automatic QoS reservations, on behalf of non-UPnP-QoS aware applications....... Additionally we focus on an integrated end-to-end solution, combining GMPLS-based reservations in e.g., access/metro and UPnP-QoS based reservation in the home network....

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

Directory of Open Access Journals (Sweden)

Ailian Jiang

2018-03-01

Full Text Available Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs. This paper investigates the existing ant colony optimization (ACO-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks

Science.gov (United States)

Abba, Sani; Lee, Jeong-A

2015-01-01

We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network. PMID:26295236

Cross-layer protocol design for QoS optimization in real-time wireless sensor networks

Science.gov (United States)

Hortos, William S.

2010-04-01

The metrics of quality of service (QoS) for each sensor type in a wireless sensor network can be associated with metrics for multimedia that describe the quality of fused information, e.g., throughput, delay, jitter, packet error rate, information correlation, etc. These QoS metrics are typically set at the highest, or application, layer of the protocol stack to ensure that performance requirements for each type of sensor data are satisfied. Application-layer metrics, in turn, depend on the support of the lower protocol layers: session, transport, network, data link (MAC), and physical. The dependencies of the QoS metrics on the performance of the higher layers of the Open System Interconnection (OSI) reference model of the WSN protocol, together with that of the lower three layers, are the basis for a comprehensive approach to QoS optimization for multiple sensor types in a general WSN model. The cross-layer design accounts for the distributed power consumption along energy-constrained routes and their constituent nodes. Following the author's previous work, the cross-layer interactions in the WSN protocol are represented by a set of concatenated protocol parameters and enabling resource levels. The "best" cross-layer designs to achieve optimal QoS are established by applying the general theory of martingale representations to the parameterized multivariate point processes (MVPPs) for discrete random events occurring in the WSN. Adaptive control of network behavior through the cross-layer design is realized through the parametric factorization of the stochastic conditional rates of the MVPPs. The cross-layer protocol parameters for optimal QoS are determined in terms of solutions to stochastic dynamic programming conditions derived from models of transient flows for heterogeneous sensor data and aggregate information over a finite time horizon. Markov state processes, embedded within the complex combinatorial history of WSN events, are more computationally

SD-EAR: Energy Aware Routing in Software Defined Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Anuradha Banerjee

2018-06-01

Full Text Available In today’s internet-of-things (IoT environment, wireless sensor networks (WSNs have many advantages, with broad applications in different areas including environmental monitoring, maintaining security, etc. However, high energy depletion may lead to node failures in WSNs. In most WSNs, nodes deplete energy mainly because of the flooding and broadcasting of route-request (RREQ packets, which is essential for route discovery in WSNs. The present article models wireless sensor networks as software-defined wireless sensor networks (SD-WSNs where the network is divided into multiple clusters or zones, and each zone is controlled by a software-defined network (SDN controller. The SDN controller is aware of the topology of each zone, and finds out the optimum energy efficient path from any source to any destination inside the zone. For destinations outside of the zone, the SDN controller of the source zone instructs the source to send a message to all of the peripheral nodes in that zone, so that they can forward the message to the peripheral nodes in other zones, and the process goes on until a destination is found. As far as energy-efficient path selection is concerned, the SDN controller of a zone is aware of the connectivity and residual energy of each node. Therefore, it is capable of discovering an optimum energy efficient path from any source to any destination inside as well as outside of the zone of the source. Accordingly, flow tables in different routers are updated dynamically. The task of route discovery is shifted from individual nodes to controllers, and as a result, the flooding of route-requests is completely eliminated. Software-defined energy aware routing (SD-EARalso proposes an innovative sleeping strategy where exhausted nodes are allowed to go to sleep through a sleep request—sleep grant mechanism. All of these result in huge energy savings in SD-WSN, as shown in the simulation results.

Energy-Aware Routing in Multiple Domains Software-Defined Networks

Directory of Open Access Journals (Sweden)

Adriana FERNÁNDEZ-FERNÁNDEZ

2016-12-01

Full Text Available The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, the new architecture of Software-Defined Networks (SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale SDN with multiple domains. The solution proposed, called DEAR (Distributed Energy-Aware Routing, tackles the problem of minimizing the number of links that can be used to satisfy a given data traffic demand under performance constraints such as control traffic delay and link utilization. To this end, we present a complete formulation of the optimization problem that considers routing requirements for control and data plane communications. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.

SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs.

Science.gov (United States)

Aslam, Muhammad; Hu, Xiaopeng; Wang, Fan

2017-12-13

Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN). Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs) utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR) routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR's routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS). This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR) to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime and stability

SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs

Directory of Open Access Journals (Sweden)

Muhammad Aslam

2017-12-01

Full Text Available Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN. Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR’s routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS. This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime

Vibrant Energy Aware Spray and Wait Routing in Delay Tolerant Network

Directory of Open Access Journals (Sweden)

Viren G. Patel

2013-01-01

Full Text Available Delay tolerant networks (DTN are wireless networks where disconnections arise often due to the mobility of nodes, failures of energy, the low density of nodes, or when the network extends over long distances. In these situations, traditional routing protocols that have been developed for mobile ad hoc networks prove to be unsuccessful to the scope of transmitting messages between nodes. The Spray and Wait routing may achieve low routing and energy efficiency due to the blindness in the spray phase. To deal with this situation, we propose an opportunistic routing with enclosed message copies, called the Vibrant Energy aware Spray and Wait (VESW, which utilizes the information about vibrancy of node and remaining energy to allocate the number of copies between the corresponding pair nodes in the spray phase.

A Network-Attached Storage System Supporting Guaranteed QoS

Institute of Scientific and Technical Information of China (English)

KONG Hua-feng; YU Sheng-sheng; LU Hong-wei

2005-01-01

We propose a network-attached storage system that can support guaranteed Quality of Service (QoS), called POPNet Storage. The special policy of date access and disk scheduling is enable users to access files quickly and directly with guaranteed QoS in the POPNet Storage. The POPNet Storage implements a measurement-based admission control algorithm (PSMBAC) to determine whether to admit a new data access request stream and admit as many requests as possible while meeting the QoS guarantees to its clients. The data reconstruction algorithms in the POPNet Storage also put more emphasis on data availability and guaranteed QoS, thus it is designed to complete the data recovery as soon as possible and at the same time provide the guaranteed QoS for high-priority data access. The experiment results show that the POPNet Storage can provide more significant performance, reliability, and guaranteed QoS than conventional storage systems.

Energy Aware Cluster-Based Routing in Flying Ad-Hoc Networks.

Science.gov (United States)

Aadil, Farhan; Raza, Ali; Khan, Muhammad Fahad; Maqsood, Muazzam; Mehmood, Irfan; Rho, Seungmin

2018-05-03

Flying ad-hoc networks (FANETs) are a very vibrant research area nowadays. They have many military and civil applications. Limited battery energy and the high mobility of micro unmanned aerial vehicles (UAVs) represent their two main problems, i.e., short flight time and inefficient routing. In this paper, we try to address both of these problems by means of efficient clustering. First, we adjust the transmission power of the UAVs by anticipating their operational requirements. Optimal transmission range will have minimum packet loss ratio (PLR) and better link quality, which ultimately save the energy consumed during communication. Second, we use a variant of the K-Means Density clustering algorithm for selection of cluster heads. Optimal cluster heads enhance the cluster lifetime and reduce the routing overhead. The proposed model outperforms the state of the art artificial intelligence techniques such as Ant Colony Optimization-based clustering algorithm and Grey Wolf Optimization-based clustering algorithm. The performance of the proposed algorithm is evaluated in term of number of clusters, cluster building time, cluster lifetime and energy consumption.

Energy Aware Cluster-Based Routing in Flying Ad-Hoc Networks

Directory of Open Access Journals (Sweden)

Farhan Aadil

2018-05-01

Full Text Available Flying ad-hoc networks (FANETs are a very vibrant research area nowadays. They have many military and civil applications. Limited battery energy and the high mobility of micro unmanned aerial vehicles (UAVs represent their two main problems, i.e., short flight time and inefficient routing. In this paper, we try to address both of these problems by means of efficient clustering. First, we adjust the transmission power of the UAVs by anticipating their operational requirements. Optimal transmission range will have minimum packet loss ratio (PLR and better link quality, which ultimately save the energy consumed during communication. Second, we use a variant of the K-Means Density clustering algorithm for selection of cluster heads. Optimal cluster heads enhance the cluster lifetime and reduce the routing overhead. The proposed model outperforms the state of the art artificial intelligence techniques such as Ant Colony Optimization-based clustering algorithm and Grey Wolf Optimization-based clustering algorithm. The performance of the proposed algorithm is evaluated in term of number of clusters, cluster building time, cluster lifetime and energy consumption.

WEAMR — A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based WSNs

Directory of Open Access Journals (Sweden)

Ki-Hyung Kim

2013-05-01

Full Text Available Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR, a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs.

A Scalable Context-Aware Objective Function (SCAOF) of Routing Protocol for Agricultural Low-Power and Lossy Networks (RPAL).

Science.gov (United States)

Chen, Yibo; Chanet, Jean-Pierre; Hou, Kun-Mean; Shi, Hongling; de Sousa, Gil

2015-08-10

In recent years, IoT (Internet of Things) technologies have seen great advances, particularly, the IPv6 Routing Protocol for Low-power and Lossy Networks (RPL), which provides a powerful and flexible routing framework that can be applied in a variety of application scenarios. In this context, as an important role of IoT, Wireless Sensor Networks (WSNs) can utilize RPL to design efficient routing protocols for a specific application to increase the ubiquity of networks with resource-constrained WSN nodes that are low-cost and easy to deploy. In this article, our work starts with the description of Agricultural Low-power and Lossy Networks (A-LLNs) complying with the LLN framework, and to clarify the requirements of this application-oriented routing solution. After a brief review of existing optimization techniques for RPL, our contribution is dedicated to a Scalable Context-Aware Objective Function (SCAOF) that can adapt RPL to the environmental monitoring of A-LLNs, through combining energy-aware, reliability-aware, robustness-aware and resource-aware contexts according to the composite routing metrics approach. The correct behavior of this enhanced RPL version (RPAL) was verified by performance evaluations on both simulation and field tests. The obtained experimental results confirm that SCAOF can deliver the desired advantages on network lifetime extension, and high reliability and efficiency in different simulation scenarios and hardware testbeds.

A Scalable Context-Aware Objective Function (SCAOF of Routing Protocol for Agricultural Low-Power and Lossy Networks (RPAL

Directory of Open Access Journals (Sweden)

Yibo Chen

2015-08-01

Full Text Available In recent years, IoT (Internet of Things technologies have seen great advances, particularly, the IPv6 Routing Protocol for Low-power and Lossy Networks (RPL, which provides a powerful and flexible routing framework that can be applied in a variety of application scenarios. In this context, as an important role of IoT, Wireless Sensor Networks (WSNs can utilize RPL to design efficient routing protocols for a specific application to increase the ubiquity of networks with resource-constrained WSN nodes that are low-cost and easy to deploy. In this article, our work starts with the description of Agricultural Low-power and Lossy Networks (A-LLNs complying with the LLN framework, and to clarify the requirements of this application-oriented routing solution. After a brief review of existing optimization techniques for RPL, our contribution is dedicated to a Scalable Context-Aware Objective Function (SCAOF that can adapt RPL to the environmental monitoring of A-LLNs, through combining energy-aware, reliability-aware, robustness-aware and resource-aware contexts according to the composite routing metrics approach. The correct behavior of this enhanced RPL version (RPAL was verified by performance evaluations on both simulation and field tests. The obtained experimental results confirm that SCAOF can deliver the desired advantages on network lifetime extension, and high reliability and efficiency in different simulation scenarios and hardware testbeds.

Providing QoS guarantee in 3G wireless networks

Science.gov (United States)

Chuah, MooiChoo; Huang, Min; Kumar, Suresh

2001-07-01

The third generation networks and services present opportunities to offer multimedia applications and services that meet end-to-end quality of service requirements. In this article, we present UMTS QoS architecture and its requirements. This includes the definition of QoS parameters, traffic classes, the end-to-end data delivery model, and the mapping of end-to-end services to the services provided by the network elements of the UMTS. End-to-end QoS of a user flow is achieved by the combination of the QoS control over UMTS Domain and the IP core Network. In the Third Generation Wireless network, UMTS bearer service manager is responsible to manage radio and transport resources to QoS-enabled applications. The UMTS bearer service consists of the Radio Access Bearer Service between Mobile Terminal and SGSN and Core Network bearer service between SGSN and GGSN. The Radio Access Bearer Service is further realized by the Radio Bearer Service (mostly air interface) and Iu bearer service. For the 3G air interface, one can provide differentiated QoS via intelligent burst allocation scheme, adaptive spreading factor control and weighted fair queueing scheduling algorithms. Next, we discuss the requirements for the transport technologies in the radio access network to provide differentiated QoS to multiple classes of traffic. We discuss both ATM based and IP based transport solutions. Last but not least, we discuss how QoS mechanism is provided in the core network to ensure e2e quality of service requirements. We discuss how mobile terminals that use RSVP as QoS signaling mechanisms can be are supported in the 3G network which may implement only IETF diffserv mechanism. . We discuss how one can map UMTS QoS classes with IETF diffserv code points. We also discuss 2G/3G handover scenarios and how the 2G/3G QoS parameters can be mapped.

A Survey on Temperature-Aware Routing Protocols in Wireless Body Sensor Networks

Directory of Open Access Journals (Sweden)

Sangman Moh

2013-08-01

Full Text Available The rapid growth of the elderly population in the world and the rising cost of healthcare impose big issues for healthcare and medical monitoring. A Wireless Body Sensor Network (WBSN is comprised of small sensor nodes attached inside, on or around a human body, the main purpose of which is to monitor the functions and surroundings of the human body. However, the heat generated by the node’s circuitry and antenna could cause damage to the human tissue. Therefore, in designing a routing protocol for WBSNs, it is important to reduce the heat by incorporating temperature into the routing metric. The main contribution of this paper is to survey existing temperature-aware routing protocols that have been proposed for WBSNs. In this paper, we present a brief overview of WBSNs, review the existing routing protocols comparatively and discuss challenging open issues in the design of routing protocols.

A Multipath Routing Protocol Based on Clustering and Ant Colony Optimization for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jing Yang

2010-05-01

Full Text Available For monitoring burst events in a kind of reactive wireless sensor networks (WSNs, a multipath routing protocol (MRP based on dynamic clustering and ant colony optimization (ACO is proposed.. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is their limited power supply, and therefore some metrics (such as energy consumption of communication among nodes, residual energy, path length were considered as very important criteria while designing routing in the MRP. Firstly, a cluster head (CH is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in the search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance of energy consumption among nodes and reduce the average energy consumption effectively.

Novel Adaptive QoS Framework for Integrated UMTS/WLAN Environment

Directory of Open Access Journals (Sweden)

T. Shuminoski

2013-06-01

Full Text Available Since Quality of Service (QoS provisioning for multimedia traffic in integrated Wireless and Mobile Networks is becoming an increasingly important objective, in this paper we introduce a novel concept of an adaptive QoS cross-layer framework. The Adaptive QoS framework is proven via novel simulation results in integrated environment with UMTS and IEEE 802.11 networks. The aim of our novel framework is presenting a new module that shall provide the best QoS and lower cost for a given service using one or more wireless technologies in a given time. The analysis of simulation results has shown superior performances with a high level of QoS provisioning in a variety of network conditions. The performance of Adaptive QoS algorithm is evaluated using ns-miracle augmented with our dual-mode Mobile Equipments (MEs and using statistical analysis.

Evaluation of QoS supported in Network Mobility NEMO environments

International Nuclear Information System (INIS)

Hussien, L F; Abdalla, A H; Habaebi, M H; Khalifa, O O; Hassan, W H

2013-01-01

Network mobility basic support (NEMO BS) protocol is an entire network, roaming as a unit which changes its point of attachment to the Internet and consequently its reachability in the network topology. NEMO BS doesn't provide QoS guarantees to its users same as traditional Internet IP and Mobile IPv6 as well. Typically, all the users will have same level of services without considering about their application requirements. This poses a problem to real-time applications that required QoS guarantees. To gain more effective control of the network, incorporated QoS is needed. Within QoS-enabled network the traffic flow can be distributed to various priorities. Also, the network bandwidth and resources can be allocated to different applications and users. Internet Engineering Task Force (IETF) working group has proposed several QoS solutions for static network such as IntServ, DiffServ and MPLS. These QoS solutions are designed in the context of a static environment (i.e. fixed hosts and networks). However, they are not fully adapted to mobile environments. They essentially demands to be extended and adjusted to meet up various challenges involved in mobile environments. With existing QoS mechanisms many proposals have been developed to provide QoS for individual mobile nodes (i.e. host mobility). In contrary, research based on the movement of the whole mobile network in IPv6 is still undertaking by the IETF working groups (i.e. network mobility). Few researches have been done in the area of providing QoS for roaming networks. Therefore, this paper aims to review and investigate (previous /and current) related works that have been developed to provide QoS in mobile network. Consequently, a new proposed scheme will be introduced to enhance QoS within NEMO environment, achieving by which seamless mobility to users of mobile network node (MNN)

Optimising social information by game theory and ant colony method to enhance routing protocol in opportunistic networks

Directory of Open Access Journals (Sweden)

Chander Prabha

2016-09-01

Full Text Available The data loss and disconnection of nodes are frequent in the opportunistic networks. The social information plays an important role in reducing the data loss because it depends on the connectivity of nodes. The appropriate selection of next hop based on social information is critical for improving the performance of routing in opportunistic networks. The frequent disconnection problem is overcome by optimising the social information with Ant Colony Optimization method which depends on the topology of opportunistic network. The proposed protocol is examined thoroughly via analysis and simulation in order to assess their performance in comparison with other social based routing protocols in opportunistic network under various parameters settings.

Simulation of Routing Protocol with CoS/QoS Enhancements in Heterogeneous Communication Network

National Research Council Canada - National Science Library

Kubera, Emil; Sliwa, Joanna; Zubel, Krzysztof; Mroczko, Adrian

2006-01-01

The article describes the subject of QoS routing mechanism in tactical heterogeneous communication network consisting of network elements built in different technologies and connected following rules...

Function-Oriented Networking and On-Demand Routing System in Network Using Ant Colony Optimization Algorithm

Directory of Open Access Journals (Sweden)

Young-Bo Sim

2017-11-01

Full Text Available In this paper, we proposed and developed Function-Oriented Networking (FON, a platform for network users. It has a different philosophy as opposed to technologies for network managers of Software-Defined Networking technology, OpenFlow. It is a technology that can immediately reflect the demands of the network users in the network, unlike the existing OpenFlow and Network Functions Virtualization (NFV, which do not reflect directly the needs of the network users. It allows the network user to determine the policy of the direct network, so it can be applied more precisely than the policy applied by the network manager. This is expected to increase the satisfaction of the service users when the network users try to provide new services. We developed FON function that performs on-demand routing for Low-Delay Required service. We analyzed the characteristics of the Ant Colony Optimization (ACO algorithm and found that the algorithm is suitable for low-delay required services. It was also the first in the world to implement the routing software using ACO Algorithm in the real Ethernet network. In order to improve the routing performance, several algorithms of the ACO Algorithm have been developed to enable faster path search-routing and path recovery. The relationship between the network performance index and the ACO routing parameters is derived, and the results are compared and analyzed. Through this, it was possible to develop the ACO algorithm.

QoS Differential Scheduling in Cognitive-Radio-Based Smart Grid Networks: An Adaptive Dynamic Programming Approach.

Science.gov (United States)

Yu, Rong; Zhong, Weifeng; Xie, Shengli; Zhang, Yan; Zhang, Yun

2016-02-01

As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.

NQAR: Network Quality Aware Routing in Error-Prone Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jaewon Choi

2010-01-01

Full Text Available We propose a network quality aware routing (NQAR mechanism to provide an enabling method of the delay-sensitive data delivery over error-prone wireless sensor networks. Unlike the existing routing methods that select routes with the shortest arrival latency or the minimum hop count, the proposed scheme adaptively selects the route based on the network qualities including link errors and collisions with minimum additional complexity. It is designed to avoid the paths with potential noise and collision that may cause many non-deterministic backoffs and retransmissions. We propose a generic framework to select a minimum cost route that takes the packet loss rate and collision history into account. NQAR uses a data centric approach to estimate a single-hop delay based on processing time, propagation delay, packet loss rate, number of backoffs, and the retransmission timeout between two neighboring nodes. This enables a source node to choose the shortest expected end-to-end delay path to send a delay-sensitive data. The experiment results show that NQAR reduces the end-to-end transfer delay up to approximately 50% in comparison with the latency-based directed diffusion and the hop count-based directed diffusion under the error-prone network environments. Moreover, NQAR shows better performance than those routing methods in terms of jitter, reachability, and network lifetime.

Dynamic selection mechanism for quality of service aware web services

Science.gov (United States)

D'Mello, Demian Antony; Ananthanarayana, V. S.

2010-02-01

A web service is an interface of the software component that can be accessed by standard Internet protocols. The web service technology enables an application to application communication and interoperability. The increasing number of web service providers throughout the globe have produced numerous web services providing the same or similar functionality. This necessitates the use of tools and techniques to search the suitable services available over the Web. UDDI (universal description, discovery and integration) is the first initiative to find the suitable web services based on the requester's functional demands. However, the requester's requirements may also include non-functional aspects like quality of service (QoS). In this paper, the authors define a QoS model for QoS aware and business driven web service publishing and selection. The authors propose a QoS requirement format for the requesters, to specify their complex demands on QoS for the web service selection. The authors define a tree structure called quality constraint tree (QCT) to represent the requester's variety of requirements on QoS properties having varied preferences. The paper proposes a QoS broker based architecture for web service selection, which facilitates the requesters to specify their QoS requirements to select qualitatively optimal web service. A web service selection algorithm is presented, which ranks the functionally similar web services based on the degree of satisfaction of the requester's QoS requirements and preferences. The paper defines web service provider qualities to distinguish qualitatively competitive web services. The paper also presents the modelling and selection mechanism for the requester's alternative constraints defined on the QoS. The authors implement the QoS broker based system to prove the correctness of the proposed web service selection mechanism.

A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem.

Science.gov (United States)

Li-Ning Xing; Rohlfshagen, P; Ying-Wu Chen; Xin Yao

2011-08-01

The capacitated arc routing problem (CARP) is representative of numerous practical applications, and in order to widen its scope, we consider an extended version of this problem that entails both total service time and fixed investment costs. We subsequently propose a hybrid ant colony optimization (ACO) algorithm (HACOA) to solve instances of the extended CARP. This approach is characterized by the exploitation of heuristic information, adaptive parameters, and local optimization techniques: Two kinds of heuristic information, arc cluster information and arc priority information, are obtained continuously from the solutions sampled to guide the subsequent optimization process. The adaptive parameters ease the burden of choosing initial values and facilitate improved and more robust results. Finally, local optimization, based on the two-opt heuristic, is employed to improve the overall performance of the proposed algorithm. The resulting HACOA is tested on four sets of benchmark problems containing a total of 87 instances with up to 140 nodes and 380 arcs. In order to evaluate the effectiveness of the proposed method, some existing capacitated arc routing heuristics are extended to cope with the extended version of this problem; the experimental results indicate that the proposed ACO method outperforms these heuristics.

TD-LTE Wireless Private Network QoS Transmission Protection

Science.gov (United States)

Zhang, Jianming; Cheng, Chao; Wu, Zanhong

With the commencement of construction of the smart grid, the demand power business for reliability and security continues to improve, the reliability transmission of power TD-LTE Wireless Private Network are more and more attention. For TD-LTE power private network, it can provide different QoS services according to the user's business type, to protect the reliable transmission of business. This article describes in detail the AF module of PCC in the EPC network, specifically introduces set up AF module station and QoS mechanisms in the EPS load, fully considers the business characteristics of the special power network, establishing a suitable architecture for mapping QoS parameters, ensuring the implementation of each QoS business. Through using radio bearer management, we can achieve the reliable transmission of each business on physical channel.

QoS Predictability of Internet Services

Science.gov (United States)

Bilski, Tomasz

The paper presents problems of QoS (Quality of Service) predictability of network services (mainly in WAN environment). In the first part we present general remarks on QoS predictability problem, mentioning some research projects and available resources. The main part of the paper deals with QoS predictability in long-term as well as short-term viewpoints. We will try to answer a question: is it possible to predict network QoS/performance level with a use of statistical data from the past? The term quality of service has many meanings ranging from the user's qualitative perception of the service to a set of quantitative connection parameters (RTT (Round Trip Time), throughput, loss packet rate) necessary to achieve particular service quality. In the paper we will mostly use the second meaning of the term based on RFC 2386 [1]. Analyzed, statistical data on Internet performance are taken from the IEPM (Internet End-to-end Performance Measurement) database.

Network based control point for UPnP QoS architecture

DEFF Research Database (Denmark)

Brewka, Lukasz Jerzy; Wessing, Henrik; Rossello Busquet, Ana

2011-01-01

Enabling coexistence of non-UPnP Devices in an UPnP QoS Architecture is an important issue that might have a major impact on the deployment and usability of UPnP in future home networks. The work presented here shows potential issues of placing non-UPnP Device in the network managed by UPnP QoS. We...... address this issue by extensions to the UPnP QoS Architecture that can prevent non-UPnP Devices from degrading the overall QoS level. The obtained results show that deploying Network Based Control Point service with efficient traffic classifier, improves significantly the end-to-end packet delay...

La-CTP: Loop-Aware Routing for Energy-Harvesting Wireless Sensor Networks.

Science.gov (United States)

Sun, Guodong; Shang, Xinna; Zuo, Yan

2018-02-02

In emerging energy-harvesting wireless sensor networks (EH-WSN), the sensor nodes can harvest environmental energy to drive their operation, releasing the user's burden in terms of frequent battery replacement, and even enabling perpetual sensing systems. In EH-WSN applications, usually, the node in energy-harvesting or recharging state has to stop working until it completes the energy replenishment. However, such temporary departures of recharging nodes severely impact the packet routing, and one immediate result is the routing loop problem. Controlling loops in connectivity-intermittent EH-WSN in an efficient way is a big challenge in practice, and so far, users still lack of effective and practicable routing protocols with loop handling. Based on the Collection Tree Protocol (CTP) widely used in traditional wireless sensor networks, this paper proposes a loop-aware routing protocol for real-world EH-WSNs, called La-CTP, which involves a new parent updating metric and a proactive, adaptive beaconing scheme to effectively suppress the occurrence of loops and unlock unavoidable loops, respectively. We constructed a 100-node testbed to evaluate La-CTP, and the experimental results showed its efficacy and efficiency.

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

Science.gov (United States)

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-hoon

2017-01-01

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads. PMID:28531159

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks.

Science.gov (United States)

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-Hoon

2017-05-22

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads.

GRAdient Cost Establishment (GRACE for an Energy-Aware Routing in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Noor M. Khan

2009-01-01

Full Text Available In Wireless Sensor Network (WSN, the nodes have limitations in terms of energy-constraint, unreliable links, and frequent topology change. In this paper we propose an energy-aware routing protocol, that outperforms the existing ones with an enhanced network lifetime and more reliable data delivery. Major issues in the design of a routing strategy in wireless sensor networks are to make efficient use of energy and to increase reliability in data delivery. The proposed approach reduces both energy consumption and communication-bandwidth requirements and prolongs the lifetime of the wireless sensor network. Using both analysis and extensive simulations, we show that the proposed dynamic routing helps achieve the desired system performance under dynamically changing network conditions. The proposed algorithm is compared with one of the best existing routing algorithms, GRAB. Moreover, a modification in GRAB is proposed which not only improves its performance but also prolongs its lifetime.

A comprehensive survey of energy-aware routing protocols in wireless body area sensor networks.

Science.gov (United States)

Effatparvar, Mehdi; Dehghan, Mehdi; Rahmani, Amir Masoud

2016-09-01

Wireless body area sensor network is a special purpose wireless sensor network that, employing wireless sensor nodes in, on, or around the human body, makes it possible to measure biological parameters of a person for specific applications. One of the most fundamental concerns in wireless body sensor networks is accurate routing in order to send data promptly and properly, and therefore overcome some of the challenges. Routing protocols for such networks are affected by a large number of factors including energy, topology, temperature, posture, the radio range of sensors, and appropriate quality of service in sensor nodes. Since energy is highly important in wireless body area sensor networks, and increasing the network lifetime results in benefiting greatly from sensor capabilities, improving routing performance with reduced energy consumption presents a major challenge. This paper aims to study wireless body area sensor networks and the related routing methods. It also presents a thorough, comprehensive review of routing methods in wireless body area sensor networks from the perspective of energy. Furthermore, different routing methods affecting the parameter of energy will be classified and compared according to their advantages and disadvantages. In this paper, fundamental concepts of wireless body area sensor networks are provided, and then the advantages and disadvantages of these networks are investigated. Since one of the most fundamental issues in wireless body sensor networks is to perform routing so as to transmit data precisely and promptly, we discuss the same issue. As a result, we propose a classification of the available relevant literature with respect to the key challenge of energy in the routing process. With this end in view, all important papers published between 2000 and 2015 are classified under eight categories including 'Mobility-Aware', 'Thermal-Aware', 'Restriction of Location and Number of Relays', 'Link-aware', 'Cluster- and Tree

QoS Negotiation and Renegotiation Based on Mobile Agents

Institute of Scientific and Technical Information of China (English)

ZHANG Shi-bing; ZHANG Deng-yin

2006-01-01

The Quality of Service (QoS) has received more and more attention since QoS becomes increasingly important in the Internet development. Mobile software agents represent a valid alternative to the implementation of strategies for the negotiation. In this paper, a QoS negotiation and renegotiation system architecture based on mobile agents is proposed. The agents perform the task in the whole process. Therefore, such a system can reduce the network load, overcome latency, and avoid frequent exchange information between clients and server. The simulation results show that the proposed system could improve the network resource utility about 10%.

Efficient QoS-aware Service Composition

Science.gov (United States)

Alrifai, Mohammad; Risse, Thomas

Web service composition requests are usually combined with endto-end QoS requirements, which are specified in terms of non-functional properties (e.g. response time, throughput and price). The goal of QoS-aware service composition is to find the best combination of services such that their aggregated QoS values meet these end-to-end requirements. Local selection techniques are very efficient but fail short in handling global QoS constraints. Global optimization techniques, on the other hand, can handle global constraints, but their poor performance render them inappropriate for applications with dynamic and real-time requirements. In this paper we address this problem and propose a solution that combines global optimization with local selection techniques for achieving a better performance. The proposed solution consists of two steps: first we use mixed integer linear programming (MILP) to find the optimal decomposition of global QoS constraints into local constraints. Second, we use local search to find the best web services that satisfy these local constraints. Unlike existing MILP-based global planning solutions, the size of the MILP model in our case is much smaller and independent on the number of available services, yields faster computation and more scalability. Preliminary experiments have been conducted to evaluate the performance of the proposed solution.

Cross Layer QoS Provisioning in Home Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Brewka, Lukasz Jerzy; Ruepp, Sarah Renée

2011-01-01

This paper introduces an innovative QoS provisioning scheme in home networks, by utilizing Optical Wireless (OW) MAC specification proposed by Home Gigabit Access Project (OMEGA) project. The specification is characterized by its resource reservation protocol and the use of Time Division Multiple...... Access (TDMA). By adopting OW MAC to the widely supported Universal Plug and Play – Quality of Service (UPnP-QoS) Architecture in the simulated home domain, algorithms for cross layer mapping QoS requirements are proposed. Compared to utilizing WLAN MAC, our scheme is able to provide guaranteed Qo......S levels to streams with different priorities, especially to delay-sensitive services. Efficiencies of the algorithms and network performance are validated by analyzing the results collected from OPNET simulation models....

Time-Aware Service Ranking Prediction in the Internet of Things Environment.

Science.gov (United States)

Huang, Yuze; Huang, Jiwei; Cheng, Bo; He, Shuqing; Chen, Junliang

2017-04-27

With the rapid development of the Internet of things (IoT), building IoT systems with high quality of service (QoS) has become an urgent requirement in both academia and industry. During the procedures of building IoT systems, QoS-aware service selection is an important concern, which requires the ranking of a set of functionally similar services according to their QoS values. In reality, however, it is quite expensive and even impractical to evaluate all geographically-dispersed IoT services at a single client to obtain such a ranking. Nevertheless, distributed measurement and ranking aggregation have to deal with the high dynamics of QoS values and the inconsistency of partial rankings. To address these challenges, we propose a time-aware service ranking prediction approach named TSRPred for obtaining the global ranking from the collection of partial rankings. Specifically, a pairwise comparison model is constructed to describe the relationships between different services, where the partial rankings are obtained by time series forecasting on QoS values. The comparisons of IoT services are formulated by random walks, and thus, the global ranking can be obtained by sorting the steady-state probabilities of the underlying Markov chain. Finally, the efficacy of TSRPred is validated by simulation experiments based on large-scale real-world datasets.

Time-Aware Service Ranking Prediction in the Internet of Things Environment

Directory of Open Access Journals (Sweden)

Yuze Huang

2017-04-01

Full Text Available With the rapid development of the Internet of things (IoT, building IoT systems with high quality of service (QoS has become an urgent requirement in both academia and industry. During the procedures of building IoT systems, QoS-aware service selection is an important concern, which requires the ranking of a set of functionally similar services according to their QoS values. In reality, however, it is quite expensive and even impractical to evaluate all geographically-dispersed IoT services at a single client to obtain such a ranking. Nevertheless, distributed measurement and ranking aggregation have to deal with the high dynamics of QoS values and the inconsistency of partial rankings. To address these challenges, we propose a time-aware service ranking prediction approach named TSRPred for obtaining the global ranking from the collection of partial rankings. Specifically, a pairwise comparison model is constructed to describe the relationships between different services, where the partial rankings are obtained by time series forecasting on QoS values. The comparisons of IoT services are formulated by random walks, and thus, the global ranking can be obtained by sorting the steady-state probabilities of the underlying Markov chain. Finally, the efficacy of TSRPred is validated by simulation experiments based on large-scale real-world datasets.

An Intelligent QoS Identification for Untrustworthy Web Services Via Two-phase Neural Networks

OpenAIRE

Wang, Weidong; Wang, Liqiang; Lu, Wei

2016-01-01

QoS identification for untrustworthy Web services is critical in QoS management in the service computing since the performance of untrustworthy Web services may result in QoS downgrade. The key issue is to intelligently learn the characteristics of trustworthy Web services from different QoS levels, then to identify the untrustworthy ones according to the characteristics of QoS metrics. As one of the intelligent identification approaches, deep neural network has emerged as a powerful techniqu...

Visual cues for the retrieval of landmark memories by navigating wood ants.

Science.gov (United States)

Harris, Robert A; Graham, Paul; Collett, Thomas S

2007-01-23

Even on short routes, ants can be guided by multiple visual memories. We investigate here the cues controlling memory retrieval as wood ants approach a one- or two-edged landmark to collect sucrose at a point along its base. In such tasks, ants store the desired retinal position of landmark edges at several points along their route. They guide subsequent trips by retrieving the appropriate memory and moving to bring the edges in the scene toward the stored positions. The apparent width of the landmark turns out to be a powerful cue for retrieving the desired retinal position of a landmark edge. Two other potential cues, the landmark's apparent height and the distance that the ant walks, have little effect on memory retrieval. A simple model encapsulates these conclusions and reproduces the ants' routes in several conditions. According to this model, the ant stores a look-up table. Each entry contains the apparent width of the landmark and the desired retinal position of vertical edges. The currently perceived width provides an index for retrieving the associated stored edge positions. The model accounts for the population behavior of ants and the idiosyncratic training routes of individual ants. Our results imply binding between the edge of a shape and its width and, further, imply that assessing the width of a shape does not depend on the presence of any particular local feature, such as a landmark edge. This property makes the ant's retrieval and guidance system relatively robust to edge occlusions.

Applications of a saving method with max-min ant system to a vehicle routing problem with time windows and speed limits

Directory of Open Access Journals (Sweden)

Suphan Sodsoon

2014-06-01

Full Text Available This study aims to solve a Vehicle Routing Problem with Time Windows and Speed Limits (VRPTWSL, which has received considerable attention in recent years. The vehicle routing problem with time windows is an extension of the well-known Vehicle Routing Problem (VRP and involves a fleet of vehicles set of from a depot to serve a number of customers at different geographic locations with various demands within specific time and speed limits before returning to the depot eventually. To solve the problem, an efficient Saving Method-Max Min Ant System (Saving-MMAS with Local Search algorithm is applied. Using minimization of the total transportation costs as the objective of the extension VRPTWSL, a mathematic model is constructed. Finally, the Saving-MMAS algorithms indicated the good quality of the method in this problem.

RACOON: a multiuser QoS design for mobile wireless body area networks.

Science.gov (United States)

Cheng, Shihheng; Huang, Chingyao; Tu, Chun Chen

2011-10-01

In this study, Random Contention-based Resource Allocation (RACOON) medium access control (MAC) protocol is proposed to support the quality of service (QoS) for multi-user mobile wireless body area networks (WBANs). Different from existing QoS designs that focus on a single WBAN, a multiuser WBAN QoS should further consider both inter-WBAN interference and inter-WBAN priorities. Similar problems have been studied in both overlapped wireless local area networks (WLANs) and Bluetooth piconets that need QoS supports. However, these solutions are designed for non-medical transmissions that do not consider any priority scheme for medical applications. Most importantly, these studies focus on only static or low mobility networks. Network mobility of WBANs will introduce unnecessary inter-network collisions and energy waste, which are not considered by these solutions. The proposed multiuser-QoS protocol, RACOON, simultaneously satisfies the inter WBAN QoS requirements and overcomes the performance degradation caused by WBAN mobility. Simulation results verify that RACOON provides better latency and energy control, as compared with WBAN QoS protocols without considering the inter-WBAN requirements.

Fault Activity Aware Service Delivery in Wireless Sensor Networks for Smart Cities

Directory of Open Access Journals (Sweden)

Xiaomei Zhang

2017-01-01

Full Text Available Wireless sensor networks (WSNs are increasingly used in smart cities which involve multiple city services having quality of service (QoS requirements. When misbehaving devices exist, the performance of current delivery protocols degrades significantly. Nonetheless, the majority of existing schemes either ignore the faulty behaviors’ variability and time-variance in city environments or focus on homogeneous traffic for traditional data services (simple text messages rather than city services (health care units, traffic monitors, and video surveillance. We consider the problem of fault-aware multiservice delivery, in which the network performs secure routing and rate control in terms of fault activity dynamic metric. To this end, we first design a distributed framework to estimate the fault activity information based on the effects of nondeterministic faulty behaviors and to incorporate these estimates into the service delivery. Then we present a fault activity geographic opportunistic routing (FAGOR algorithm addressing a wide range of misbehaviors. We develop a leaky-hop model and design a fault activity rate-control algorithm for heterogeneous traffic to allocate resources, while guaranteeing utility fairness among multiple city services. Finally, we demonstrate the significant performance of our scheme in routing performance, effective utility, and utility fairness in the presence of misbehaving sensors through extensive simulations.

RELIABLE DYNAMIC SOURCE ROUTING PROTOCOL (RDSRP FOR ENERGY HARVESTING WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

B. Narasimhan

2015-03-01

Full Text Available Wireless sensor networks (WSNs carry noteworthy pros over traditional communication. Though, unkind and composite environments fake great challenges in the reliability of WSN communications. It is more vital to develop a reliable unipath dynamic source routing protocol (RDSRPl for WSN to provide better quality of service (QoS in energy harvesting wireless sensor networks (EH-WSN. This paper proposes a dynamic source routing approach for attaining the most reliable route in EH-WSNs. Performance evaluation is carried out using NS-2 and throughput and packet delivery ratio are chosen as the metrics.

Least loaded and route fragmentation aware RSA strategies for elastic optical networks

Science.gov (United States)

Batham, Deepak; Yadav, Dharmendra Singh; Prakash, Shashi

2017-12-01

Elastic optical networks (EONs) provide flexibility to assign wide range of spectral resources to the connection requests. In this manuscript, we address two issues related to spectrum assignment in EONs: the non uniform spectrum assignment along different links of the route and the spectrum fragmentation in the network. To address these issues, two routing and spectrum assignment (RSA) strategies have been proposed: Least Loaded RSA (LLRSA) and Route Fragmentation Aware RSA (RFARSA). The LLRSA allocates spectrum homogeneously along different links in the network, where as RFARSA accords priority to the routes which are less fragmented. To highlight the salient features of the two strategies, two new metrics, route fragmentation index (RFI) and standard deviation (SD) are introduced. RFI is defined as the ratio of non-contiguous FSs to the total available free FSs on the route, and SD relates to the measure of non-uniformity in the allocation of resources on the links in the network. A simulation program has been developed to evaluate the performance of the proposed (LLRSA and RFARSA) strategies, and the existing strategies of shortest path RSA (SPRSA) and spectrum compactness based defragmentation (SCD) strategies, on the metric of RFI, bandwidth blocking probability (BBP), network capacity utilized, and SD. The variation in the metrics on the basis of number of requests and the bandwidth (number of FSs) requested has been studied. It has been conclusively established that the proposed strategies (LLRSA and RFARSA) outperform the existing strategies in terms of all the metrics.

Optimal Network QoS over the Internet of Vehicles for E-Health Applications

Directory of Open Access Journals (Sweden)

Di Lin

2016-01-01

Full Text Available Wireless technologies are pervasive to support ubiquitous healthcare applications. However, a critical issue of using wireless communications under a healthcare scenario is the electromagnetic interference (EMI caused by RF transmission, and a high level of EMI may lead to a critical malfunction of medical sensors. In consideration of EMI on medical sensors, we study the optimization of quality of service (QoS within the whole Internet of vehicles for E-health and propose a novel model to optimize the QoS by allocating the transmit power of each user. Our results show that the optimal power control policy depends on the objective of optimization problems: a greedy policy is optimal to maximize the summation of QoS of each user, whereas a fair policy is optimal to maximize the product of QoS of each user. Algorithms are taken to derive the optimal policies, and numerical results of optimizing QoS are presented for both objectives and QoS constraints.

Analyzing Comprehensive QoS with Security Constraints for Services Composition Applications in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Naixue Xiong

2014-12-01

Full Text Available Services composition is fundamental to software development in multi-service wireless sensor networks (WSNs. The quality of service (QoS of services composition applications (SCAs are confronted with severe challenges due to the open, dynamic, and complex natures of WSNs. Most previous research separated various QoS indices into different fields and studied them individually due to the computational complexity. This approach ignores the mutual influence between these QoS indices, and leads to a non-comprehensive and inaccurate analysis result. The universal generating function (UGF shows the speediness and precision in QoS analysis. However, only one QoS index at a time can be analyzed by the classic UGF. In order to efficiently analyze the comprehensive QoS of SCAs, this paper proposes an improved UGF technique—vector universal generating function (VUGF—which considers the relationship between multiple QoS indices, including security, and can simultaneously analyze multiple QoS indices. The numerical examples demonstrate that it can be used for the evaluation of the comprehensive QoS of SCAs subjected to the security constraint in WSNs. Therefore, it can be effectively applied to the optimal design of multi-service WSNs.

Analyzing comprehensive QoS with security constraints for services composition applications in wireless sensor networks.

Science.gov (United States)

Xiong, Naixue; Wu, Zhao; Huang, Yannong; Xu, Degang

2014-12-01

Services composition is fundamental to software development in multi-service wireless sensor networks (WSNs). The quality of service (QoS) of services composition applications (SCAs) are confronted with severe challenges due to the open, dynamic, and complex natures of WSNs. Most previous research separated various QoS indices into different fields and studied them individually due to the computational complexity. This approach ignores the mutual influence between these QoS indices, and leads to a non-comprehensive and inaccurate analysis result. The universal generating function (UGF) shows the speediness and precision in QoS analysis. However, only one QoS index at a time can be analyzed by the classic UGF. In order to efficiently analyze the comprehensive QoS of SCAs, this paper proposes an improved UGF technique-vector universal generating function (VUGF)-which considers the relationship between multiple QoS indices, including security, and can simultaneously analyze multiple QoS indices. The numerical examples demonstrate that it can be used for the evaluation of the comprehensive QoS of SCAs subjected to the security constraint in WSNs. Therefore, it can be effectively applied to the optimal design of multi-service WSNs.

A Proposal for IoT Dynamic Routes Selection Based on Contextual Information.

Science.gov (United States)

Araújo, Harilton da Silva; Filho, Raimir Holanda; Rodrigues, Joel J P C; Rabelo, Ricardo de A L; Sousa, Natanael de C; Filho, José C C L S; Sobral, José V V

2018-01-26

The Internet of Things (IoT) is based on interconnection of intelligent and addressable devices, allowing their autonomy and proactive behavior with Internet connectivity. Data dissemination in IoT usually depends on the application and requires context-aware routing protocols that must include auto-configuration features (which adapt the behavior of the network at runtime, based on context information). This paper proposes an approach for IoT route selection using fuzzy logic in order to attain the requirements of specific applications. In this case, fuzzy logic is used to translate in math terms the imprecise information expressed by a set of linguistic rules. For this purpose, four Objective Functions (OFs) are proposed for the Routing Protocol for Low Power and Loss Networks (RPL); such OFs are dynamically selected based on context information. The aforementioned OFs are generated from the fusion of the following metrics: Expected Transmission Count (ETX), Number of Hops (NH) and Energy Consumed (EC). The experiments performed through simulation, associated with the statistical data analysis, conclude that this proposal provides high reliability by successfully delivering nearly 100% of data packets, low delay for data delivery and increase in QoS. In addition, an 30% improvement is attained in the network life time when using one of proposed objective function, keeping the devices alive for longer duration.

A Proposal for IoT Dynamic Routes Selection Based on Contextual Information

Directory of Open Access Journals (Sweden)

Harilton da Silva Araújo

2018-01-01

Full Text Available The Internet of Things (IoT is based on interconnection of intelligent and addressable devices, allowing their autonomy and proactive behavior with Internet connectivity. Data dissemination in IoT usually depends on the application and requires context-aware routing protocols that must include auto-configuration features (which adapt the behavior of the network at runtime, based on context information. This paper proposes an approach for IoT route selection using fuzzy logic in order to attain the requirements of specific applications. In this case, fuzzy logic is used to translate in math terms the imprecise information expressed by a set of linguistic rules. For this purpose, four Objective Functions (OFs are proposed for the Routing Protocol for Low Power and Loss Networks (RPL; such OFs are dynamically selected based on context information. The aforementioned OFs are generated from the fusion of the following metrics: Expected Transmission Count (ETX, Number of Hops (NH and Energy Consumed (EC. The experiments performed through simulation, associated with the statistical data analysis, conclude that this proposal provides high reliability by successfully delivering nearly 100% of data packets, low delay for data delivery and increase in QoS. In addition, an 30% improvement is attained in the network life time when using one of proposed objective function, keeping the devices alive for longer duration.

APIs for QoS configuration in Software Defined Networks

DEFF Research Database (Denmark)

Caba, Cosmin Marius; Soler, José

2015-01-01

The OpenFlow (OF) protocol is widely used in Software Defined Networking (SDN) to realize the communication between the controller and forwarding devices. OF allows great flexibility in managing traffic flows. However, OF alone is not enough to build more complex SDN services that require complete...... such as configuration of devices, ports, queues, etc. An Application Programming Interface (API) for dynamic configuration of QoS resources in the network devices is implemented herein, by using the capabilities of OVSDB. Further, the paper demonstrates the possibility to create network services with coarse granularity...... on top of the fine granular services exposed by the QoS configuration API at the SDNC. A series of tests emphasize the capabilities and the performance of the implemented QoS configuration API....

On the end-user QoS-awareness of a distributed service environment

NARCIS (Netherlands)

Widya, I.; Stap, R.E.; Teunissen, L.J.; Hopman, B.F.

2001-01-01

A lot of attention has been given to network quality of service and efforts to make layers on top of the network also QoS-aware increase noticeably. This paper explores QoS-aware service provisioning at a level close to end-user's perception. It shows how end-user oriented QoS requirements have been

Routing in opportunistic networks

CERN Document Server

Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

2013-01-01

This book provides a comprehensive guide to selected topics, both ongoing and emerging, in routing in OppNets. The book is edited by worldwide technical leaders, prolific researchers and outstanding academics, Dr. Isaac Woungang and co-editors, Dr. Sanjay Kumar Dhurandher, Prof. Alagan Anpalagan and Prof. Athanasios Vasilakos. Consisting of contributions from well known and high profile researchers and scientists in their respective specialties, the main topics that are covered in this book include mobility and routing, social-aware routing, context-based routing, energy-aware routing, incentive-aware routing, stochastic routing, modeling of intermittent connectivity, in both infrastructure and infrastructure-less OppNets. Key Features: Discusses existing and emerging techniques for routing in infrastructure and infrastructure-less OppNets. Provides a unified covering of otherwise disperse selected topics on routing in infrastructure and infrastructure-less OppNets.  Includes a set of PowerPoint slides and g...

Congestion control and routing over satellite networks

Science.gov (United States)

Cao, Jinhua

Satellite networks and transmissions find their application in fields of computer communications, telephone communications, television broadcasting, transportation, space situational awareness systems and so on. This thesis mainly focuses on two networking issues affecting satellite networking: network congestion control and network routing optimization. Congestion, which leads to long queueing delays, packet losses or both, is a networking problem that has drawn the attention of many researchers. The goal of congestion control mechanisms is to ensure high bandwidth utilization while avoiding network congestion by regulating the rate at which traffic sources inject packets into a network. In this thesis, we propose a stable congestion controller using data-driven, safe switching control theory to improve the dynamic performance of satellite Transmission Control Protocol/Active Queue Management (TCP/AQM) networks. First, the stable region of the Proportional-Integral (PI) parameters for a nominal model is explored. Then, a PI controller, whose parameters are adaptively tuned by switching among members of a given candidate set, using observed plant data, is presented and compared with some classical AQM policy examples, such as Random Early Detection (RED) and fixed PI control. A new cost detectable switching law with an interval cost function switching algorithm, which improves the performance and also saves the computational cost, is developed and compared with a law commonly used in the switching control literature. Finite-gain stability of the system is proved. A fuzzy logic PI controller is incorporated as a special candidate to achieve good performance at all nominal points with the available set of candidate controllers. Simulations are presented to validate the theory. An effocient routing algorithm plays a key role in optimizing network resources. In this thesis, we briefly analyze Low Earth Orbit (LEO) satellite networks, review the Cross Entropy (CE

A Context-Aware Adaptive Streaming Media Distribution System in a Heterogeneous Network with Multiple Terminals

Directory of Open Access Journals (Sweden)

Yepeng Ni

2016-01-01

Full Text Available We consider the problem of streaming media transmission in a heterogeneous network from a multisource server to home multiple terminals. In wired network, the transmission performance is limited by network state (e.g., the bandwidth variation, jitter, and packet loss. In wireless network, the multiple user terminals can cause bandwidth competition. Thus, the streaming media distribution in a heterogeneous network becomes a severe challenge which is critical for QoS guarantee. In this paper, we propose a context-aware adaptive streaming media distribution system (CAASS, which implements the context-aware module to perceive the environment parameters and use the strategy analysis (SA module to deduce the most suitable service level. This approach is able to improve the video quality for guarantying streaming QoS. We formulate the optimization problem of QoS relationship with the environment parameters based on the QoS testing algorithm for IPTV in ITU-T G.1070. We evaluate the performance of the proposed CAASS through 12 types of experimental environments using a prototype system. Experimental results show that CAASS can dynamically adjust the service level according to the environment variation (e.g., network state and terminal performances and outperforms the existing streaming approaches in adaptive streaming media distribution according to peak signal-to-noise ratio (PSNR.

A QoS Scheme for a Congestion Core Network Based on Dissimilar QoS Structures in Smart-Phone Environments

Science.gov (United States)

Hong, Sung-Ryong; Na, Wonshik; Kang, Jang-Mook

2010-01-01

This study suggests an approach to effective transmission of multimedia content in a rapidly changing Internet environment including smart-phones. Guaranteeing QoS in networks is currently an important research topic. When transmitting Assured Forwarding (AF) packets in a Multi-DiffServ network environment, network A may assign priority in an order AF1, AF2, AF3 and AF4; on the other hand, network B may reverse the order to a priority AF4, AF3, AF2 and AF1. In this case, the AF1 packets that received the best quality of service in network A will receive the lowest in network B, which may result in dropping of packets in network B and vice versa. This study suggests a way to guarantee QoS between hosts by minimizing the loss of AF packet class when one network transmits AF class packets to another network with differing principles. It is expected that QoS guarantees and their experimental value may be utilized as principles which can be applied to various mobile-web environments based on smart-phones. PMID:22163453

Performance of Flow-Aware Networking in LTE backbone

DEFF Research Database (Denmark)

Sniady, Aleksander; Soler, José

2012-01-01

technologies, such as Long Term Evolution (LTE). This paper proposes usage of a modified Flow Aware Networking (FAN) technique for enhancing Quality of Service (QoS) in the all-IP transport networks underlying LTE backbone. The results obtained with OPNET Modeler show that FAN, in spite of being relatively...

CCSDS Advanced Orbiting Systems Virtual Channel Access Service for QoS MACHETE Model

Science.gov (United States)

Jennings, Esther H.; Segui, John S.

2011-01-01

To support various communications requirements imposed by different missions, interplanetary communication protocols need to be designed, validated, and evaluated carefully. Multimission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE), described in "Simulator of Space Communication Networks" (NPO-41373), NASA Tech Briefs, Vol. 29, No. 8 (August 2005), p. 44, combines various tools for simulation and performance analysis of space networks. The MACHETE environment supports orbital analysis, link budget analysis, communications network simulations, and hardware-in-the-loop testing. By building abstract behavioral models of network protocols, one can validate performance after identifying the appropriate metrics of interest. The innovators have extended the MACHETE model library to include a generic link-layer Virtual Channel (VC) model supporting quality-of-service (QoS) controls based on IP streams. The main purpose of this generic Virtual Channel model addition was to interface fine-grain flow-based QoS (quality of service) between the network and MAC layers of the QualNet simulator, a commercial component of MACHETE. This software model adds the capability of mapping IP streams, based on header fields, to virtual channel numbers, allowing extended QoS handling at link layer. This feature further refines the QoS v existing at the network layer. QoS at the network layer (e.g. diffserv) supports few QoS classes, so data from one class will be aggregated together; differentiating between flows internal to a class/priority is not supported. By adding QoS classification capability between network and MAC layers through VC, one maps multiple VCs onto the same physical link. Users then specify different VC weights, and different queuing and scheduling policies at the link layer. This VC model supports system performance analysis of various virtual channel link-layer QoS queuing schemes independent of the network-layer QoS systems.

Many-to-Many Multicast Routing Schemes under a Fixed Topology

Directory of Open Access Journals (Sweden)

Wei Ding

2013-01-01

Full Text Available Many-to-many multicast routing can be extensively applied in computer or communication networks supporting various continuous multimedia applications. The paper focuses on the case where all users share a common communication channel while each user is both a sender and a receiver of messages in multicasting as well as an end user. In this case, the multicast tree appears as a terminal Steiner tree (TeST. The problem of finding a TeST with a quality-of-service (QoS optimization is frequently NP-hard. However, we discover that it is a good idea to find a many-to-many multicast tree with QoS optimization under a fixed topology. In this paper, we are concerned with three kinds of QoS optimization objectives of multicast tree, that is, the minimum cost, minimum diameter, and maximum reliability. All of three optimization problems are distributed into two types, the centralized and decentralized version. This paper uses the dynamic programming method to devise an exact algorithm, respectively, for the centralized and decentralized versions of each optimization problem.

Eavesdropping-aware routing and spectrum allocation based on multi-flow virtual concatenation for confidential information service in elastic optical networks

Science.gov (United States)

Bai, Wei; Yang, Hui; Yu, Ao; Xiao, Hongyun; He, Linkuan; Feng, Lei; Zhang, Jie

2018-01-01

The leakage of confidential information is one of important issues in the network security area. Elastic Optical Networks (EON) as a promising technology in the optical transport network is under threat from eavesdropping attacks. It is a great demand to support confidential information service (CIS) and design efficient security strategy against the eavesdropping attacks. In this paper, we propose a solution to cope with the eavesdropping attacks in routing and spectrum allocation. Firstly, we introduce probability theory to describe eavesdropping issue and achieve awareness of eavesdropping attacks. Then we propose an eavesdropping-aware routing and spectrum allocation (ES-RSA) algorithm to guarantee information security. For further improving security and network performance, we employ multi-flow virtual concatenation (MFVC) and propose an eavesdropping-aware MFVC-based secure routing and spectrum allocation (MES-RSA) algorithm. The presented simulation results show that the proposed two RSA algorithms can both achieve greater security against the eavesdropping attacks and MES-RSA can also improve the network performance efficiently.

Uplink Cross-Layer Scheduling with Differential QoS Requirements in OFDMA Systems

Directory of Open Access Journals (Sweden)

Chen Wei

2010-01-01

Full Text Available Fair and efficient scheduling is a key issue in cross-layer design for wireless communication systems, such as 3GPP LTE and WiMAX. However, few works have considered the multiaccess of the traffic with differential QoS requirements in wireless systems. In this paper, we will consider an OFDMA-based wireless system with four types of traffic associated with differential QoS requirements, namely, minimum reserved rate, maximum sustainable rate, maximum latency, and tolerant jitter. Given these QoS requirements, the traffic scheduling will be formulated into a cross-layer optimization problem, which is convex fortunately. By separating the power allocation through the waterfilling algorithm in each user, this problem will further reduce to a kind of continuous quadratic knapsack problem in the base station which yields low complexity. It is then demonstrated that the proposed cross-layer method cannot only guarantee the application layer QoS requirements, but also minimizes the integrated residual workload in the MAC layer. To further enhance the ability of QoS assurance in heavily loaded scenario, a call admission control scheme will also be proposed. The simulation results show that the QoS requirements for the four types of traffic are guaranteed effectively by the proposed algorithms.

Using Kalman Filter to Guarantee QoS Robustness of Web Server

Institute of Scientific and Technical Information of China (English)

无

2006-01-01

The exponential growth of the Internet coupled with the increasing popularity of dynamically generated content on the World Wide Web, has created the need for more and faster Web servers capable of serving the over 100 million Internet users. To converge the control method has emerged as a promising technique to solve the Web QoS problem. In this paper, a model of adaptive session is presented and a session flow self-regulating algorism based on Kalman Filter are proposed towards Web Server. And a Web QoS self-regulating scheme is advanced. To attain the goal of on-line system identification, the optimized estimation of QoS parameters is fulfilled by utilizing Kalman Filter in full domain. The simulation results shows that the proposed scheme can guarantee the QoS with both robustness and stability .

BP Network Control for Resource Allocation and QoS Ensurance in UAV Cloud

Directory of Open Access Journals (Sweden)

Ang Gao

2018-01-01

Full Text Available Unmanned aerial vehicle (UAV cloud can greatly enhance the intelligence of unmanned systems by dynamically unloading the compute-intensive applications to cloud. For the uncertain nature of UAV missions and fast-changing environment, different UAV applications may have different quality of service (QoS requirements. This paper proposes a mixed QoS ensurance and energy-balanced (MQEB architecture for UAV cloud from a view of control theory, which can support both hard and soft QoS ensurance with the consideration of energy saving. The hard and soft QoS requirements are decoupled by being normalized into a two-level cascaded feedback loop. The former is time slot loop (TS-Loop to enforce the absolute QoS ensurance for real-time applications, and the latter is contention window loop (CW-Loop to enforce the plastic QoS ensurance for non-real-time applications. Finally, the back propagating (BP neuron network is used for parameters’ self-tuning and controller design. The hardware experiments demonstrate the feasibility of MQEB. In heavy load, MQEB has greater throughput and better energy efficiency, and in light load, MQBE has lower total power consumption.

Compromises Between Quality of Service Metrics and Energy Consumption of Hierarchical and Flat Routing Protocols for Wireless Sensors Network

Directory of Open Access Journals (Sweden)

Abdelbari BEN YAGOUTA

2016-11-01

Full Text Available Wireless Sensor Network (WSN is wireless network composed of spatially distributed and tiny autonomous nodes, which cooperatively monitor physical or environmental conditions. Among the concerns of these networks is prolonging the lifetime by saving nodes energy. There are several protocols specially designed for WSNs based on energy conservation. However, many WSNs applications require QoS (Quality of Service criteria, such as latency, reliability and throughput. In this paper, we will compare three routing protocols for wireless sensors network LEACH (Low Energy Adaptive Clustering Hierarchy, AODV (Ad hoc on demand Distance Vector and LABILE (Link Quality-Based Lexical Routing using Castalia simulator in terms of energy consumption, throughput, reliability and latency time of packets received by sink under different conditions to determinate the best configurations that offers the most suitable compromises between energy conservation and all QoS metrics for each routing protocols. The results show that, the best configurations that offer the suitable compromises between energy conservation and all QoS metrics is a large number of deployed nodes with low packet rate for LEACH (300 nodes and 1 packet/s, a medium number of deployed nodes with low packet rate For AODV (100 nodes and 1 packet/s and a very low nodes density with low packet rate for LABILE (50 nodes and 1 packet/s.

Fault-Aware Resource Allocation for Heterogeneous Data Sources with Multipath Routing

Directory of Open Access Journals (Sweden)

Xiaomei Zhang

2017-01-01

Full Text Available With the rapid development of cloud computing and big data, diverse types of traffic generated from heterogeneous data sources are delivered throughout communication networks, which consist of various node kinds such as digital sensors and smart actuators, and different applications. Due to the shared medium, communication networks are vulnerable to misbehaving nodes, and it is a crucial aspect to maintain an acceptable level of service degradation. This paper studies the fault-aware resource allocation problem by exploiting multipath routing and dynamic rate assignment for heterogeneous sources. We estimate the impacts of faults and formulate the resource allocation as a lossy network flow optimization problem based on these estimates. The traditional flow optimization solutions focus on homogeneous traffic. In our work, we model the performance of heterogeneous applications as a relaxed utility function and develop an effective utility framework of rate control for heterogeneous sources with multipath routing in presence of misbehaving nodes. We design a distributed algorithm to decide the routing strategy and obtain the rate assignments on the available paths in a lossy utility fair manner. Extensive performance evaluations corroborate the significant performance of our algorithm in effective utility and utility fairness in the presence of misbehaving nodes.

A QoS Framework with Traffic Request in Wireless Mesh Network

Science.gov (United States)

Fu, Bo; Huang, Hejiao

In this paper, we consider major issues in ensuring greater Quality-of-Service (QoS) in Wireless Mesh Networks (WMNs), specifically with regard to reliability and delay. To this end, we use traffic request to record QoS requirements of data flows. In order to achieve required QoS for all data flows efficiently and with high portability, we develop Network State Update Algorithm. All assumptions, definitions, and algorithms are made exclusively with WMNs in mind, guaranteeing the portability of our framework to various environments in WMNs. The simulation results in proof that our framework is correct.

Analysis of In-to-Out Wireless Body Area Network Systems: Towards QoS-Aware Health Internet of Things Applications

Directory of Open Access Journals (Sweden)

Yangzhe Liao

2016-07-01

Full Text Available In this paper, an analytical and accurate in-to-out (I2O human body path loss (PL model at 2.45 GHz is derived based on a 3D heterogeneous human body model under safety constraints. The bit error rate (BER performance for this channel using multiple efficient modulation schemes is investigated and the link budget is analyzed based on a predetermined satisfactory BER of 10−3. In addition, an incremental relay-based cooperative quality of service-aware (QoS-aware routing protocol for the proposed I2O WBAN is presented and compared with an existing scheme. Linear programming QoS metric expressions are derived and employed to maximize the network lifetime, throughput, minimizing delay. Results show that binary phase-shift keying (BPSK outperforms other modulation techniques for the proposed I2O WBAN systems, enabling the support of a 30 Mbps data transmission rate up to 1.6 m and affording more reliable communication links when the transmitter power is increased. Moreover, the proposed incremental cooperative routing protocol outperforms the existing two-relay technique in terms of energy efficiency. Open issues and on-going research within the I2O WBAN area are presented and discussed as an inspiration towards developments in health IoT applications.

PERFORMANCE ANALYSIS OF AI BASED QOS SCHEDULER FOR MOBILE WIMAX

Directory of Open Access Journals (Sweden)

D. David Neels Pon Kumar

2012-09-01

Full Text Available Interest in broadband wireless access (BWA has been growing due to increased user mobility and the need for data access at all times. IEEE 802.16e based WiMAX networks promise the best available quality of experience for mobile data service users. WiMAX networks incorporate several Quality of Service (QoS mechanisms at the Media Access Control (MAC level for guaranteed services for multimedia viz. data, voice and video. The problem of assuring QoS is how to allocate available resources among users to meet the QoS criteria such as delay, delay jitter, fairness and throughput requirements. IEEE standard does not include a standard scheduling mechanism and leaves it for various implementer differentiations. Although a lot of the real-time and non real-time packet scheduling schemes has been proposed, it needs to be modified to apply to Mobile WiMAX system that supports five kinds of service classes. In this paper, we propose a novel Priority based Scheduling scheme that uses Artificial Intelligence to support various services by considering the QoS constraints of each class. The simulation results show that slow mobility does not affect the performances and faster mobility and the increment in users beyond a particular load have their say in defining average throughput, average per user throughput, fairness index, average end to end delay and average delay jitter. Nevertheless the results are encouraging that the proposed scheme provides QoS support for each class efficiently.

A Dynamic Optimization Method of Indoor Fire Evacuation Route Based on Real-time Situation Awareness

Directory of Open Access Journals (Sweden)

DING Yulin

2016-12-01

Full Text Available How to provide safe and effective evacuation routes is an important safeguard to correctly guide evacuation and reduce the casualties during the fire situation rapidly evolving in complex indoor environment. The traditional static path finding method is difficult to adjust the path adaptively according to the changing fire situation, which lead to the evacuation decision-making blindness and hysteresis. This paper proposes a dynamic method which can dynamically optimize the indoor evacuation routes based on the real-time situation awareness. According to the real-time perception of fire situation parameters and the changing indoor environment information, the evacuation route is optimized dynamically. The integrated representation of multisource indoor fire monitoring sensor observations oriented fire emergency evacuation is presented at first, real-time fire threat situation information inside building is then extracted from the observation data of multi-source sensors, which is used to constrain the dynamical optimization of the topology of the evacuation route. Finally, the simulation experiments prove that this method can improve the accuracy and efficiency of indoor evacuation routing.

UPnP QoS and queuing in home networks

DEFF Research Database (Denmark)

Brewka, Lukasz Jerzy; Wessing, Henrik; Dittmann, Lars

2010-01-01

The QoS provisioning in home networks is being more often considered for future use cases, where mulitple high bandwidth flows are accomodated in the home environment. This paper investigates chosen characteristics of one of the home network control and management protocol suites, namely UPn......P. Using network modeling tools, we evaluate UPnP QoS architecture and its resource management influence on the end-to-end packet delay characteristics for different scheduling approaches....

An Application-Level QoS Control Method Based on Local Bandwidth Scheduling

Directory of Open Access Journals (Sweden)

Yong Wang

2018-01-01

Full Text Available Quality of service (QoS is an important performance indicator for Web applications and bandwidth is a key factor affecting QoS. Current methods use network protocols or ports to schedule bandwidth, which require tedious manual configurations or modifications of the underlying network. Some applications use dynamic ports and the traditional port-based bandwidth control methods cannot deal with them. A new QoS control method based on local bandwidth scheduling is proposed, which can schedule bandwidth at application level in a user-transparent way and it does not require tedious manual configurations. Experimental results indicate that the new method can effectively improve the QoS for applications, and it can be easily integrated into current Web applications without the need to modify the underlying network.

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Science.gov (United States)

Alena, Richard I.; Lee, Charles

2004-01-01

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the

QoS-Aware Error Recovery in Wireless Body Sensor Networks Using Adaptive Network Coding

Directory of Open Access Journals (Sweden)

Mohammad Abdur Razzaque

2014-12-01

Full Text Available Wireless body sensor networks (WBSNs for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS, in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network’s QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts.

QoS-Aware Error Recovery in Wireless Body Sensor Networks Using Adaptive Network Coding

Science.gov (United States)

Razzaque, Mohammad Abdur; Javadi, Saeideh S.; Coulibaly, Yahaya; Hira, Muta Tah

2015-01-01

Wireless body sensor networks (WBSNs) for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS), in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network's QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts. PMID:25551485

Providing QoS through machine-learning-driven adaptive multimedia applications.

Science.gov (United States)

Ruiz, Pedro M; Botía, Juan A; Gómez-Skarmeta, Antonio

2004-06-01

We investigate the optimization of the quality of service (QoS) offered by real-time multimedia adaptive applications through machine learning algorithms. These applications are able to adapt in real time their internal settings (i.e., video sizes, audio and video codecs, among others) to the unpredictably changing capacity of the network. Traditional adaptive applications just select a set of settings to consume less than the available bandwidth. We propose a novel approach in which the selected set of settings is the one which offers a better user-perceived QoS among all those combinations which satisfy the bandwidth restrictions. We use a genetic algorithm to decide when to trigger the adaptation process depending on the network conditions (i.e., loss-rate, jitter, etc.). Additionally, the selection of the new set of settings is done according to a set of rules which model the user-perceived QoS. These rules are learned using the SLIPPER rule induction algorithm over a set of examples extracted from scores provided by real users. We will demonstrate that the proposed approach guarantees a good user-perceived QoS even when the network conditions are constantly changing.

Cost-aware request routing in multi-geography cloud data centres using software-defined networking

Science.gov (United States)

Yuan, Haitao; Bi, Jing; Li, Bo Hu; Tan, Wei

2017-03-01

Current geographically distributed cloud data centres (CDCs) require gigantic energy and bandwidth costs to provide multiple cloud applications to users around the world. Previous studies only focus on energy cost minimisation in distributed CDCs. However, a CDC provider needs to deliver gigantic data between users and distributed CDCs through internet service providers (ISPs). Geographical diversity of bandwidth and energy costs brings a highly challenging problem of how to minimise the total cost of a CDC provider. With the recently emerging software-defined networking, we study the total cost minimisation problem for a CDC provider by exploiting geographical diversity of energy and bandwidth costs. We formulate the total cost minimisation problem as a mixed integer non-linear programming (MINLP). Then, we develop heuristic algorithms to solve the problem and to provide a cost-aware request routing for joint optimisation of the selection of ISPs and the number of servers in distributed CDCs. Besides, to tackle the dynamic workload in distributed CDCs, this article proposes a regression-based workload prediction method to obtain future incoming workload. Finally, this work evaluates the cost-aware request routing by trace-driven simulation and compares it with the existing approaches to demonstrate its effectiveness.

Modelling the guaranteed QoS for wireless sensor networks: a network calculus approach

Directory of Open Access Journals (Sweden)

Yu Jianping

2011-01-01

Full Text Available Abstract Wireless sensor networks (WSNs became one of the high technology domains during the last 10 years. Real-time applications for them make it necessary to provide the guaranteed quality of service (QoS. The main contributions of this article are a system skeleton and a guaranteed QoS model that are suitable for the WSNs. To do it, we develop a sensor node model based on virtual buffer sharing and present a two-layer scheduling model using the network calculus. With the system skeleton, we develop a guaranteed QoS model, such as the upper bounds on buffer queue length/delay/effective bandwidth, and single-hop/multi-hops delay/jitter/effective bandwidth. Numerical results show the system skeleton and the guaranteed QoS model are scalable for different types of flows, including the self-similar traffic flows, and the parameters of flow regulators and service curves of sensor nodes affect them. Our proposal leads to buffer dimensioning, guaranteed QoS support and control in the WSNs.

QoS Enabled Resource Allocation Over an UPnP-QoS - GMPLS Controlled Edge

DEFF Research Database (Denmark)

Brewka, Lukasz Jerzy; Sköldström, Pontus; Gavler, Anders

2011-01-01

This paper focuses on the problem of coherent resource allocation within home and access networks. The interdomain QoS signaling discussed here enables the initiation of the QoS provisioning in the home and access from the end device in users home. The home network considered in this paper is UPn......P-QoS enabled while the access network is GMPLS based. We propose and implement an interface between aforementioned network segments allowing for end-to-end QoS establishment. We present the QoS parameters and mechanisms in both UPnP-QoS and GMPLS and how they can be matched to create a coherent Qo...

Integrating QoS and security functions in an IP-VPN gateway

Science.gov (United States)

Fan, Kuo-Pao; Chang, Shu-Hsin; Lin, Kuan-Ming; Pen, Mau-Jy

2001-10-01

IP-based Virtual Private Network becomes more and more popular. It can not only reduce the enterprise communication cost but also increase the revenue of the service provider. The common IP-VPN application types include Intranet VPN, Extranet VPN, and remote access VPN. For the large IP-VPN market, some vendors develop dedicated IP-VPN devices; while some vendors add the VPN functions into their existing network equipment such as router, access gateway, etc. The functions in the IP-VPN device include security, QoS, and management. The common security functions supported are IPSec (IP Security), IKE (Internet Key Exchange), and Firewall. The QoS functions include bandwidth control and packet scheduling. In the management component, policy-based network management is under standardization in IETF. In this paper, we discuss issues on how to integrate the QoS and security functions in an IP-VPN Gateway. We propose three approaches to do this. They are (1) perform Qos first (2) perform IPSec first and (3) reserve fixed bandwidth for IPSec. We also compare the advantages and disadvantages of the three proposed approaches.

Integration of QoS provisioning in home and access networks

DEFF Research Database (Denmark)

Popov, Mikhail; Gavler, A.; Sköldström, P.

2010-01-01

Approaches for QoS provisioning using UPnP for home networks and GMPLS for access networks are described. A solution for interworking the UPnP and the GMPLS at the residential gateway is proposed.......Approaches for QoS provisioning using UPnP for home networks and GMPLS for access networks are described. A solution for interworking the UPnP and the GMPLS at the residential gateway is proposed....

Performance Enhancements of UMTS networks using end-to-end QoS provisioning

DEFF Research Database (Denmark)

Wang, Haibo; Prasad, Devendra; Teyeb, Oumer

2005-01-01

This paper investigates the end-to-end(E2E) quality of service(QoS) provisioning approaches for UMTS networks together with DiffServ IP network. The effort was put on QoS classes mapping from DiffServ to UMTS, Access Control(AC), buffering and scheduling optimization. The DiffServ Code Point (DSCP......) was utilized in the whole UMTS QoS provisioning to differentiate different type of traffics. The overall algorithm was optimized to guarantee the E2E QoS parameters of each service class, especially for realtime applications, as well as to improve the bandwidth utilization. Simulation shows that the enhanced...

Routing Optimization of Intelligent Vehicle in Automated Warehouse

Directory of Open Access Journals (Sweden)

Yan-cong Zhou

2014-01-01

Full Text Available Routing optimization is a key technology in the intelligent warehouse logistics. In order to get an optimal route for warehouse intelligent vehicle, routing optimization in complex global dynamic environment is studied. A new evolutionary ant colony algorithm based on RFID and knowledge-refinement is proposed. The new algorithm gets environmental information timely through the RFID technology and updates the environment map at the same time. It adopts elite ant kept, fallback, and pheromones limitation adjustment strategy. The current optimal route in population space is optimized based on experiential knowledge. The experimental results show that the new algorithm has higher convergence speed and can jump out the U-type or V-type obstacle traps easily. It can also find the global optimal route or approximate optimal one with higher probability in the complex dynamic environment. The new algorithm is proved feasible and effective by simulation results.

A Robust Service Selection Method Based on Uncertain QoS

Directory of Open Access Journals (Sweden)

Yanping Chen

2016-01-01

Full Text Available Nowadays, the number of Web services on the Internet is quickly increasing. Meanwhile, different service providers offer numerous services with the similar functions. Quality of Service (QoS has become an important factor used to select the most appropriate service for users. The most prominent QoS-based service selection models only take the certain attributes into account, which is an ideal assumption. In the real world, there are a large number of uncertain factors. In particular, at the runtime, QoS may become very poor or unacceptable. In order to solve the problem, a global service selection model based on uncertain QoS was proposed, including the corresponding normalization and aggregation functions, and then a robust optimization model adopted to transform the model. Experiment results show that the proposed method can effectively select services with high robustness and optimality.

Implementation and Evaluation of Multichannel Multi-Interface Routing Mechanism with QoS-Consideration for Ad-Hoc Networks

Directory of Open Access Journals (Sweden)

Satoh Hiroki

2010-01-01

Full Text Available To accommodate real-time multimedia application while satisfying application-level QoS requirements in a wireless ad-hoc network, we need QoS control mechanisms. We proposed a new routing mechanism for a wireless ad-hoc network composed of nodes equipped with multiple network interfaces. By embedding information about channel usage in control messages of OLSRv2, each node obtains a view of topology and bandwidth information of the whole network. Based on the obtained information, a source node determines a logical path with the maximum available bandwidth to satisfy application-level QoS requirements. In this paper, we evaluated feasibility of the proposal through simulation and practical experiments and confirmed that our proposal effectively transferred multimedia packets over a logical path avoiding congested links. The load on a network is well distributed and the network can accommodate more sessions than OLSRv2 and QOLSR.

Assessing Measurements of QoS for global Cloud Computing Services

DEFF Research Database (Denmark)

Pedersen, Jens Myrup; Riaz, M. Tahir; Júnior, Joaquim Celestino

2011-01-01

Many global distributed cloud computing applications and services running over the Internet, between globally dispersed clients and servers, will require certain levels of Quality of Service (QoS) in order to deliver and give a sufficiently smooth user experience. This would be essential for real......-time streaming multimedia applications like online gaming and watching movies on a pay as you use basis hosted in a cloud computing environment. However, guaranteeing or even predicting QoS in global and diverse networks supporting complex hosting of application services is a very challenging issue that needs...... a stepwise refinement approach to be solved as the technology of cloud computing matures. In this paper, we investigate if latency in terms of simple Ping measurements can be used as an indicator for other QoS parameters such as jitter and throughput. The experiments were carried out on a global scale...

An improved ant colony optimization algorithm with fault tolerance for job scheduling in grid computing systems.

Directory of Open Access Journals (Sweden)

Hajara Idris

Full Text Available The Grid scheduler, schedules user jobs on the best available resource in terms of resource characteristics by optimizing job execution time. Resource failure in Grid is no longer an exception but a regular occurring event as resources are increasingly being used by the scientific community to solve computationally intensive problems which typically run for days or even months. It is therefore absolutely essential that these long-running applications are able to tolerate failures and avoid re-computations from scratch after resource failure has occurred, to satisfy the user's Quality of Service (QoS requirement. Job Scheduling with Fault Tolerance in Grid Computing using Ant Colony Optimization is proposed to ensure that jobs are executed successfully even when resource failure has occurred. The technique employed in this paper, is the use of resource failure rate, as well as checkpoint-based roll back recovery strategy. Check-pointing aims at reducing the amount of work that is lost upon failure of the system by immediately saving the state of the system. A comparison of the proposed approach with an existing Ant Colony Optimization (ACO algorithm is discussed. The experimental results of the implemented Fault Tolerance scheduling algorithm show that there is an improvement in the user's QoS requirement over the existing ACO algorithm, which has no fault tolerance integrated in it. The performance evaluation of the two algorithms was measured in terms of the three main scheduling performance metrics: makespan, throughput and average turnaround time.

Maximization of the Supportable Number of Sensors in QoS-Aware Cluster-Based Underwater Acoustic Sensor Networks

Directory of Open Access Journals (Sweden)

Thi-Tham Nguyen

2014-03-01

Full Text Available This paper proposes a practical low-complexity MAC (medium access control scheme for quality of service (QoS-aware and cluster-based underwater acoustic sensor networks (UASN, in which the provision of differentiated QoS is required. In such a network, underwater sensors (U-sensor in a cluster are divided into several classes, each of which has a different QoS requirement. The major problem considered in this paper is the maximization of the number of nodes that a cluster can accommodate while still providing the required QoS for each class in terms of the PDR (packet delivery ratio. In order to address the problem, we first estimate the packet delivery probability (PDP and use it to formulate an optimization problem to determine the optimal value of the maximum packet retransmissions for each QoS class. The custom greedy and interior-point algorithms are used to find the optimal solutions, which are verified by extensive simulations. The simulation results show that, by solving the proposed optimization problem, the supportable number of underwater sensor nodes can be maximized while satisfying the QoS requirements for each class.

Bio-Inspired Distributed Transmission Power Control Considering QoS Fairness in Wireless Body Area Sensor Networks.

Science.gov (United States)

Lee, Chan-Jae; Jung, Ji-Young; Lee, Jung-Ryun

2017-10-14

Recently, the development of wireless body area sensor network (WBASN) has accelerated due to the rapid development of wireless technology. In the WBASN environment, many WBASNs coexist where communication ranges overlap with each other, resulting in the possibility of interference. Although nodes in a WBASN typically operate at a low power level, to avoid adversely affecting the human body, high transmission rates may be required to support some applications. In addition to this, since many varieties of applications exist in the WBASN environment, each prospective user may have different quality of service (QoS) requirements. Hence, the following issues should be considered in the WBASN environment: (1) interference between adjacent WBASNs, which influences the performance of a specific system, and (2) the degree of satisfaction on the QoS of each user, i.e., the required QoS such as user throughput should be considered to ensure that all users in the network are provided with a fair QoS satisfaction. Thus, in this paper, we propose a transmission power adjustment algorithm that addresses interference problems and guarantees QoS fairness between users. First, we use a new utility function to measure the degree of the satisfaction on the QoS for each user. Then, the transmission power of each sensor node is calculated using the Cucker-Smale model, and the QoS satisfaction of each user is synchronized dispersively. The results of simulations show that the proposed algorithm performs better than existing algorithms, with respect to QoS fairness and energy efficiency.

Priority Queues with Fractional Service for Tiered Delay QoS

Directory of Open Access Journals (Sweden)

Gary Chang

2015-12-01

Full Text Available Packet scheduling is key to quality of service (QoS capabilities of broadband wired and wireless networks. In a heterogeneous traffic environment, a comprehensive QoS packet scheduler must strike a balance between flow fairness and access delay. Many advanced packet scheduling solutions have targeted fair bandwidth allocation while protecting delay-constrained traffic by adding priority queue(s on top of a fair bandwidth scheduler. Priority queues are known to cause performance uncertainties and, thus, various modifications have been proposed. In this paper, we present a packet queueing engine dubbed Fractional Service Buffer (FSB, which, when coupled with a configurable flow scheduler, can achieve desired QoS objectives, such as fair throughputs and differentiated delay guarantees. Key performance metrics, such as delay limit and probability of delay limit violation, are derived as a function of key FSB parameters for each delay class in the packet queueing engine using diffusion approximations. OPNET simulations verify these analytical results.

Landmarks or panoramas: what do navigating ants attend to for guidance?

Directory of Open Access Journals (Sweden)

Beugnon Guy

2011-08-01

Full Text Available Abstract Background Insects are known to rely on terrestrial landmarks for navigation. Landmarks are used to chart a route or pinpoint a goal. The distant panorama, however, is often thought not to guide navigation directly during a familiar journey, but to act as a contextual cue that primes the correct memory of the landmarks. Results We provided Melophorus bagoti ants with a huge artificial landmark located right near the nest entrance to find out whether navigating ants focus on such a prominent visual landmark for homing guidance. When the landmark was displaced by small or large distances, ant routes were affected differently. Certain behaviours appeared inconsistent with the hypothesis that guidance was based on the landmark only. Instead, comparisons of panoramic images recorded on the field, encompassing both landmark and distal panorama, could explain most aspects of the ant behaviours. Conclusion Ants navigating along a familiar route do not focus on obvious landmarks or filter out distal panoramic cues, but appear to be guided by cues covering a large area of their panoramic visual field, including both landmarks and distal panorama. Using panoramic views seems an appropriate strategy to cope with the complexity of natural scenes and the poor resolution of insects' eyes. The ability to isolate landmarks from the rest of a scene may be beyond the capacity of animals that do not possess a dedicated object-perception visual stream like primates.

Solving a Closed-Loop Location-Inventory-Routing Problem with Mixed Quality Defects Returns in E-Commerce by Hybrid Ant Colony Optimization Algorithm

Directory of Open Access Journals (Sweden)

Shuai Deng

2016-01-01

Full Text Available This paper presents a closed-loop location-inventory-routing problem model considering both quality defect returns and nondefect returns in e-commerce supply chain system. The objective is to minimize the total cost produced in both forward and reverse logistics networks. We propose a combined optimization algorithm named hybrid ant colony optimization algorithm (HACO to address this model that is an NP-hard problem. Our experimental results show that the proposed HACO is considerably efficient and effective in solving this model.

Middleware Support for Media Streaming Establishment Driven by User-oriented QoS Requirements

NARCIS (Netherlands)

Hesselman, C.E.W.; Widya, I.A.; van Halteren, Aart; Nieuwenhuis, Lambertus Johannes Maria; Scholten, Johan; van Sinderen, Marten J.

2000-01-01

The requirements for the QoS of distributed applications are traditionally expressed in terms of network oriented or systems oriented parameters. In general, the users of these services are not interested or capable of specifying the QoS of their services in such technical terms. In this paper, we

Transmission Algorithm with QoS Considerations for a Sustainable MPEG Streaming Service

Directory of Open Access Journals (Sweden)

Sang-Hyong Kim

2017-03-01

Full Text Available With the proliferation of heterogeneous networks, there is a need to provide multimedia stream services in a sustainable manner. It is especially critical to maintain the Quality of Service (QoS standards. Existing multimedia streaming services have been studied to guarantee QoS on the receiving side. QoS has not been ensured due to the fact that the loss of streaming data to be transmitted has not been considered in network conditions. With an algorithm that considers the QoS and can reduce the overhead of the network, it will be possible to reduce the transmission error and wastage of communication network resources. In this paper, we propose a scheme that improves the reliability of multimedia transmissions by using an adaptive algorithm that switches between UDP (User Datagram Protocol and TCP (Transmission Control Protocol based on the size of the data. In addition, we present a method that retransmits essential portions of the multimedia data, thus improving transmission efficiency. We simulate an MPEG (Moving Picture Experts Group stream service and evaluate the performance of the proposed adaptive MPEG stream service.

Providing end-to-end QoS for multimedia applications in 3G wireless networks

Science.gov (United States)

Guo, Katherine; Rangarajan, Samapth; Siddiqui, M. A.; Paul, Sanjoy

2003-11-01

As the usage of wireless packet data services increases, wireless carriers today are faced with the challenge of offering multimedia applications with QoS requirements within current 3G data networks. End-to-end QoS requires support at the application, network, link and medium access control (MAC) layers. We discuss existing CDMA2000 network architecture and show its shortcomings that prevent supporting multiple classes of traffic at the Radio Access Network (RAN). We then propose changes in RAN within the standards framework that enable support for multiple traffic classes. In addition, we discuss how Session Initiation Protocol (SIP) can be augmented with QoS signaling for supporting end-to-end QoS. We also review state of the art scheduling algorithms at the base station and provide possible extensions to these algorithms to support different classes of traffic as well as different classes of users.

Bidirectional QoS support for novelty detection applications based on hierarchical wireless sensor network model

Science.gov (United States)

Edwards, Mark; Hu, Fei; Kumar, Sunil

2004-10-01

The research on the Novelty Detection System (NDS) (called as VENUS) at the authors' universities has generated exciting results. For example, we can detect an abnormal behavior (such as cars thefts from the parking lot) from a series of video frames based on the cognitively motivated theory of habituation. In this paper, we would like to describe the implementation strategies of lower layer protocols for using large-scale Wireless Sensor Networks (WSN) to NDS with Quality-of-Service (QoS) support. Wireless data collection framework, consisting of small and low-power sensor nodes, provides an alternative mechanism to observe the physical world, by using various types of sensing capabilities that include images (and even videos using Panoptos), sound and basic physical measurements such as temperature. We do not want to lose any 'data query command' packets (in the downstream direction: sink-to-sensors) or have any bit-errors in them since they are so important to the whole sensor network. In the upstream direction (sensors-to-sink), we may tolerate the loss of some sensing data packets. But the 'interested' sensing flow should be assigned a higher priority in terms of multi-hop path choice, network bandwidth allocation, and sensing data packet generation frequency (we hope to generate more sensing data packet for that novel event in the specified network area). The focus of this paper is to investigate MAC-level Quality of Service (QoS) issue in Wireless Sensor Networks (WSN) for Novelty Detection applications. Although QoS has been widely studied in other types of networks including wired Internet, general ad hoc networks and mobile cellular networks, we argue that QoS in WSN has its own characteristics. In wired Internet, the main QoS parameters include delay, jitter and bandwidth. In mobile cellular networks, two most common QoS metrics are: handoff call dropping probability and new call blocking probability. Since the main task of WSN is to detect and report

Adaptive Radio Resource Allocation in Hierarchical QoS Scheduling for IEEE 802.16 Systems

DEFF Research Database (Denmark)

Wang, Hua; Dittmann, Lars

2007-01-01

Future mobile communication systems such as IEEE 802.16 are expected to deliver a variety of multimedia services with diverse QoS requirements. To guarantee the QoS provision, appropriate scheduler architecture and scheduling algorithms have to be carefully designed. In this paper, we propose...

Desempeño de la calidad del servicio (QoS sobre IPv6

Directory of Open Access Journals (Sweden)

Octavio José Salcedo Parra

2011-06-01

Full Text Available New applications such as VoIP, e-commerce and video conferencing are sensitive to network performance, making the network capacity to provide quality of service is increasingly important. IPv6 was developed to solve some of the problems of IPv4, such as QoS, security and IP address exhaustion. Current IP networks provide better trafficdelivery effort, therefore, offer no guarantee of quality service. However, there are services, including voice, with stringent requirements for delay and delay variation (jitter, which makes it necessary to add functionality to IP networks based on this protocol are capable of supporting such services. For its part, IPv6 uses 2 fields that can be used to implement QoS, which are: Flow Label and Traffic Class. This article describes the mechanisms and architectures that are used to provide QoS on a network. Later, you specify the features that use both IPv4 and IPv6 to implement QoS. In the last sections present the results of the comparison of 2 scenarios, which are evaluated.

Resource management framework for QoS scheduling in IEEE 802.16 WiMAX networks

DEFF Research Database (Denmark)

Wang, Hua; Dittmann, Lars

2009-01-01

IEEE 802.16, also known as WiMAX, has received much attention recently for its capability to support multiple types of applications with diverse Quality-of-Service (QoS) requirements. Beyond what the standard has defined, radio resource management (RRM) still remains an open issue, which plays...... an important role in QoS provisioning for different types of services. In this chapter, we propose a downlink resource management framework for QoS scheduling in OFDMA based WiMAX systems. Our framework consists of a dynamic resource allocation (DRA) module and a connection admission control (CAC) module...

Downlink resource management for QoS scheduling in IEEE 802.16 WiMAX networks

DEFF Research Database (Denmark)

Wang, Hua; Dittmann, Lars

2010-01-01

IEEE 802.16, also known as WiMAX, has received much attention recently for its capability to support multiple types of applications with diverse Quality-of-Service (QoS) requirements. Beyond what the standard has defined, radio resource management (RRM) still remains an open issue, which plays...... an important role in QoS provisioning for different types of services. In this paper, we propose a downlink resource management framework for QoS scheduling in OFDMA based WiMAX systems. Our framework consists of a dynamic resource allocation (DRA) module and a connection admission control (CAC) module. A two...

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

Science.gov (United States)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

Efficient distribution of toy products using ant colony optimization algorithm

Science.gov (United States)

Hidayat, S.; Nurpraja, C. A.

2017-12-01

CV Atham Toys (CVAT) produces wooden toys and furniture, comprises 13 small and medium industries. CVAT always attempt to deliver customer orders on time but delivery costs are high. This is because of inadequate infrastructure such that delivery routes are long, car maintenance costs are high, while fuel subsidy by the government is still temporary. This study seeks to minimize the cost of product distribution based on the shortest route using one of five Ant Colony Optimization (ACO) algorithms to solve the Vehicle Routing Problem (VRP). This study concludes that the best of the five is the Ant Colony System (ACS) algorithm. The best route in 1st week gave a total distance of 124.11 km at a cost of Rp 66,703.75. The 2nd week route gave a total distance of 132.27 km at a cost of Rp 71,095.13. The 3rd week best route gave a total distance of 122.70 km with a cost of Rp 65,951.25. While the 4th week gave a total distance of 132.27 km at a cost of Rp 74,083.63. Prior to this study there was no effort to calculate these figures.

Dynamic routing and spectrum assignment based on multilayer virtual topology and ant colony optimization in elastic software-defined optical networks

Science.gov (United States)

Wang, Fu; Liu, Bo; Zhang, Lijia; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun

2017-07-01

Elastic software-defined optical networks greatly improve the flexibility of the optical switching network while it has brought challenges to the routing and spectrum assignment (RSA). A multilayer virtual topology model is proposed to solve RSA problems. Two RSA algorithms based on the virtual topology are proposed, which are the ant colony optimization (ACO) algorithm of minimum consecutiveness loss and the ACO algorithm of maximum spectrum consecutiveness. Due to the computing power of the control layer in the software-defined network, the routing algorithm avoids the frequent link-state information between routers. Based on the effect of the spectrum consecutiveness loss on the pheromone in the ACO, the path and spectrum of the minimal impact on the network are selected for the service request. The proposed algorithms have been compared with other algorithms. The results show that the proposed algorithms can reduce the blocking rate by at least 5% and perform better in spectrum efficiency. Moreover, the proposed algorithms can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness.

Buffer Management of Multi-Queue QoS Switches with Class Segregation

OpenAIRE

Itoh, Toshiya; Yoshimoto, Seiji

2013-01-01

In this paper, we focus on buffer management of multi-queue QoS switches in which packets of different values are segregated in different queues. Our model consists of $m$ queues and $m$ packet values $0 < v_{1} < v_{2} < ... < v_{m}$. Recently, Al-Bawani and Souza [IPL 113(4), pp.145-150, 2013] presented an online algorithm GREEDY for buffer management of multi-queue QoS switches with class segregation and showed thatif $m$ queues have the same size, then the competitive ratio of GREEDY is $...

QoS INVESTIGATION ON MOODLE’S VIDEO CONFERENCE

Directory of Open Access Journals (Sweden)

LINAWATI LINAWATI

2011-06-01

Full Text Available Learning Management System (LMS supports e-learning as a distant learning. Moodle is one of open source LMS applications that allow embedding multimedia into learning activity in a course, such as video conference session. The paper investigates quality of service (QoS of video conference session embedded in Moodle, i.e. end-to-end delay, jitter, throughput, packet loss and PSNR. Three scenarios were implemented in the experiment. The scenarios were applied on both wire and wireless transmission, and p2p and p2m connections. The investigation results show that the QoS of video conference session meets the standards issued by ITU-T G.1010 and G.114, for minimum bandwidth of 128 kbps. Thus the application of video conferencing that is integrated in Moodle can run well with minimum bandwidth of 128 Kbps. 

Communication Framework for Tele-rehabilitation Systems with QoS Guarantee

Directory of Open Access Journals (Sweden)

Dandanov Nikolay

2017-01-01

Full Text Available Nowadays, there is great interest in developing telemedicine technologies. These technologies will provide health care from distance swiftly and lightly, as well as reduce the expenses for activities, such as rehabilitation. Telemedicine applications are possible due to the advances in information technologies and the ever-expanding communication network infrastructure. The network characteristics bandwidth, packet loss, latency, jitter and policies are crucial for the performance of tele-rehabilitation systems. Because in tele-rehabilitation human lives are at stake, guaranteeing the Quality of Service (QoS is important. In this paper, an approach for assuring the QoS for information transmission in tele-rehabilitation systems is proposed.

Inter-flow and intra-flow interference mitigation routing in wireless mesh networks

OpenAIRE

Houaidia, Chiraz; Idoudi, Hanen; Van den Bossche, Adrien; Saidane, Leila; Val, Thierry

2017-01-01

In this paper, we address the problem of QoS support in an heterogeneous multi-rate wireless mesh network. We propose a new routing metric that provides information about link quality, based on PHY and MAC characteristics, including the link availability, the loss rate and the available bandwidth. This metric allows to apprehend inter-flow interferences and avoid bottleneck formation by balancing traffic load on the links. Based on the conflict graph model and calculation of maximal cliques, ...

Research on the business QoS and trustworthy and controllable strategies mechanism for energy internet

Science.gov (United States)

Zhang, Geng; Lu, Meiling; Zhang, Dahua; Zhou, Liang; Li, Likang

2017-01-01

Energy internet is a kind of power sharing network, which can realize the bidirectional flow of energy information on the basis of the existing power grid. It puts forward higher requirements for reliability and controllability of information communication, and all kinds of business QoS of the backbone network. So the research of business QoS and trustworthy and controllable strategies mechanism have an important significance for the development of energy internet. This paper mainly studies how to use the software defined network (SDN) to achieve business QoS, and provide QoS support for all kinds of business of the energy internet. Combined with the current development situation of the energy internet in our country, this paper researches the trustworthy and controllable strategies mechanism for energy internet, and proposes the transition scheme of the IPv6 credible network architecture based on SDN. This coordinates the contradiction between the growing demand for energy internet applications and the limitations of the energy internet technology itself.

QoS Support Polling Scheme for Multimedia Traffic in Wireless LAN MAC Protocol

Institute of Scientific and Technical Information of China (English)

YANG Zhijun; ZHAO Dongfeng

2008-01-01

Quality of service (QoS) support is a key attribute for multimedia traffic including video, voice, and data in wireless local area networks (LANs) but is limited in 802.11-based wireless LANs. A polling-based scheme called the point coordination function (PCF) was developed for 802.11 LANs to support the trans-mission of multimedia traffic. However, the PCF is not able to meet the desired practical traffic differentiation requirements for real-time data. This paper describes a QoS support polling scheme based on the IEEE 802.11 medium access control (MAC) protocol. The scheme uses a two-level polling mechanism with the QoS classes differentiated by two different access policies. Stations with higher priority traffic such as key or real-time data form the first level and can access the common channel through an exhaustive access policy. Other stations with lower priority traffic form the second level and can access the channel through a gated access policy. A system model based on imbedded Markov chain theory and a generation function were setup to explicitly analyze the mean information packet waiting time of the two-level polling scheme. Theo-retical and simulation results show that the new scheme efficiently differentiates services to guarantee better QoS and system stability.

Algorithm of Particle Data Association for SLAM Based on Improved Ant Algorithm

Directory of Open Access Journals (Sweden)

KeKe Gen

2015-01-01

Full Text Available The article considers a problem of data association algorithm for simultaneous localization and mapping guidelines in determining the route of unmanned aerial vehicles (UAVs. Currently, these equipments are already widely used, but mainly controlled from the remote operator. An urgent task is to develop a control system that allows for autonomous flight. Algorithm SLAM (simultaneous localization and mapping, which allows to predict the location, speed, the ratio of flight parameters and the coordinates of landmarks and obstacles in an unknown environment, is one of the key technologies to achieve real autonomous UAV flight. The aim of this work is to study the possibility of solving this problem by using an improved ant algorithm.The data association for SLAM algorithm is meant to establish a matching set of observed landmarks and landmarks in the state vector. Ant algorithm is one of the widely used optimization algorithms with positive feedback and the ability to search in parallel, so the algorithm is suitable for solving the problem of data association for SLAM. But the traditional ant algorithm in the process of finding routes easily falls into local optimum. Adding random perturbations in the process of updating the global pheromone to avoid local optima. Setting limits pheromone on the route can increase the search space with a reasonable amount of calculations for finding the optimal route.The paper proposes an algorithm of the local data association for SLAM algorithm based on an improved ant algorithm. To increase the speed of calculation, local data association is used instead of the global data association. The first stage of the algorithm defines targets in the matching space and the observed landmarks with the possibility of association by the criterion of individual compatibility (IC. The second stage defines the matched landmarks and their coordinates using improved ant algorithm. Simulation results confirm the efficiency and

ALPHA: Proposal of Mapping QoS Parameters between UPnP Home Network and GMPLS Access

DEFF Research Database (Denmark)

Brewka, Lukasz Jerzy; Sköldström, Pontus; Gavler, Anders

2011-01-01

This paper is treating the interdomain QoS signaling between the home and access domains with a focus on applying it for providing QoS between a UPnP-QoS based home network and GMPLS based access network. The work presented here is defining a possible approach for an interface between UPn...

Adaptive QoS provision for IEEE 802.16e BWA networks based on cross-layer design

Directory of Open Access Journals (Sweden)

Kuo GS

2011-01-01

Full Text Available Abstract This article proposes an integrated framework for adaptive QoS provision in IEEE 802.16e broadband wireless access networks based on cross-layer design. On one hand, an efficient admission control (AC algorithm is proposed along with a semi-reservation scheme to guarantee the connection-level QoS. First, to guarantee the service continuity for handoff connections and resource efficiency, our semi-reservation scheme considers both users' handoff probability and average resource consumption together, which effectively avoids resource over-reservation and insufficient reservation. For AC, a new/handoff connection is accepted only when the target cell has enough resource to afford both instantaneous and average resource consumption to meet the average source rate request. On the other hand, a joint resource allocation and packet scheduling scheme is designed to provide packet-level QoS guarantee in term of "QoS rate", which can ensure fairness for the services with identical priority level in case of bandwidth shortage. Particularly, an enhanced bandwidth request scheme is designed to reduce unnecessary BR delay and redundant signaling overhead caused by the existing one in IEEE 802.16e, which further improves the packet-level QoS performance and resource efficiency for uplink transmission. Simulation results show that the proposed approach not only balances the tradeoff among connection blocking rate, connection dropping rate, and connection failure rate, but also achieves low mean packet dropping rate (PDR, small deviation of PDR, and low QoS outage rate. Moreover, high resource efficiency is ensured.

Statistical Delay QoS Provisioning for Energy-Efficient Spectrum-Sharing Based Wireless Ad Hoc Sensor Networks

Directory of Open Access Journals (Sweden)

Yichen Wang

2016-01-01

Full Text Available In this paper, we develop the statistical delay quality-of-service (QoS provisioning framework for the energy-efficient spectrum-sharing based wireless ad hoc sensor network (WAHSN, which is characterized by the delay-bound violation probability. Based on the established delay QoS provisioning framework, we formulate the nonconvex optimization problem which aims at maximizing the average energy efficiency of the sensor node in the WAHSN while meeting PU’s statistical delay QoS requirement as well as satisfying sensor node’s average transmission rate, average transmitting power, and peak transmitting power constraints. By employing the theories of fractional programming, convex hull, and probabilistic transmission, we convert the original fractional-structured nonconvex problem to the additively structured parametric convex problem and obtain the optimal power allocation strategy under the given parameter via Lagrangian method. Finally, we derive the optimal average energy efficiency and corresponding optimal power allocation scheme by employing the Dinkelbach method. Simulation results show that our derived optimal power allocation strategy can be dynamically adjusted based on PU’s delay QoS requirement as well as the channel conditions. The impact of PU’s delay QoS requirement on sensor node’s energy efficiency is also illustrated.

Optimal capacity and buffer size estimation under Generalized Markov Fluids Models and QoS parameters

International Nuclear Information System (INIS)

Bavio, José; Marrón, Beatriz

2014-01-01

Quality of service (QoS) for internet traffic management requires good traffic models and good estimation of sharing network resource. A link of a network processes all traffic and it is designed with certain capacity C and buffer size B. A Generalized Markov Fluid model (GMFM), introduced by Marrón (2011), is assumed for the sources because describes in a versatile way the traffic, allows estimation based on traffic traces, and also consistent effective bandwidth estimation can be done. QoS, interpreted as buffer overflow probability, can be estimated for GMFM through the effective bandwidth estimation and solving the optimization problem presented in Courcoubetis (2002), the so call inf-sup formulas. In this work we implement a code to solve the inf-sup problem and other optimization related with it, that allow us to do traffic engineering in links of data networks to calculate both, minimum capacity required when QoS and buffer size are given or minimum buffer size required when QoS and capacity are given

Analisa Horizontal Handover Terhadap Qos Layanan Streaming Multimedia E-Learning Pada Jaringan WLAN 802.11

Directory of Open Access Journals (Sweden)

I M.O. Widyantara

2015-06-01

Full Text Available In this globalization era, the state of the user who no longer occupies in a single place, but always moving, it is necessary to continuity of communication that will cause a handover. This paper intends to analyze the effect of 802.11 WLAN horizontal handover to the QoS of streaming e-learning. Methods of data collection process using the Cisco 3500 series access point that supports handover with existing network systems, ad-hoc network and type of hard handover. The results of the data analysis showed that the handover process is able to improve the QoS by gradually restored gradually, to get back to normal QoS

An energy efficient distance-aware routing algorithm with multiple mobile sinks for wireless sensor networks.

Science.gov (United States)

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-08-18

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks.

Science.gov (United States)

Robinson, Y Harold; Rajaram, M

2015-01-01

Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique.

An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jin Wang

2014-08-01

Full Text Available Traffic patterns in wireless sensor networks (WSNs usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

Mixed integer nonlinear programming model of wireless pricing scheme with QoS attribute of bandwidth and end-to-end delay

Science.gov (United States)

Irmeilyana, Puspita, Fitri Maya; Indrawati

2016-02-01

The pricing for wireless networks is developed by considering linearity factors, elasticity price and price factors. Mixed Integer Nonlinear Programming of wireless pricing model is proposed as the nonlinear programming problem that can be solved optimally using LINGO 13.0. The solutions are expected to give some information about the connections between the acceptance factor and the price. Previous model worked on the model that focuses on bandwidth as the QoS attribute. The models attempt to maximize the total price for a connection based on QoS parameter. The QoS attributes used will be the bandwidth and the end to end delay that affect the traffic. The maximum goal to maximum price is achieved when the provider determine the requirement for the increment or decrement of price change due to QoS change and amount of QoS value.

Ants can learn to forage on one-way trails.

Directory of Open Access Journals (Sweden)

Pedro Leite Ribeiro

Full Text Available The trails formed by many ant species between nest and food source are two-way roads on which outgoing and returning workers meet and touch each other all along. The way to get back home, after grasping a food load, is to take the same route on which they have arrived from the nest. In many species such trails are chemically marked by pheromones providing orientation cues for the ants to find their way. Other species rely on their vision and use landmarks as cues. We have developed a method to stop foraging ants from shuttling on two-way trails. The only way to forage is to take two separate roads, as they cannot go back on their steps after arriving at the food or at the nest. The condition qualifies as a problem because all their orientation cues -- chemical, visual or any other -- are disrupted, as all of them cannot but lead the ants back to the route on which they arrived. We have found that workers of the leaf-cutting ant Atta sexdens rubropilosa can solve the problem. They could not only find the alternative way, but also used the unidirectional traffic system to forage effectively. We suggest that their ability is an evolutionary consequence of the need to deal with environmental irregularities that cannot be negotiated by means of excessively stereotyped behavior, and that it is but an example of a widespread phenomenon. We also suggest that our method can be adapted to other species, invertebrate and vertebrate, in the study of orientation, memory, perception, learning and communication.

Nature-Inspired and Energy Efficient Route Planning

DEFF Research Database (Denmark)

Schlichtkrull, Anders; Christensen, J. B. S.; Feld, T.

2015-01-01

Cars are responsible for substantial CO2 emission worldwide. Computers can help solve this problem by computing shortest routes on maps. A good example of this is the popular Google Maps service. However, such services often require the order of the stops on the route to be fixed. By not enforcing....... The app is aimed at private persons and small businesses. The app works by using a nature-inspired algorithm called Ant Colony Optimization....

An Analysis of QoS in ZigBee Network Based on Deviated Node Priority

Directory of Open Access Journals (Sweden)

Md. Jaminul Haque Biddut

2016-01-01

Full Text Available ZigBee is an IEEE 802.15.4 standardized communication protocol. It forms a flawless Wireless Sensor Network (WSN standard for interoperability at all levels of the network, particularly the application level which most closely touches the user. A large number of devices from different vendors can work seamlessly. These devices act as a network and send huge data traffic to the Coordinator. End devices at different zones have different roles in communication with each other. There has been a lack in executing their requests in a synchronized way based on task priority. This lack leads to massive data traffic loss and degrades the Quality of Service (QoS. One of the challenges is to analyze the QoS parameters in ZigBee network that help to detect the overall network performance. The contribution of this paper is twofold; first, a ZigBee Network is implemented based on node priority. It demonstrates a method to generate a new priority of devices with respect to their existing priority and zones’ priority as well. Second, the QoS is analyzed based on the new priority status for tasks preference purposes. The outcome of this paper shows that the QoS of the network is more conspicuous than non-priority based network.

A Novel Prioritization Scheme to Improve QoS in IEEE 802.11e Networks

Directory of Open Access Journals (Sweden)

Navid Tadayon

2010-01-01

Full Text Available IEEE 802.11 WLAN utilizes a distributed function at its MAC layer, namely, DCF to access the wireless medium. Due to its distributed nature, DCF is able to guarantee working stability in a wireless medium while maintaining the assembling and maintenance cost in a low level. However, DCF is inefficient in dealing with real-time traffics due to its incapability on providing QoS. IEEE 802.11e was introduced as a supplementary standard to cope with this problem. This standard introduces an Enhanced Distributed Coordination Function (EDCF that works based on diff-Serve model and can serve multiple classes of traffics (by using different prioritizations schemes. With the emergence of new time-sensitive applications, EDCF has proved to be yet inefficient in dealing with these kinds of traffics because it could not provide network with well-differentiated QoS. In this study, we propose a novel prioritization scheme to improve QoS level in IEEE 802.11e network. In this scheme, we replace Uniform PDF with Gamma PDF, which has salient differentiating properties. We investigate the suitability and superiority of this scheme on furnishing network with well-differentiated QoS using probabilistic analysis. We strengthen our claims by extensive simulation runs.

OPNET Modeler Simulation Testing of the New Model Used to Cooperation Between QoS and Security Mechanisms

Directory of Open Access Journals (Sweden)

Jan Papaj

2012-01-01

Full Text Available In this article the performance analysis of the new model, used to integration between QoS and Security, is introduced. OPNET modeler simulation testing of the new model with comparation with the standard model is presented. This new model enables the process of cooperation between QoS and Security in MANET. The introduction how the model is implemented to the simulation OPNET modeler is also showed. Model provides possibilities to integration and cooperation of QoS and security by the cross layer design (CLD with modified security service vector (SSV. An overview of the simulation tested of the new model, comparative study in mobile ad-hoc networks, describe requirements and directions for adapted solutions are presented. Main idea of the testing is to show how QoS and Security related services could be provided simultaneously with using minimal interfering with each service.

Hierarchy Bayesian model based services awareness of high-speed optical access networks

Science.gov (United States)

Bai, Hui-feng

2018-03-01

As the speed of optical access networks soars with ever increasing multiple services, the service-supporting ability of optical access networks suffers greatly from the shortage of service awareness. Aiming to solve this problem, a hierarchy Bayesian model based services awareness mechanism is proposed for high-speed optical access networks. This approach builds a so-called hierarchy Bayesian model, according to the structure of typical optical access networks. Moreover, the proposed scheme is able to conduct simple services awareness operation in each optical network unit (ONU) and to perform complex services awareness from the whole view of system in optical line terminal (OLT). Simulation results show that the proposed scheme is able to achieve better quality of services (QoS), in terms of packet loss rate and time delay.

Warehouse stocking optimization based on dynamic ant colony genetic algorithm

Science.gov (United States)

Xiao, Xiaoxu

2018-04-01

In view of the various orders of FAW (First Automotive Works) International Logistics Co., Ltd., the SLP method is used to optimize the layout of the warehousing units in the enterprise, thus the warehouse logistics is optimized and the external processing speed of the order is improved. In addition, the relevant intelligent algorithms for optimizing the stocking route problem are analyzed. The ant colony algorithm and genetic algorithm which have good applicability are emphatically studied. The parameters of ant colony algorithm are optimized by genetic algorithm, which improves the performance of ant colony algorithm. A typical path optimization problem model is taken as an example to prove the effectiveness of parameter optimization.

QoS Negotiation in Real-Time Systems and its Application to Automated Flight Control

Science.gov (United States)

2000-11-01

QoS Negotiation in Real - Time Systems and Its Application to Automated Flight Control Tarek F. Abdelzaher, Member, IEEE, Ella M. Atkins, Member, IEEE...been committed to those that arrived earlier. In hard- real - time systems , a static analysis may be performed to guarantee a priori that all requests be...DATE 2000 2. REPORT TYPE 3. DATES COVERED 00-00-2000 to 00-00-2000 4. TITLE AND SUBTITLE QoS Negotiation in Real - Time Systems and its

Improving the Reliability of Optimised Link State Routing in a Smart Grid Neighbour Area Network based Wireless Mesh Network Using Multiple Metrics

Directory of Open Access Journals (Sweden)

Yakubu Tsado

2017-02-01

Full Text Available Reliable communication is the backbone of advanced metering infrastructure (AMI. Within the AMI, the neighbourhood area network (NAN transports a multitude of traffic, each with unique requirements. In order to deliver an acceptable level of reliability and latency, the underlying network, such as the wireless mesh network(WMN, must provide or guarantee the quality-of-service (QoS level required by the respective application traffic. Existing WMN routing protocols, such as optimised link state routing (OLSR, typically utilise a single metric and do not consider the requirements of individual traffic; hence, packets are delivered on a best-effort basis. This paper presents a QoS-aware WMN routing technique that employs multiple metrics in OLSR optimal path selection for AMI applications. The problems arising from this approach are non deterministic polynomial time (NP-complete in nature, which were solved through the combined use of the analytical hierarchy process (AHP algorithm and pruning techniques. For smart meters transmitting Internet Protocol (IP packets of varying sizes at different intervals, the proposed technique considers the constraints of NAN and the applications’ traffic characteristics. The technique was developed by combining multiple OLSR path selection metrics with the AHP algorithminns-2. Compared with the conventional link metric in OLSR, the results show improvements of about 23% and 45% in latency and Packet Delivery Ratio (PDR, respectively, in a 25-node grid NAN.

QoS testing of service-based applications

OpenAIRE

Driss , Maha; Jamoussi , Yassine; Ben Ghézala , Henda Hajjami

2008-01-01

International audience; Web services (WSs) are becoming increasingly popular because of their potential in several application domains including e-Enterprise, e-Business, e-Government, and e-Science. Based on open XML standards, WS technology allows the construction of massively distributed and loosely coupled applications. A service composition mechanism should satisfy not only functional properties but also non-functional Quality of Service (QoS) ones. In this paper, we introduce a discrete...

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed; Ho, Pin Han; Naik, Sagar; Shihada, Basem

2011-01-01

This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed

2011-08-21

This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

Further improvements in competitive guarantees for QoS buffering

NARCIS (Netherlands)

Bansal, N.; Fleischer, L.K.; Kimbrel, T.; Mahdian, M.; Schieber, B.; Sviridenko, M.; Diaz, J.; Karhumäki, J.; Lepistö, A.; Sannella, D.

2004-01-01

We study the behavior of algorithms for buffering packets weighted by different levels of Quality of Service (QoS) guarantees in a single queue. Buffer space is limited, and packet loss occurs when the buffer overflows. We describe a modification of the previously proposed ``preemptive greedy{''}

On capacity tradeoffs in secure DS-CDMA packet communications with QOS constraints

International Nuclear Information System (INIS)

Sattar, F.; Mufti, M.

2012-01-01

This paper presents a mathematical framework for analysis of effect of counter mode (CTR) encryption on the traffic capacity of packet communication systems based on direct-sequence, code-division, multiple-access (DS-CDMA). We specify QoS constraints in terms of minimum acceptable mean opinion score (MOS) of voice payload, maximum permissible resource utilization for CTR-mode re-keying and DS-CDMA processing gain. We quantify the trade-offs in system capacity as a function of these constraints. Results show that application of CTR encryption causes error expansion and respecting the QoS constraints while satisfying the desired encryption parameters results in reduction of traffic capacity. (author)

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

Science.gov (United States)

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-01-01

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio. PMID:29562628

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks.

Science.gov (United States)

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-03-18

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Shaobo Wu

2018-03-01

Full Text Available Wireless sensor networks (WSNs involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

McMAC: Towards a MAC Protocol with Multi-Constrained QoS Provisioning for Diverse Traffic in Wireless Body Area Networks

OpenAIRE

Monowar, Muhammad; Hassan, Mohammad; Bajaber, Fuad; Al-Hussein, Musaed; Alamri, Atif

2012-01-01

The emergence of heterogeneous applications with diverse requirements for resource-constrained Wireless Body Area Networks (WBANs) poses significant challenges for provisioning Quality of Service (QoS) with multi-constraints (delay and reliability) while preserving energy efficiency. To address such challenges, this paper proposes McMAC, a MAC protocol with multi-constrained QoS provisioning for diverse traffic classes in WBANs. McMAC classifies traffic based on their multi-constrained QoS de...

ANCS: Achieving QoS through Dynamic Allocation of Network Resources in Virtualized Clouds

Directory of Open Access Journals (Sweden)

Cheol-Ho Hong

2016-01-01

Full Text Available To meet the various requirements of cloud computing users, research on guaranteeing Quality of Service (QoS is gaining widespread attention in the field of cloud computing. However, as cloud computing platforms adopt virtualization as an enabling technology, it becomes challenging to distribute system resources to each user according to the diverse requirements. Although ample research has been conducted in order to meet QoS requirements, the proposed solutions lack simultaneous support for multiple policies, degrade the aggregated throughput of network resources, and incur CPU overhead. In this paper, we propose a new mechanism, called ANCS (Advanced Network Credit Scheduler, to guarantee QoS through dynamic allocation of network resources in virtualization. To meet the various network demands of cloud users, ANCS aims to concurrently provide multiple performance policies; these include weight-based proportional sharing, minimum bandwidth reservation, and maximum bandwidth limitation. In addition, ANCS develops an efficient work-conserving scheduling method for maximizing network resource utilization. Finally, ANCS can achieve low CPU overhead via its lightweight design, which is important for practical deployment.

Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Ricciardi, Sergio; Fagertun, Anna Manolova

2012-01-01

In this paper, routing optimizations based on energy sources are proposed in dynamic GMPLS controlled optical networks. The influences of re-routing and load balancing factors on the algorithm are evaluated, with a focus on different re-routing thresholds. Results from dynamic network simulations...

Phone Routing using the Dynamic Memory Model

DEFF Research Database (Denmark)

Bendtsen, Claus Nicolaj; Krink, Thiemo

2002-01-01

In earlier studies a genetic algorithm (GA) extended with the dynamic memory model has shown remarkable performance on real-world-like problems. In this paper we experiment with routing in communication networks and show that the dynamic memory GA performs remarkable well compared to ant colony...

Using an Insect Mushroom Body Circuit to Encode Route Memory in Complex Natural Environments.

Directory of Open Access Journals (Sweden)

Paul Ardin

2016-02-01

Full Text Available Ants, like many other animals, use visual memory to follow extended routes through complex environments, but it is unknown how their small brains implement this capability. The mushroom body neuropils have been identified as a crucial memory circuit in the insect brain, but their function has mostly been explored for simple olfactory association tasks. We show that a spiking neural model of this circuit originally developed to describe fruitfly (Drosophila melanogaster olfactory association, can also account for the ability of desert ants (Cataglyphis velox to rapidly learn visual routes through complex natural environments. We further demonstrate that abstracting the key computational principles of this circuit, which include one-shot learning of sparse codes, enables the theoretical storage capacity of the ant mushroom body to be estimated at hundreds of independent images.

Ant colony optimization techniques for the hamiltonian p-median problem

Directory of Open Access Journals (Sweden)

M. Zohrehbandian

2010-12-01

Full Text Available Location-Routing problems involve locating a number of facilitiesamong candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. A special case of these problems is Hamiltonian p-Median problem (HpMP. This research applies the metaheuristic method of ant colony optimization (ACO to solve the HpMP. Modifications are made to the ACO algorithm used to solve the traditional vehicle routing problem (VRP in order to allow the search of the optimal solution of the HpMP. Regarding this metaheuristic algorithm a computational experiment is reported as well.

Impact of VoIP and QoS on Open and Distance Learning

Directory of Open Access Journals (Sweden)

Sanjay JASOLA

2006-07-01

Full Text Available Voice over Internet Protocol (VoIP is becoming a reality in many organizations. The potential for mobility in voice over wi-fi networks will derive demand for the technology. Wireless VoIP is poised to rival VoIP as an alternative telephony tool. Internet has been used to transport data in the form of packet. In the past, Internet did not support any kind of sophisticated quality of service (QoS mechanism. Although the type of service (TOS field in the Internet protocol (IP header has been existing and has been allowing the differentiated treatment of packets, it was never really used on a large scale. The voice is sensitive to delay and jitter so bandwidth must be guaranteed while transporting it. With the extensive use of Internet for carrying voice, there is a need to add QoS functionality in it. QoS with reference to VoIP has been discussed in the paper. Limited bandwidth and network latency are the issues which need to be considered while using wireless LAN for packetized voice data. Efforts of standards like 802.11e which will take care of these issues, have also been explored. The impact of these technologies on distance education has also been explored in the paper.

An Efficient and QoS Supported Multichannel MAC Protocol for Vehicular Ad Hoc Networks.

Science.gov (United States)

Song, Caixia; Tan, Guozhen; Yu, Chao

2017-10-09

Vehicular Ad Hoc Networks (VANETs) employ multichannel to provide a variety of safety and non-safety (transport efficiency and infotainment) applications, based on the IEEE 802.11p and IEEE 1609.4 protocols. Different types of applications require different levels Quality-of-Service (QoS) support. Recently, transport efficiency and infotainment applications (e.g., electronic map download and Internet access) have received more and more attention, and this kind of applications is expected to become a big market driver in a near future. In this paper, we propose an Efficient and QoS supported Multichannel Medium Access Control (EQM-MAC) protocol for VANETs in a highway environment. The EQM-MAC protocol utilizes the service channel resources for non-safety message transmissions during the whole synchronization interval, and it dynamically adjusts minimum contention window size for different non-safety services according to the traffic conditions. Theoretical model analysis and extensive simulation results show that the EQM-MAC protocol can support QoS services, while ensuring the high saturation throughput and low transmission delay for non-safety applications.

An Efficient and QoS Supported Multichannel MAC Protocol for Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Caixia Song

2017-10-01

Full Text Available Vehicular Ad Hoc Networks (VANETs employ multichannel to provide a variety of safety and non-safety (transport efficiency and infotainment applications, based on the IEEE 802.11p and IEEE 1609.4 protocols. Different types of applications require different levels Quality-of-Service (QoS support. Recently, transport efficiency and infotainment applications (e.g., electronic map download and Internet access have received more and more attention, and this kind of applications is expected to become a big market driver in a near future. In this paper, we propose an Efficient and QoS supported Multichannel Medium Access Control (EQM-MAC protocol for VANETs in a highway environment. The EQM-MAC protocol utilizes the service channel resources for non-safety message transmissions during the whole synchronization interval, and it dynamically adjusts minimum contention window size for different non-safety services according to the traffic conditions. Theoretical model analysis and extensive simulation results show that the EQM-MAC protocol can support QoS services, while ensuring the high saturation throughput and low transmission delay for non-safety applications.

OPTIMISATION OF BUFFER SIZE FOR ENHANCING QOS OF VIDEO TRAFFIC USING CROSS LAYERED HYBRID TRANSPORT LAYER PROTOCOL APPROACH

Directory of Open Access Journals (Sweden)

S. Matilda

2011-03-01

Full Text Available Video streaming is gaining importance, with the wide popularity of multimedia rich applications in the Internet. Video streams are delay sensitive and require seamless flow for continuous visualization. Properly designed buffers offer a solution to queuing delay. The diagonally opposite QoS metrics associated with video traffic poses an optimization problem, in the design of buffers. This paper is a continuation of our previous work [1] and deals with the design of buffers. It aims at finding the optimum buffer size for enhancing QoS offered to video traffic. Network-centric QoS provisioning approach, along with hybrid transport layer protocol approach is adopted, to arrive at an optimum size which is independent of RTT. In this combinational approach, buffers of routers and end devices are designed to satisfy the various QoS parameters at the transport layer. OPNET Modeler is used to simulate environments for testing the design. Based on the results of simulation it is evident that the hybrid transport layer protocol approach is best suited for transmitting video traffic as it supports the economical design.

Ant- and Ant-Colony-Inspired ALife Visual Art.

Science.gov (United States)

Greenfield, Gary; Machado, Penousal

2015-01-01

Ant- and ant-colony-inspired ALife art is characterized by the artistic exploration of the emerging collective behavior of computational agents, developed using ants as a metaphor. We present a chronology that documents the emergence and history of such visual art, contextualize ant- and ant-colony-inspired art within generative art practices, and consider how it relates to other ALife art. We survey many of the algorithms that artists have used in this genre, address some of their aims, and explore the relationships between ant- and ant-colony-inspired art and research on ant and ant colony behavior.

Multi-Class load balancing scheme for QoS and energy ...

African Journals Online (AJOL)

Multi-Class load balancing scheme for QoS and energy conservation in cloud computing. ... If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs. Alternatively, you can download the PDF file directly to your computer, from ...

Optical slotted circuit switched network: a bandwidth efficient alternative to wavelength-routed network

Science.gov (United States)

Li, Yan; Collier, Martin

2007-11-01

Wavelength-routed networks have received enormous attention due to the fact that they are relatively simple to implement and implicitly offer Quality of Service (QoS) guarantees. However, they suffer from a bandwidth inefficiency problem and require complex Routing and Wavelength Assignment (RWA). Most attempts to address the above issues exploit the joint use of WDM and TDM technologies. The resultant TDM-based wavelength-routed networks partition the wavelength bandwidth into fixed-length time slots organized as a fixed-length frame. Multiple connections can thus time-share a wavelength and the grooming of their traffic leads to better bandwidth utilization. The capability of switching in both wavelength and time domains in such networks also mitigates the RWA problem. However, TMD-based wavelength-routed networks work in synchronous mode and strict synchronization among all network nodes is required. Global synchronization for all-optical networks which operate at extremely high speed is technically challenging, and deploying an optical synchronizer for each wavelength involves considerable cost. An Optical Slotted Circuit Switching (OSCS) architecture is proposed in this paper. In an OSCS network, slotted circuits are created to better utilize the wavelength bandwidth than in classic wavelength-routed networks. The operation of the protocol is such as to avoid the need for global synchronization required by TDM-based wavelength-routed networks.

McMAC: towards a MAC protocol with multi-constrained QoS provisioning for diverse traffic in Wireless Body Area Networks.

Science.gov (United States)

Monowar, Muhammad Mostafa; Hassan, Mohammad Mehedi; Bajaber, Fuad; Al-Hussein, Musaed; Alamri, Atif

2012-11-12

The emergence of heterogeneous applications with diverse requirements for resource-constrained Wireless Body Area Networks (WBANs) poses significant challenges for provisioning Quality of Service (QoS) with multi-constraints (delay and reliability) while preserving energy efficiency. To address such challenges, this paper proposes McMAC,a MAC protocol with multi-constrained QoS provisioning for diverse traffic classes in WBANs. McMAC classifies traffic based on their multi-constrained QoS demands and introduces a novel superframe structure based on the "transmit-whenever-appropriate"principle, which allows diverse periods for diverse traffic classes according to their respective QoS requirements. Furthermore, a novel emergency packet handling mechanism is proposedto ensure packet delivery with the least possible delay and the highest reliability. McMAC is also modeled analytically, and extensive simulations were performed to evaluate its performance. The results reveal that McMAC achieves the desired delay and reliability guarantee according to the requirements of a particular traffic class while achieving energy efficiency.

Fidelity-Based Ant Colony Algorithm with Q-learning of Quantum System

Science.gov (United States)

Liao, Qin; Guo, Ying; Tu, Yifeng; Zhang, Hang

2018-03-01

Quantum ant colony algorithm (ACA) has potential applications in quantum information processing, such as solutions of traveling salesman problem, zero-one knapsack problem, robot route planning problem, and so on. To shorten the search time of the ACA, we suggest the fidelity-based ant colony algorithm (FACA) for the control of quantum system. Motivated by structure of the Q-learning algorithm, we demonstrate the combination of a FACA with the Q-learning algorithm and suggest the design of a fidelity-based ant colony algorithm with the Q-learning to improve the performance of the FACA in a spin-1/2 quantum system. The numeric simulation results show that the FACA with the Q-learning can efficiently avoid trapping into local optimal policies and increase the speed of convergence process of quantum system.

A framework for QoS & mobility in the Internet next generation

NARCIS (Netherlands)

Rexhepi, Vlora; Karagiannis, Georgios; Heijenk, Geert; Pras, Aiko

2000-01-01

It is expected that the Internet next generation architecture will support applications with different quality of service requirements, independently of whether their location is fixed or mobile. However, enabling QoS in Internet is a tough challenge, and it gets even tougher when the mobile

A framework for QoS & mobility in the Internet next generation

NARCIS (Netherlands)

Karagiannis, Georgios; Rexhepi, Vlora; Heijenk, Geert

It is expected that the next generation Internet architecture will support applications with different quality of service requirements, independently of whether their location is fixed or movable. However, enabling QoS in Internet is a tough challenge, and it gets even tougher when the mobile

Dynamic Resource Allocation and QoS Control Capabilities of the Japanese Academic Backbone Network

Directory of Open Access Journals (Sweden)

Michihiro Aoki

2010-08-01

Full Text Available Dynamic resource control capabilities have become increasingly important for academic networks that must support big scientific research projects at the same time as less data intensive research and educational activities. This paper describes the dynamic resource allocation and QoS control capabilities of the Japanese academic backbone network, called SINET3, which supports a variety of academic applications with a wide range of network services. The article describes the network architecture, networking technologies, resource allocation, QoS control, and layer-1 bandwidth on-demand services. It also details typical services developed for scientific research, including the user interface, resource control, and management functions, and includes performance evaluations.

ANT

DEFF Research Database (Denmark)

van der Duim, René; Ren, Carina Bregnholm; Jóhannesson, Gunnar Thór

2017-01-01

Ten years ago actor-network theory (ANT) entered this journal. To illustrate how the relational ontology and sensibilities of ANT lend themselves to particular kinds of research, we first interrogate the main controversies as a way to open up and discuss the main premises of ANT. These debates...... concern the status and agency of objects and non-humans, ANT’s denial of the explanatory power of social structures, and the political implications of ANT. Second we present ANT’s relevance for tourism studies and discuss what ANT ‘does’ in practice. After summarizing a decade of relations between ANT...... and tourism, we conclude by tracing three future trajectories of how we have ‘moved away with’ ANT into new areas of discovery....

Survey on Recent Research and Implementation of Ant Colony Optimization in Various Engineering Applications

Directory of Open Access Journals (Sweden)

Mohan B. Chandra

2011-08-01

Full Text Available Ant colony optimization (ACO takes inspiration from the foraging behaviour of real ant species. This ACO exploits a similar mechanism for solving optimization problems for the various engineering field of study. Many successful implementations using ACO are now available in many applications. This paper reviewing varies systematic approach on recent research and implementation of ACO. Finally it presents the experimental result of ACO which is applied for routing problem and compared with existing algorithms.

Reliable Rescue Routing Optimization for Urban Emergency Logistics under Travel Time Uncertainty

Directory of Open Access Journals (Sweden)

Qiuping Li

2018-02-01

Full Text Available The reliability of rescue routes is critical for urban emergency logistics during disasters. However, studies on reliable rescue routing under stochastic networks are still rare. This paper proposes a multiobjective rescue routing model for urban emergency logistics under travel time reliability. A hybrid metaheuristic integrating ant colony optimization (ACO and tabu search (TS was designed to solve the model. An experiment optimizing rescue routing plans under a real urban storm event, was carried out to validate the proposed model. The experimental results showed how our approach can improve rescue efficiency with high travel time reliability.

QoS Provisioning Techniques for Future Fiber-Wireless (FiWi Access Networks

Directory of Open Access Journals (Sweden)

Martin Maier

2010-04-01

Full Text Available A plethora of enabling optical and wireless access-metro network technologies have been emerging that can be used to build future-proof bimodal fiber-wireless (FiWi networks. Hybrid FiWi networks aim at providing wired and wireless quad-play services over the same infrastructure simultaneously and hold great promise to mitigate the digital divide and change the way we live and work by replacing commuting with teleworking. After overviewing enabling optical and wireless network technologies and their QoS provisioning techniques, we elaborate on enabling radio-over-fiber (RoF and radio-and-fiber (R&F technologies. We describe and investigate new QoS provisioning techniques for future FiWi networks, ranging from traffic class mapping, scheduling, and resource management to advanced aggregation techniques, congestion control, and layer-2 path selection algorithms.

Asymptotic Delay Analysis for Cross-Layer Delay-Based Routing in Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Philippe Jacquet

2007-01-01

Full Text Available This paper addresses the problem of the evaluation of the delay distribution via analytical means in IEEE 802.11 wireless ad hoc networks. We show that the asymptotic delay distribution can be expressed as a power law. Based on the latter result, we present a cross-layer delay estimation protocol and we derive new delay-distribution-based routing algorithms, which are well adapted to the QoS requirements of real-time multimedia applications. In fact, multimedia services are not sensitive to average delays, but rather to the asymptotic delay distributions. Indeed, video streaming applications drop frames when they are received beyond a delay threshold, determined by the buffer size. Although delay-distribution-based routing is an NP-hard problem, we show that it can be solved in polynomial time when the delay threshold is large, because of the asymptotic power law distribution of the link delays.

Fairness as a QoS Measure for Web Services

Directory of Open Access Journals (Sweden)

Stefano Bistarelli

2009-06-01

Full Text Available Service Oriented Architectures (SOAs are component-based architectures, characterized by reusability, modularization and composition, usually offered by HTTP (web services and often equipped with a Quality of Services (QoS measure. In order to guarantee the fairness property to each client requesting a service, we propose a fair version of the (Soft Concurrent Constraint language to deal with the negotiation phases of the Service Level Agreement (SLA protocol.

Collaborative QoS Prediction for Mobile Service with Data Filtering and SlopeOne Model

Directory of Open Access Journals (Sweden)

Yuyu Yin

2017-01-01

Full Text Available The mobile service is a widely used carrier for mobile applications. With the increase of the number of mobile services, for service recommendation and selection, the nonfunctional properties (also known as quality of service, QoS become increasingly important. However, in many cases, the number of mobile services invoked by a user is quite limited, which leads to the large number of missing QoS values. In recent years, many prediction algorithms, such as algorithms extended from collaborative filtering (CF, are proposed to predict QoS values. However, the ideas of most existing algorithms are borrowed from the recommender system community, not specific for mobile service. In this paper, we first propose a data filtering-extended SlopeOne model (filtering-based CF, which is based on the characteristics of a mobile service and considers the relation with location. Also, using the data filtering technique in FB-CF and matrix factorization (MF, this paper proposes another model FB-MF (filtering-based MF. We also build an ensemble model, which combines the prediction results of FB-CF model and FB-MF model. We conduct sufficient experiments, and the experimental results demonstrate that our models outperform all compared methods and achieve good results in high data sparsity scenario.

How lost "passenger" ants find their way home.

Science.gov (United States)

Srinivasan, Mandyam V

2018-03-01

Animal navigation has fascinated biologists and engineers for centuries, and some of the most illuminating discoveries have come from the study of creatures with a brain no larger than a sesame seed. In an elegant recent study, Pfeiffer and Wittlinger (Science, 353, 1155-1157, 2016) have shown the means by which desert ants, carried from one nest to another by a relative, find their own way back home if they are accidentally dropped en route.

Traffic Agents for Improving QoS in Mixed Infrastructure and Ad Hoc Modes Wireless LAN

Directory of Open Access Journals (Sweden)

Yuan Hai-Feng

2006-01-01

Full Text Available As an important complement to infrastructured wireless networks, mobile ad hoc networks (MANET are more flexible in providing wireless access services, but more difficult in meeting different quality of service (QoS requirements for mobile customers. Both infrastructure and ad hoc network structures are supported in wireless local area networks (WLAN, which can offer high data-rate wireless multimedia services to the mobile stations (MSs in a limited geographical area. For those out-of-coverage MSs, how to effectively connect them to the access point (AP and provide QoS support is a challenging issue. By mixing the infrastructure and the ad hoc modes in WLAN, we propose in this paper a new coverage improvement scheme that can identify suitable idle MSs in good service zones as traffic agents (TAs to relay traffic from those out-of-coverage MSs to the AP. The service coverage area of WLAN is then expanded. The QoS requirements (e.g., bandwidth of those MSs are considered in the selection process of corresponding TAs. Mathematical analysis, verified by computer simulations, shows that the proposed TA scheme can effectively reduce blocking probability when traffic load is light.

A New Resources Provisioning Method Based on QoS Differentiation and VM Resizing in IaaS

Directory of Open Access Journals (Sweden)

Rongdong Hu

2015-01-01

Full Text Available In order to improve the host energy efficiency in IaaS, we proposed an adaptive host resource provisioning method, CoST, which is based on QoS differentiation and VM resizing. The control model can adaptively adjust control parameters according to real time application performance, in order to cope with changes in load. CoST takes advantage of the fact that different types of applications have different sensitivity degrees to performance and cost. It places two different types of VMs on the same host and dynamically adjusts their sizes based on the load forecasting and QoS feedback. It not only guarantees the performance defined in SLA, but also keeps the host running in energy-efficient state. Real Google cluster trace and host power data are used to evaluate the proposed method. Experimental results show that CoST can provide performance-sensitive application with a steady QoS and simultaneously speed up the overall processing of performance-tolerant application by 20~66%. The host energy efficiency is significantly improved by 7~23%.

Combining Wired and Wireless Networks for a QoS-Aware Broadband Infrastructure

DEFF Research Database (Denmark)

Pedersen, Jens Myrup; Riaz, Muhammad Tahir; Knudsen, Thomas Phillip

2004-01-01

We show how integrated planning of wired and wireless infrastructures can be used to build a QoS-aware broadband infrastructure. The outset is a case study of the municipality of Hals, a rural community in Denmark, where the objective is to establish a broadband infrastructure reaching all househ...... To The Home for primary connections and Fixed Wireless Access for backup. This is implemented over 15 years, during which temporary solutions ensure sufficient QoS and reliability for all users. These temporary solutions form parts of the final solutions....

Using latency as a QoS indicator for global cloud computing services

DEFF Research Database (Denmark)

Pedersen, Jens Myrup; Riaz, Tahir; Dubalski, Bozydar

2013-01-01

Many globally distributed cloud computing (CC) applications and services running over the Internet, between globally dispersed clients and servers, will require certain levels of QoS in order to deliver and give a sufficiently smooth user experience. This would be essential for real-time streaming...

AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Farzad Kiani

2016-01-01

Full Text Available Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase, the sensors are placed into virtual layers. The second phase (data transmission is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.

Performance evaluation of spatial vector routing protocol for wireless sensor networks

International Nuclear Information System (INIS)

Baloch, J.; Jokhio, I.

2012-01-01

WSNs (Wireless Sensor Networks) is an emerging area of research. Researchers worldwide are working on the issues faced by sensor nodes. Communication has been a major issue in wireless networks and the problem is manifolds in WSN s because of the limited resources. The routing protocol in such networks plays a pivotal role, as an effective routing protocol could significantly reduce the energy consumed in transmitting and receiving data packets throughout a network. In this paper the performance of SVR (Spatial Vector Routing) an energy efficient, location aware routing protocol is compared with the existing location aware protocols. The results from the simulation trials show the performance of SVR. (author)

Performance Evaluation of Spatial Vector Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Javed Ali Baloch

2012-10-01

Full Text Available WSNs (Wireless Sensor Networks is an emerging area of research. Researchers worldwide are working on the issues faced by sensor nodes. Communication has been a major issue in wireless networks and the problem is manifolds in WSNs because of the limited resources. The routing protocol in such networks plays a pivotal role, as an effective routing protocol could significantly reduce the energy consumed in transmitting and receiving data packets throughout a network. In this paper the performance of SVR (Spatial Vector Routing an energy efficient, location aware routing protocol is compared with the existing location aware protocols. The results from the simulation trials show the performance of SVR.

A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

Directory of Open Access Journals (Sweden)

Parisa Bazmi

2016-11-01

Full Text Available Named Data Networking (NDN is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN Based Traffic-aware Forwarding strategy (NNTF is introduced in order to determine an optimal path for Interest forwarding. NN is embedded in NDN routers to select next hop dynamically based on the path overload probability achieved from the NN. This solution is characterized by load balancing and QoS-awareness via monitoring the available path and forwarding data on the traffic-aware shortest path. The performance of NNTF is evaluated using ndnSIM which shows the efficiency of this scheme in terms of network QoS improvementof17.5% and 72% reduction in network delay and packet drop respectively.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

Science.gov (United States)

Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

2015-01-01

In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jeevaa Katiravan

2015-01-01

Full Text Available In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

Learning-Based QoS Control Algorithms for Next Generation Internet of Things

Directory of Open Access Journals (Sweden)

Sungwook Kim

2015-01-01

Full Text Available The Internet has become an evolving entity, growing in importance and creating new value through its expansion and added utilization. The Internet of Things (IoT is a new concept associated with the future Internet and has recently become popular in a dynamic and global network infrastructure. However, in an IoT implementation, it is difficult to satisfy different Quality of Service (QoS requirements and achieve rapid service composition and deployment. In this paper, we propose a new QoS control scheme for IoT systems. Based on the Markov game model, the proposed scheme can effectively allocate IoT resources while maximizing system performance. In multiagent environments, a game theory approach can provide an effective decision-making framework for resource allocation problems. To verify the results of our study, we perform a simulation and confirm that the proposed scheme can achieve considerably improved system performance compared to existing schemes.

A model to improve the routing performance of Cognitive Radio Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Lesiba Morries Kola

2017-12-01

Full Text Available The increasing demand for broadband wireless technologies has led to the scarcity, inefficient utilization, and underutilization of the spectrum. The Cognitive Radio (CR technology has emerged as the promising solution which improves the utilization of the spectrum. However, routing is a challenge due to the dynamic nature of the CR networks. The link quality varies in space and time as nodes join and leave the network. The network connectivity is intermittent due to node mobility and the activities of the primary user. The spectrum aware, spectrum agile, and interference aware routing protocols are vital for the sturdiness of the network and efficient utilization of the resources. We propose an interference aware, spectrum aware, and agile extended Weighted Cumulative Expected Transmission Time (xWCETT routing protocol. The protocol integrates the features of the Ad-hoc On-demand Distance Vector (AODV and the weighted cumulative expected transmission time (WCETT routing protocols. The xWCETT was simulated using the Network Simulator 2 and its performance compared with the AODV and the WCETT routing protocols. The xWCETT was evaluated with respect to quality of service related metrics and the results show that it outperformed the AODV and WCETT routing protocols.

Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System

Directory of Open Access Journals (Sweden)

Majid Yousefikhoshbakht

2016-07-01

Full Text Available The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The objective is to minimize the total distance traveled by the salesman.  Because this problem is a non-deterministic polynomial (NP-hard problem in nature, a hybrid meta-heuristic algorithm called REACSGA is used for solving the TSP. In REACSGA, a reactive bone route algorithm that uses the ant colony system (ACS for generating initial diversified solutions and the genetic algorithm (GA as an improved procedure are applied. Since the performance of the Metaheuristic algorithms is significantly influenced by their parameters, Taguchi Method is used to set the parameters of the proposed algorithm. The proposed algorithm is tested on several standard instances involving 24 to 318 nodes from the literature. The computational result shows that the results of the proposed algorithm are competitive with other metaheuristic algorithms for solving the TSP in terms of better quality of solution and computational time respectively. In addition, the proposed REACSGA is significantly efficient and finds closely the best known solutions for most of the instances in which thirteen best known solutions are also found.

AN AUTOMATED END-TO-END MULTI-AGENT QOS BASED ARCHITECTURE FOR SELECTION OF GEOSPATIAL WEB SERVICES

Directory of Open Access Journals (Sweden)

M. Shah

2012-07-01

With the proliferation of web services published over the internet, multiple web services may provide similar functionality, but with different non-functional properties. Thus, Quality of Service (QoS offers a metric to differentiate the services and their service providers. In a quality-driven selection of web services, it is important to consider non-functional properties of the web service so as to satisfy the constraints or requirements of the end users. The main intent of this paper is to build an automated end-to-end multi-agent based solution to provide the best-fit web service to service requester based on QoS.

Fuzzy Logic-based Intelligent Scheme for Enhancing QoS of Vertical Handover Decision in Vehicular Ad-hoc Networks

Science.gov (United States)

Azzali, F.; Ghazali, O.; Omar, M. H.

2017-08-01

The design of next generation networks in various technologies under the “Anywhere, Anytime” paradigm offers seamless connectivity across different coverage. A conventional algorithm such as RSSThreshold algorithm, that only uses the received strength signal (RSS) as a metric, will decrease handover performance regarding handover latency, delay, packet loss, and handover failure probability. Moreover, the RSS-based algorithm is only suitable for horizontal handover decision to examine the quality of service (QoS) compared to the vertical handover decision in advanced technologies. In the next generation network, vertical handover can be started based on the user’s convenience or choice rather than connectivity reasons. This study proposes a vertical handover decision algorithm that uses a Fuzzy Logic (FL) algorithm, to increase QoS performance in heterogeneous vehicular ad-hoc networks (VANET). The study uses network simulator 2.29 (NS 2.29) along with the mobility traffic network and generator to implement simulation scenarios and topologies. This helps the simulation to achieve a realistic VANET mobility scenario. The required analysis on the performance of QoS in the vertical handover can thus be conducted. The proposed Fuzzy Logic algorithm shows improvement over the conventional algorithm (RSSThreshold) in the average percentage of handover QoS whereby it achieves 20%, 21% and 13% improvement on handover latency, delay, and packet loss respectively. This is achieved through triggering a process in layer two and three that enhances the handover performance.

Contention aware mobility prediction routing for intermittently connected mobile networks

KAUST Repository

Elwhishi, Ahmed; Ho, Pin-Han; Shihada, Basem

2013-01-01

This paper introduces a novel multi-copy routing protocol, called predict and forward (PF), for delay tolerant networks, which aims to explore the possibility of using mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future inter-contact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

Contention aware mobility prediction routing for intermittently connected mobile networks

KAUST Repository

Elwhishi, Ahmed

2013-04-26

This paper introduces a novel multi-copy routing protocol, called predict and forward (PF), for delay tolerant networks, which aims to explore the possibility of using mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future inter-contact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

Soporte de QoS con 802.11e para tráfico heterogéneo en ambientes MANET

OpenAIRE

Murazzo, María Antonia; Rodríguez, Nelson R.; Guevara, Miguel José; Scheffer, María

2014-01-01

Hoy en día existe una gran necesidad de mejorar la calidad de servicio (QoS) ofrecida en redes móviles Ad Hoc (Mobile Ad-Hoc Networks -MANET-) que actualmente sólo ofrecen servicio best effort. Esto posee gran impacto en las aplicaciones que se corren, las cuales generan tráficos con diferentes requerimientos de recursos de la red. El presente trabajo tiene como objetivo fundamental analizar el comportamiento de la implementación de QoS en la sub capa MAC mediante 802.11e en ambientes con trá...

Impact of the codec and various QoS methods on the final quality of the transferred voice in an IP network

International Nuclear Information System (INIS)

Slavata, Oldřich; Holub, Jan

2015-01-01

This paper deals with an analysis of the relation between the codec that is used, the QoS method, and the final voice transmission quality. The Cisco 2811 router is used for adjusting QoS. VoIP client Linphone is used for adjusting the codec. The criterion for transmission quality is the MOS parameter investigated with the ITU-T P.862 PESQ and P.863 POLQA algorithms

Centralized Routing and Scheduling Using Multi-Channel System Single Transceiver in 802.16d

Science.gov (United States)

Al-Hemyari, A.; Noordin, N. K.; Ng, Chee Kyun; Ismail, A.; Khatun, S.

This paper proposes a cross-layer optimized strategy that reduces the effect of interferences from neighboring nodes within a mesh networks. This cross-layer design relies on the routing information in network layer and the scheduling table in medium access control (MAC) layer. A proposed routing algorithm in network layer is exploited to find the best route for all subscriber stations (SS). Also, a proposed centralized scheduling algorithm in MAC layer is exploited to assign a time slot for each possible node transmission. The cross-layer optimized strategy is using multi-channel single transceiver and single channel single transceiver systems for WiMAX mesh networks (WMNs). Each node in WMN has a transceiver that can be tuned to any available channel for eliminating the secondary interference. Among the considered parameters in the performance analysis are interference from the neighboring nodes, hop count to the base station (BS), number of children per node, slot reuse, load balancing, quality of services (QoS), and node identifier (ID). Results show that the proposed algorithms significantly improve the system performance in terms of length of scheduling, channel utilization ratio (CUR), system throughput, and average end to end transmission delay.

A seismic fault recognition method based on ant colony optimization

Science.gov (United States)

Chen, Lei; Xiao, Chuangbai; Li, Xueliang; Wang, Zhenli; Huo, Shoudong

2018-05-01

Fault recognition is an important section in seismic interpretation and there are many methods for this technology, but no one can recognize fault exactly enough. For this problem, we proposed a new fault recognition method based on ant colony optimization which can locate fault precisely and extract fault from the seismic section. Firstly, seismic horizons are extracted by the connected component labeling algorithm; secondly, the fault location are decided according to the horizontal endpoints of each horizon; thirdly, the whole seismic section is divided into several rectangular blocks and the top and bottom endpoints of each rectangular block are considered as the nest and food respectively for the ant colony optimization algorithm. Besides that, the positive section is taken as an actual three dimensional terrain by using the seismic amplitude as a height. After that, the optimal route from nest to food calculated by the ant colony in each block is judged as a fault. Finally, extensive comparative tests were performed on the real seismic data. Availability and advancement of the proposed method were validated by the experimental results.

An Energy-aware Routing Scheme in Delay Tolerant Mobile Sensor Networking

Directory of Open Access Journals (Sweden)

Zhe Chen

2014-08-01

Full Text Available In Delay Tolerant Mobile Sensor Networking (DTMSN, mobile sensor nodes are usually limited to their energy capacity, one important concern in routing design of DTMSN is energy consumption. This paper presents a number of variations of the Epidemic Routing Protocol (ERP to extend the DTMSN lifetime. It introduces the analytical model for ERP, after introducing the concepts behind the Target Delivery Probability and Minimum Delivery Probability, it defines the network lifetime. In this paper, it firstly studies many variations of the Epidemic Routing Protocol to extend the lifetime of the DTMSN. Secondly, based on the Epidemic Routing Protocol, three schemes are introduced. Those schemes rely on the limiting the times of message allowed for propagation (LT scheme, directly controlling the number of the copies (LC scheme, split the copies to the residual energies of the nodes (LE scheme. Finally, with the experiment and the validation of the simulation, the LE scheme can significantly maximize the lifetime of DTMSN, because it minimizes the number of copies and that shifts the generation of the copies to the nodes with larger residual energy.

A QoS Optimization Approach in Cognitive Body Area Networks for Healthcare Applications.

Science.gov (United States)

Ahmed, Tauseef; Le Moullec, Yannick

2017-04-06

Wireless body area networks are increasingly featuring cognitive capabilities. This work deals with the emerging concept of cognitive body area networks. In particular, the paper addresses two important issues, namely spectrum sharing and interferences. We propose methods for channel and power allocation. The former builds upon a reinforcement learning mechanism, whereas the latter is based on convex optimization. Furthermore, we also propose a mathematical channel model for off-body communication links in line with the IEEE 802.15.6 standard. Simulation results for a nursing home scenario show that the proposed approach yields the best performance in terms of throughput and QoS for dynamic environments. For example, in a highly demanding scenario our approach can provide throughput up to 7 Mbps, while giving an average of 97.2% of time QoS satisfaction in terms of throughput. Simulation results also show that the power optimization algorithm enables reducing transmission power by approximately 4.5 dBm, thereby sensibly and significantly reducing interference.

ENERGY AWARE NETWORK: BAYESIAN BELIEF NETWORKS BASED DECISION MANAGEMENT SYSTEM

Directory of Open Access Journals (Sweden)

Santosh Kumar Chaudhari

2011-06-01

Full Text Available A Network Management System (NMS plays a very important role in managing an ever-evolving telecommunication network. Generally an NMS monitors & maintains the health of network elements. The growing size of the network warrants extra functionalities from the NMS. An NMS provides all kinds of information about networks which can be used for other purposes apart from monitoring & maintaining networks like improving QoS & saving energy in the network. In this paper, we add another dimension to NMS services, namely, making an NMS energy aware. We propose a Decision Management System (DMS framework which uses a machine learning technique called Bayesian Belief Networks (BBN, to make the NMS energy aware. The DMS is capable of analysing and making control decisions based on network traffic. We factor in the cost of rerouting and power saving per port. Simulations are performed on standard network topologies, namely, ARPANet and IndiaNet. It is found that ~2.5-6.5% power can be saved.

Application of ant colony Algorithm and particle swarm optimization in architectural design

Science.gov (United States)

Song, Ziyi; Wu, Yunfa; Song, Jianhua

2018-02-01

By studying the development of ant colony algorithm and particle swarm algorithm, this paper expounds the core idea of the algorithm, explores the combination of algorithm and architectural design, sums up the application rules of intelligent algorithm in architectural design, and combines the characteristics of the two algorithms, obtains the research route and realization way of intelligent algorithm in architecture design. To establish algorithm rules to assist architectural design. Taking intelligent algorithm as the beginning of architectural design research, the authors provide the theory foundation of ant colony Algorithm and particle swarm algorithm in architectural design, popularize the application range of intelligent algorithm in architectural design, and provide a new idea for the architects.

ATM QoS Experiments Using TCP Applications: Performance of TCP/IP Over ATM in a Variety of Errored Links

Science.gov (United States)

Frantz, Brian D.; Ivancic, William D.

2001-01-01

Asynchronous Transfer Mode (ATM) Quality of Service (QoS) experiments using the Transmission Control Protocol/Internet Protocol (TCP/IP) were performed for various link delays. The link delay was set to emulate a Wide Area Network (WAN) and a Satellite Link. The purpose of these experiments was to evaluate the ATM QoS requirements for applications that utilize advance TCP/IP protocols implemented with large windows and Selective ACKnowledgements (SACK). The effects of cell error, cell loss, and random bit errors on throughput were reported. The detailed test plan and test results are presented herein.

An Improved Ant Colony Algorithm for Solving the Path Planning Problem of the Omnidirectional Mobile Vehicle

Directory of Open Access Journals (Sweden)

Jiang Zhao

2016-01-01

Full Text Available This paper presents an improved ant colony algorithm for the path planning of the omnidirectional mobile vehicle. The purpose of the improved ant colony algorithm is to design an appropriate route to connect the starting point and ending point of the environment with obstacles. Ant colony algorithm, which is used to solve the path planning problem, is improved according to the characteristics of the omnidirectional mobile vehicle. And in the improved algorithm, the nonuniform distribution of the initial pheromone and the selection strategy with direction play a very positive role in the path search. The coverage and updating strategy of pheromone is introduced to avoid repeated search reducing the effect of the number of ants on the performance of the algorithm. In addition, the pheromone evaporation coefficient is segmented and adjusted, which can effectively balance the convergence speed and search ability. Finally, this paper provides a theoretical basis for the improved ant colony algorithm by strict mathematical derivation, and some numerical simulations are also given to illustrate the effectiveness of the theoretical results.

New evidences supporting trophobiosis between populations of Edessa rufomarginata (Heteroptera: Pentatomidae and Camponotus (Hymenoptera: Formicidae ants

Directory of Open Access Journals (Sweden)

Daniel Paiva Silva

2016-06-01

Full Text Available ABSTRACT Despite its important effect on the maintenance of tritrophic interactions among plants, insect herbivores, and ants, there is still a paucity of natural history and basic biology information involving trophobiosis among Heteroptera stink bugs. Here, based on previous observations of a new trophobiotic interaction between Edessa rufomarginata (De Geer, 1773 and Camponotus rufipes (Fabricius, 1775 ants, we describe the chemical profile of the honeydew obtained by Gas Chromatography–Mass Spectrometry. There were mainly three different sugars (trehalose, glucose, and sorbose within our samples. The extrafloral nectaries of Caryocar brasiliense Camb., the host plant of E. rufomarginata, attracts a wide assemblage of Cerrado ants with varying aggressiveness toward herbivores. Therefore, this facultative trophobiotic interaction may allow the survival of the stink bug while feeding on the risky, highly ant-visited plant. Given the rarity of trophobiotic interactions between Pentatomidae species and ants and considering a zoological perspective within this family, here we discuss the ecological and evolutionary routes that may allow the rise of these interactions.

McMAC: Towards a MAC Protocol with Multi-Constrained QoS Provisioning for Diverse Traffic in Wireless Body Area Networks

Directory of Open Access Journals (Sweden)

Muhammad Mostafa Monowar

2012-11-01

Full Text Available The emergence of heterogeneous applications with diverse requirements forresource-constrained Wireless Body Area Networks (WBANs poses significant challengesfor provisioning Quality of Service (QoS with multi-constraints (delay and reliability whilepreserving energy efficiency. To address such challenges, this paper proposes McMAC,a MAC protocol with multi-constrained QoS provisioning for diverse traffic classes inWBANs. McMAC classifies traffic based on their multi-constrained QoS demands andintroduces a novel superframe structure based on the "transmit-whenever-appropriate"principle, which allows diverse periods for diverse traffic classes according to their respectiveQoS requirements. Furthermore, a novel emergency packet handling mechanism is proposedto ensure packet delivery with the least possible delay and the highest reliability. McMACis also modeled analytically, and extensive simulations were performed to evaluate itsperformance. The results reveal that McMAC achieves the desired delay and reliabilityguarantee according to the requirements of a particular traffic class while achieving energyefficiency.

A Secure Cluster-Based Multipath Routing Protocol for WMSNs

Directory of Open Access Journals (Sweden)

Jamal N. Al-Karaki

2011-04-01

Full Text Available The new characteristics of Wireless Multimedia Sensor Network (WMSN and its design issues brought by handling different traffic classes of multimedia content (video streams, audio, and still images as well as scalar data over the network, make the proposed routing protocols for typical WSNs not directly applicable for WMSNs. Handling real-time multimedia data requires both energy efficiency and QoS assurance in order to ensure efficient utility of different capabilities of sensor resources and correct delivery of collected information. In this paper, we propose a Secure Cluster-based Multipath Routing protocol for WMSNs, SCMR, to satisfy the requirements of delivering different data types and support high data rate multimedia traffic. SCMR exploits the hierarchical structure of powerful cluster heads and the optimized multiple paths to support timeliness and reliable high data rate multimedia communication with minimum energy dissipation. Also, we present a light-weight distributed security mechanism of key management in order to secure the communication between sensor nodes and protect the network against different types of attacks. Performance evaluation from simulation results demonstrates a significant performance improvement comparing with existing protocols (which do not even provide any kind of security feature in terms of average end-to-end delay, network throughput, packet delivery ratio, and energy consumption.

Calidad de servicio (QoS en procesos: Escenarios de procesamiento con aspectos

Directory of Open Access Journals (Sweden)

Hector Manuel Soto Pérez

2016-12-01

En resumen el presente trabajo estudia conceptos básicos de calidad de servicio y algunos de sus marcos de aplicación siguiendo un enfoque aspectual. Planteando posibles casos de uso genéricos para aplicar mejoras en la prestación de la QoS mediante aspectos en la planificación y gestión de recursos de aplicaciones tradicionales.

Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed; Ho, Pin-Han; Naik, K.; Shihada, Basem

2013-01-01

This paper introduces a novel multicopy routing protocol, called Self-Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function-based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high-buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multicopy encounter-based routing protocols considered in the study.

Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed

2013-07-01

This paper introduces a novel multicopy routing protocol, called Self-Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function-based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high-buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multicopy encounter-based routing protocols considered in the study.

B-iTRS: A Bio-Inspired Trusted Routing Scheme for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mingchuan Zhang

2015-01-01

Full Text Available In WSNs, routing algorithms need to handle dynamical changes of network topology, extra overhead, energy saving, and other requirements. Therefore, routing in WSNs is an extremely interesting and challenging issue. In this paper, we present a novel bio-inspired trusted routing scheme (B-iTRS based on ant colony optimization (ACO and Physarum autonomic optimization (PAO. For trust assessment, B-iTRS monitors neighbors’ behavior in real time, receives feedback from Sink, and then assesses neighbors’ trusts based on the acquired information. For routing scheme, each node finds routes to the Sink based on ACO and PAO. In the process of path finding, B-iTRS senses the load and trust value of each node and then calculates the link load and link trust of the found routes to support the route selection. Moreover, B-iTRS also assesses the route based on PAO to maintain the route table. Simulation results show how B-iTRS can achieve the effective performance compared to existing state-of-the-art algorithms.

Multilevel QoS-policy-based routing management architecture appropriate for heterogeneous network environments

Science.gov (United States)

Chatzaki, Magda; Sartzetakis, Stelios

1998-09-01

As telecom providers introduce new and more sophisticated services the necessity of a global, unified view of the network infrastructure becomes demanding. Today, heterogenous backbone networks are interconnected in order to provide global connectivity. Due to technological impairments the cost of network operation, the maintenance complexity and the overuse of resources are extremely high under the goal of supporting the diverting customer requirements. We propose a scheme for ATM QoS support in such heterogenous, multi-domain, multi-technology network environment. The objective is to optimize users' and networks' profits by giving them the opportunity to satisfy their requirements. Our approach introduces a manager able to take routing decisions supporting quality of service guarantees for the customers, while making efficient use of network resources.

ANALISIS QOS PADA PEMBAGIAN BANDWIDTH DENGAN METODE LAYER 7 PROTOCOL, PCQ, HTB DAN HOTSPOT DI SMK SWASTA AL-WASHLIYAH PASAR SENEN

Directory of Open Access Journals (Sweden)

Dian Kurnia

2017-07-01

Full Text Available Pada penelitian ini akan dilakukan analisis QoS Pada Pembagian Bandwidth menggunakan metode HTB (Hierarchical Tocken Bucket, PCQ(Per Connection Queue  dengan Layer 7 protocol sebagai limit file berekstensi, PCQ dan Hotspot. Pada HTB menggunakan teknik antrian queue tree, PCQ dengan Layer 7 protocol, PCQ menggunakan teknik antrian simple queue, hotspot menggunakan teknik antrian simple queue. Sehingga didapat perbandingan dari metode HTB (Hierarchical Tocken Bucket, PCQ dengan Layer 7 protocol, PCQ dan hotspot akan diterapkan pada mikrotik RB750GL. Hasil akhir penelitian ini diukur dengan parameter-parameter QoS throughput, delay (latency, jitter (variasi kedatangan paket, Packet loss. Adapun hasil pengujian dalam penelitian ini dilakukan pada trafik jam sibuk untuk mengetahui sejauh mana kinerja performansi management bandwidth dengan metode-metode tersebut. Dari hasil penelitian untuk performance QoS yang lebih baik untuk memanagement bandwidth di dapat nilai throughput, jitter dan delay terbaik yaitu menggunakan metode HTB.

Utilizing joint routing and capacity assignment algorithms to achieve inter- and intra-group delay fairness in multi-rate multicast wireless sensor networks.

Science.gov (United States)

Lin, Frank Yeong-Sung; Hsiao, Chiu-Han; Lin, Leo Shih-Chang; Wen, Yean-Fu

2013-03-14

Recent advance in wireless sensor network (WSN) applications such as the Internet of Things (IoT) have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS) is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay) becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.

An Efficient Context-Aware Privacy Preserving Approach for Smartphones

Directory of Open Access Journals (Sweden)

Lichen Zhang

2017-01-01

Full Text Available With the proliferation of smartphones and the usage of the smartphone apps, privacy preservation has become an important issue. The existing privacy preservation approaches for smartphones usually have less efficiency due to the absent consideration of the active defense policies and temporal correlations between contexts related to users. In this paper, through modeling the temporal correlations among contexts, we formalize the privacy preservation problem to an optimization problem and prove its correctness and the optimality through theoretical analysis. To further speed up the running time, we transform the original optimization problem to an approximate optimal problem, a linear programming problem. By resolving the linear programming problem, an efficient context-aware privacy preserving algorithm (CAPP is designed, which adopts active defense policy and decides how to release the current context of a user to maximize the level of quality of service (QoS of context-aware apps with privacy preservation. The conducted extensive simulations on real dataset demonstrate the improved performance of CAPP over other traditional approaches.

AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK

OpenAIRE

Mrs. Amandeep Kaur

2011-01-01

This paper highlights some of the basic concepts of QoS. The major research areas of Quality of Service Computer Networks are highlighted. The paper also compares some of the current QoS Routing techniques.

Seamless interworking architecture for WBAN in heterogeneous wireless networks with QoS guarantees.

Science.gov (United States)

Khan, Pervez; Ullah, Niamat; Ullah, Sana; Kwak, Kyung Sup

2011-10-01

The IEEE 802.15.6 standard is a communication standard optimized for low-power and short-range in-body/on-body nodes to serve a variety of medical, consumer electronics and entertainment applications. Providing high mobility with guaranteed Quality of Service (QoS) to a WBAN user in heterogeneous wireless networks is a challenging task. A WBAN uses a Personal Digital Assistant (PDA) to gather data from body sensors and forwards it to a remote server through wide range wireless networks. In this paper, we present a coexistence study of WBAN with Wireless Local Area Networks (WLAN) and Wireless Wide Area Networks (WWANs). The main issue is interworking of WBAN in heterogenous wireless networks including seamless handover, QoS, emergency services, cooperation and security. We propose a Seamless Interworking Architecture (SIA) for WBAN in heterogenous wireless networks based on a cost function. The cost function is based on power consumption and data throughput costs. Our simulation results show that the proposed scheme outperforms typical approaches in terms of throughput, delay and packet loss rate.

Self-Adaptive Context Aware Routing Protocol for Unicast Communication in Delay and Tolerant Network

Directory of Open Access Journals (Sweden)

Yunbo Chen

2014-05-01

Full Text Available At present, most of research works in mobile network focus on the network overhead of the known path which exists between the sender and the receiver. However, the trend of the current practical application demands is becoming increasingly distributed and decentralized. The Delay and Tolerant Network (DTN just comes out of such background of the conflicts between them. The DTN could effectively eliminate the gap between the mobile network and the practical application demands. In this paper, a Self-Adaptive Context Aware Routing Protocol (SACARP for the unicast communication in delay and tolerant networks is presented. Meanwhile, according to the real-time context information of DTN, the Kalman filter theory is introduced to predict the information state of mobility for the optional message ferrying node, and then gives the optimal selection strategy of the message ferrying nodes. The simulation experiments have shown that, compared to the familiar single- copy and multi-copy protocols, the SACARP proposed in this paper has better transmission performance and stability, especially when the network is free, the protocol would keep a good performance with fewer connections and less buffer space.

Ant-plant mutualism: a dietary by-product of a tropical ant's macronutrient requirements.

Science.gov (United States)

Arcila Hernández, Lina M; Sanders, Jon G; Miller, Gabriel A; Ravenscraft, Alison; Frederickson, Megan E

2017-12-01

Many arboreal ants depend on myrmecophytic plants for both food and shelter; in return, these ants defend their host plants against herbivores, which are often insects. Ant-plant and other mutualisms do not necessarily involve the exchange of costly rewards or services; they may instead result from by-product benefits, or positive outcomes that do not entail a cost for one or both partners. Here, we examined whether the plant-ant Allomerus octoarticulatus pays a short-term cost to defend their host plants against herbivores, or whether plant defense is a by-product benefit of ant foraging for insect prey. Because the food offered by ant-plants is usually nitrogen-poor, arboreal ants may balance their diets by consuming insect prey or associating with microbial symbionts to acquire nitrogen, potentially shifting the costs and benefits of plant defense for the ant partner. To determine the effect of ant diet on an ant-plant mutualism, we compared the behavior, morphology, fitness, stable isotope signatures, and gaster microbiomes of A. octoarticulatus ants nesting in Cordia nodosa trees maintained for nearly a year with or without insect herbivores. At the end of the experiment, ants from herbivore exclosures preferred protein-rich baits more than ants in the control (i.e., herbivores present) treatment. Furthermore, workers in the control treatment were heavier than in the herbivore-exclusion treatment, and worker mass predicted reproductive output, suggesting that foraging for insect prey directly increased ant colony fitness. The gaster microbiome of ants was not significantly affected by the herbivore exclusion treatment. We conclude that the defensive behavior of some phytoecious ants is a by-product of their need for external protein sources; thus, the consumption of insect herbivores by ants benefits both the ant colony and the host plant. © 2017 by the Ecological Society of America.

Do ants need to estimate the geometrical properties of trail bifurcations to find an efficient route? A swarm robotics test bed.

Directory of Open Access Journals (Sweden)

Simon Garnier

Full Text Available Interactions between individuals and the structure of their environment play a crucial role in shaping self-organized collective behaviors. Recent studies have shown that ants crossing asymmetrical bifurcations in a network of galleries tend to follow the branch that deviates the least from their incoming direction. At the collective level, the combination of this tendency and the pheromone-based recruitment results in a greater likelihood of selecting the shortest path between the colony's nest and a food source in a network containing asymmetrical bifurcations. It was not clear however what the origin of this behavioral bias is. Here we propose that it results from a simple interaction between the behavior of the ants and the geometry of the network, and that it does not require the ability to measure the angle of the bifurcation. We tested this hypothesis using groups of ant-like robots whose perceptual and cognitive abilities can be fully specified. We programmed them only to lay down and follow light trails, avoid obstacles and move according to a correlated random walk, but not to use more sophisticated orientation methods. We recorded the behavior of the robots in networks of galleries presenting either only symmetrical bifurcations or a combination of symmetrical and asymmetrical bifurcations. Individual robots displayed the same pattern of branch choice as individual ants when crossing a bifurcation, suggesting that ants do not actually measure the geometry of the bifurcations when travelling along a pheromone trail. Finally at the collective level, the group of robots was more likely to select one of the possible shorter paths between two designated areas when moving in an asymmetrical network, as observed in ants. This study reveals the importance of the shape of trail networks for foraging in ants and emphasizes the underestimated role of the geometrical properties of transportation networks in general.

A Secure Routing Protocol for Wireless Sensor Networks Considering Secure Data Aggregation

Directory of Open Access Journals (Sweden)

Triana Mugia Rahayu

2015-06-01

Full Text Available The commonly unattended and hostile deployments of WSNs and their resource-constrained sensor devices have led to an increasing demand for secure energy-efficient protocols. Routing and data aggregation receive the most attention since they are among the daily network routines. With the awareness of such demand, we found that so far there has been no work that lays out a secure routing protocol as the foundation for a secure data aggregation protocol. We argue that the secure routing role would be rendered useless if the data aggregation scheme built on it is not secure. Conversely, the secure data aggregation protocol needs a secure underlying routing protocol as its foundation in order to be effectively optimal. As an attempt for the solution, we devise an energy-aware protocol based on LEACH and ESPDA that combines secure routing protocol and secure data aggregation protocol. We then evaluate its security effectiveness and its energy-efficiency aspects, knowing that there are always trade-off between both.

Ant Larval Demand Reduces Aphid Colony Growth Rates in an Ant-Aphid Interaction

Directory of Open Access Journals (Sweden)

James M. Cook

2012-02-01

Full Text Available Ants often form mutualistic interactions with aphids, soliciting honeydew in return for protective services. Under certain circumstances, however, ants will prey upon aphids. In addition, in the presence of ants aphids may increase the quantity or quality of honeydew produced, which is costly. Through these mechanisms, ant attendance can reduce aphid colony growth rates. However, it is unknown whether demand from within the ant colony can affect the ant-aphid interaction. In a factorial experiment, we tested whether the presence of larvae in Lasius niger ant colonies affected the growth rate of Aphis fabae colonies. Other explanatory variables tested were the origin of ant colonies (two separate colonies were used and previous diet (sugar only or sugar and protein. We found that the presence of larvae in the ant colony significantly reduced the growth rate of aphid colonies. Previous diet and colony origin did not affect aphid colony growth rates. Our results suggest that ant colonies balance the flow of two separate resources from aphid colonies- renewable sugars or a protein-rich meal, depending on demand from ant larvae within the nest. Aphid payoffs from the ant-aphid interaction may change on a seasonal basis, as the demand from larvae within the ant colony waxes and wanes.

Rationality in collective decision-making by ant colonies.

Science.gov (United States)

Edwards, Susan C; Pratt, Stephen C

2009-10-22

Economic models of animal behaviour assume that decision-makers are rational, meaning that they assess options according to intrinsic fitness value and not by comparison with available alternatives. This expectation is frequently violated, but the significance of irrational behaviour remains controversial. One possibility is that irrationality arises from cognitive constraints that necessitate short cuts like comparative evaluation. If so, the study of whether and when irrationality occurs can illuminate cognitive mechanisms. We applied this logic in a novel setting: the collective decisions of insect societies. We tested for irrationality in colonies of Temnothorax ants choosing between two nest sites that varied in multiple attributes, such that neither site was clearly superior. In similar situations, individual animals show irrational changes in preference when a third relatively unattractive option is introduced. In contrast, we found no such effect in colonies. We suggest that immunity to irrationality in this case may result from the ants' decentralized decision mechanism. A colony's choice does not depend on site comparison by individuals, but instead self-organizes from the interactions of multiple ants, most of which are aware of only a single site. This strategy may filter out comparative effects, preventing systematic errors that would otherwise arise from the cognitive limitations of individuals.

Trust-Enhanced Cloud Service Selection Model Based on QoS Analysis.

Science.gov (United States)

Pan, Yuchen; Ding, Shuai; Fan, Wenjuan; Li, Jing; Yang, Shanlin

2015-01-01

Cloud computing technology plays a very important role in many areas, such as in the construction and development of the smart city. Meanwhile, numerous cloud services appear on the cloud-based platform. Therefore how to how to select trustworthy cloud services remains a significant problem in such platforms, and extensively investigated owing to the ever-growing needs of users. However, trust relationship in social network has not been taken into account in existing methods of cloud service selection and recommendation. In this paper, we propose a cloud service selection model based on the trust-enhanced similarity. Firstly, the direct, indirect, and hybrid trust degrees are measured based on the interaction frequencies among users. Secondly, we estimate the overall similarity by combining the experience usability measured based on Jaccard's Coefficient and the numerical distance computed by Pearson Correlation Coefficient. Then through using the trust degree to modify the basic similarity, we obtain a trust-enhanced similarity. Finally, we utilize the trust-enhanced similarity to find similar trusted neighbors and predict the missing QoS values as the basis of cloud service selection and recommendation. The experimental results show that our approach is able to obtain optimal results via adjusting parameters and exhibits high effectiveness. The cloud services ranking by our model also have better QoS properties than other methods in the comparison experiments.

Joint QoS and Congestion Control Based on Traffic Prediction in SDN

Directory of Open Access Journals (Sweden)

Mohammad Mahdi Tajiki

2017-12-01

Full Text Available Due to the various network requirements of applications, quality of service (QoS-aware routing plays an important role in the networks. Recently proposed resource allocation algorithms focus on the current traffic matrix, which is not applicable for dynamic networks. In this paper, we exploit an estimation of flow matrix that gives our scheme the ability to sufficiently reduce the total packet loss and simultaneously raise the network throughput. In this way, we mathematically formulate the QoS-aware resource reallocation in software-defined networking (SDN networks based on the traffic prediction. To solve this optimization problem, two schemes are proposed: (i exact solution; and (ii fast suboptimal one. The proposed schemes are compared with the accuracy perspective. Moreover, the impact of prediction on resource reallocation is discussed. In this regard, it is shown that, compared with the conventional scheme, the proposed scheme decreases the packet loss and increases the throughput significantly.

RFID-WSN integrated architecture for energy and delay- aware routing a simulation approach

CERN Document Server

Ahmed, Jameel; Tayyab, Muhammad; Nawaz, Menaa

2015-01-01

The book identifies the performance challenges concerning Wireless Sensor Networks (WSN) and Radio Frequency Identification (RFID) and analyzes their impact on the performance of routing protocols. It presents a thorough literature survey to identify the issues affecting routing protocol performance, as well as a mathematical model for calculating the end-to-end delays of the routing protocol ACQUIRE; a comparison of two routing protocols (ACQUIRE and DIRECTED DIFFUSION) is also provided for evaluation purposes. On the basis of the results and literature review, recommendations are made for better selection of protocols regarding the nature of the respective application and related challenges. In addition, this book covers a proposed simulator that integrates both RFID and WSN technologies. Therefore, the manuscript is divided in two major parts: an integrated architecture of smart nodes, and a power-optimized protocol for query and information interchange.

Fire Ant Bites

Science.gov (United States)

... Favorite Name: Category: Share: Yes No, Keep Private Fire Ant Bites Share | Fire ants are aggressive, venomous insects that have pinching ... across the United States, even into Puerto Rico. Fire ant stings usually occur on the feet or ...

Overview: Routes to Open Access

OpenAIRE

Tullney, Marco; van Wezenbeek, Wilma

2017-01-01

Slides of an overview presentation given at a CESAER workshop on Open Access, February 2nd, 2017, in Brussels Cover major routes to more open access as discussed in the Task Force Open Science of CESAER: (national) open access strategies open access mandates open access incentives open access awareness open access publishing open access infrastructure

QoS Modeling for End-to-End Performance Evaluation over Networks with Wireless Access

Directory of Open Access Journals (Sweden)

Gómez Gerardo

2010-01-01

Full Text Available This paper presents an end-to-end Quality of Service (QoS model for assessing the performance of data services over networks with wireless access. The proposed model deals with performance degradation across protocol layers using a bottom-up strategy, starting with the physical layer and moving on up to the application layer. This approach makes it possible to analytically assess performance at different layers, thereby facilitating a possible end-to-end optimization process. As a representative case, a scenario where a set of mobile terminals connected to a streaming server through an IP access node has been studied. UDP, TCP, and the new TCP-Friendly Rate Control (TFRC protocols were analyzed at the transport layer. The radio interface consisted of a variable-rate multiuser and multichannel subsystem, including retransmissions and adaptive modulation and coding. The proposed analytical QoS model was validated on a real-time emulator of an end-to-end network with wireless access and proved to be very useful for the purposes of service performance estimation and optimization.

QoS modelling and analysis with UML-statecharts: the StoCharts approach

OpenAIRE

Jansen, D.N.; Haverkort, Boudewijn R.H.M.; Hermanns, H.; Katoen, Joost P.

2005-01-01

The UML is an influential and widespread notation for high-level modelling of information processing systems. UML statechart diagrams are a graphical language to describe system behaviour. They consitute one of the most intensively-used formalisms comprised by the UML. However, statechart diagrams are lacking concepts for describing real-time, performance, dependability and quality of service (QoS) characteristics at a behavioural level.This note describes a QoS-oriented extension of UML stat...

An adaptive distributed admission approach in Bluetooth network with QoS provisions

DEFF Research Database (Denmark)

Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

2002-01-01

In this paper, a method of adaptive distributed admission with end-to-end Quality of Service (QoS) provisions for real time and non real time tra°cs in Blue-tooth networks is highlighted, its mathematic background is analyzed and a simulation with bursty tra°c sources, Interrupted Bernoulli Process...... (IBP), is carried out. The simulation results show that the performance of Bluetooth network is improved when applying the distributed admission method...

Location-Aware Cross-Layer Design Using Overlay Watermarks

Directory of Open Access Journals (Sweden)

Paul Ho

2007-04-01

Full Text Available A new orthogonal frequency division multiplexing (OFDM system embedded with overlay watermarks for location-aware cross-layer design is proposed in this paper. One major advantage of the proposed system is the multiple functionalities the overlay watermark provides, which includes a cross-layer signaling interface, a transceiver identification for position-aware routing, as well as its basic role as a training sequence for channel estimation. Wireless terminals are typically battery powered and have limited wireless communication bandwidth. Therefore, efficient collaborative signal processing algorithms that consume less energy for computation and less bandwidth for communication are needed. Transceiver aware of its location can also improve the routing efficiency by selective flooding or selective forwarding data only in the desired direction, since in most cases the location of a wireless host is unknown. In the proposed OFDM system, location information of a mobile for efficient routing can be easily derived when a unique watermark is associated with each individual transceiver. In addition, cross-layer signaling and other interlayer interactive information can be exchanged with a new data pipe created by modulating the overlay watermarks. We also study the channel estimation and watermark removal techniques at the physical layer for the proposed overlay OFDM. Our channel estimator iteratively estimates the channel impulse response and the combined signal vector from the overlay OFDM signal. Cross-layer design that leads to low-power consumption and more efficient routing is investigated.

An energy-aware engineered control plane for wavelength-routed networks

DEFF Research Database (Denmark)

Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco

2015-01-01

' operational expenditures. To face this problem, we propose a single-stage routing and wavelength assignment scheme, based on several network engineering extensions to the Generalised Multi-Protocol Label Switching (GMPLS) control plane protocols, mainly Open Shortest Path First, with new composed metrics...

Balancing emergency message dissemination and network lifetime in wireless body area network using ant colony optimization and Bayesian game formulation

Directory of Open Access Journals (Sweden)

R. Latha

Full Text Available Nowadays, Wireless Body Area Network (WBAN is emerging very fast and so many new methods and algorithms are coming up for finding the optimal path for disseminating emergency messages. Ant Colony Optimization (ACO is one of the cultural algorithms for solving many hard problems such as Travelling Salesman Problem (TSP. ACO is a natural behaviour of ants, which work stochastically with the help of pheromone trails deposited in the shortest route to find their food. This optimization procedure involves adapting, positive feedback and inherent parallelism. Each ant will deposit certain amount of pheromone in the tour construction it makes searching for food. This type of communication is known as stigmetric communication. In addition, if a dense WBAN environment prevails, such as hospital, i.e. in the environment of overlapping WBAN, game formulation was introduced for analyzing the mixed strategy behaviour of WBAN. In this paper, the ant colony optimization approach to the travelling salesman problem was applied to the WBAN to determine the shortest route for sending emergency message to the doctor via sensor nodes; and also a static Bayesian game formulation with mixed strategy was analysed to enhance the network lifetime. Whenever the patient needs any critical care or any other medical issue arises, emergency messages will be created by the WBAN and sent to the doctor's destination. All the modes of communication were realized in a simulation environment using OMNet++. The authors investigated a balanced model of emergency message dissemination and network lifetime in WBAN using ACO and Bayesian game formulation. Keywords: Wireless body area network, Ant colony optimization, Bayesian game model, Sensor network, Message latency, Network lifetime

On the Performance of the Current MANET Routing Protocols for VoIP, HTTP, and FTP Applications

Directory of Open Access Journals (Sweden)

Waheb A. Jabbar

2014-01-01

Full Text Available The recent advances of ensemble mobile environment of smart devices with embedded sensors have enabled the MANET to play a key role in the smart cities as well as WSN and WMN. However, these smart devices are still limited in terms of energy, processor, and memory. Moreover, the efficient routing for reliable network connectivity at anytime, anywhere, and about everything is still a challenge in multihop wireless networks. This paper evaluates the QoS and energy efficiency of three active routing protocols: (i OLSRv2, a successor to OLSR, (ii DYMO, a successor to both DSR and AODV, and (iii MP-OLSR multipath extension to OLSRv2. In contrast to the related previous works which focused only on CBR traffic without considering the influence of specific traffic types on the performance of routing protocols, this work focused on this area from a different perspective. It evaluates the performance of three internet-based traffic types that can be used in the smart city applications: VoIP, HTTP, and FTP using different simulation models. The impact of the network density, load traffic, and nodes mobility on the considered protocols was evaluated by considering particular performance metrics for each traffic application. Based on the results, the study concludes by presenting useful recommendations for future work.

Ant aggression and evolutionary stability in plant-ant and plant-pollinator mutualistic interactions.

Science.gov (United States)

Oña, L; Lachmann, M

2011-03-01

Mutualistic partners derive a benefit from their interaction, but this benefit can come at a cost. This is the case for plant-ant and plant-pollinator mutualistic associations. In exchange for protection from herbivores provided by the resident ants, plants supply various kinds of resources or nests to the ants. Most ant-myrmecophyte mutualisms are horizontally transmitted, and therefore, partners share an interest in growth but not in reproduction. This lack of alignment in fitness interests between plants and ants drives a conflict between them: ants can attack pollinators that cross-fertilize the host plants. Using a mathematical model, we define a threshold in ant aggressiveness determining pollinator survival or elimination on the host plant. In our model we observed that, all else being equal, facultative interactions result in pollinator extinction for lower levels of ant aggressiveness than obligatory interactions. We propose that the capacity to discriminate pollinators from herbivores should not often evolve in ants, and when it does it will be when the plants exhibit limited dispersal in an environment that is not seed saturated so that each seed produced can effectively generate a new offspring or if ants acquire an extra benefit from pollination (e.g. if ants eat fruit). We suggest specific mutualism examples where these hypotheses can be tested empirically. © 2010 The Authors. Journal of Evolutionary Biology © 2010 European Society For Evolutionary Biology.

QoS Management and Control for an All-IP WiMAX Network Architecture: Design, Implementation and Evaluation

Directory of Open Access Journals (Sweden)

Thomas Michael Bohnert

2008-01-01

Full Text Available The IEEE 802.16 standard provides a specification for a fixed and mobile broadband wireless access system, offering high data rate transmission of multimedia services with different Quality-of-Service (QoS requirements through the air interface. The WiMAX Forum, going beyond the air interface, defined an end-to-end WiMAX network architecture, based on an all-IP platform in order to complete the standards required for a commercial rollout of WiMAX as broadband wireless access solution. As the WiMAX network architecture is only a functional specification, this paper focuses on an innovative solution for an end-to-end WiMAX network architecture offering in compliance with the WiMAX Forum specification. To our best knowledge, this is the first WiMAX architecture built by a research consortium globally and was performed within the framework of the European IST project WEIRD (WiMAX Extension to Isolated Research Data networks. One of the principal features of our architecture is support for end-to-end QoS achieved by the integration of resource control in the WiMAX wireless link and the resource management in the wired domains in the network core. In this paper we present the architectural design of these QoS features in the overall WiMAX all-IP framework and their functional as well as performance evaluation. The presented results can safely be considered as unique and timely for any WiMAX system integrator.

Dynamic QoS management in Differentiated Services using bandwidth brokers, RSVP aggregation and load control protocols

NARCIS (Netherlands)

Westberg, Lars; Eriksson, Anders; Karagiannis, Georgios; Heijenk, Geert; Rexhepi, Vlora; Partain, David

2001-01-01

A method and network subsystem for providing on demand end to end Quality of Service (Qos) in a dynamic manner, use a combination of Resource Reservation Protocol (RSVP), load control protocol (and its successors) and Bandwidth Brokers (BBs)(1106) which communicate using a predetermined protocol.

Dynamic QoS management in Differentiated Services using bandwidth brokers, RSVP aggregation and load control protocols

NARCIS (Netherlands)

Westberg, Lars; Eriksson, Anders; Karagiannis, Georgios; Heijenk, Geert; Rexhepi, Vlora; Partain, David

2009-01-01

A method and network subsystem for providing on demand end to end Quality of Service (Qos) in a dynamic manner, use a combination of Resource Reservation Protocol (RSVP), load control protocol (and its successors) and Bandwidth Brokers (BBs)(1106) which communicate using a predetermined protocol.

Model checking and evaluating QoS of batteries in MPSoC dataflow applications via hybrid automata

NARCIS (Netherlands)

Ahmad, W.; Jongerden, M.R.; Stoelinga, Mariëlle Ida Antoinette; van de Pol, Jan Cornelis

2016-01-01

System lifetime is a major design constraint for battery-powered mobile embedded systems. The increasing gap between the energy demand of portable devices and their battery capacities is further limiting durability of mobile devices. Thus, the guarantees over Quality of Service (QoS) of

Impact of Dual-Link Failures on Impairment-Aware Routed Networks

DEFF Research Database (Denmark)

Georgakilas, Konstantinos N; Katrinis, Kostas; Tzanakaki, Anna

2010-01-01

This paper evaluates the impact of dual-link failures on single-link failure resilient networks, while physical layer constraints are taken into consideration during demand routing, as dual link failures and equivalent situations appear to be quite probable in core optical networks. In particular...

Utilizing Joint Routing and Capacity Assignment Algorithms to Achieve Inter- and Intra-Group Delay Fairness in Multi-Rate Multicast Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Yean-Fu Wen

2013-03-01

Full Text Available Recent advance in wireless sensor network (WSN applications such as the Internet of Things (IoT have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.

AntStar: Enhancing Optimization Problems by Integrating an Ant System and A⁎ Algorithm

Directory of Open Access Journals (Sweden)

Mohammed Faisal

2016-01-01

Full Text Available Recently, nature-inspired techniques have become valuable to many intelligent systems in different fields of technology and science. Among these techniques, Ant Systems (AS have become a valuable technique for intelligent systems in different fields. AS is a computational system inspired by the foraging behavior of ants and intended to solve practical optimization problems. In this paper, we introduce the AntStar algorithm, which is swarm intelligence based. AntStar enhances the optimization and performance of an AS by integrating the AS and A⁎ algorithm. Applying the AntStar algorithm to the single-source shortest-path problem has been done to ensure the efficiency of the proposed AntStar algorithm. The experimental result of the proposed algorithm illustrated the robustness and accuracy of the AntStar algorithm.

Runtime analysis of the 1-ANT ant colony optimizer

DEFF Research Database (Denmark)

Doerr, Benjamin; Neumann, Frank; Sudholt, Dirk

2011-01-01

The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. First runtime analyses of ant colony optimization (ACO) have been conducted only recently. In these studies simple ACO algorithms such as the 1-ANT...... that give us a more detailed impression of the 1-ANT’s performance. Furthermore, the experiments also deal with the question whether using many ant solutions in one iteration can decrease the total runtime....

Microorganisms transported by ants induce changes in floral nectar composition of an ant-pollinated plant.

Science.gov (United States)

de Vega, Clara; Herrera, Carlos M

2013-04-01

Interactions between plants and ants abound in nature and have significant consequences for ecosystem functioning. Recently, it has been suggested that nectar-foraging ants transport microorganisms to flowers; more specifically, they transport yeasts, which can potentially consume sugars and alter nectar composition. Therefore, ants could indirectly change nectar sugar profile, an important floral feature involved in the plant-pollinator mutualism. But this novel role for ants has never been tested. We here investigate the effects of nectarivorous ants and their associated yeasts on the floral nectar sugar composition of an ant-pollinated plant. Differences in the nectar sugar composition of ant-excluded and ant-visited flowers were examined in 278 samples by using high-performance liquid-chromatography. The importance of the genetic identity and density of ant-transported basidiomycetous and ascomycetous yeasts on the variation of nectar traits was also evaluated. Ant visitation had significant effects on nectar sugar composition. The nectar of ant-visited flowers contained significantly more fructose, more glucose, and less sucrose than the nectar of ant-excluded flowers, but these effects were context dependent. Nectar changes were correlated with the density of yeast cells in nectar. The magnitude of the effects of ant-transported ascomycetes was much higher than that of basiodiomycetes. Ants and their associated yeasts induce changes in nectar sugar traits, reducing the chemical control of the plant over this important floral trait. The potential relevance of this new role for ants as indirect nectar modifiers is a rich topic for future research into the ecology of ant-flower interactions.

Evaluasi Kinerja IEEE 802.11e HCCA untuk Dukungan QoS pada WLAN Menggunakan NS-2

Directory of Open Access Journals (Sweden)

Amry Daulat Gultom

2014-06-01

Full Text Available Wireless Local Area Network (WLAN digunakan oleh trafik multimedia yang seharusnya memerlukan persyaratan jaringan yang lebih baik terhadap delay, jitter dan packet losses. IEEE 802.11 Task Group E memperkenalkan perbaikan protokol MAC 802.11, yaitu Hybrid Coordination Function (HCF, yang terdiri dari dua mekanisme akses: Enhanced Distributed Channel Access (EDCA dan HCF Controlled Channel Access (HCCA yang memberikan dukungan Kualitas Layanan/Quality of Service (QoS bagi trafik multimedia. Tujuan dari penelitian ini adalah untuk memahami algoritma protokol MAC IEEE 802.11e HCCA pada jaringan WLAN, dan menganalisis kinerja protokol MAC 802.11e HCCA pada aplikasi multimedia dengan menggunakan metode simulasi pada NS-2. Metrik kinerja yang diukur adalah jitter dan throughput-nya. Hasil penelitian ini menunjukkan bahwa protokol MAC HCCA dapat memberikan jaminan QoS dibanding protokol MAC DCF, dimana jitter HCCA lebih stabil dari pada jitter DCF. Begitupula dengan throughput HCCA yang tidak berubah selama trafik berlangsung, tidak seperti pada DCF yang masih mengalami fluktuasi yang besar.

Turbulence Awareness for Strategic Aircraft Re-Routing (TASAR-R), Phase I

Data.gov (United States)

National Aeronautics and Space Administration — The Innovation Laboratory, Inc., proposes to develop a Decision Support Tool (DST) for strategic guidance to pilots for mitigating encounters with en route...

Cognitive Aware Interference Mitigation Scheme for LTE Femtocells

KAUST Repository

Alqerm, Ismail

2015-04-21

Femto-cells deployment in today’s cellular networks came into practice to fulfill the increasing demand for data services. However, interference to other femto and macro-cells users remains an unresolved challenge. In this paper, we propose an interference mitigation scheme to control the cross-tier interference caused by femto-cells to the macro users and the co-tier interference among femtocells. Cognitive radio spectrum sensing capability is utilized to determine the non-occupied channels or the ones that cause minimal interference to the macro users. An awareness based channel allocation scheme is developed with the assistance of the graph-coloring algorithm to assign channels to the femto-cells base stations with power optimization, minimal interference, maximum throughput, and maximum spectrum efficiency. In addition, the scheme exploits negotiation capability to match traffic load and QoS with the channel capacity, and to maintain efficient utilization of the available channels.

Energy Aware GPSR Routing Protocol in a Wireless Sensor Network ...

African Journals Online (AJOL)

Energy is the scarce resource in wireless sensor networks (WSNs), and it determines the lifetime of WSNs. For this reason, WSN algorithms and routing protocols should be selected in a manner which fulfills these energy requirements. This paper presents a solution to increase the lifetime of WSNs by decreasing their ...

[Behavioral mechanisms of spatial competition between red wood ants (Formica aquilonia) and ground beetles (Carabidae)].

Science.gov (United States)

Dorosheva, E A; Reznikova, Zh I

2006-01-01

Behavioral aspects of spatial competition between red wood ants (Formica aquilonia) and six mass species of Carabidae were studied in field and laboratory experiments. We showed that red wood ants essentially influence spatial distribution of ground beetles on their common territories. Transplantation experiments suggest that in newly established ants' settlements stronger forms of interrelations arise than in old stable colony. To examine the ability of beetles to avoid collisions with ants we used two experimental techniques. In laboratory, we tested carabids ability to avoid a clash in a Y-shaped labyrinth containing an active tethered ant in one section. In field experiments we compared quantitative characteristics of movements (such as crookedness of individual trajectories, speed of movement, the time spent on stops) for beetles placed close to ants foraging routes and on ant-free plots. All beetles studied displayed a clear tendency to learn, that is, to modity their behavior in order to avoid collisions with ants. Species that exhibited best parameters of learning were closer to ants by their size and characteristic movement, namely, Pterostichus oblogopunctatus and P. magus. Beetles' stereotyped behavioral tactics can be considered universal for avoiding collisions with any subject (for instance, with an ant) of a certain size and speed of movements. A set of tactics in the labyrinth included: (1) attempts to round the ant; (2) turns away after touching the ant with antennae; (3) turns away without a contact; (4) avoidances of a dangerous section; (5) stops near the ant with the antennae hidden. Comparing pairwise difference between four species shows that beetles use species-specific preference for definite combinations of tactics. Effective learning allows carabids to penetrate into ant foraging territory and partly avoide interference competition. It seems that red wood ants are not inclined to learn to avoid collisions with competing carabid species

Designing area optimized application-specific network-on-chip architectures while providing hard QoS guarantees.

Directory of Open Access Journals (Sweden)

Sajid Gul Khawaja

Full Text Available With the increase of transistors' density, popularity of System on Chip (SoC has increased exponentially. As a communication module for SoC, Network on Chip (NoC framework has been adapted as its backbone. In this paper, we propose a methodology for designing area-optimized application specific NoC while providing hard Quality of Service (QoS guarantees for real time flows. The novelty of the proposed system lies in derivation of a Mixed Integer Linear Programming model which is then used to generate a resource optimal Network on Chip (NoC topology and architecture while considering traffic and QoS requirements. We also present the micro-architectural design features used for enabling traffic and latency guarantees and discuss how the solution adapts for dynamic variations in the application traffic. The paper highlights the effectiveness of proposed method by generating resource efficient NoC solutions for both industrial and benchmark applications. The area-optimized results are generated in few seconds by proposed technique, without resorting to heuristics, even for an application with 48 traffic flows.

Novel Clustering Method Based on K-Medoids and Mobility Metric

Directory of Open Access Journals (Sweden)

Y. Hamzaoui

2018-06-01

Full Text Available The structure and constraint of MANETS influence negatively the performance of QoS, moreover the main routing protocols proposed generally operate in flat routing. Hence, this structure gives the bad results of QoS when the network becomes larger and denser. To solve this problem we use one of the most popular methods named clustering. The present paper comes within the frameworks of research to improve the QoS in MANETs. In this paper we propose a new algorithm of clustering based on the new mobility metric and K-Medoid to distribute the nodes into several clusters. Intuitively our algorithm can give good results in terms of stability of the cluster, and can also extend life time of cluster head.

Diseño experimental de un Modelo de Calidad de Servicio para Redes de Siguiente Generación

Directory of Open Access Journals (Sweden)

Josheff David

2015-07-01

Full Text Available Este artículo presenta un Modelo de Calidad de Servicio (QoS para Redes de Siguiente Generación (NGN, que consta de una torre de cinco capas definidas como Capa Modelo de QoS, Control de Admisión, QoS en el Enrutamiento, QoS en la Señalización, y MAC QoS. Además el modelo plantea un método basado en el concepto de segregación de funciones definiendo dos redes funcionales junto con las tareas de QoS. Luego se establecen las políticas de Control de Acceso, los protocolos y algoritmos de señalización, y de enrutamiento, así como los aspectos relacionados con el acceso al medio. Para verificar el rendimiento del modelo, se realizó un Diseño de Experimentos sobre una NGN Piloto en la herramienta de simulación OPNET Modeler. El Análisis Estadístico constó de un Análisis de Varianzas sobre las variables de salida Retardo, Jitter y Throughput, cuyo resultado determinó los factores significativos de impacto del modelo en las métricas estudiadas.   Abstract This paper presents a Model of Quality of Service (QoS for Next Generation Networks (NGN, which consists of a tower of five layers defined as Model Layer QoS, Admission Control, QoS routing, QoS signaling, MAC and QoS. The model also presents a method based on the concept of segregation of functions defining two functional networks with QoS tasks. Then, Access Control policies, protocols and algorithms, signaling and routing, as well as aspects related to media access are established. To verify the performance of the model, a Design of Experiments on a NGN Pilot was designed over simulation tool OPNET Modeler. The statistical analysis consisted of an analysis of variance on the output variables Delay, Jitter and Throughput, whose outcome determined the significant factors that impacted the model metrics.

Private information alone can trigger trapping of ant colonies in local feeding optima.

Science.gov (United States)

Czaczkes, Tomer J; Salmane, Anete K; Klampfleuthner, Felicia A M; Heinze, Jürgen

2016-03-01

Ant colonies are famous for using trail pheromones to make collective decisions. Trail pheromone systems are characterised by positive feedback, which results in rapid collective decision making. However, in an iconic experiment, ants were shown to become 'trapped' in exploiting a poor food source, if it was discovered earlier. This has conventionally been explained by the established pheromone trail becoming too strong for new trails to compete. However, many social insects have a well-developed memory, and private information often overrules conflicting social information. Thus, route memory could also explain this collective 'trapping' effect. Here, we disentangled the effects of social and private information in two 'trapping' experiments: one in which ants were presented with a good and a poor food source, and one in which ants were presented with a long and a short path to the same food source. We found that private information is sufficient to trigger trapping in selecting the poorer of two food sources, and may be sufficient to cause it altogether. Memories did not trigger trapping in the shortest path experiment, probably because sufficiently detailed memories did not form. The fact that collective decisions can be triggered by private information alone may require other collective patterns previously attributed solely to social information use to be reconsidered. © 2016. Published by The Company of Biologists Ltd.

Analog integrated circuit design automation placement, routing and parasitic extraction techniques

CERN Document Server

Martins, Ricardo; Horta, Nuno

2017-01-01

This book introduces readers to a variety of tools for analog layout design automation. After discussing the placement and routing problem in electronic design automation (EDA), the authors overview a variety of automatic layout generation tools, as well as the most recent advances in analog layout-aware circuit sizing. The discussion includes different methods for automatic placement (a template-based Placer and an optimization-based Placer), a fully-automatic Router and an empirical-based Parasitic Extractor. The concepts and algorithms of all the modules are thoroughly described, enabling readers to reproduce the methodologies, improve the quality of their designs, or use them as starting point for a new tool. All the methods described are applied to practical examples for a 130nm design process, as well as placement and routing benchmark sets. Introduces readers to hierarchical combination of Pareto fronts of placements; Presents electromigration-aware routing with multilayer multiport terminal structures...

Towards droplet size-aware biochemical application compilation for AM-EWOD biochips

DEFF Research Database (Denmark)

Pop, Paul; Alistar, Mirela

2015-01-01

a droplet size-aware compilation by proposing a routing algorithm that considers the droplet size. Our routing algorithm is developed for a novel digital microfluidic biochip architecture based on Active Matrix Electrowetting on Dielectric, which uses a thin film transistor array for the electrodes. We also...

QoS Self-Provisioning and Interference Management for Co-Channel Deployed 3G Femtocells

DEFF Research Database (Denmark)

Kolding, Troels; Ochal, Pawel; Jørgensen, Niels T.K.

2013-01-01

A highly efficient self-provisioning interference management scheme is derived for 3G Home Node-Bs (HNB). The proposed scheme comprises self-adjustment of the HNB transmission parameters to meet the targeted QoS (quality of service) requirements in terms of downlink and uplink guaranteed minimum ...... live 3G high-speed packet access (HSPA) HNB field-trials, confirming the validity of major simulation results and assumptions....

Q-MOHRA

DEFF Research Database (Denmark)

Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

2016-01-01

Quality of Service (QoS) assurance in Wireless Sensor Network (WSN) is a tough task, and it is more exciting due to the scarcity of resources. The requirement of different WSN applications running over has different constraints. In QoS, routing protocol the network has to balance the traffic...

The Haleakala Argentine ant project: a synthesis of past research and prospects for the future

Science.gov (United States)

Krushelnycky, Paul; Haines, William; Loope, Lloyd; Van Gelder, Ellen

2011-01-01

alternative would be to pursue approval to use Xstinguish bait, a commercial bait manufactured in New Zealand and not registered for use in the US, which has yielded good results against Argentine ants. Either route would involve significant regulatory hurdles. Because the baits ultimately used would likely be liquid or paste in form, there would also be major logistical challenges in devising methods to successfully apply the baits across the two large ant populations at Haleakala.

An Evolutionary Mobility Aware Multi-Objective Hybrid Routing Algorithm for Heterogeneous Wireless Sensor Networks

DEFF Research Database (Denmark)

Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

deliberation. To tackle these two problems, Mobile Wireless Sensor Networks (MWSNs) is a better choice. In MWSN, Sensor nodes move freely to a target area without the need for any special infrastructure. Due to mobility, the routing process in MWSN has become more complicated as connections in the network can...... such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. The authors study the influence of energy heterogeneity and mobility of sensor nodes on the performance of EMRP. The Performance of EMRP compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-Objective Routing...

Applying Data Clustering Feature to Speed Up Ant Colony Optimization

Directory of Open Access Journals (Sweden)

Chao-Yang Pang

2014-01-01

Full Text Available Ant colony optimization (ACO is often used to solve optimization problems, such as traveling salesman problem (TSP. When it is applied to TSP, its runtime is proportional to the squared size of problem N so as to look less efficient. The following statistical feature is observed during the authors’ long-term gene data analysis using ACO: when the data size N becomes big, local clustering appears frequently. That is, some data cluster tightly in a small area and form a class, and the correlation between different classes is weak. And this feature makes the idea of divide and rule feasible for the estimate of solution of TSP. In this paper an improved ACO algorithm is presented, which firstly divided all data into local clusters and calculated small TSP routes and then assembled a big TSP route with them. Simulation shows that the presented method improves the running speed of ACO by 200 factors under the condition that data set holds feature of local clustering.

Harnessing ant defence at fruits reduces bruchid seed predation in a symbiotic ant-plant mutualism.

Science.gov (United States)

Pringle, Elizabeth G

2014-06-22

In horizontally transmitted mutualisms, mutualists disperse separately and reassemble in each generation with partners genetically unrelated to those in the previous generation. Because of this, there should be no selection on either partner to enhance the other's reproductive output directly. In symbiotic ant-plant mutualisms, myrmecophytic plants host defensive ant colonies, and ants defend the plants from herbivores. Plants and ants disperse separately, and, although ant defence can indirectly increase plant reproduction by reducing folivory, it is unclear whether ants can also directly increase plant reproduction by defending seeds. The neotropical tree Cordia alliodora hosts colonies of Azteca pittieri ants. The trees produce domatia where ants nest at stem nodes and also at the node between the peduncle and the rachides of the infloresence. Unlike the stem domatia, these reproductive domatia senesce after the tree fruits each year. In this study, I show that the tree's resident ant colony moves into these ephemeral reproductive domatia, where they tend honeydew-producing scale insects and patrol the nearby developing fruits. The presence of ants significantly reduced pre-dispersal seed predation by Amblycerus bruchid beetles, thereby directly increasing plant reproductive output.

Joint terminals and relay optimization for two-way power line information exchange systems with QoS constraints

Science.gov (United States)

Wu, Xiaolin; Rong, Yue

2015-12-01

The quality-of-service (QoS) criteria (measured in terms of the minimum capacity requirement in this paper) are very important to practical indoor power line communication (PLC) applications as they greatly affect the user experience. With a two-way multicarrier relay configuration, in this paper we investigate the joint terminals and relay power optimization for the indoor broadband PLC environment, where the relay node works in the amplify-and-forward (AF) mode. As the QoS-constrained power allocation problem is highly non-convex, the globally optimal solution is computationally intractable to obtain. To overcome this challenge, we propose an alternating optimization (AO) method to decompose this problem into three convex/quasi-convex sub-problems. Simulation results demonstrate the fast convergence of the proposed algorithm under practical PLC channel conditions. Compared with the conventional bidirectional direct transmission (BDT) system, the relay-assisted two-way information exchange (R2WX) scheme can meet the same QoS requirement with less total power consumption.

Performansi Algoritma CODEQ dalam Penyelesaian Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Annisa Kesy Garside

2014-01-01

Full Text Available Genetic Algorithm, Tabu Search, Simulated Annealing, and Ant Colony Optimization showed a good performance in solving vehicle routing problem. However, the generated solution of those algorithms was changeable regarding on the input parameter of each algorithm. CODEQ is a new, parameter free meta-heuristic algorithm that had been successfully used to solve constrained optimization problems, integer programming, and feed-forward neural network. The purpose of this research are improving CODEQ algorithm to solve vehicle routing problem and testing the performance of the improved algorithm. CODEQ algorithm is started with population initiation as initial solution, generated of mutant vector for each parent in every iteration, replacement of parent by mutant when fitness function value of mutant is better than parent’s, generated of new vector for each iteration based on opposition value or chaos principle, replacement of worst solution by new vector when fitness function value of new vector is better, iteration ceasing when stooping criterion is achieved, and sub-tour determination based on vehicle capacity constraint. The result showed that the average deviation of the best-known and the best-test value is 6.35%. Therefore, CODEQ algorithm is good in solving vehicle routing problem.

"Ant-egg" cataract revisited

DEFF Research Database (Denmark)

Clemmensen, Kåre; Enghild, Jan J; Ivarsen, Anders

2017-01-01

-ray scans and electron microscopy. The purpose of this study was to further characterize "ant-egg" cataract using modern technology and display the history of the "ant-eggs" after cataract extraction. METHODS: "Ant-eggs" were examined using Heidelberg SPECTRALIS Optical Coherence Tomography (OCT...

How ants drop out: ant abundance on tropical mountains.

Science.gov (United States)

Longino, John T; Branstetter, Michael G; Colwell, Robert K

2014-01-01

In tropical wet forests, ants are a large proportion of the animal biomass, but the factors determining abundance are not well understood. We characterized ant abundance in the litter layer of 41 mature wet forest sites spread throughout Central America (Chiapas, Guatemala, Honduras, Nicaragua, and Costa Rica) and examined the impact of elevation (as a proxy for temperature) and community species richness. Sites were intentionally chosen to minimize variation in precipitation and seasonality. From sea level to 1500 m ant abundance very gradually declined, community richness declined more rapidly than abundance, and the local frequency of the locally most common species increased. These results suggest that within this elevational zone, density compensation is acting, maintaining high ant abundance as richness declines. In contrast, in sites above 1500 m, ant abundance dropped abruptly to much lower levels. Among these high montane sites, community richness explained much more of the variation in abundance than elevation, and there was no evidence of density compensation. The relative stability of abundance below 1500 m may be caused by opposing effects of temperature on productivity and metabolism. Lower temperatures may decrease productivity and thus the amount of food available for consumers, but slower metabolisms of consumers may allow maintenance of higher biomass at lower resource supply rates. Ant communities at these lower elevations may be highly interactive, the result of continuous habitat presence over geological time. High montane sites may be ephemeral in geological time, resulting in non-interactive communities dominated by historical and stochastic processes. Abundance in these sites may be determined by the number of species that manage to colonize and/or avoid extinction on mountaintops.

How ants drop out: ant abundance on tropical mountains.

Directory of Open Access Journals (Sweden)

John T Longino

Full Text Available In tropical wet forests, ants are a large proportion of the animal biomass, but the factors determining abundance are not well understood. We characterized ant abundance in the litter layer of 41 mature wet forest sites spread throughout Central America (Chiapas, Guatemala, Honduras, Nicaragua, and Costa Rica and examined the impact of elevation (as a proxy for temperature and community species richness. Sites were intentionally chosen to minimize variation in precipitation and seasonality. From sea level to 1500 m ant abundance very gradually declined, community richness declined more rapidly than abundance, and the local frequency of the locally most common species increased. These results suggest that within this elevational zone, density compensation is acting, maintaining high ant abundance as richness declines. In contrast, in sites above 1500 m, ant abundance dropped abruptly to much lower levels. Among these high montane sites, community richness explained much more of the variation in abundance than elevation, and there was no evidence of density compensation. The relative stability of abundance below 1500 m may be caused by opposing effects of temperature on productivity and metabolism. Lower temperatures may decrease productivity and thus the amount of food available for consumers, but slower metabolisms of consumers may allow maintenance of higher biomass at lower resource supply rates. Ant communities at these lower elevations may be highly interactive, the result of continuous habitat presence over geological time. High montane sites may be ephemeral in geological time, resulting in non-interactive communities dominated by historical and stochastic processes. Abundance in these sites may be determined by the number of species that manage to colonize and/or avoid extinction on mountaintops.

Cognitive Aware Interference Mitigation Scheme for OFDMA Femtocells

KAUST Repository

Alqerm, Ismail

2015-04-09

Femto-cells deployment in today’s cellular networks came into practice to fulfill the increasing demand for data services. It also extends the coverage in the indoor areas. However, interference to other femto and macro-cells users remains an unresolved challenge. In this paper, we propose an interference mitigation scheme to control the cross-tier interference caused by femto-cells to the macro users and the co-tier interference among femtocells. Cognitive radio spectrum sensing capability is utilized to determine the non-occupied channels or the ones that cause minimal interference to the macro users. An awareness based channel allocation scheme is developed with the assistance of the graph-coloring algorithm to assign channels to the femto-cells base stations with power optimization, minimal interference, maximum throughput, and maximum spectrum efficiency. In addition, the scheme exploits negotiation capability to match traffic load and QoS with the channel, and to maintain efficient utilization of the available channels.

Pest repelling properties of ant pheromones

DEFF Research Database (Denmark)

Offenberg, Joachim

2014-01-01

Ants control pests via predation and physical deterrence; however, ant communication is based on chemical cues which may serve as warning signals to potential prey and other intruders. The presence of ant pheromones may, thus, be sufficient to repel pests from ant territories. This mini-review sh......-review shows that four out of five tested ant species deposit pheromones that repel herbivorous prey from their host plants.......Ants control pests via predation and physical deterrence; however, ant communication is based on chemical cues which may serve as warning signals to potential prey and other intruders. The presence of ant pheromones may, thus, be sufficient to repel pests from ant territories. This mini...

Nectar Theft and Floral Ant-Repellence: A Link between Nectar Volume and Ant-Repellent Traits?

Science.gov (United States)

Ballantyne, Gavin; Willmer, Pat

2012-01-01

As flower visitors, ants rarely benefit a plant. They are poor pollinators, and can also disrupt pollination by deterring other flower visitors, or by stealing nectar. Some plant species therefore possess floral ant-repelling traits. But why do particular species have such traits when others do not? In a dry forest in Costa Rica, of 49 plant species around a third were ant-repellent at very close proximity to a common generalist ant species, usually via repellent pollen. Repellence was positively correlated with the presence of large nectar volumes. Repellent traits affected ant species differently, some influencing the behaviour of just a few species and others producing more generalised ant-repellence. Our results suggest that ant-repellent floral traits may often not be pleiotropic, but instead could have been selected for as a defence against ant thieves in plant species that invest in large volumes of nectar. This conclusion highlights to the importance of research into the cost of nectar production in future studies into ant-flower interactions. PMID:22952793

Semantic Network Adaptation Based on QoS Pattern Recognition for Multimedia Streams

Science.gov (United States)

Exposito, Ernesto; Gineste, Mathieu; Lamolle, Myriam; Gomez, Jorge

This article proposes an ontology based pattern recognition methodology to compute and represent common QoS properties of the Application Data Units (ADU) of multimedia streams. The use of this ontology by mechanisms located at different layers of the communication architecture will allow implementing fine per-packet self-optimization of communication services regarding the actual application requirements. A case study showing how this methodology is used by error control mechanisms in the context of wireless networks is presented in order to demonstrate the feasibility and advantages of this approach.

Device Centric Throughput and QoS Optimization for IoTsin a Smart Building Using CRN-Techniques

Directory of Open Access Journals (Sweden)

Saleem Aslam

2016-10-01

Full Text Available The Internet of Things (IoT has gained an incredible importance in the communication and networking industry due to its innovative solutions and advantages in diverse domains. The IoT’ network is a network of smart physical objects: devices, vehicles, buildings, etc. The IoT has a number of applications ranging from smart home, smart surveillance to smart healthcare systems. Since IoT consists of various heterogeneous devices that exhibit different traffic patterns and expect different quality of service (QoS in terms of data rate, bit error rate and the stability index of the channel, therefore, in this paper, we formulated an optimization problem to assign channels to heterogeneous IoT devices within a smart building for the provisioning of their desired QoS. To solve this problem, a novel particle swarm optimization-based algorithm is proposed. Then, exhaustive simulations are carried out to evaluate the performance of the proposed algorithm. Simulation results demonstrate the supremacy of our proposed algorithm over the existing ones in terms of throughput, bit error rate and the stability index of the channel.

Pest repellent properties of ant pheromones

DEFF Research Database (Denmark)

Offenberg, Joachim

2012-01-01

of ant pheromones may be sufficient to repel pest insects from ant territories. The study of ant semiochemicals is in its infancy, yet, evidence for their potential use in pest management is starting to build up. Pheromones from four of five tested ant species have been shown to deter herbivorous insect...... prey and competing ant species are also deterred by ant deposits, whereas ant symbionts may be attracted to them. Based on these promising initial findings, it seems advisable to further elucidate the signaling properties of ant pheromones and to test and develop their use in future pest management....

Urban corners and refuges in the literature of João Antônio

Directory of Open Access Journals (Sweden)

Elena Pajaro Peres

2011-06-01

Full Text Available Through writer João Antônio's unsettled characters one can understand the history of urban transformation of São Paulo beginning in the 1950s. They are migrants, mixed people, rascals, informal workers, workers, children who appear and disappear into the corners of his literature and the city, drawing a route of affectivity and shared experiences that can be followed by the historian who seeks to study the culture under a non canonical view

Leveraging 802.11n frame aggregation to enhance QoS and power consumption in Wi-Fi networks

NARCIS (Netherlands)

Camps-Mur, D.; Gomony, M.D.; Perez-Costa, X.; Sallent-Ribes, S.

2012-01-01

The Wi-Fi technology, driven by its tremendous success, is expanding into a wide variety of devices and applications. However, many of these new devices, like handheld devices, pose new challenges in terms of QoS and energy efficiency. In order to address these challenges, in this paper we study how

Lightweight context aware routing in wireless sensor networks for environments

International Nuclear Information System (INIS)

Aijaz, S.

2015-01-01

Design and implementation of a WSN (Wireless Sensor Network) that can efficiently work for a longer time period must include identification of the deployment environment context and to conform to the behavior of the sensor nodes. The context information when treated with evaluation factor becomes a process of context awareness and the evaluation factor is called the context attribute. In this paper, we consider the context factor of energy. The paper identifies analyses and evaluates efficiency of two when used in a context aware environment. Furthermore, the study also highlights the strengths and weaknesses of sensor SPIN (Sensor Protocol for Information via Negotiation) and LEACH (Low Energy Adaptive Clustering Hierarchy) protocols with respect to the support for WSN with heavy network traffic conditions. The performance has been evaluated in terms of energy efficiency, data packet transmission, network status, data management, reliability, etc. (author)

DEHAR: a Distributed Energy Harvesting Aware Routing Algorithm for Ad-hoc Multi-hop Wireless Sensor Networks

DEFF Research Database (Denmark)

Jakobsen, Mikkel Koefoed; Madsen, Jan; Hansen, Michael Reichhardt

2010-01-01

One of the key design goals in Wireless Sensor Networks is long lasting or even continuous operation. Continuous operation is made possible through energy harvesting. Keeping the network operational imposes a demand to prevent network segmentation and power loss in nodes. It is therefore important...... that the best energy-wise route is found for each data transfer from a source node to the sink node. We present a new adaptive and distributed routing algorithm for finding energy optimised routes in a wireless sensor network with energy harvesting. The algorithm finds an energy efficient route from each source...

Design of energy efficient optical networks with software enabled integrated control plane

DEFF Research Database (Denmark)

Wang, Jiayuan; Yan, Ying; Dittmann, Lars

2015-01-01

energy consumption by proposing a new integrated control plane structure utilising Software Defined Networking technologies. The integrated control plane increases the efficiencies of exchanging control information across different network domains, while introducing new possibilities to the routing...... methods and the control over quality of service (QoS). The structure is defined as an overlay generalised multi-protocol label switching (GMPLS) control model. With the defined structure, the integrated control plane is able to gather information from different domains (i.e. optical core network......'s) routing behaviours. With the flexibility of the routing structure, results show that the energy efficiency of the network can be improved without compromising the QoS for delay/blocking sensitive services....

Preventing Restricted Space Inference in Online Route Planning Services

Directory of Open Access Journals (Sweden)

Florian Dorfmeister

2016-03-01

Full Text Available Online route planning services compute routes from any given location to a desired destination address. Unlike offline implementations, they do so in a traffic-aware fashion by taking into consideration up-to-date map data and real-time traffic information. In return, users have to provide precise location information about a route’s endpoints to a not necessarily trusted service provider. As suchlike leakage of personal information threatens a user’s privacy and anonymity, this paper presents PrOSPR, a comprehensive approach for using current online route planning services in a privacy-preserving way, and introduces the concept of k-immune route requests to avert inference attacks based on restricted space information. Using a map-based approach for creating cloaked regions for the start and destination addresses, our solution queries the online service for routes between subsets of points from these regions. This, however, might result in the returned path deviating from the optimal route. By means of empirical evaluation on a real road network, we demonstrate the feasibility of our approach regarding quality of service and communication overhead.

A QoS-Guaranteed Coverage Precedence Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jiun-Chuan Lin

2011-03-01

Full Text Available For mission-critical applications of wireless sensor networks (WSNs involving extensive battlefield surveillance, medical healthcare, etc., it is crucial to have low-power, new protocols, methodologies and structures for transferring data and information in a network with full sensing coverage capability for an extended working period. The upmost mission is to ensure that the network is fully functional providing reliable transmission of the sensed data without the risk of data loss. WSNs have been applied to various types of mission-critical applications. Coverage preservation is one of the most essential functions to guarantee quality of service (QoS in WSNs. However, a tradeoff exists between sensing coverage and network lifetime due to the limited energy supplies of sensor nodes. In this study, we propose a routing protocol to accommodate both energy-balance and coverage-preservation for sensor nodes in WSNs. The energy consumption for radio transmissions and the residual energy over the network are taken into account when the proposed protocol determines an energy-efficient route for a packet. The simulation results demonstrate that the proposed protocol is able to increase the duration of the on-duty network and provide up to 98.3% and 85.7% of extra service time with 100% sensing coverage ratio comparing with LEACH and the LEACH-Coverage-U protocols, respectively.

Service-Aware Clustering: An Energy-Efficient Model for the Internet-of-Things.

Science.gov (United States)

Bagula, Antoine; Abidoye, Ademola Philip; Zodi, Guy-Alain Lusilao

2015-12-23

Current generation wireless sensor routing algorithms and protocols have been designed based on a myopic routing approach, where the motes are assumed to have the same sensing and communication capabilities. Myopic routing is not a natural fit for the IoT, as it may lead to energy imbalance and subsequent short-lived sensor networks, routing the sensor readings over the most service-intensive sensor nodes, while leaving the least active nodes idle. This paper revisits the issue of energy efficiency in sensor networks to propose a clustering model where sensor devices' service delivery is mapped into an energy awareness model, used to design a clustering algorithm that finds service-aware clustering (SAC) configurations in IoT settings. The performance evaluation reveals the relative energy efficiency of the proposed SAC algorithm compared to related routing algorithms in terms of energy consumption, the sensor nodes' life span and its traffic engineering efficiency in terms of throughput and delay. These include the well-known low energy adaptive clustering hierarchy (LEACH) and LEACH-centralized (LEACH-C) algorithms, as well as the most recent algorithms, such as DECSA and MOCRN.

Service-Aware Clustering: An Energy-Efficient Model for the Internet-of-Things

Directory of Open Access Journals (Sweden)

Antoine Bagula

2015-12-01

Full Text Available Current generation wireless sensor routing algorithms and protocols have been designed based on a myopic routing approach, where the motes are assumed to have the same sensing and communication capabilities. Myopic routing is not a natural fit for the IoT, as it may lead to energy imbalance and subsequent short-lived sensor networks, routing the sensor readings over the most service-intensive sensor nodes, while leaving the least active nodes idle. This paper revisits the issue of energy efficiency in sensor networks to propose a clustering model where sensor devices’ service delivery is mapped into an energy awareness model, used to design a clustering algorithm that finds service-aware clustering (SAC configurations in IoT settings. The performance evaluation reveals the relative energy efficiency of the proposed SAC algorithm compared to related routing algorithms in terms of energy consumption, the sensor nodes’ life span and its traffic engineering efficiency in terms of throughput and delay. These include the well-known low energy adaptive clustering hierarchy (LEACH and LEACH-centralized (LEACH-C algorithms, as well as the most recent algorithms, such as DECSA and MOCRN.

Plant lock and ant key: pairwise coevolution of an exclusion filter in an ant-plant mutualism.

Science.gov (United States)

Brouat, C; Garcia, N; Andary, C; McKey, D

2001-10-22

Although observations suggest pairwise coevolution in specific ant-plant symbioses, coevolutionary processes have rarely been demonstrated. We report on, what is to the authors' knowledge, the strongest evidence yet for reciprocal adaptation of morphological characters in a species-specific ant-plant mutualism. The plant character is the prostoma, which is a small unlignified organ at the apex of the domatia in which symbiotic ants excavate an entrance hole. Each myrmecophyte in the genus Leonardoxa has evolved a prostoma with a different shape. By performing precise measurements on the prostomata of three related myrmecophytes, on their specific associated ants and on the entrance holes excavated by symbiotic ants at the prostomata, we showed that correspondence of the plant and ant traits forms a morphological and behavioural filter. We have strong evidence for coevolution between the dimensions and shape of the symbiotic ants and the prostoma in one of the three ant-Leonardoxa associations.

Beyond ANT

DEFF Research Database (Denmark)

Jansen, Till

2017-01-01

Actor-Network-Theory (ANT) offers an ‘infra-language’ of the social that allows one to trace social relations very dynamically, while at the same time dissolving human agency, thus providing a flat and de-centred way into sociology. However, ANT struggles with its theoretical design that may lead...... us to reduce agency to causation and to conceptualize actor-networks as homogeneous ontologies of force. This article proposes to regard ANT’s inability to conceptualize reflexivity and the interrelatedness of different ontologies as the fundamental problem of the theory. Drawing on Günther......, it offers an ‘infra-language’ of reflexive relations while maintaining ANT’s de-centred approach. This would enable us to conceptualize actor-networks as non-homogeneous, dynamic and connecting different societal rationales while maintaining the main strengths of ANT....

Diversity and transmission of gut bacteria in Atta and Acromyrmex leaf-cutting ants during development

DEFF Research Database (Denmark)

Zhukova, Mariya; Sapountzis, Panagiotis; Schiøtt, Morten

2017-01-01

. To elucidate the extent to which metamorphosis interrupts associations between bacteria and hosts, we analyzed changes in gut microbiota during development and traced the transmission routes of dominant symbionts from the egg to adult stage in the leaf-cutting ants Acromyrmex echinatior and Atta cephalotes...... was the absolute dominant bacterial species across developmental stages in Acromyrmex and we confirmed that Atta lacks Wolbachia also in the immature stages, and had mostly Mollicutes bacteria in the adult worker guts. Wolbachia in Acromyrmex appeared to be transovarially transmitted similar to transmission...... in solitary insects. In contrast, Mollicutes were socially transmitted from old workers to newly emerged callows. We found that larval and pupal guts of both ant species contained Pseudomonas and Enterobacter bacteria that are also found in fungus gardens, but hardly or not in adult workers, suggesting...

Dynamics of an ant-plant-pollinator model

Science.gov (United States)

Wang, Yuanshi; DeAngelis, Donald L.; Nathaniel Holland, J.

2015-03-01

In this paper, we consider plant-pollinator-ant systems in which plant-pollinator interaction and plant-ant interaction are both mutualistic, but there also exists interference of pollinators by ants. The plant-pollinator interaction can be described by a Beddington-DeAngelis formula, so we extend the formula to characterize plant-pollinator mutualisms, including the interference by ants, and form a plant-pollinator-ant model. Using dynamical systems theory, we show uniform persistence of the model. Moreover, we demonstrate conditions under which boundary equilibria are globally asymptotically stable. The dynamics exhibit mechanisms by which the three species could coexist when ants interfere with pollinators. We define a threshold in ant interference. When ant interference is strong, it can drive plant-pollinator mutualisms to extinction. Furthermore, if the ants depend on pollination mutualism for their persistence, then sufficiently strong ant interference could lead to their own extinction as well. Yet, when ant interference is weak, plant-ant and plant-pollinator mutualisms can promote the persistence of one another.

Mobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence of Location Errors

Directory of Open Access Journals (Sweden)

Trung Kien Vu

2014-01-01

Full Text Available We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and have been ignored in previous work. To mitigate the impact of location errors on routing, we propose an on-demand routing algorithm taking into account location errors. To that end, we adopt the Kalman filter to estimate accurate locations and consider route confidence in discovering routes. Via simulations, we compare our algorithm and previous algorithms in various environments. Our proposed mobility prediction is robust to the location errors.

Using Ants as bioindicators: Multiscale Issues in Ant Community Ecology

Directory of Open Access Journals (Sweden)

Alan Andersen

1997-06-01

Full Text Available Ecological patterns and processes are characteristically scale dependent, and research findings often cannot be translated easily from one scale to another. Conservation biology is challenged by a lack of congruence between the spatial scales of ecological research (typically involving small plots and land management (typically involving whole landscapes. Here, I discuss spatial scaling issues as they relate to an understanding of ant communities and, consequently, their use as bioindicators in land management. Our perceptions of fundamental patterns and processes in ant communities depend on scale: taxa that are behaviorally dominant at one scale are not necessarily so at others, functional groups recognized at one scale are often inappropriate for others, and the role of competition in community structure depends on the scale of analysis. Patterns of species richness and composition, and the ability of total richness to be estimated by surrogates, are all also scale dependent. Ant community ecology has a tradition of detailed studies in small plots, but the use of ants as bioindicators requires a predictive understanding of community structure and dynamics at a range of spatial scales. Such an appreciation of ant communities and their most effective use as bioindicators is best served by studies integrating results from plot-scale research with the broad-scale paradigms of biogeography, systematics, and evolutionary biology.

Ecosystem services delivered by weaver ants

DEFF Research Database (Denmark)

Offenberg, Joachim

Weaver ants (Oecopgylla spp.) are increasingly being utilized as efficient biocontrol agents in a number of tropical tree crops, as they prey on pest insects and increase yields. However, recent studies and a review of the literature reveal that a number of other services may derive from the pres......Weaver ants (Oecopgylla spp.) are increasingly being utilized as efficient biocontrol agents in a number of tropical tree crops, as they prey on pest insects and increase yields. However, recent studies and a review of the literature reveal that a number of other services may derive from...... the presence of these ants. First of all, the chemical footprint left by the high density of ants in managed host trees may results in additional benefits. (i) Ant deposits may lead to improved fruit quality, e.g. increased sugar content, (ii) ant deposits may deter important pests (chemical deterrence) from...... crops, and lastly, (iii) ant waste products deposited ias anal spots contain urea that may be taken up by plant leaves and in this way fertilize ant-plants. On top of chemical services, weaver ants have been shown to reduce plant disease incidence via competitive exclusion of other ant species because...

Ant-lepidopteran associations along African forest edges

Science.gov (United States)

Dejean, Alain; Azémar, Frédéric; Libert, Michel; Compin, Arthur; Hérault, Bruno; Orivel, Jérôme; Bouyer, Thierry; Corbara, Bruno

2017-02-01

Working along forest edges, we aimed to determine how some caterpillars can co-exist with territorially dominant arboreal ants (TDAAs) in tropical Africa. We recorded caterpillars from 22 lepidopteran species living in the presence of five TDAA species. Among the defoliator and/or nectarivorous caterpillars that live on tree foliage, the Pyralidae and Nymphalidae use their silk to protect themselves from ant attacks. The Notodontidae and lycaenid Polyommatinae and Theclinae live in direct contact with ants; the Theclinae even reward ants with abundant secretions from their Newcomer gland. Lichen feeders (lycaenid; Poritiinae), protected by long bristles, also live among ants. Some lycaenid Miletinae caterpillars feed on ant-attended membracids, including in the shelters where the ants attend them; Lachnocnema caterpillars use their forelegs to obtain trophallaxis from their host ants. Caterpillars from other species live inside weaver ant nests. Those of the genus Euliphyra (Miletinae) feed on ant prey and brood and can obtain trophallaxis, while those from an Eberidae species only prey on host ant eggs. Eublemma albifascia (Erebidae) caterpillars use their thoracic legs to obtain trophallaxis and trophic eggs from ants. Through transfer bioassays of last instars, we noted that herbivorous caterpillars living in contact with ants were always accepted by alien conspecific ants; this is likely due to an intrinsic appeasing odor. Yet, caterpillars living in ant shelters or ant nests probably acquire cues from their host colonies because they were considered aliens and killed. We conclude that co-evolution with ants occurred similarly in the Heterocera and Rhopalocera.

Towards Location Based QoS-Aware Network Selection Mechanism for the Nomadic Mobile Services

NARCIS (Netherlands)

Pawar, P.; van Beijnum, Bernhard J.F.; Wac, K.E.; Hermens, Hermanus J.; Konstantas, D.

The advances in the area of location based computing will soon make it feasible to predict the availability of wireless networks and their application level Quality of Service (QoS) characteristics along the location and time dimensions. Such predictions are referred to as QoS predictions which are

The metapleural gland of ants

DEFF Research Database (Denmark)

Yek, Sze Huei; Mueller, Ulrich G

2011-01-01

The metapleural gland (MG) is a complex glandular structure unique to ants, suggesting a critical role in their origin and ecological success. We synthesize the current understanding of the adaptive function, morphology, evolutionary history, and chemical properties of the MG. Two functions......-compressible invagination of the integument and the secretion is thought to ooze out passively through the non-closable opening of the MG or is groomed off by the legs and applied to target surfaces. MG loss has occurred repeatedly among the ants, particularly in the subfamilies Formicinae and Myrmicinae, and the MG...... is more commonly absent in males than in workers. MG chemistry has been characterized mostly in derived ant lineages with unique biologies (e.g. leafcutter ants, fire ants), currently precluding any inferences about MG chemistry at the origin of the ants. A synthetic approach integrating functional...

Foliar uptake of nitrogen from ant fecal droplets: an overlooked service to ant plants

DEFF Research Database (Denmark)

Pinkalski, Christian Alexander Stidsen; Jensen, Karl-Martin Vagn; Damgaard, Christian Frølund

2018-01-01

and subsequently deposited fecal droplets on the seedlings, coffee leaves showed increased levels of 15N and total N compared to control plants without ants. This was evident for both exposed leaves and leaves covered in plastic bags (i.e. not directly exposed to ants). Thus, N from ant excretions was absorbed...

Intersexual trophic niche partitioning in an ant-eating spider (Araneae: Zodariidae.

Directory of Open Access Journals (Sweden)

Stano Pekár

2011-01-01

Full Text Available Divergence in trophic niche between the sexes may function to reduce competition between the sexes ("intersexual niche partitioning hypothesis", or may be result from differential selection among the sexes on maximizing reproductive output ("sexual selection hypothesis". The latter may lead to higher energy demands in females driven by fecundity selection, while males invest in mate searching. We tested predictions of the two hypotheses underlying intersexual trophic niche partitioning in a natural population of spiders. Zodarion jozefienae spiders specialize on Messor barbarus ants that are polymorphic in body size and hence comprise potential trophic niches for the spider, making this system well-suited to study intersexual trophic niche partitioning.Comparative analysis of trophic morphology (the chelicerae and body size of males, females and juveniles demonstrated highly female biased SSD (Sexual Size Dimorphism in body size, body weight, and in the size of chelicerae, the latter arising from sex-specific growth patterns in trophic morphology. In the field, female spiders actively selected ant sub-castes that were larger than the average prey size, and larger than ants captured by juveniles and males. Female fecundity was highly positively correlated with female body mass, which reflects foraging success during the adult stage. Females in laboratory experiments preferred the large ant sub-castes and displayed higher capture efficiency. In contrast, males occupied a different trophic niche and showed reduced foraging effort and reduced prey capture and feeding efficiency compared with females and juveniles.Our data indicate that female-biased dimorphism in trophic morphology and body size correlate with sex-specific reproductive strategies. We propose that intersexual trophic niche partitioning is shaped primarily by fecundity selection in females, and results from sex-differences in the route to successful reproduction where females are

Creating a Current Awareness Service Using Yahoo! Pipes and LibGuides

Directory of Open Access Journals (Sweden)

Elizabeth Kiscaden

2014-12-01

Full Text Available Migration from print to electronic journals brought an end to traditional current awareness services, which primarily utilized print routing. The emergence of Real Simple Syndication, or RSS feeds, and email alerting systems provided users with alternative services. To assist users with adopting these technologies, a service utilizing aggregate feeds to the library’s electronic journal content was created and made available through LibGuides. Libraries can resurrect current awareness services using current technologies to increase awareness and usage of library-provided electronic journal content. The current awareness service presented is an example of how libraries can build simple current awareness services utilizing freely accessible technologies.

A Novel Load Balancing Scheme for Multipath Routing Protocol in MANET

Directory of Open Access Journals (Sweden)

Kokilamani Mounagurusamy

2016-09-01

Full Text Available The recent advancements in information and communication technology create a great demand for multipath routing protocols. In MANET, nodes can be arbitrarily located and can move freely at any given time. The topology of MANET can change rapidly and unpredictably. Because wireless link capacities are usually limited, congestion is possible in MANETs. Hence, balancing the load in a MANET is important since nodes with high load will deplete their batteries quickly, thereby increasing the probability of disconnecting or partitioning the network. To overcome these, the multipath protocol should be aware of load at route discovery phase. The main objective of the proposed article is to balance the load on a node and to extend the lifetime of the node due to the congestion, energy depletion and link failures. This article describes a novel load and congestion aware scheme called Path Efficient Ad-hoc On-demand Multipath Distance Vector (PE-AOMDV protocol to increase the performance of routing process in MANET in terms of congestion, end-to-end delay and load balancing. A new threshold value and a counter variable are introduced to limit the number of communication paths passing over a node in route discovery phase. For every new request the counter variable is incremented by one and the threshold value is compared to see whether the maximum number of connections has been reached or not. The proposed method is network simulator ns-2 and it is found that there is a significant improvement in the proposed scheme. It reduces the energy consumption, average end-to-end delay and normalized routing overhead. Also the proposed scheme increases packet delivery ratio, throughput and minimizes routing overheads.

First demonstration of single-mode MCF transport network with crosstalk-aware in-service optical channel control

DEFF Research Database (Denmark)

Pulverer, K.; Tanaka, T.; Häbel, U.

2017-01-01

We demonstrate the first crosstalk-aware traffic engineering as a use case in a multicore fibre transport network. With the help of a software-defined network controller, modulation format and channel route are adaptively changed using programmable devices with XT monitors.......We demonstrate the first crosstalk-aware traffic engineering as a use case in a multicore fibre transport network. With the help of a software-defined network controller, modulation format and channel route are adaptively changed using programmable devices with XT monitors....

Odorous house ants (Tapinoma sessile as back-seat drivers of localized ant decline in urban habitats.

Directory of Open Access Journals (Sweden)

Adam Salyer

Full Text Available Invasive species and habitat disturbance threaten biodiversity worldwide by modifying ecosystem performance and displacing native organisms. Similar homogenization impacts manifest locally when urbanization forces native species to relocate or reinvade perpetually altered habitat. This study investigated correlations between ant richness and abundance in response to urbanization and the nearby presence of invasive ant species, odorous house ants (Tapinoma sessile, within its native region. Surveying localized ant composition within natural, semi-natural, and urban habitat supported efforts to determine whether T. sessile appear to be primary (drivers threats as instigators or secondary (passengers threats as inheritors of indigenous ant decline. Sampling 180 sites, evenly split between all habitats with and without T. sessile present, yielded 45 total species. Although urbanization and T. sessile presence factors were significantly linked to ant decline, their interaction correlated to the greatest reduction of total ant richness (74% and abundance (81%. Total richness appeared to decrease from 27 species to 18 when natural habitat is urbanized and from 18 species to 7 with T. sessile present in urban plots. Odorous house ant presence minimally influenced ant communities within natural and semi-natural habitat, highlighting the importance of habitat alteration and T. sessile presence interactions. Results suggest urbanization releases T. sessile from unknown constraints by decreasing ant richness and competition. Within urban environment, T. sessile are pre-adapted to quickly exploit new resources and grow to supercolony strength wherein T. sessile drive adjacent biodiversity loss. Odorous house ants act as passengers and drivers of ecological change throughout different phases of urban 'invasion'. This progression through surviving habitat alteration, exploiting new resources, thriving, and further reducing interspecific competition supports a

Microsatellite primers for fungus-growing ants

DEFF Research Database (Denmark)

Villesen, Palle; Gertsch, P J; Boomsma, JJ

2002-01-01

We isolated five polymorphic microsatellite loci from a library of two thousand recombinant clones of two fungus-growing ant species, Cyphomyrmex longiscapus and Trachymyrmex cf. zeteki. Amplification and heterozygosity were tested in five species of higher attine ants using both the newly...... developed primers and earlier published primers that were developed for fungus-growing ants. A total of 20 variable microsatellite loci, developed for six different species of fungus-growing ants, are now available for studying the population genetics and colony kin-structure of these ants....

Microsatellite Primers for Fungus-Growing Ants

DEFF Research Database (Denmark)

Villesen Fredsted, Palle; Gertsch, Pia J.; Boomsma, Jacobus Jan (Koos)

2002-01-01

We isolated five polymorphic microsatellite loci from a library of two thousand recombinant clones of two fungus-growing ant species, Cyphomyrmex longiscapus and Trachymyrmex cf. zeteki. Amplification and heterozygosity were tested in five species of higher attine ants using both the newly...... developed primers and earlier published primers that were developed for fungus-growing ants. A total of 20 variable microsatellite loci, developed for six different species of fungus-growing ants, are now available for studying the population genetics and colony kin-structure of these ants....

Ant Colony Optimization for Control

NARCIS (Netherlands)

Van Ast, J.M.

2010-01-01

The very basis of this thesis is the collective behavior of ants in colonies. Ants are an excellent example of how rather simple behavior on a local level can lead to complex behavior on a global level that is beneficial for the individuals. The key in the self-organization of ants is communication

Partial incompatibility between ants and symbiotic fungi in two sympatric species of Acromyrmex leaf-cutting ants.

Science.gov (United States)

Bot, A N; Rehner, S A; Boomsma, J J

2001-10-01

We investigate the nature and duration of incompatibility between certain combinations of Acromyrmex leaf-cutting ants and symbiotic fungi, taken from sympatric colonies of the same or a related species. Ant-fungus incompatibility appeared to be largely independent of the ant species involved, but could be explained partly by genetic differences among the fungus cultivars. Following current theoretical considerations, we develop a hypothesis, originally proposed by S. A. Frank, that the observed incompatibilities are ultimately due to competitive interactions between genetically different fungal lineages, and we predict that the ants should have evolved mechanisms to prevent such competition between cultivars within a single garden. This requires that the ants are able to recognize unfamiliar fungi, and we show that this is indeed the case. Amplified fragment length polymorphism genotyping further shows that the two sympatric Acromyrmex species share each other's major lineages of cultivar, confirming that horizontal transfer does occasionally take place. We argue and provide some evidence that chemical substances produced by the fungus garden may mediate recognition of alien fungi by the ants. We show that incompatibility between ants and transplanted, genetically different cultivars is indeed due to active killing of the novel cultivar by the ants. This incompatibility disappears when ants are force-fed the novel cultivar for about a week, a result that is consistent with our hypothesis of recognition induced by the resident fungus and eventual replacement of incompatibility compounds during force-feeding.

Pengembangan Sistem Pendukung Keputusan Permasalahan Inventory Routing Problem Pada Spbu Menggunakan Algoritma Ant Colony

Directory of Open Access Journals (Sweden)

Satria Nur Alam

2012-09-01

Full Text Available Seiring dengan bertambahnya jumlah kendaraan setiap tahun, akan mempengaruhi konsumsi bahan bakar yang dibutuhkan. Tingginya kebutuhan bahan bakar di Indonesia didominasi oleh jenis bahan bakar premium. Persentase konsumsi bahan bakar premium di daerah Jawa-Bali mencapai 59% dari kuota premium nasional. Besarnya persentase kebutuhan akan bahan bakar premium, menyebabkan manajemen distribusi menjadi hal krusial yang perlu ditingkatkan secara berkala. Depo yang berperan sebagai supplier terhadap retailer -yang dalam studi kasus ini adalah SPBU- diusulkan menerapkan model Vendor Managed Inventory (VMI, yaitu proses pengadaan barang dimana supplier mengelola inventori dari retailernya. VMI memiliki salah satu perencanaan yaitu Inventory Routing Problem (IRP, IRP merupakan suatu bentuk perencanaan berbasis vendor hasil perpaduan antara Inventory Management dengan Inventory Routing yang mengatur kuantitas pengiriman dan retailer mana yang harus dikunjungi dalam suatu waktu perencanaan dalam jangka waktu tertentu yang bersifat terbatas (finite planning horizon. Dengan hasil akhir berupa penjadwalan, perencanaan model IRP mempertimbangkan jarak supplier-retailer dan biaya stockout yang mungkin terjadi pada retailer, sehingga diharapkan pengiriman optimal dan tidak terjadi stockout pada pos-pos penjualan bahan bakar.

Sick ants become unsociable

DEFF Research Database (Denmark)

Bos, Nicky Peter Maria; Lefevre, T.; Jensen, A.B.

2012-01-01

Parasites represent a severe threat to social insects, which form high-density colonies of related individuals, and selection should favour host traits that reduce infection risk. Here, using a carpenter ant (Camponotus aethiops) and a generalist insect pathogenic fungus (Metarhizium brunneum), we...... show that infected ants radically change their behaviour over time to reduce the risk of colony infection. Infected individuals (i) performed less social interactions than their uninfected counterparts, (ii) did not interact with brood anymore and (iii) spent most of their time outside the nest from...... day 3 post-infection until death. Furthermore, infected ants displayed an increased aggressiveness towards non-nestmates. Finally, infected ants did not alter their cuticular chemical profile, suggesting that infected individuals do not signal their physiological status to nestmates. Our results...

QoS Parameters Evaluation in a VPN-MPLS Diffserv Network under a Complete Free Software Emulation Environment

Directory of Open Access Journals (Sweden)

Miroslava Aracely Zapata Rodríguez

2017-12-01

Full Text Available The use of Virtual Private Network – Multi Protocol Label Switching (VPN-MPLS networks has become very common inside enterprises thanks to their multiple advantages; such as, the private communication across a public network infrastructure between geographically diverse sites. This leads to a need for an efficient network in terms of Quality of Service (QoS to guarantee reliability and security of information. However, the implementation of a VPN-MPLS network is neither easy nor cheap for small and medium companies; hence, in most cases, it is required the use of emulators that are not free either. In this paper, we analyze a VPN-MPLS network in terms of QoS metrics: delay, jitter and packet loss. This evaluation was performed in a virtual environment using only free software tools under two test scenarios, with and without Differentiated Services (DiffServ. The results showed that a VPN-MPLS DiffServ network reduces the delay by approximately 96.78% in VoIP, 39.21% in Data and 66.83% in Streaming; furthermore, the jitter was reduced by approximately 27.88% in VoIP and 41.09% in Data.

A game theoretical approach for QoS provisioning in heterogeneous networks

Directory of Open Access Journals (Sweden)

A.S.M. Zadid Shifat

2015-09-01

Full Text Available With the proliferation of mobile phone users, interference management is a big concern in this neoteric years. To cope with this problem along with ensuring better Quality of Service (QoS, femtocell plays an imperious preamble in heterogeneous networks (HetNets for some of its noteworthy characteristics. In this paper, we propose a game theoretic algorithm along with dynamic channel allocation and hybrid access mechanism with self-organizing power control scheme. With a view to resolving prioritized access issue, the concept of primary and secondary users is applied. Existence of pure strategy Nash equilibrium (NE has been investigated and comes to a perfection that our proposed scheme can be adopted both increasing capacity and increasing revenue of operators considering optimal price for consumers.

Interactive effects of soil-dwelling ants, ant mounds and simulated grazing on local plant community composition

NARCIS (Netherlands)

Veen, G.F.; Olff, H.

2011-01-01

Interactions between aboveground vertebrate herbivores and subterranean yellow meadow ants (Lasius flavus) can drive plant community patterns in grassland ecosystems. Here, we study the relative importance of the presence of ants (L. flavus) and ant mounds under different simulated grazing regimes

Roadside Survey of Ants on Oahu, Hawaii

Science.gov (United States)

Tong, Reina L.; Grace, J. Kenneth; Krushelnycky, Paul D.

2018-01-01

Hawaii is home to over 60 ant species, including five of the six most damaging invasive ants. Although there have been many surveys of ants in Hawaii, the last island-wide hand-collection survey of ants on Oahu was conducted in 1988–1994. In 2012, a timed hand-collection of ants was made at 44 sites in a systematic, roadside survey throughout Oahu. Ants were identified and species distribution in relation to elevation, precipitation and soil type was analyzed. To assess possible convenience sampling bias, 15 additional sites were sampled further from roads to compare with the samples near roads. Twenty-four species of ants were found and mapped; Pheidole megacephala (F.), Ochetellus glaber (Mayr), and Technomyrmex difficilis Forel were the most frequently encountered ants. For six ant species, a logistic regression was performed with elevation, average annual precipitation, and soil order as explanatory variables. O. glaber was found in areas with lower precipitation around Oahu. Paratrechina longicornis (Latrielle) and Tetramorium simillimum (Smith, F.) were found more often in lower elevations and in areas with the Mollisol soil order. Elevation, precipitation, and soil type were not significant sources of variation for P. megacephala, Plagiolepis alluaudi Emery, and T. difficilis. P. megacephala was associated with fewer mean numbers of ants where it occurred. Ant assemblages near and far from roads did not significantly differ. Many species of ants remain established on Oahu, and recent invaders are spreading throughout the island. Mapping ant distributions contributes to continued documentation and understanding of these pests. PMID:29439503

Dealing with water deficit in Atta ant colonies: large ants scout for water while small ants transport it

Directory of Open Access Journals (Sweden)

Antonio Carlos Da-Silva

2012-07-01

Leafcutter ants (Atta sexdens rubropilosa (Forel 1908 have an elaborate social organization, complete with caste divisions. Activities carried out by specialist groups contribute to the overall success and survival of the colony when it is confronted with environmental challenges such as dehydration. Ants detect variations in humidity inside the nest and react by activating several types of behavior that enhance water uptake and decrease water loss, but it is not clear whether or not a single caste collects water regardless of the cost of bringing this resource back to the colony. Accordingly, we investigated water collection activities in three colonies of Atta sexdens rubropilosa experimentally exposed to water stress. Specifically, we analyzed whether or not the same ant caste foraged for water, regardless of the absolute energetic cost (distance of transporting this resource back to the colony. Our experimental design offered water sources at 0 m, 1 m and 10 m from the nest. We studied the body size of ants near the water sources from the initial offer of water (time  =  0 to 120 min, and tested for specialization. We observed a reduction in the average size and variance of ants that corroborated the specialization hypothesis. Although the temporal course of specialization changed with distance, the final outcome was similar among distances. Thus, we conclude that, for this species, a specialist (our use of the word “specialist” does not mean exclusive task force is responsible for collecting water, regardless of the cost of transporting water back to the colony.

Secure Trust Based Key Management Routing Framework for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jugminder Kaur

2016-01-01

Full Text Available Security is always a major concern in wireless sensor networks (WSNs. Several trust based routing protocols are designed that play an important role in enhancing the performance of a wireless network. However they still have some disadvantages like limited energy resources, susceptibility to physical capture, and little protection against various attacks due to insecure wireless communication channels. This paper presents a secure trust based key management (STKF routing framework that establishes a secure trustworthy route depending upon the present and past node to node interactions. This route is then updated by isolating the malicious or compromised nodes from the route, if any, and a dedicated link is created between every pair of nodes in the selected route with the help of “q” composite random key predistribution scheme (RKPS to ensure data delivery from source to destination. The performance of trust aware secure routing framework (TSRF is compared with the proposed routing scheme. The results indicate that STKF provides an effective mechanism for finding out a secure route with better trustworthiness than TSRF which avoids the data dropping, thereby increasing the data delivery ratio. Also the distance required to reach the destination in the proposed protocol is less hence effectively utilizing the resources.

Online image databases as multi-purpose resources: discovery of a new host ant of Rickia wasmannii Cavara (Ascomycota, Laboulbeniales by screening AntWeb.org

Directory of Open Access Journals (Sweden)

Ferenc Báthori

2017-12-01

Full Text Available Public awareness has been raised on the importance of natural history and academic collections for science and society in a time when reduced financial support and staff cuts are prevalent. In the field of biology, new species and new interspecies associations are constantly discovered by making use of museum collections, digitalised materials or citizen science programs. In our study, the Myrmica Latreille, 1804 image collection of AntWeb.org was screened for fungal ectoparasites. A total of 397 imaged specimens from 133 species were visually investigated. A single specimen of M. hellenica Finzi, 1926, collected in Greece by U. Sahlberg, showed a conspicuous fungal infection. The parasite was identified using microscopic methods as Rickia wasmannii Cavara, an ectoparasitic fungal species specialised to Myrmica ants. This finding represents a new country record and a new Myrmica species for the host spectrum of R. wasmannii. According to our results, online entomological databases can be screened relatively easily for ectoparasitic fungal infections from new hosts and new regions. However, depending on quality of the insect voucher photos, additional investigation of the material could be needed to confirm the identity of the parasite.

The evolution of genome size in ants

Directory of Open Access Journals (Sweden)

Spagna Joseph C

2008-02-01

Full Text Available Abstract Background Despite the economic and ecological importance of ants, genomic tools for this family (Formicidae remain woefully scarce. Knowledge of genome size, for example, is a useful and necessary prerequisite for the development of many genomic resources, yet it has been reported for only one ant species (Solenopsis invicta, and the two published estimates for this species differ by 146.7 Mb (0.15 pg. Results Here, we report the genome size for 40 species of ants distributed across 10 of the 20 currently recognized subfamilies, thus making Formicidae the 4th most surveyed insect family and elevating the Hymenoptera to the 5th most surveyed insect order. Our analysis spans much of the ant phylogeny, from the less derived Amblyoponinae and Ponerinae to the more derived Myrmicinae, Formicinae and Dolichoderinae. We include a number of interesting and important taxa, including the invasive Argentine ant (Linepithema humile, Neotropical army ants (genera Eciton and Labidus, trapjaw ants (Odontomachus, fungus-growing ants (Apterostigma, Atta and Sericomyrmex, harvester ants (Messor, Pheidole and Pogonomyrmex, carpenter ants (Camponotus, a fire ant (Solenopsis, and a bulldog ant (Myrmecia. Our results show that ants possess small genomes relative to most other insects, yet genome size varies three-fold across this insect family. Moreover, our data suggest that two whole-genome duplications may have occurred in the ancestors of the modern Ectatomma and Apterostigma. Although some previous studies of other taxa have revealed a relationship between genome size and body size, our phylogenetically-controlled analysis of this correlation did not reveal a significant relationship. Conclusion This is the first analysis of genome size in ants (Formicidae and the first across multiple species of social insects. We show that genome size is a variable trait that can evolve gradually over long time spans, as well as rapidly, through processes that may

iQOS: evidence of pyrolysis and release of a toxicant from plastic.

Science.gov (United States)

Davis, Barbara; Williams, Monique; Talbot, Prue

2018-03-13

To evaluate performance of the I quit original smoking (iQOS) heat-not-burn system as a function of cleaning and puffing topography, investigate the validity of manufacturer's claims that this device does not burn tobacco and determine if the polymer-film filter is potentially harmful. iQOS performance was evaluated using five running conditions incorporating two different cleaning protocols. Heatsticks were visually and stereomicroscopically inspected preuse and postuse to determine the extent of tobacco plug charring (from pyrolysis) and polymer-film filter melting, and to elucidate the effects of cleaning on charring. Gas chromatography-mass spectrometry headspace analysis was conducted on unused polymer-film filters to determine if potentially toxic chemicals are emitted from the filter during heating. For all testing protocols, pressure drop decreased as puff number increased. Changes in testing protocols did not affect aerosol density. Charring due to pyrolysis (a form of organic matter thermochemical decomposition) was observed in the tobacco plug after use. When the manufacturer's cleaning instructions were followed, both charring of the tobacco plug and melting of the polymer-film filter increased. Headspace analysis of the polymer-film filter revealed the release of formaldehyde cyanohydrin at 90°C, which is well below the maximum temperature reached during normal usage. Device usage limitations may contribute to decreases in interpuff intervals, potentially increasing user's intake of nicotine and other harmful chemicals. This study found that the tobacco plug does char and that charring increases when the device is not cleaned between heatsticks. Release of formaldehyde cyanohydrin is a concern as it is highly toxic at very low concentrations. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

An algorithm for routing optimization in DiffServ-aware MPLS networks

OpenAIRE

Luigi Atzori; Fabio D'Andreagiovanni; Carlo Mannino; Tatiana Onali

2010-01-01

This paper addresses the constrained-based routing problem in DiffServaware MPLS networks. We consider a dynamic context in which new requests appear over time, asking for reconfigurations of the previous allocation. In the classical approach, a multi-phase heuristic procedure is adopted: the new requests are evaluated considering available bandwidth; if the bandwidth is not sufficient, preemption and rerouting of one or more connections are performed in sequence. As an alternative, we propos...

Lightweight Context Aware Routing in Wireless Sensor Networks for Real Environments

Directory of Open Access Journals (Sweden)

Samia Aijaz

2015-07-01

Full Text Available Design and implementation of a WSN (Wireless Sensor Network that can efficiently work for a longer time period must include identification of the deployment environment context and to conform to the behavior of the sensor nodes. The context information when treated with evaluation factor becomes a process of context awareness and the evaluation factor is called the context attribute. In this paper, we consider the context factor of energy. The paper identifies analyses and evaluates efficiency of two when used in a context aware environment. Furthermore, the study also highlights the strengths and weaknesses of sensor SPIN (Sensor Protocol for Information via Negotiation and LEACH (Low Energy Adaptive Clustering Hierarchy protocols with respect to the support for WSN with heavy network traffic conditions. The performance has been evaluated in terms of energy efficiency, data packet transmission, network status, data management, reliability, etc.

Are ant feces nutrients for plants? A metabolomics approach to elucidate the nutritional effects on plants hosting weaver ants

DEFF Research Database (Denmark)

Vidkjær, Nanna Hjort; Wollenweber, Bernd; Gislum, René

2015-01-01

Weaver ants (genus Oecophylla) are tropical carnivorous ant species living in high numbers in the canopies of trees. The ants excrete copious amounts of fecal matter on leaf surfaces, and these feces may provide nutrients to host trees. This hypothesis is supported by studies of ant......-plant interactions involving other ant species that have demonstrated the transfer of nutrients from ants to plants. In this 7-months study, a GC–MS-based metabolomics approach along with an analysis of total nitrogen and carbon levels was used to study metabolic changes in ant-hosting Coffea arabica plants compared...... with control plants. The results showed elevated levels of total nitrogen, amino acids, fatty acids, caffeine, and secondary metabolites of the phenylpropanoid pathway in leaves from ant-hosting plants. Minor effects were observed for sugars, whereas little or no effect was observed for organic acids, despite...

The interactions of ants with their biotic environment.

Science.gov (United States)

Chomicki, Guillaume; Renner, Susanne S

2017-03-15

This s pecial feature results from the symposium 'Ants 2016: ant interactions with their biotic environments' held in Munich in May 2016 and deals with the interactions between ants and other insects, plants, microbes and fungi, studied at micro- and macroevolutionary levels with a wide range of approaches, from field ecology to next-generation sequencing, chemical ecology and molecular genetics. In this paper, we review key aspects of these biotic interactions to provide background information for the papers of this s pecial feature After listing the major types of biotic interactions that ants engage in, we present a brief overview of ant/ant communication, ant/plant interactions, ant/fungus symbioses, and recent insights about ants and their endosymbionts. Using a large molecular clock-dated Formicidae phylogeny, we map the evolutionary origins of different ant clades' interactions with plants, fungi and hemiptera. Ants' biotic interactions provide ideal systems to address fundamental ecological and evolutionary questions about mutualism, coevolution, adaptation and animal communication. © 2017 The Author(s).

Chemically armed mercenary ants protect fungus-farming societies

DEFF Research Database (Denmark)

Adams, Rachelle Martha Marie; Liberti, Joanito; Illum, Anders A.

2013-01-01

guest ants are sufficient to kill raiders that invariably exterminate host nests without a cohabiting guest ant colony. We also show that the odor of guest ants discourages raider scouts from recruiting nestmates to host colonies. Our results imply that Sericomyrmex fungus-growers obtain a net benefit......The ants are extraordinary in having evolved many lineages that exploit closely related ant societies as social parasites, but social parasitism by distantly related ants is rare. Here we document the interaction dynamics among a Sericomyrmex fungus-growing ant host, a permanently associated...... parasitic guest ant of the genus Megalomyrmex, and a raiding agro-predator of the genus Gnamptogenys. We show experimentally that the guest ants protect their host colonies against agro-predator raids using alkaloid venom that is much more potent than the biting defenses of the host ants. Relatively few...

A Link Quality and Geographical-aware Routing Protocol for Video Transmission in Mobile IoT

OpenAIRE

Rosário, Denis; Zhao, Zhongliang; Cerqueira, Eduardo; Braun, Torsten; Santos, Aldri

2013-01-01

Wireless mobile sensor networks are enlarging the Internet of Things (IoT) portfolio with a huge number of multimedia services for smart cities. Safety and environmental monitoring multimedia applications will be part of the Smart IoT systems, which aim to reduce emergency response time, while also predicting hazardous events. In these mobile and dynamic (possible disaster) scenarios, opportunistic routing allows routing decisions in a completely distributed manner, by using a hop- by-hop rou...

A cellular automata model for ant trails

Indian Academy of Sciences (India)

In this study, the unidirectional ant traffic flow with U-turn in an ant trail was inves- tigated using ... the literature, it was considered in the model that (i) ant colony consists of two kinds of ants, good- ... ponents without a central controller [8].

Using pleometrosis (multiple queens) and pupae transplantation to boost weaver ant (Oecophylla smaragdina) colony growth in ant nurseries

DEFF Research Database (Denmark)

Offenberg, Hans Joachim; Nielsen, Mogens Gissel; Peng, Renkang

2011-01-01

Weaver ants (Oecophylla spp.) are increasingly being used for biocontrol and are targeted for future production of insect protein in ant farms. An efficient production of live ant colonies may facilitate the utilization of these ants but the production of mature colonies is hampered by the long...... and no transplantation. Thus, in ant nurseries the use of multiple queens during nest founding as well as transplantation of pupae from foreign colonies may be utilised to decrease the time it takes to produce a colony ready for implementation....

Ant-plants and fungi: a new threeway symbiosis.

Science.gov (United States)

Defossez, Emmanuel; Selosse, Marc-André; Dubois, Marie-Pierre; Mondolot, Laurence; Faccio, Antonella; Djieto-Lordon, Champlain; McKey, Doyle; Blatrix, Rumsaïs

2009-06-01

Symbioses between plants and fungi, fungi and ants, and ants and plants all play important roles in ecosystems. Symbioses involving all three partners appear to be rare. Here, we describe a novel tripartite symbiosis in which ants and a fungus inhabit domatia of an ant-plant, and present evidence that such interactions are widespread. We investigated 139 individuals of the African ant-plant Leonardoxa africana for occurrence of fungus. Behaviour of mutualist ants toward the fungus within domatia was observed using a video camera fitted with an endoscope. Fungi were identified by sequencing a fragment of their ribosomal DNA. Fungi were always present in domatia occupied by mutualist ants but never in domatia occupied by opportunistic or parasitic ants. Ants appear to favour the propagation, removal and maintenance of the fungus. Similar fungi were associated with other ant-plants in Cameroon. All belong to the ascomycete order Chaetothyriales; those from L. africana formed a monophyletic clade. These new plant-ant-fungus associations seem to be specific, as demonstrated within Leonardoxa and as suggested by fungal phyletic identities. Such tripartite associations are widespread in African ant-plants but have long been overlooked. Taking fungal partners into account will greatly enhance our understanding of symbiotic ant-plant mutualisms.

Food source quality and ant dominance hierarchy influence the outcomes of ant-plant interactions in an arid environment

Science.gov (United States)

Flores-Flores, Rocío Vianey; Aguirre, Armando; Anjos, Diego V.; Neves, Frederico S.; Campos, Ricardo I.; Dáttilo, Wesley

2018-02-01

In this study, we conducted a series of experiments in a population of Vachellia constricta (Fabaceae) in the arid Tehuacan-Cuicatláan valley, Mexico, in order to evaluate if the food source quality and ant dominance hierarchy influence the outcomes of ant-plant interactions. Using an experiment with artificial nectaries, we observed that ants foraging on food sources with higher concentration of sugar are quicker in finding and attacking potential herbivorous insects. More specifically, we found that the same ant species may increase their defence effectiveness according to the quality of food available. These findings indicate that ant effectiveness in plant protection is context-dependent and may vary according to specific individual characteristics of plants. In addition, we showed that competitively superior ant species tend to dominate plants in periods with high nectar activity, emphasizing the role of the dominance hierarchy structuring ant-plant interactions. However, when high sugar food sources were experimentally available ad libitum, the nocturnal and competitively superior ant species, Camponotus atriceps, did not dominate the artificial nectaries during the day possibly due to limitation of its thermal tolerance. Therefore, temporal niche partitioning may be allowing the coexistence of two dominant ant species (Camponotus rubritorax during the day and C. atriceps at night) on V. constricta. Our findings indicate that the quality of the food source, and temporal shifts in ant dominance are key factors which structure the biotic plant defences in an arid environment.

Persistence of pollination mutualisms in the presence of ants.

Science.gov (United States)

Wang, Yuanshi; Wang, Shikun

2015-01-01

This paper considers plant-pollinator-ant systems in which the plant-pollinator interaction is mutualistic but ants have both positive and negative effects on plants. The ants also interfere with pollinators by preventing them from accessing plants. While a Beddington-DeAngelis (BD) formula can describe the plant-pollinator interaction, the formula is extended in this paper to characterize the pollination mutualism under the ant interference. Then, a plant-pollinator-ant system with the extended BD functional response is discussed, and global dynamics of the model demonstrate the mechanisms by which pollination mutualism can persist in the presence of ants. When the ant interference is strong, it can result in extinction of pollinators. Moreover, if the ants depend on pollination mutualism for survival, the strong interference could drive pollinators into extinction, which consequently lead to extinction of the ants themselves. When the ant interference is weak, a cooperation between plant-ant and plant-pollinator mutualisms could occur, which promotes survival of both ants and pollinators, especially in the case that ants (respectively, pollinators) cannot survive in the absence of pollinators (respectively, ants). Even when the level of ant interference remains invariant, varying ants' negative effect on plants can result in survival/extinction of both ants and pollinators. Therefore, our results provide an explanation for the persistence of pollination mutualism when there exist ants.

HIV/AIDS: Awareness and Practice Among Traditional Birth ...

African Journals Online (AJOL)

Ebonyi State has an HIV prevalence rate of 11.1%. The state has 2.1 million inhabitants, who are mainly rural dwellers where traditional birth attendants play pivotal role in healthcare delivery. This study assesses the awareness of HIV infection and its route of transmission among the traditional birth attendants in Ebonyi ...

Riding with the ants

NARCIS (Netherlands)

Duarte, A. P. M.; Attili-Angelis, D.; Baron, N. C.; Groenewald, Johannes Z.; Crous, Pedro W.; Pagnocca, F. C.

Isolates of Teratosphaeriaceae have frequently been found in the integument of attine ants, proving to be common and diverse in this microenvironment. The LSU phylogeny of the ant-isolated strains studied revealed that they cluster in two main lineages. The first was associated with the genus

ENERGY EFFICIENT ROUTING PROTOCOLS FOR WIRELESS AD HOC NETWORKS – A SURVEY

Directory of Open Access Journals (Sweden)

K. Sankar

2012-06-01

Full Text Available Reducing energy consumption, primarily with the goal of extending the lifetime of battery-powered devices, has emerged as a fundamental challenge in wireless communication. The performance of the medium access control (MAC scheme not only has a fairly significant end-result on the behaviour of the routing approach employed, but also on the energy consumption of the wireless network interface card (NIC. We investigate the inadequacies of the MAC schemes designed for ad hoc wireless networks in the context of power awareness herein. The topology changes due to uncontrollable factors such as node mobility, weather, interference, noise, as well as on controllable parameters such as transmission power and antenna direction results in significant amount of energy loss. Controlling rapid topology changes by minimizing the maximum transmission power used in ad hoc wireless networks, while still maintaining networks connectivity can prolong battery life and hence network lifetime considerably. In addition, we systematically explore the potential energy consumption pitfalls of non–power-based and power based routing schemes. We suggest a thorough energy-based performance survey of energy aware routing protocols for wireless mobile ad-hoc networks. We also present the statistical performance metrics measured by our simulations.

The importance of ants in cave ecology, with new records and behavioral observations of ants in Arizona caves

Directory of Open Access Journals (Sweden)

Robert B. Pape

2016-09-01

Full Text Available The importance of ants as elements in cave ecology has been mostly unrecognized. A global list of ant species recorded from caves, compiled from a review of existing literature, is presented. This paper also reviews what is currently known about ants occurring in Arizona (USA caves. The diversity and distribution represented in these records suggests ants are relatively common cave visitors (trogloxenes. A general utilization of caves by ants within both temperate and tropical latitudes may be inferred from this combined evidence. Observations of ant behavior in Arizona caves demonstrate a low level and sporadic, but persistent, use of these habitats and their contained resources by individual ant colonies. Documentation of Neivamyrmex sp. preying on cave-inhabiting arthropods is reported here for the first time. Observations of hypogeic army ants in caves suggests they may not penetrate to great vertical depth in search of prey, but can be persistent occupants in relatively shallow, horizontal sections of caves where they may prey on endemic cave animals. First cave records for ten ant species are reported from Arizona caves. These include two species of Neivamyrmex (N. nigrescens Cresson and Neivamyrmex sp.; Formicidae: Dorylinae, four myrmicines (Pheidole portalensis Wilson, Pheidole cf. porcula Wheeler, Solenopsis aurea Wheeler and Stenamma sp. Westwood, one dolichoderine (Forelius keiferi Wheeler and three formicines (Lasius arizonicus Wheeler, L. sitiens Wilson, and Camponotus sp. Mayr.

Selective Route Based on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network

Directory of Open Access Journals (Sweden)

Istikmal

2017-01-01

Full Text Available In this study, we developed network and throughput formulation models and proposed new method of the routing protocol algorithm with a cross-layer scheme based on signal-to-noise ratio (SNR. This method is an enhancement of routing protocol ad hoc on-demand distance vector (AODV. This proposed scheme uses selective route based on the SNR threshold in the reverse route mechanism. We developed AODV SNR-selective route (AODV SNR-SR for a mechanism better than AODV SNR, that is, the routing protocol that used average or sum of path SNR, and also better than AODV which is hop-count-based. We also used selective reverse route based on SNR mechanism, replacing the earlier method to avoid routing overhead. The simulation results show that AODV SNR-SR outperforms AODV SNR and AODV in terms of throughput, end-to-end delay, and routing overhead. This proposed method is expected to support Device-to-Device (D2D communications that are concerned with the quality of the channel awareness in the development of the future Fifth Generation (5G.

Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems.

Directory of Open Access Journals (Sweden)

Zili Zhang

Full Text Available Bi-objective Traveling Salesman Problem (bTSP is an important field in the operations research, its solutions can be widely applied in the real world. Many researches of Multi-objective Ant Colony Optimization (MOACOs have been proposed to solve bTSPs. However, most of MOACOs suffer premature convergence. This paper proposes an optimization strategy for MOACOs by optimizing the initialization of pheromone matrix with the prior knowledge of Physarum-inspired Mathematical Model (PMM. PMM can find the shortest route between two nodes based on the positive feedback mechanism. The optimized algorithms, named as iPM-MOACOs, can enhance the pheromone in the short paths and promote the search ability of ants. A series of experiments are conducted and experimental results show that the proposed strategy can achieve a better compromise solution than the original MOACOs for solving bTSPs.

Optimization for routing vehicles of seafood product transportation

Science.gov (United States)

Soenandi, I. A.; Juan, Y.; Budi, M.

2017-12-01

Recently, increasing usage of marine products is creating new challenges for businesses of marine products in terms of transportation that used to carry the marine products like seafood to the main warehouse. This can be a problem if the carrier fleet is limited, and there are time constraints in terms of the freshness of the marine product. There are many ways to solve this problem, including the optimization of routing vehicles. In this study, this strategy is to implement in the marine product business in Indonesia with such an expected arrangement of the company to optimize routing problem in transportation with time and capacity windows. Until now, the company has not used the scientific method to manage the routing of their vehicle from warehouse to the location of marine products source. This study will solve a stochastic Vehicle Routing Problems (VRP) with time and capacity windows by using the comparison of six methods and looking the best results for the optimization, in this situation the company could choose the best method, in accordance with the existing condition. In this research, we compared the optimization with another method such as branch and bound, dynamic programming and Ant Colony Optimization (ACO). Finally, we get the best result after running ACO algorithm with existing travel time data. With ACO algorithm was able to reduce vehicle travel time by 3189.65 minutes, which is about 23% less than existing and based on consideration of the constraints of time within 2 days (including rest time for the driver) using 28 tons capacity of truck and the companies need two units of vehicles for transportation.

Ant-plant-homopteran mutualism: how the third partner affects the interaction between a plant-specialist ant and its myrmecophyte host

Science.gov (United States)

Gaume, L.; McKey, D.; Terrin, S.

1998-01-01

By estimating relative costs and benefits, we explored the role of the homopteran partner in the protection mutualism between the myrmecophyte Leonardoxa africana T3, the ant Aphomomyrmex afer, and sap-sucking homopterans tended by ants in the tree's swollen hollow twigs. The ants obtain nest sites and food from their host-plant (food is obtained either directly by extrafloral nectar or indirectly via homopterans). Aphomomyrmex workers patrol the young leaves of L. africana T3 and protect them against phytophagous insects. Because ants tended, either solely or primarily, coccids in some trees and pseudococcids in others, we were able to study whether the nature of the interaction was dependent on the identity of the third partner. First, the type of homopteran affects the benefits to the tree of maintaining a large ant colony. Larger colony size (relative to tree size) confers greater protection against herbivory; this relationship is more pronounced for trees whose ants tend pseudococcids than for those in which ants tend coccids. Second, for trees (and associated ant colonies) of comparable size, homopteran biomass was much larger in trees harbouring coccids than in trees with pseudococcids. Thus, the cost to the tree of maintaining ants may be greater when ants are associated with coccids. The net benefits to the plant of maintaining ants appear to be much greater with pseudococcids as the third partner. To explore how the type of homopteran affects functioning of the system, we attempted to determine which of the resources (nest sites, extrafloral nectar, and homopterans) is likely to limit ant colony size. In trees where ants tended coccids, ant-colony biomass was strongly dependent on the number of extrafloral nectaries. In contrast, in trees whose ants tended only pseudococcids, colony biomass was not related to the number of nectaries and was most strongly determined by the volume of available nest sites. We present hypotheses to explain how the type of

The distribution of weaver ant pheromones on host trees

DEFF Research Database (Denmark)

Offenberg, Joachim

2007-01-01

The visible anal spots deposited by Oecophylla smaragdina ants have been suggested to deter ant prey, affect interspecific competition and facilitate mutualists and parasites in tracking down Oecophylla ants. I measured the density of anal spots on host trees with and without ants and tested for ...... to leaves. Also there was a positive correlation between spot density and the likelihood of being detected by ants. Anal spots may thus function as reliable cues to interacting species and be an important factor in shaping the community around Oecophylla colonies.......The visible anal spots deposited by Oecophylla smaragdina ants have been suggested to deter ant prey, affect interspecific competition and facilitate mutualists and parasites in tracking down Oecophylla ants. I measured the density of anal spots on host trees with and without ants and tested...... for correlations between spot density, ant activity and the likelihood of being detected by an ant. Spots were only found on trees with ants. On ant-trees, spots were distributed throughout the trees but with higher densities in areas with high ant activity and pheromone densities were higher on twigs compared...

Of ants and men the unexpected side effects of complexity in society

CERN Document Server

Green, David G

2014-01-01

Why do things go wrong? Why, despite all the planning and care in the world, do things go from bad to worse? This book argues that it is because we are like the ants. Just as ants create an anthill without being aware of it, unintended side effects of human activity create all manner of social trends and crises. The book traces the way these trends emerge and the role they play in some of the major issues of our time. One of the greatest challenges today is the complexity of our social and economic systems. Every action has side effects that people often ignore or fail to see. The book examines the ways in which limitations in our thinking and behaviour lead to unintended side effects. It looks at the role played by complex networks of interactions. Finally, it looks at the way side effects of new technologies, especially computers and communication, have created an Information Revolution, the full repercussions of which are yet to be seen. In our race to create new technologies and sustain indefinite economi...

An ant genus-group (Prenolepis) illuminates the biogeography and drivers of insect diversification in the Indo-Pacific.

Science.gov (United States)

Matos-Maraví, Pável; Clouse, Ronald M; Sarnat, Eli M; Economo, Evan P; LaPolla, John S; Borovanska, Michaela; Rabeling, Christian; Czekanski-Moir, Jesse; Latumahina, Fransina; Wilson, Edward O; Janda, Milan

2018-06-01

The Malay Archipelago and the tropical South Pacific (hereafter the Indo-Pacific region) are considered biodiversity hotspots, yet a general understanding of the origins and diversification of species-rich groups in the region remains elusive. We aimed to test hypotheses for the evolutionary processes driving insect species diversity in the Indo-Pacific using a higher-level and comprehensive phylogenetic hypothesis for an ant clade consisting of seven genera. We estimated divergence times and reconstructed the biogeographical history of ant species in the Prenolepis genus-group (Formicidae: Formicinae: Lasiini). We used a fossil-calibrated phylogeny to infer ancestral geographical ranges utilizing a biogeographic model that includes founder-event speciation. Ancestral state reconstructions of the ants' ecological preferences, and diversification rates were estimated for selected Indo-Pacific clades. Overall, we report that faunal interchange between Asia and Australia has occurred since at least 20-25 Ma, and early dispersal to the Fijian Basin happened during the early and mid-Miocene (ca. 10-20 Ma). Differences in diversification rates across Indo-Pacific clades may be related to ecological preference breadth, which in turn may have facilitated geographical range expansions. Ancient dispersal routes suggested by our results agree with the palaeogeography of the region. For this particular group of ants, the rapid orogenesis in New Guinea and possibly subsequent ecological shifts may have promoted their rapid diversification and widespread distribution across the Indo-Pacific. Copyright © 2018 Elsevier Inc. All rights reserved.

Relative effects of disturbance on red imported fire ants and native ant species in a longleaf pine ecosystem

DEFF Research Database (Denmark)

Stuble, Katharine L.; Kirkman, L. Katherine; Carroll, C. Ronald

2011-01-01

and cases in which non-native species become established in intact (lacking extensive anthropogenic soil disturbance) communities and subsequently diminish the abundance and richness of native species is challenging on the basis of observation alone. The red imported fire ant (Solenopsis invicta......), an invasive species that occurs throughout much of the southeastern United States, is such an example. Rather than competitively displacing native species, fire ants may become established only in disturbed areas in which native species richness and abundance are already reduced. We used insecticide to reduce......, the abundance of native ants increased to levels comparable to those in control plots after 1 year. Our findings suggest that factors other than large reductions in ant abundance and species density (number of species per unit area) may affect the establishment of fire ants and that the response of native ants...

Narrowing the Gap Between QoS Metrics and Web QoE Using Above-the-fold Metrics

OpenAIRE

da Hora, Diego Neves; Asrese, Alemnew; Christophides, Vassilis; Teixeira, Renata; Rossi, Dario

2018-01-01

International audience; Page load time (PLT) is still the most common application Quality of Service (QoS) metric to estimate the Quality of Experience (QoE) of Web users. Yet, recent literature abounds with proposals for alternative metrics (e.g., Above The Fold, SpeedIndex and variants) that aim at better estimating user QoE. The main purpose of this work is thus to thoroughly investigate a mapping between established and recently proposed objective metrics and user QoE. We obtain ground tr...

Chemically armed mercenary ants protect fungus-farming societies

Science.gov (United States)

Adams, Rachelle M. M.; Liberti, Joanito; Illum, Anders A.; Jones, Tappey H.; Nash, David R.; Boomsma, Jacobus J.

2013-01-01

The ants are extraordinary in having evolved many lineages that exploit closely related ant societies as social parasites, but social parasitism by distantly related ants is rare. Here we document the interaction dynamics among a Sericomyrmex fungus-growing ant host, a permanently associated parasitic guest ant of the genus Megalomyrmex, and a raiding agro-predator of the genus Gnamptogenys. We show experimentally that the guest ants protect their host colonies against agro-predator raids using alkaloid venom that is much more potent than the biting defenses of the host ants. Relatively few guest ants are sufficient to kill raiders that invariably exterminate host nests without a cohabiting guest ant colony. We also show that the odor of guest ants discourages raider scouts from recruiting nestmates to host colonies. Our results imply that Sericomyrmex fungus-growers obtain a net benefit from their costly guest ants behaving as a functional soldier caste to meet lethal threats from agro-predator raiders. The fundamentally different life histories of the agro-predators and guest ants appear to facilitate their coexistence in a negative frequency-dependent manner. Because a guest ant colony is committed for life to a single host colony, the guests would harm their own interests by not defending the host that they continue to exploit. This conditional mutualism is analogous to chronic sickle cell anemia enhancing the resistance to malaria and to episodes in human history when mercenary city defenders offered either net benefits or imposed net costs, depending on the level of threat from invading armies. PMID:24019482

Chemically armed mercenary ants protect fungus-farming societies.

Science.gov (United States)

Adams, Rachelle M M; Liberti, Joanito; Illum, Anders A; Jones, Tappey H; Nash, David R; Boomsma, Jacobus J

2013-09-24

The ants are extraordinary in having evolved many lineages that exploit closely related ant societies as social parasites, but social parasitism by distantly related ants is rare. Here we document the interaction dynamics among a Sericomyrmex fungus-growing ant host, a permanently associated parasitic guest ant of the genus Megalomyrmex, and a raiding agro-predator of the genus Gnamptogenys. We show experimentally that the guest ants protect their host colonies against agro-predator raids using alkaloid venom that is much more potent than the biting defenses of the host ants. Relatively few guest ants are sufficient to kill raiders that invariably exterminate host nests without a cohabiting guest ant colony. We also show that the odor of guest ants discourages raider scouts from recruiting nestmates to host colonies. Our results imply that Sericomyrmex fungus-growers obtain a net benefit from their costly guest ants behaving as a functional soldier caste to meet lethal threats from agro-predator raiders. The fundamentally different life histories of the agro-predators and guest ants appear to facilitate their coexistence in a negative frequency-dependent manner. Because a guest ant colony is committed for life to a single host colony, the guests would harm their own interests by not defending the host that they continue to exploit. This conditional mutualism is analogous to chronic sickle cell anemia enhancing the resistance to malaria and to episodes in human history when mercenary city defenders offered either net benefits or imposed net costs, depending on the level of threat from invading armies.

Monoculture of leafcutter ant gardens.

Directory of Open Access Journals (Sweden)

Ulrich G Mueller

2010-09-01

Full Text Available Leafcutter ants depend on the cultivation of symbiotic Attamyces fungi for food, which are thought to be grown by the ants in single-strain, clonal monoculture throughout the hundreds to thousands of gardens within a leafcutter nest. Monoculture eliminates cultivar-cultivar competition that would select for competitive fungal traits that are detrimental to the ants, whereas polyculture of several fungi could increase nutritional diversity and disease resistance of genetically variable gardens.Using three experimental approaches, we assessed cultivar diversity within nests of Atta leafcutter ants, which are most likely among all fungus-growing ants to cultivate distinct cultivar genotypes per nest because of the nests' enormous sizes (up to 5000 gardens and extended lifespans (10-20 years. In Atta texana and in A. cephalotes, we resampled nests over a 5-year period to test for persistence of resident cultivar genotypes within each nest, and we tested for genetic differences between fungi from different nest sectors accessed through excavation. In A. texana, we also determined the number of Attamyces cells carried as a starter inoculum by a dispersing queens (minimally several thousand Attamyces cells, and we tested for genetic differences between Attamyces carried by sister queens dispersing from the same nest. Except for mutational variation arising during clonal Attamyces propagation, DNA fingerprinting revealed no evidence for fungal polyculture and no genotype turnover during the 5-year surveys.Atta leafcutter ants can achieve stable, fungal monoculture over many years. Mutational variation emerging within an Attamyces monoculture could provide genetic diversity for symbiont choice (gardening biases of the ants favoring specific mutational variants, an analog of artificial selection.

Overhead-Aware-Best-Fit (OABF) Resource Allocation Algorithm for Minimizing VM Launching Overhead

Energy Technology Data Exchange (ETDEWEB)

Wu, Hao [IIT; Garzoglio, Gabriele [Fermilab; Ren, Shangping [IIT, Chicago; Timm, Steven [Fermilab; Noh, Seo Young [KISTI, Daejeon

2014-11-11

FermiCloud is a private cloud developed in Fermi National Accelerator Laboratory to provide elastic and on-demand resources for different scientific research experiments. The design goal of the FermiCloud is to automatically allocate resources for different scientific applications so that the QoS required by these applications is met and the operational cost of the FermiCloud is minimized. Our earlier research shows that VM launching overhead has large variations. If such variations are not taken into consideration when making resource allocation decisions, it may lead to poor performance and resource waste. In this paper, we show how we may use an VM launching overhead reference model to minimize VM launching overhead. In particular, we first present a training algorithm that automatically tunes a given refer- ence model to accurately reflect FermiCloud environment. Based on the tuned reference model for virtual machine launching overhead, we develop an overhead-aware-best-fit resource allocation algorithm that decides where and when to allocate resources so that the average virtual machine launching overhead is minimized. The experimental results indicate that the developed overhead-aware-best-fit resource allocation algorithm can significantly improved the VM launching time when large number of VMs are simultaneously launched.

The distribution and diversity of insular ants

DEFF Research Database (Denmark)

Roura-Pascual, Núria; Sanders, Nate; Hui, Cang

2016-01-01

Aim: To examine the relationship between island characteristics (area, distance to the nearest continent, climate and human population size) and ant species richness, as well as the factors underlying global geographical clustering of native and exotic ant composition on islands. Location: One...... hundred and two islands from 20 island groups around the world. Methods: We used spatial linear models that consider the spatial structure of islands to examine patterns of ant species richness. We also performed modularity analyses to identify clusters of islands hosting a similar suite of species...... and constructed conditional inference trees to assess the characteristics of islands that explain the formation of these island-ant groups. Results: Island area was the best predictor of ant species richness. However, distance to the nearest continent was an important predictor of native ant species richness...

A Toolkit For Storage Qos Provisioning For Data-Intensive Applications

Directory of Open Access Journals (Sweden)

Renata Słota

2012-01-01

Full Text Available This paper describes a programming toolkit developed in the PL-Grid project, named QStorMan, which supports storage QoS provisioning for data-intensive applications in distributed environments. QStorMan exploits knowledge-oriented methods for matching storage resources to non-functional requirements, which are defined for a data-intensive application. In order to support various usage scenarios, QStorMan provides two interfaces, such as programming libraries or a web portal. The interfaces allow to define the requirements either directly in an application source code or by using an intuitive graphical interface. The first way provides finer granularity, e.g., each portion of data processed by an application can define a different set of requirements. The second method is aimed at legacy applications support, which source code can not be modified. The toolkit has been evaluated using synthetic benchmarks and the production infrastructure of PL-Grid, in particular its storage infrastructure, which utilizes the Lustre file system.

Antígona y la muerte

OpenAIRE

Pérez Alcolea, Simona Micaela

2012-01-01

La ponencia analiza la muerte de Antígona en la obra de Sófocles. Se propone que su suicidio es un acto consciente de voluntad preanunciado a lo largo de toda la obra y no una medida desesperada. Con ese fin se exploran las posibles motivaciones de Antígona para poner fin a su vida. En el análisis se proponen tres respuestas (no necesariamente excluyentes): -Antígona responde a la ética homérica. Está en lucha con Creón, y su suicidio es su golpe de gracia al poder del rey. -Antígona...

From Ant Trails to Pedestrian Dynamics

Directory of Open Access Journals (Sweden)

Andreas Schadschneider

2003-01-01

Full Text Available This paper presents a model for the simulation of pedestrian dynamics inspired by the behaviour of ants in ant trails. Ants communicate by producing a pheromone that can be smelled by other ants. In this model, pedestrians produce a virtual pheromone that influences the motion of others. In this way all interactions are strictly local, and so even large crowds can be simulated very efficiently. Nevertheless, the model is able to reproduce the collective effects observed empirically, eg the formation of lanes in counterflow. As an application, we reproduce a surprising result found in experiments of evacuation from an aircraft.

Ants defend aphids against lethal disease

Science.gov (United States)

Nielsen, Charlotte; Agrawal, Anurag A.; Hajek, Ann E.

2010-01-01

Social insects defend their own colonies and some species also protect their mutualist partners. In mutualisms with aphids, ants typically feed on honeydew produced by aphids and, in turn guard and shelter aphid colonies from insect natural enemies. Here we report that Formica podzolica ants tending milkweed aphids, Aphis asclepiadis, protect aphid colonies from lethal fungal infections caused by an obligate aphid pathogen, Pandora neoaphidis. In field experiments, bodies of fungal-killed aphids were quickly removed from ant-tended aphid colonies. Ant workers were also able to detect infective conidia on the cuticle of living aphids and responded by either removing or grooming these aphids. Our results extend the long-standing view of ants as mutualists and protectors of aphids by demonstrating focused sanitizing and quarantining behaviour that may lead to reduced disease transmission in aphid colonies. PMID:19923138

Collective search by ants in microgravity

Directory of Open Access Journals (Sweden)

Stefanie M. Countryman

2015-03-01

Full Text Available The problem of collective search is a tradeoff between searching thoroughly and covering as much area as possible. This tradeoff depends on the density of searchers. Solutions to the problem of collective search are currently of much interest in robotics and in the study of distributed algorithms, for example to design ways that without central control robots can use local information to perform search and rescue operations. Ant colonies operate without central control. Because they can perceive only local, mostly chemical and tactile cues, they must search collectively to find resources and to monitor the colony's environment. Examining how ants in diverse environments solve the problem of collective search can elucidate how evolution has led to diverse forms of collective behavior. An experiment on the International Space Station in January 2014 examined how ants (Tetramorium caespitum perform collective search in microgravity. In the ISS experiment, the ants explored a small arena in which a barrier was lowered to increase the area and thus lower ant density. In microgravity, relative to ground controls, ants explored the area less thoroughly and took more convoluted paths. It appears that the difficulty of holding on to the surface interfered with the ants’ ability to search collectively. Ants frequently lost contact with the surface, but showed a remarkable ability to regain contact with the surface.

Pericarpial nectary-visiting ants do not provide fruit protection against pre-dispersal seed predators regardless of ant species composition and resource availability.

Directory of Open Access Journals (Sweden)

Priscila Andre Sanz-Veiga

Full Text Available Extrafloral nectaries can occur in both vegetative and reproductive plant structures. In many Rubiaceae species in the Brazilian Cerrado, after corolla abscission, the floral nectary continues to secret nectar throughout fruit development originating post-floral pericarpial nectaries which commonly attract many ant species. The occurrence of such nectar secreting structures might be strategic for fruit protection against seed predators, as plants are expected to invest higher on more valuable and vulnerable parts. Here, we performed ant exclusion experiments to investigate whether the interaction with ants mediated by the pericarpial nectaries of Tocoyena formosa affects plant reproductive success by reducing the number of pre-dispersal seed predators. We also assessed whether ant protection was dependent on ant species composition and resource availability. Although most of the plants were visited by large and aggressive ant species, such as Ectatomma tuberculatum and species of the genus Camponotus, ants did not protect fruits against seed predators. Furthermore, the result of the interaction was neither related to ant species composition nor to the availability of resources. We suggest that these results may be related to the nature and behavior of the most important seed predators, like Hemicolpus abdominalis weevil which the exoskeleton toughness prevent it from being predated by most ant species. On the other hand, not explored factors, such as reward quality, local ant abundance, ant colony characteristics and/or the presence of alternative energetic sources could also account for variations in ant frequency, composition, and finally ant protective effects, highlighting the conditionality of facultative plant-ant mutualisms.

The Biochemical Toxin Arsenal from Ant Venoms

Directory of Open Access Journals (Sweden)

Axel Touchard

2016-01-01

Full Text Available Ants (Formicidae represent a taxonomically diverse group of hymenopterans with over 13,000 extant species, the majority of which inject or spray secretions from a venom gland. The evolutionary success of ants is mostly due to their unique eusociality that has permitted them to develop complex collaborative strategies, partly involving their venom secretions, to defend their nest against predators, microbial pathogens, ant competitors, and to hunt prey. Activities of ant venom include paralytic, cytolytic, haemolytic, allergenic, pro-inflammatory, insecticidal, antimicrobial, and pain-producing pharmacologic activities, while non-toxic functions include roles in chemical communication involving trail and sex pheromones, deterrents, and aggregators. While these diverse activities in ant venoms have until now been largely understudied due to the small venom yield from ants, modern analytical and venomic techniques are beginning to reveal the diversity of toxin structure and function. As such, ant venoms are distinct from other venomous animals, not only rich in linear, dimeric and disulfide-bonded peptides and bioactive proteins, but also other volatile and non-volatile compounds such as alkaloids and hydrocarbons. The present review details the unique structures and pharmacologies of known ant venom proteinaceous and alkaloidal toxins and their potential as a source of novel bioinsecticides and therapeutic agents.

The Biochemical Toxin Arsenal from Ant Venoms

Science.gov (United States)

Touchard, Axel; Aili, Samira R.; Fox, Eduardo Gonçalves Paterson; Escoubas, Pierre; Orivel, Jérôme; Nicholson, Graham M.; Dejean, Alain

2016-01-01

Ants (Formicidae) represent a taxonomically diverse group of hymenopterans with over 13,000 extant species, the majority of which inject or spray secretions from a venom gland. The evolutionary success of ants is mostly due to their unique eusociality that has permitted them to develop complex collaborative strategies, partly involving their venom secretions, to defend their nest against predators, microbial pathogens, ant competitors, and to hunt prey. Activities of ant venom include paralytic, cytolytic, haemolytic, allergenic, pro-inflammatory, insecticidal, antimicrobial, and pain-producing pharmacologic activities, while non-toxic functions include roles in chemical communication involving trail and sex pheromones, deterrents, and aggregators. While these diverse activities in ant venoms have until now been largely understudied due to the small venom yield from ants, modern analytical and venomic techniques are beginning to reveal the diversity of toxin structure and function. As such, ant venoms are distinct from other venomous animals, not only rich in linear, dimeric and disulfide-bonded peptides and bioactive proteins, but also other volatile and non-volatile compounds such as alkaloids and hydrocarbons. The present review details the unique structures and pharmacologies of known ant venom proteinaceous and alkaloidal toxins and their potential as a source of novel bioinsecticides and therapeutic agents. PMID:26805882

An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem

Science.gov (United States)

2015-01-01

solution approach that combines heuristic search and integer programming. Boudia et al. (2007) solved an SDVRP instance using a memetic algorithm with...Boudia, M., Prins, C., Reghioui, M., 2007. An effective memetic algorithm with population management for the split delivery vehicle routing problem

Aphid egg protection by ants: a novel aspect of the mutualism between the tree-feeding aphid Stomaphis hirukawai and its attendant ant Lasius productus

Science.gov (United States)

Matsuura, Kenji; Yashiro, Toshihisa

2006-10-01

Aphids often form mutualistic associations with ants, in which the aphids provide the ants with honeydew and the ants defend the aphids from predators. In this paper, we report aphid egg protection by ants as a novel aspect of the deeply interdependent relationship between a tree-feeding aphid and its attendant ant. The ant Lasius productus harbours oviparous females, males, and eggs of the hinoki cypress-feeding aphid Stomaphis hirukawai in its nests in winter. We investigated the behaviour of ants kept with aphid eggs in petri dishes to examine whether the ants recognise the aphid eggs and tend them or only provide a refuge for the aphids. Workers carried almost all of the aphid eggs into the nest within 24 h. The ants indiscriminately tended aphid eggs collected from their own colonies and those from other ant colonies. The ants cleaned the eggs and piled them up in the nest, and egg tending by ants dramatically increased aphid egg survival rates. Starving the ants showed no significant effect on aphid egg survivorship. Without ants, aphid eggs were rapidly killed by fungi. These results suggested that grooming by the ants protected the aphid eggs, at least, against pathogenic fungi. This hygienic service afforded by the ants seems indispensable for egg survival of these aphids in an environment rich in potentially pathogenic microorganisms.

Fire ants perpetually rebuild sinking towers

Science.gov (United States)

Phonekeo, Sulisay; Mlot, Nathan; Monaenkova, Daria; Hu, David L.; Tovey, Craig

2017-07-01

In the aftermath of a flood, fire ants, Solenopsis invicta, cluster into temporary encampments. The encampments can contain hundreds of thousands of ants and reach over 30 ants high. How do ants build such tall structures without being crushed? In this combined experimental and theoretical study, we investigate the shape and rate of construction of ant towers around a central support. The towers are bell shaped, consistent with towers of constant strength such as the Eiffel tower, where each element bears an equal load. However, unlike the Eiffel tower, the ant tower is built through a process of trial and error, whereby failed portions avalanche until the final shape emerges. High-speed and novel X-ray videography reveal that the tower constantly sinks and is rebuilt, reminiscent of large multicellular systems such as human skin. We combine the behavioural rules that produce rafts on water with measurements of adhesion and attachment strength to model the rate of growth of the tower. The model correctly predicts that the growth rate decreases as the support diameter increases. This work may inspire the design of synthetic swarms capable of building in vertical layers.

Ants Orase kultuurisõnum

Index Scriptorium Estoniae

2007-01-01

26. jaanuaril toimub Tallinna Ülikooli Akadeemilises Raamatukogus seminar silmapaistvast Eesti teadlasest ja tõlkijast Ants Orasest. Esinevad kirjandusteadlased Tallinna Ülikoolist, Tartu Ülikoolist ja Eesti Kirjandusmuuseumist. Avaettekandeks on sõna Oklahoma Ülikooli professoril Vincent B. Leitchil, kes oli Ants Orase viimaseks juhendatavaks doktorandiks. Seminari korraldavad Tallinna Ülikool ja Eesti Kirjandusmuuseum. Vt ka Postimees, 26, jaan., lk. 18

Ant-plant symbioses: Stalking the chuyachaqui.

Science.gov (United States)

Davidson, D W; McKey, D

1993-09-01

According to Quechua-speaking peoples, orchard-like stands ('Supay Chacras') of two Amazonian ant-plant species are cultivated by the devil, or 'Chuyachaqui'. These "devil gardens" offer extreme examples of specializations that have evolved repeatedly in ant-plant associations. Numerous investigations are beginning to disclose the identity of the Chuyachaqui - the forces behind evolutionary specialization in ant-plant symbioses. These developments have important implications for our understanding of modes of coevolution in symbiotic mutualism, remarkable convergent similarities in the form of ant-plant symbioses on different continents, and pronounced intercontinental differences in the diversity and taxonomic composition of associates. Copyright © 1993. Published by Elsevier Ltd.

An Automated End-To Multi-Agent Qos Based Architecture for Selection of Geospatial Web Services

Science.gov (United States)

Shah, M.; Verma, Y.; Nandakumar, R.

2012-07-01

Over the past decade, Service-Oriented Architecture (SOA) and Web services have gained wide popularity and acceptance from researchers and industries all over the world. SOA makes it easy to build business applications with common services, and it provides like: reduced integration expense, better asset reuse, higher business agility, and reduction of business risk. Building of framework for acquiring useful geospatial information for potential users is a crucial problem faced by the GIS domain. Geospatial Web services solve this problem. With the help of web service technology, geospatial web services can provide useful geospatial information to potential users in a better way than traditional geographic information system (GIS). A geospatial Web service is a modular application designed to enable the discovery, access, and chaining of geospatial information and services across the web that are often both computation and data-intensive that involve diverse sources of data and complex processing functions. With the proliferation of web services published over the internet, multiple web services may provide similar functionality, but with different non-functional properties. Thus, Quality of Service (QoS) offers a metric to differentiate the services and their service providers. In a quality-driven selection of web services, it is important to consider non-functional properties of the web service so as to satisfy the constraints or requirements of the end users. The main intent of this paper is to build an automated end-to-end multi-agent based solution to provide the best-fit web service to service requester based on QoS.

Impact of ecological doses of the most widespread phthalate on a terrestrial species, the ant Lasius niger.

Science.gov (United States)

Cuvillier-Hot, Virginie; Salin, Karine; Devers, Séverine; Tasiemski, Aurélie; Schaffner, Pauline; Boulay, Raphaël; Billiard, Sylvain; Lenoir, Alain

2014-05-01

Phthalates are synthetic contaminants released into the environment notably by plastic waste. Semi-volatile, they adsorb to atmospheric particles and get distributed in all ecosystems. Effects of this major anthropogenic pollution in economical species in aquatic habitats have attracted large interest. On the contrary, very few studies have focused on wild terrestrial species. Yet, these lipophilic molecules are easily trapped by insect cuticle; ants and other insects have been shown to permanently bear among their cuticular components a non-negligible proportion of phthalates, meaning that they suffer from chronic exposure to these pollutants. Oral route could also be an additional way of contamination, as phthalates tend to stick to any organic particle. We show here via a food choice experiment that Lasius niger workers can detect, and avoid feeding on, food contaminated with DEHP (DiEthyl Hexyl Phthalate), the most widespread phthalate found in nature. This suggests that the main source of contamination for ants is atmosphere and that doses measured on the cuticle correspond to the chronic exposure levels for these animals. Such an ecologically relevant dose of DEHP was used to contaminate ants in lab and to investigate their physiological impact. Over a chronic exposure (1 dose per week for 5 weeks), the egg-laying rate of queens was significantly reduced lending credence to endocrine disruptive properties of such a pollutant, as also described for aquatic invertebrates. On the contrary, short term exposure (24h) to a single dose of DEHP does not induce oxidative stress in ant workers as expected, but leads to activation of the immune system. Because of their very large distribution, their presence in virtually all terrestrial ecosystems and their representation at all trophic levels, ants could be useful indicators of contamination by phthalates, especially via monitoring the level of activation of their immune state. Copyright © 2014 Elsevier Inc. All

Pollination and facultative ant-association in the African leopard ...

African Journals Online (AJOL)

The role of extra-floral nectar appears to be recruitment of foraging ants to tend the flowers resulting in a facultative ant-association between the orchid and gregarious ants. Four different ant species were found to forage on A. africana's inflorescences. Ant-tended inflorescences suffered significantly less damage by insects.

ANT, tourism and situated globality

DEFF Research Database (Denmark)

Jóhannesson, Gunnar Thór; Ren, Carina Bregnholm; van der Duim, René

2015-01-01

viable descriptions of the collective condition of humans and more-than-humans in the Anthropocene. Also and moving past a merely descriptive approach, it discusses it as a useful tool to engage with the situated globalities which come into being through the socio-spatial coupling of tourism......In recent years Actor-network theory (ANT) has increasingly been felt in the field of tourism studies (Van der Duim, Ren, & Jóhannesson, 2012). An important implication of the meeting between ANT and tourism studies is the notion of tourism being described as a heterogeneous assemblage of what we...... are used to define as the separate spheres of nature and culture. This paper explores and relates the central tenets of ANT in tourism with regard to the concept of the Anthropocene. It presents the ANT approach as a flat and object-oriented ontology and methodology and explores its potentials to carve out...

Recurrence analysis of ant activity patterns.

Directory of Open Access Journals (Sweden)

Felipe Marcel Neves

Full Text Available In this study, we used recurrence quantification analysis (RQA and recurrence plots (RPs to compare the movement activity of individual workers of three ant species, as well as a gregarious beetle species. RQA and RPs quantify the number and duration of recurrences of a dynamical system, including a detailed quantification of signals that could be stochastic, deterministic, or both. First, we found substantial differences between the activity dynamics of beetles and ants, with the results suggesting that the beetles have quasi-periodic dynamics and the ants do not. Second, workers from different ant species varied with respect to their dynamics, presenting degrees of predictability as well as stochastic signals. Finally, differences were found among minor and major caste of the same (dimorphic ant species. Our results underscore the potential of RQA and RPs in the analysis of complex behavioral patterns, as well as in general inferences on animal behavior and other biological phenomena.

Quality of service management framework for dynamic chaining of geographic information services

Science.gov (United States)

Onchaga, Richard

2006-06-01

Dynamic chaining of geographic information services (geo-services) is gaining popularity as a new paradigm for evolving flexible geo-information systems and for providing on-demand access to geo-information. In dynamic chaining, disparate geo-services are discovered and composed at run time to yield more elaborate functionality and create value-added geo-information. Common approaches to service chaining discover and compose disparate geo-services based on the functional capability of individual geo-services. The primary concern of common approaches is thus the emergent behavior of the resulting composite geo-service. However, as geo-services become mundane and take on a greater and more strategic role in mission critical processes, deliverable quality of service (QoS) becomes an important concern. QoS concerns operational characteristics of a service that determine its utility in an application context. To address pertinent QoS requirements, a new approach to service chaining becomes necessary. In this paper we propose a QoS-aware chaining approach in which geo-services are discovered, composed and executed considering both functional and QoS requirements. We prescribe a QoS management framework that defines fundamental principles, concepts and mechanisms which can be applied to evolve an effective distributed computing platform for QoS-aware chaining of geo-services - the so-called geo-service infrastructure. The paper also defines an extensible QoS model for services delivered by dynamic compositions of geo-services. The process of orthophoto generation is used to demonstrate the applicability of the prescribed framework to service-oriented geographic information processing.

Symbiotic mutualism with a community of opportunistic ants: protection, competition, and ant occupancy of the myrmecophyte Barteria nigritana (Passifloraceae)

Science.gov (United States)

Djiéto-Lordon, Champlain; Dejean, Alain; Gibernau, Marc; Hossaert-McKey, Martine; McKey, Doyle

2004-10-01

Barteria nigritana is a myrmecophyte tree of Lower Guinea coastal vegetation. Unlike the more specialised B. fistulosa, which harbours a single host-specific mutualistic ant, B. nigritana is associated with several opportunistic ants. Such symbiotic, yet opportunistic, ant-plant associations have been little studied. On 113 clumps of B. nigritana, we censused ant associates and herbivores and compared herbivory on plants occupied by different ants. In addition to these correlative data, protection conferred by different ant species was compared by herbivore-placement experiments. Identity of ant associate changed predictably over plant ontogeny. Pheidole megacephala was restricted to very small plants; saplings were occupied by either Oecophylla longinoda or Crematogaster sp., and the latter species was the sole occupant of larger trees. Damage by caterpillars of the nymphalid butterfly Acraea zetes accounted for much of the herbivory to leaves. Ant species differed in the protection provided to hosts. While P. megacephala provided no significant protection, plants occupied by O. longinoda and Crematogaster sp. suffered less damage than did unoccupied plants or those occupied by P. megacephala. Furthermore, O. longinoda provided more effective protection than did Crematogaster sp. Herbivore-placement experiments confirmed these results. Workers of O. longinoda killed or removed all larval instars of A. zetes. Crematogaster preyed on only the two first larval instars, and P. megacephala preyed mainly on eggs, only rarely attacking the two first larval instars. Opportunistic ants provided significant protection to this relatively unspecialised myrmecophyte. The usual associate of mature trees was not the species that provided most protection.

Privacy-aware web service composition and ranking

NARCIS (Netherlands)

Costante, E.; Paci, F.; Zannone, N.

2013-01-01

Service selection is a key issue in the Future Internet, where applications are built by composing services and content offered by different service providers. Most existing service selection schemas only focus on QoS properties of services such as throughput, latency and response time, or on their

Privacy-aware web service composition and ranking

NARCIS (Netherlands)

Costante, E.; Paci, F.; Zannone, N.

2015-01-01

Service selection is a key issue in the Future Internet, where applications are built by composing services and content offered by different service providers. Most existing service selection schemas only focus on QoS properties of services such as throughput, latency and response time, or on their

Plant-ants use symbiotic fungi as a food source: new insight into the nutritional ecology of ant-plant interactions.

Science.gov (United States)

Blatrix, Rumsaïs; Djiéto-Lordon, Champlain; Mondolot, Laurence; La Fisca, Philippe; Voglmayr, Hermann; McKey, Doyle

2012-10-07

Usually studied as pairwise interactions, mutualisms often involve networks of interacting species. Numerous tropical arboreal ants are specialist inhabitants of myrmecophytes (plants bearing domatia, i.e. hollow structures specialized to host ants) and are thought to rely almost exclusively on resources derived from the host plant. Recent studies, following up on century-old reports, have shown that fungi of the ascomycete order Chaetothyriales live in symbiosis with plant-ants within domatia. We tested the hypothesis that ants use domatia-inhabiting fungi as food in three ant-plant symbioses: Petalomyrmex phylax/Leonardoxa africana, Tetraponera aethiops/Barteria fistulosa and Pseudomyrmex penetrator/Tachigali sp. Labelling domatia fungal patches in the field with either a fluorescent dye or (15)N showed that larvae ingested domatia fungi. Furthermore, when the natural fungal patch was replaced with a piece of a (15)N-labelled pure culture of either of two Chaetothyriales strains isolated from T. aethiops colonies, these fungi were also consumed. These two fungi often co-occur in the same ant colony. Interestingly, T. aethiops workers and larvae ingested preferentially one of the two strains. Our results add a new piece in the puzzle of the nutritional ecology of plant-ants.

Resource Optimization of Mobile Intelligent System with heart MPLS network

Directory of Open Access Journals (Sweden)

Mohammed Elkoutbi

2009-10-01

Full Text Available In this paper, we introduce the original Mobile Intelligent System (MIS in embeded FPGA architecture. This node will allow the construction of autonomous mobile network units which can move in unknowns, inaccessible or hostile environnement for human being, in order to collect data by various sensors and transmits them by routing to a unit of distant process. In the sake of improving the performance of transmission, we propose a global schema of QoS management using DiffServ/MPLS backbones. We provide an evaluation of several scenarios for combining QoS IP networks with MIS access network. We conclude with a study on interoperability between QoS patterns in access and backbone networks.

THE METHODS OF TRAFFIC ENGINEERING’S OPTIMIZATION IN CASE OF DATA TRANSFER BY TWO ROUTS

Directory of Open Access Journals (Sweden)

Vera Petrovna Khoborova

2018-05-01

Full Text Available To prevent congestion in certain sections of multi-service networks, data flow management, which leads to a more proportional distribution of resources and improved network functioning, is implemented. The task of selecting routes for individual data streams (traffic class, taking into account requirements of QoS, is solved by the methods of traffic engineering. With the help of these methods, it is strived to load all the network resources maximally and balanced, so that the network, with a given level of service quality, has high total capacity as much as possible. However, at the present time, there are no rigorous well-founded solutions for the problem of distributing data flows between the selected routes, taking into account the possibility of additional control over their capacity. The article proposes a method for optimizing the distribution of data flows and the bandwidth of the channels (routes used in each separate information direction, with different coordination of control actions at adjacent levels of the network architecture. We consider scientific and technical proposals for the implementation of the developed method as part of the mechanisms that implement the traffic engineering in modern multiservice networks. Purpose: increasing the efficiency of the multiservice network by optimizing the traffic engineering. Methodology in article analytical methods for solving optimization problems with a non-linear objective function and linear constraints are used. Results: analytical expressions were obtained for the optimal distribution of data flows and bandwidth of the used channels, which provides the minimum values of delay indicators, and the use of these expressions in calculations in the mechanisms of traffic engineering was suggested. Practical implications: the obtained results should be used in modern multiservice networks, which are implemented data flow management through the traffic engineering in order to improve the

Towards Using Reo for Compliance-Aware Business Process Modeling

Science.gov (United States)

Arbab, Farhad; Kokash, Natallia; Meng, Sun

Business process modeling and implementation of process supporting infrastructures are two challenging tasks that are not fully aligned. On the one hand, languages such as Business Process Modeling Notation (BPMN) exist to capture business processes at the level of domain analysis. On the other hand, programming paradigms and technologies such as Service-Oriented Computing (SOC) and web services have emerged to simplify the development of distributed web systems that underly business processes. BPMN is the most recognized language for specifying process workflows at the early design steps. However, it is rather declarative and may lead to the executable models which are incomplete or semantically erroneous. Therefore, an approach for expressing and analyzing BPMN models in a formal setting is required. In this paper we describe how BPMN diagrams can be represented by means of a semantically precise channel-based coordination language called Reo which admits formal analysis using model checking and bisimulation techniques. Moreover, since additional requirements may come from various regulatory/legislative documents, we discuss the opportunities offered by Reo and its mathematical abstractions for expressing process-related constraints such as Quality of Service (QoS) or time-aware conditions on process states.

Evaluation of Topology-Aware Broadcast Algorithms for Dragonfly Networks

Energy Technology Data Exchange (ETDEWEB)

Dorier, Matthieu; Mubarak, Misbah; Ross, Rob; Li, Jianping Kelvin; Carothers, Christopher D.; Ma, Kwan-Liu

2016-09-12

Two-tiered direct network topologies such as Dragonflies have been proposed for future post-petascale and exascale machines, since they provide a high-radix, low-diameter, fast interconnection network. Such topologies call for redesigning MPI collective communication algorithms in order to attain the best performance. Yet as increasingly more applications share a machine, it is not clear how these topology-aware algorithms will react to interference with concurrent jobs accessing the same network. In this paper, we study three topology-aware broadcast algorithms, including one designed by ourselves. We evaluate their performance through event-driven simulation for small- and large-sized broadcasts (in terms of both data size and number of processes). We study the effect of different routing mechanisms on the topology-aware collective algorithms, as well as their sensitivity to network contention with other jobs. Our results show that while topology-aware algorithms dramatically reduce link utilization, their advantage in terms of latency is more limited.

OPTIMISATION OF BUFFER SIZE FOR ENHANCING QOS OF VIDEO TRAFFIC USING CROSS LAYERED HYBRID TRANSPORT LAYER PROTOCOL APPROACH

OpenAIRE

S. Matilda; B. Palaniappan

2011-01-01

Video streaming is gaining importance, with the wide popularity of multimedia rich applications in the Internet. Video streams are delay sensitive and require seamless flow for continuous visualization. Properly designed buffers offer a solution to queuing delay. The diagonally opposite QoS metrics associated with video traffic poses an optimization problem, in the design of buffers. This paper is a continuation of our previous work [1] and deals with the design of buffers. It aims at finding...

Pheromone disruption of Argentine ant trail integrity

Science.gov (United States)

Suckling, D.M.; Peck, R.W.; Manning, L.M.; Stringer, L.D.; Cappadonna, J.; El-Sayed, A. M.

2008-01-01

Disruption of Argentine ant trail following and reduced ability to forage (measured by bait location success) was achieved after presentation of an oversupply of trail pheromone, (Z)-9-hexadecenal. Experiments tested single pheromone point sources and dispersion of a formulation in small field plots. Ant walking behavior was recorded and digitized by using video tracking, before and after presentation of trail pheromone. Ants showed changes in three parameters within seconds of treatment: (1) Ants on trails normally showed a unimodal frequency distribution of walking track angles, but this pattern disappeared after presentation of the trail pheromone; (2) ants showed initial high trail integrity on a range of untreated substrates from painted walls to wooden or concrete floors, but this was significantly reduced following presentation of a point source of pheromone; (3) the number of ants in the pheromone-treated area increased over time, as recruitment apparently exceeded departures. To test trail disruption in small outdoor plots, the trail pheromone was formulated with carnuba wax-coated quartz laboratory sand (1 g quartz sand/0.2 g wax/1 mg pheromone). The pheromone formulation, with a half-life of 30 h, was applied by rotary spreader at four rates (0, 2.5, 7.5, and 25 mg pheromone/m2) to 1- and 4-m2 plots in Volcanoes National Park, Hawaii. Ant counts at bait cards in treated plots were significantly reduced compared to controls on the day of treatment, and there was a significant reduction in ant foraging for 2 days. These results show that trail pheromone disruption of Argentine ants is possible, but a much more durable formulation is needed before nest-level impacts can be expected. ?? 2008 Springer Science+Business Media, LLC.

ANT International chemistry update and best practices

International Nuclear Information System (INIS)

Nordmann, F.; Odar, S.; Venz, H.; Kysela, J.; Ruehle, W.; Riess, R.

2010-01-01

There is an increasing number of Nuclear Power Plants (NPP) in various countries. Their chemistry practices are different due to the variety of designs and experiences while in the past the view was more monolithic. This is allowing a very rich experience that is extremely difficult to fully be aware of. ANT International is now collecting and evaluating these data as well as related R and D Information. This allows interested parties to have an easier access to the various sources of information. The chemistry experts associated to ANT International have been gathering a comprehensive detailed view of: The numerous laboratory data gained all over the world during the past decades; The extensive plant operating experiences with various types of chemistry strategies, crosschecked for various types of reactors designs and materials; An experienced international knowledge able to give the comprehensive overview that young engineers now in charge of many other activities are unable to fully cover. This paper gives the core conclusions of the detailed ANT International reports and results that have recently been gathered in the area of chemistry. It particularly covers: The primary water chemistry and its relation with radionuclides, dose rates and fuel behaviour; The secondary water chemistry focusing on its rationale selection depending on materials, design and other constraints; The start up and shutdown chemistry with it large variety of practices hardly understandable even for some experts; and, The maintenance remedies such as decontamination, steam generator cleaning and its alternate options. Various types of Reactor designs (PWR, VVER, BWR, CANDU®) are considered. The different materials, for example the impact of steam generator tubing and its evolution on the secondary water chemistry rationale or on the radioactivity built-up in the primary coolant, are described. The ways to improve the plant operation with a long term reliability as well as the most

Congestion and communication in confined ant traffic

Science.gov (United States)

Gravish, Nick; Gold, Gregory; Zangwill, Andrew; Goodisman, Michael A. D.; Goldman, Daniel I.

2014-03-01

Many social animals move and communicate within confined spaces. In subterranean fire ants Solenopsis invicta, mobility within crowded nest tunnels is important for resource and information transport. Within confined tunnels, communication and traffic flow are at odds: trafficking ants communicate through tactile interactions while stopped, yet ants that stop to communicate impose physical obstacles on the traffic. We monitor the bi-directional flow of fire ant workers in laboratory tunnels of varied diameter D. The persistence time of communicating ant aggregations, τ, increases approximately linearly with the number of participating ants, n. The sensitivity of traffic flow increases as D decreases and diverges at a minimum diameter, Dc. A cellular automata model incorporating minimal traffic features--excluded volume and communication duration--reproduces features of the experiment. From the model we identify a competition between information transfer and the need to maintain jam-free traffic flow. We show that by balancing information transfer and traffic flow demands, an optimum group strategy exists which maximizes information throughput. We acknowledge funding from NSF PoLS #0957659 and #PHY-1205878.

Selenium exposure results in reduced reproduction in an invasive ant species and altered competitive behavior for a native ant species

International Nuclear Information System (INIS)

De La Riva, Deborah G.; Trumble, John T.

2016-01-01

Competitive ability and numerical dominance are important factors contributing to the ability of invasive ant species to establish and expand their ranges in new habitats. However, few studies have investigated the impact of environmental contamination on competitive behavior in ants as a potential factor influencing dynamics between invasive and native ant species. Here we investigated the widespread contaminant selenium to investigate its potential influence on invasion by the exotic Argentine ant, Linepithema humile, through effects on reproduction and competitive behavior. For the fecundity experiment, treatments were provided to Argentine ant colonies via to sugar water solutions containing one of three concentrations of selenium (0, 5 and 10 μg Se mL −1 ) that fall within the range found in soil and plants growing in contaminated areas. Competition experiments included both the Argentine ant and the native Dorymyrmex bicolor to determine the impact of selenium exposure (0 or 15 μg Se mL −1 ) on exploitation- and interference-competition between ant species. The results of the fecundity experiment revealed that selenium negatively impacted queen survival and brood production of Argentine ants. Viability of the developing brood was also affected in that offspring reached adulthood only in colonies that were not given selenium, whereas those in treated colonies died in their larval stages. Selenium exposure did not alter direct competitive behaviors for either species, but selenium exposure contributed to an increased bait discovery time for D. bicolor. Our results suggest that environmental toxins may not only pose problems for native ant species, but may also serve as a potential obstacle for establishment among exotic species. - Highlights: • Argentine ant colonies exposed to selenium had reduced fecundity compared to unexposed colonies. • Viability of offspring was negatively impacted by selenium. • Queen survival was reduced in colonies

Improved Ant Colony Clustering Algorithm and Its Performance Study

Science.gov (United States)

Gao, Wei

2016-01-01

Clustering analysis is used in many disciplines and applications; it is an important tool that descriptively identifies homogeneous groups of objects based on attribute values. The ant colony clustering algorithm is a swarm-intelligent method used for clustering problems that is inspired by the behavior of ant colonies that cluster their corpses and sort their larvae. A new abstraction ant colony clustering algorithm using a data combination mechanism is proposed to improve the computational efficiency and accuracy of the ant colony clustering algorithm. The abstraction ant colony clustering algorithm is used to cluster benchmark problems, and its performance is compared with the ant colony clustering algorithm and other methods used in existing literature. Based on similar computational difficulties and complexities, the results show that the abstraction ant colony clustering algorithm produces results that are not only more accurate but also more efficiently determined than the ant colony clustering algorithm and the other methods. Thus, the abstraction ant colony clustering algorithm can be used for efficient multivariate data clustering. PMID:26839533

Offloading IP Flows onto Lambda-Connections

NARCIS (Netherlands)

Fioreze, Tiago; Oude Wolbers, Mattijs; van de Meent, R.; Pras, Aiko

2007-01-01

Optical networks are capable of switching IP traffic via lambda connections. In this way, big IP flows that overload the regular IP routing level may be moved to the optical level, where they get better Quality of Service (QoS). At the same time, the IP routing level is off-loaded and can serve

Current and potential ant impacts in the Pacific region

Science.gov (United States)

Loope, Lloyd L.; Krushelnycky, Paul D.

2007-01-01

Worldwide, ants are a powerful ecological force, and they appear to be dominant components of animal communities of many tropical and temperate ecosystems in terms of biomass and numbers of individuals (Bluthgen et al. 2000). For example, ants comprise up to 94% of arthropod individuals in fogging samples taken from diverse lowland tropical rainforest canopies, and 86% of the biomass (Davidson et al. 2003). The majority of these ant species and individuals obtain carbohydrates either from extrafloral nectaries or from sap-feeding Hemiptera that pass carbohydrate-rich “honeydew” to attending ants while concentrating nitrogen (N) from N-poor plant sap (Davidson et al. 2003). Honeydew and nectar represent key resources for arboreal ant species, although most ant species are at least partly carnivorous or scavengers (Bluthgen et al. 2004). In contrast to most of the terrestrial world, the biotas of many Pacific islands evolved without ants. Whereas endemic ant species are found in New Zealand (ca. 10 spp.), Tonga (ca. 10 spp.), and Samoa (ca. 12 spp.), other islands of Polynesia and parts of Micronesia likely lack native ants (Wilson and Taylor 1967, Wetterer 2002, Wetterer and Vargo 2003). About 20 Indo-Australian and western Pacific ant species range to the east and north of Samoa, but it is unclear how many of these were transported there by humans at some time (Wilson and Taylor 1967). Most of the remainder of the ant species currently found on Pacific islands are widespread species that fall in the category of “tramp species,” dispersed by recent human commerce and generally closely tied to human activity and urban areas (Wilson and Taylor 1967, McGlynn 1999). In Pacific island situations, some of these tramp ant species are able to thrive beyond areas of human activity. Relatively few ant species have been successful invaders of native communities on continents, and these include most of the species that pose the greatest problems for Pacific islands

Oecophylla smaragdina food conversion efficiency: prospects for ant farming