Netw. Protoc. Algorithms最新文献

{"title":"Adherence to a treatment of cranial deformities with a sensorised brace device","authors":"T. Arcas, J. L. Rubio, Jesus Alcober i Segura, Guillem Tarín, L. Rosas, Julio Garcia","doi":"10.5296/npa.v8i1.8732","DOIUrl":"https://doi.org/10.5296/npa.v8i1.8732","url":null,"abstract":"A disease that affects newborn children causes cranial deformities and the (surgical) treatment possibilities are limited until the children are old enough to not put their life in risk. This work describes an experience based on biomedical and telematics engineering discipline combination, which allows defining a treatment procedure for children between 4 and 18 months old to the diagnosis, helmet design, manufacturing and tracking in a way of registering the adherence during the whole treatment.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115524242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Using OpenFlow to control redundant paths in wireless networks","authors":"Elias Molina, E. Jacob, A. Astarloa","doi":"10.5296/npa.v8i1.8730","DOIUrl":"https://doi.org/10.5296/npa.v8i1.8730","url":null,"abstract":"The deployment of wireless networks in critical industrial environments must ensure the availability of monitoring and control applications, for which it is essential to exploit redundancy techniques. In order to reduce to zero the failover time, in this paper, the Parallel Redundancy Protocol (PRP) is used in Wireless Local Area Networks (WLAN) which are implemented under the Software-Defined Networking (SDN) paradigm. It is discussed how the OpenFlow protocol allows an external controller to configure redundant paths between dual-homed devices. As a result, critical services can be protected in interference and mobility situations. The improvement in availability has been obtained by using both emulation and simulation.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126337484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Placement of Wavelength Converters in Dynamically Routed All Optical Networks in presence of Tunable Transceivers","authors":"S. S. Patil, B. Chaudhari","doi":"10.5296/npa.v7i4.8567","DOIUrl":"https://doi.org/10.5296/npa.v7i4.8567","url":null,"abstract":"Efficient routing with optimal resources is one of the challenging tasks in the design of DWDM networks. Wavelength Converter (WC) is an important resource, as the placement of WCs affects the network performance and the quantity of WCs affects the cost of the network. With the help of WCs the network performance can be maximized by removing the wavelength continuity constraint. As WCs are very expensive, selecting the candidate nodes for the placement of WCs in a network is important. In this paper we have proposed an optimized approach for the placement of WCs in the presence of tunable transceivers (TTRs) and fixed transceivers (FTRs). The performance analysis has been carried out for above approaches. Observation shows that sparse partial wavelength converters with various loads requires only 2.4% converters. When tunable transceivers are used an average reduction of 73% in blocking probability and average saving of 91% in required number of converters.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127658728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Ad hoc Network for Emergency Rescue System based on Unmanned Aerial Vehicles","authors":"Carlos Cambra Baseca, S. Sendra, Jaime Lloret, L. Parra","doi":"10.5296/npa.v7i4.8816","DOIUrl":"https://doi.org/10.5296/npa.v7i4.8816","url":null,"abstract":"Intelligent Unmanned Aerial Vehicles (UAVs) on emergency rescue is widely used to detect injured mountaineers in inaccessible areas. These systems should satisfied several features. On the one hand, it is important to know the georeference of the injured mountaineers. It is also important to have real-time images of the situation and the area where people have been hilly. For this reasons, in this paper, we present the development of a UAV integrated within a wireless ad hoc network and a communication protocol able to transfer between several UAV’s and Smartphones working with Android OS. This paper also shows how to extend the concept of ad hoc network on Smartphones to extend wireless coverage for emergency situations in critical areas without GSM cellular coverage. After developing our system, we have focused our effort on demonstrating the correct operation of our UAV and its network performance when the system is used to track within a zone. Experimental results show the big potential of this kind of networks working on hostile terrain such as big mountains, ravines and river canyons without GSM signal communication.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122222328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Study of Multimedia Delivery over Software Defined Networks","authors":"J. M. Jiménez, Óscar Romero, A. Rego, Avinash Dilendra, Jaime Lloret","doi":"10.5296/npa.v7i4.8794","DOIUrl":"https://doi.org/10.5296/npa.v7i4.8794","url":null,"abstract":"Software Defined Networks (SDN) have become a new way to make dynamic topologies. They have great potential in both the creation and development of new network protocols and the inclusion of distributed artificial intelligence in the network. There are few emulators, like Mininet, that allow emulating a SDN in a single personal computer, but there is lack of works showing its performance and how it performs compared with real cases. This paper shows a performance comparison between Mininet and a real network when multimedia streams are being delivered. We are going to compare them in terms of consumed bandwidth (throughput), delay and jitter. Our study shows that there are some important differences when these parameters are compared. We hope that this research will be the basis to show the difference with real deployments when Mininet is used.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130151652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"QoS-aware Routing in Multi-rate Ad hoc Networks Based on Ant Colony Optimization","authors":"A. Al-Ani, J. Seitz","doi":"10.5296/npa.v7i4.8513","DOIUrl":"https://doi.org/10.5296/npa.v7i4.8513","url":null,"abstract":"QoS-aware routing in mobile ad hoc networks (MANETs) is a major challenge due to node mobility and scarcity of resources. QoS-aware routing based on ant colony optimization (ACO) algorithms is a promising approach to overcome these problems. However, as compared to MANETs, vehicular ad hoc networks (VANETs) face additional challenges due to rapid topology change, making the estimation or prediction of QoS parameters difficult or stale. VANETs require time-critical message delivery, as late delivery may result in endangering lives. Currently existing routing protocols usually require the exchange of additional control message between neighbor nodes to compute QoS parameters. This makes the routing protocol too slow to react to fast topology change and also does not consider network congestion when forwarding a data packet. To reduce the overhead introduced to collect information from neighbor nodes and to obtain an accurate estimate of QoS parameters, we use the simple network management protocol to estimate these values locally. This paper describes a new approach for calculating QoS parameter locally and avoiding congestion during data transmission. The simulations are implemented using the network simulator ns-3, and the results show that our approach is scalable and performs well in high mobility.  QoS-aware routing in mobile ad hoc networks (MANETs) is a major challenge due to node mobility and scarcity of resources. QoS-aware routing based on ant colony optimization (ACO) algorithms is a promising approach to overcome these problems. However, as compared to MANETs, vehicular ad hoc networks (VANETs) face additional challenges due to rapid topology change, making the estimation or prediction of QoS parameters difficult or stale. VANETs require time-critical message delivery, as late delivery may result in endangering lives. Currently existing routing protocols usually require the exchange of additional control message between neighbor nodes to compute QoS parameters. This makes the routing protocol too slow to react to fast topology change and also does not consider network congestion when forwarding a data packet. To reduce the overhead introduced to collect information from neighbor nodes and to obtain an accurate estimate of QoS parameters, we use the simple network management protocol to estimate these values locally. This paper describes a new approach for calculating QoS parameter locally and avoiding congestion during data transmission. The simulations are implemented using the network simulator ns-3, and the results show that our approach is scalable and performs well in high mobility.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131593113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Design and Evaluation of Modified Adaptive Block Normalized Algorithm for Acoustic Echo Cancellation in Hands-Free Communications","authors":"Azeddine Wahbi, A. Roukhe, L. Hlou","doi":"10.5296/npa.v7i4.8159","DOIUrl":"https://doi.org/10.5296/npa.v7i4.8159","url":null,"abstract":"The aim of this paper is to design and simulate an AEC in order to enhance the quality of speech disturbed by echo phenomenon. Therefore, in order to design the normalized adaptive AEC, we have used digital signal processing techniques, especially Simulink embedded functions. Effectiveness of the suggested AEC using adaptive normalized algorithm was verified using Matlab/Simulink software. Finally, our AEC has been tested by using ERLE criteria and the analysis results show more efficiency according to ITU-T recommendation G.168.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127736117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improving Throughput in SCTP via Dynamic Optimization of Retransmission Bounds","authors":"S. McClellan, W. Peng, Eduardo Gonzalez","doi":"10.5296/npa.v7i3.8228","DOIUrl":"https://doi.org/10.5296/npa.v7i3.8228","url":null,"abstract":"The Stream Control Transmission Proto- col (SCTP) is a relatively new transport protocol. It has several underlying mechanisms that are similar to the Transmission Control Protocol (TCP), as well as several improvements that are important in certain classes of applications. The timeout scheme of SCTP, however, is almost identical to that used in TCP. With the dynamics of today’s Internet, that timeout scheme may be too passive. This paper presents an al- gorithm which dynamically adjusts the overall context of the retransmission timeout process without chang- ing the fundamental retransmission mechanisms. This approach manages the impact of fast retransmissions and timeouts to significantly improve the throughput of SCTP applications. The algorithm has been im- plemented and tested in real network environments. Experimental results show that the algorithm avoids spurious retransmissions and provides better through- put by intelligently managing RTO boundaries and allowing conventional timeout schemes to participate more actively in the retransmission process.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121238153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Channel Aware Scheduling Algorithm for LTE Uplink and Downlink","authors":"A. Kanagasabai, A. Nayak","doi":"10.5296/npa.v7i3.8229","DOIUrl":"https://doi.org/10.5296/npa.v7i3.8229","url":null,"abstract":"In the past two decades, there has been a drastic increase in the mobile traffic, which is caused by the improved user experience with smart phones and its applications. In LTE system, the packet scheduler plays a vital role in the effective utilization of the resources. This field is not standardized and has immense scope of improvement, allowing vendor-specific implementation. LTE scheduling can be categorized into two extremes, namely, Opportunistic scheduling and Fairness scheduling. The Best Channel Quality Indicator (BCQI) algorithm falls under the former category while Proportional Fairness (PF) algorithm under the later. BCQI algorithm provides high system throughput than PF algorithm, however, unlike BCQI algorithm, PF algorithm considers users with poor channel condition for allocation process. In this work, a new scheduling algorithm called as Opportunistic Dual Metric (ODM) Scheduling Algorithm is proposed for LTE uplink and downlink. The objective of the algorithm is to prioritize the users with good channel condition for resource allocation, at the same time not to starve the users with poor channel conditions. The proposed algorithm has two resource allocation matrices, one being throughput-centric and the other being is fairness-centric. The uplink algorithm uses the two resource allocation matrices to allocate the resources to the users and to ensure contiguous resource allocation. The downlink algorithm is an extension of the proposed uplink algorithm avoiding uplink constraints. The downlink algorithm employs the two resource distribution matrices to provide an efficient resource allocation by expanding the allocation for the users considering intermittent resources. The performance of ODM is measured in terms of throughput, fairness. Additionally, the uplink algorithm is analyzed in terms of transmit power. From the results it is observed that the proposed algorithm has better trade-off in terms of all the performance parameters than PF scheduler and BCQI scheduler.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128189188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based Data Gathering Trees for Wireless Sensor Networks","authors":"N. Meghanathan","doi":"10.5296/npa.v7i3.7961","DOIUrl":"https://doi.org/10.5296/npa.v7i3.7961","url":null,"abstract":"We propose a generic algorithm to determine maximum bottleneck node weight-based data gathering (MaxBNW-DG) trees for wireless sensor networks (WSNs) and compare the performance of the MaxBNW-DG trees with those of maximum and minimum link weight-based data gathering trees (MaxLW-DG and MinLW-DG trees). Assuming each node in a WSN graph has a weight, the bottleneck weight for the path from a node u to the root node of the DG tree is the minimum of the node weights on the path (inclusive of the weights of the end nodes). The MaxBNW-DG tree algorithm determines a DG tree such that each node has a path of the largest bottleneck weight to the root node. We observe the MaxBNW-DG trees to incur lower height, larger percentage of nodes as leaf nodes and a larger weight per intermediate node compared to the leaf node; the tradeoff being a larger a network-wide data aggregation delay due to larger number of child nodes per intermediate node. The MaxBNW-DG algorithm could be used to determine DG trees with larger trust score, larger energy (and other such criterion for node weight) per intermediate node compared to the leaf node.","PeriodicalId":190994,"journal":{"name":"Netw. Protoc. Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131545179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}