{"title":"An agent based Rumor Dissemination for routing in Wireless Sensor Networks","authors":"Leila Kheroua, S. Moussaoui, Louiza Mansour","doi":"10.1109/ISPS.2011.5898892","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898892","url":null,"abstract":"The main problem for Wireless Sensor Networks deployed in environments with no geographical localization system is the uniform distribution of information in the network. For that purpose we propose a new routing protocol based on an Efficient Rumor Dissemination called: Fast Rumor Routing. The FRA protocol optimizes the agent (respectively the query) propagation through the network preventing backward paths. The rumor succeeds to reach far regions in the network in a trajectory as straight as possible, reducing the total overhead of the network. Furthermore, for important and critique data in a real time applications, FRA with replicas (FRA_R) was implemented and tested to ensure a good delivery rate of the query in a short delays and prevent by this way the problem of path deficiency. Simulation results show that the main contributions of FRA protocol are the reduction of: time of path establishment, the overhead caused in the network and consequently the energy consumption.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124144272","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 processor virtualization to load balancing distributed state space construction","authors":"Messaoud Rahim, M. C. Boukala","doi":"10.1109/ISPS.2011.5898879","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898879","url":null,"abstract":"Most distributed model-checking algorithms use global hash functions to partition state space. This creates load imbalance between computation processors. In this paper, we focus on the use of processor virtualization for parallelizing the state space construction algorithm. Our aim is to optimize the distributed model checking process by using load balancing techniques. We study the effectiveness of Charm++ runtime system and Adaptive Message Passing Interface that support processor virtualization for load balancing the distributed state space construction. The objective is to allow the verification of large and complex systems by maintaining equally loaded processors and achieving higher speed-up. Preliminary experiments are reported to show the benefits of constructing state space using processor virtualization.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134583759","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":"IB-MAC: Improvement of the backoff algorithm for better MAC - TCP protocols interactions in MANET","authors":"Sofiane Hamrioui, M. Lalam","doi":"10.1109/ISPS.2011.5898873","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898873","url":null,"abstract":"In this paper, we will study the interactions between medium access control (MAC) and Transfer Control Protocol (TCP) protocols. These interactions will be done with some of the IETF standardised reactive (AODV, DSR) and proactive (DSDV) routing protocols under varying network conditions such as load and mobility. We will suggest an improvement to these interactions for a better MANET performance. We especially interest to the TCP performance parameters like the sending rate of the TCP packets. This improvement is the IB-MAC (backoff improvement of the MAC protocol) which proposes a new backoff algorithm based on a dynamic adaptation of its maximal limit according to the number of nodes and their mobility. Finally, we will complete our study by showing the incidences of IB-MAC on MANET performance.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116035740","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":"User to user adaptive routing based on QoE","authors":"H. Tran, A. Mellouk, S. Hoceini","doi":"10.1109/ISPS.2011.5898883","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898883","url":null,"abstract":"Service quality can be defined as “the collective effect of service performances which determine the degree of satisfaction of a user of the service” [1]. In other words, quality is the customer's perception of a delivered service. As larger varieties of services are offered to customers, the impact of network performance on the quality of service will be more complex. It is vital that service engineers identify network-performance issues that impact customer service. They also must quantify revenue lost due to service degradation. The Quality of Experience (QoE) becomes recently the most important tendency to guarantee the quality of network services. QoE represents the subjective perception of end-users using network services with network functions such as admission control, resource management, routing, traffic control, etc. In this paper, our main focus is routing mechanism driven by QoE end-users. With the purpose of avoiding the NP-complete problem and reducing the complexity problem for the future Internet, we propose two protocols based on user QoE measurement in routing paradigm to construct an adaptive and evolutionary system. Our first approach is a routing driven by terminal QoE basing on a least squares reinforcement learning technique called Least Squares Policy Iteration. The second approach, namely QQAR (QoE Q-learning based Adaptive Routing), is a improvement of the first one. QQAR basing on Q-Learning, a Reinforcement Learning algorithm, uses Pseudo Subjective Quality Assessment (PSQA), a real-time QoE assessment tool based on Random Neural Network, to evaluate QoE. Experimental results showed a significant performance against over other traditional routing protocols.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134329826","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 brief synthesis of QoS-QoE methodologies","authors":"H. Rifai, S. Mohammed, A. Mellouk","doi":"10.1109/ISPS.2011.5898880","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898880","url":null,"abstract":"This paper presents an overview of some existing techniques of Quality of Service QoS and Quality of Experience QoE. QoS stands for the quality of the network in terms of transporting data with a minimum of delay and packet loss and a maximum of bandwidth. The extremum values depend surely of the provided service. QoE defines the quality perceived by the user and is assessed at the terminal level. It can be computed through objective and subjective ways. A comparison of the two techniques as well as an improvement of the service by combining them are also addressed.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124332353","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":"Interactive free form deformer for point-based objects by GPU acceleration","authors":"A. Beddiaf, M. C. Babahenini, W. Puech","doi":"10.1109/ISPS.2011.5898885","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898885","url":null,"abstract":"The point-based representation constitutes a recent useful alternative approach for modeling enormous and large 3D polygonal models which contain usually millions of faces. However, and in order to allow the artists and the designers to work with such representation, a new mechanisms of FFD (Free Form Deformation) must be offered and that especially with an interactive response time or real time response (in the best case). This paper presents an acceleration of FFD for point-based objects and particularly splat-based with interactive response time, and that by exploiting the programmable GPU features of the modern graphics cards.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130131955","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":"2D and 3D visualization of AspectJ programs","authors":"S. Bentrad, D. Meslati","doi":"10.1109/ISPS.2011.5898888","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898888","url":null,"abstract":"This work concerns the software visualization which represents a valuable help when developing and maintaining software systems. The contribution of graphical visualization is important because it presents a program (or other artefacts) under an abstract synthetic view that gives a quick idea about the content, the logic, the structure and the entities relationships. AspectJ is one implementation of aspect-oriented paradigm applied to the Java language. As a relatively new paradigm with powerful specific constructs, it deserves new techniques and new tools to visualize programs. In this paper, we present a specific approach to visualize AspectJ programs in 2 and 3 dimensions, and a corresponding tool in the form of plug-ins for the Eclipse platform.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127220769","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":"Performance evaluation of QoS aware multipath extensions for the Dynamic MANET On-demand protocol in wireless sensor networks","authors":"Nawel Bendimerad, Bouabdellah Kechar","doi":"10.1109/ISPS.2011.5898868","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898868","url":null,"abstract":"Wireless sensor networks (WSNs) consist of densely deployed sensor nodes, which have limited computational capabilities, power supply, and communication bandwidth. How to efficiently and reliably deliver sensing data through a large field of sensors remains a research challenge. The multipath routing technique is a favourite alternative for sensor networks with objectives to achieve better energy efficiency and network robustness in case of node failures. In this paper we propose a multipath extension to Dynamic MANET On-demand (DYMO), the most recent routing protocol proposed by the MANET working group, by computing multiple node disjoint paths within a single route discovery attempt with minimal additional overhead. Our main objective is to reduce the frequency of route discovery providing resilience (fault tolerance) that is specially helpful in scenarios with node mobility in WSN and the assurance of quality of service (QoS) defined by the delay and the error rate metrics in order to improves the reliability of data communication and prolong the network lifetime. The proposed protocol called DYMO_MQ is implemented and tested in NS2 and shows significant improvements in routing overhead, end to end delay and energy consumption compared to DYMO and AODV multipath with QoS routing protocol.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125098252","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 swarm bee routing protocol for Wireless Sensor Networks","authors":"S. Bitam, A. Mellouk","doi":"10.1109/ISPS.2011.5898870","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898870","url":null,"abstract":"Research and industries are increasingly more interested to inspire by the natural phenomena in order to solve computational problems such as mobile computing and sensor networking. In this paper we propose a new quality of service multipath routing protocol for Wireless Sensor Networks (WSNs) called QoSBeeWSN. It is inspired by the bees' communication in their food source searching behavior. This protocol is simulated on NS2 and compared against AODV and DSR as conventional routing protocols applied to the WSNs. QoSBeeWSN effectiveness and performance are demonstrated after comparisons in terms of quality of service metrics such as average end-to-end delay, average bandwidth, and normalized overhead load. Simulation results have shown that the proposed protocol reduced the average end-to-end delay and improved the average bandwidth. Moreover, QoSBeeWSN outperformed AODV in normalized overhead load and was close to that of DSR.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134279521","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":"Application of the structural analysis on a three axis manipulator robot","authors":"Yasmine Derdour, H. Haffaf, Kheireddine Bouazza","doi":"10.1109/ISPS.2011.5898890","DOIUrl":"https://doi.org/10.1109/ISPS.2011.5898890","url":null,"abstract":"This paper presents a three axis manipulator robot on which we apply the structural analysis for fault diagnosis purpose. Structural analysis offers the opportunity to transform an analytical model into a structural model, so we can describe it using an incidence matrix which represents all components of the system. From the structural graph obtained, we apply the matching algorithm to extract analytical redundancy relations gathered in a signature failures table. From this description, the aim of the method is to identifying the main variables which are influential and dependent to the evolution of the system. Also, this analysis allows to check the “detectability” and “localizability” properties.","PeriodicalId":305060,"journal":{"name":"2011 10th International Symposium on Programming and Systems","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124180879","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}