Sayed Chhattan Shah, A. Bashir, S. H. Chauhdary, Cheng Jiehui, Myong-Soon Park
{"title":"Mobile Ad Hoc Computational Grid for Low Constraint Devices","authors":"Sayed Chhattan Shah, A. Bashir, S. H. Chauhdary, Cheng Jiehui, Myong-Soon Park","doi":"10.1109/ICFCC.2009.115","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.115","url":null,"abstract":"We are not far from the time when environments will be smart and intelligent having capability to compute and communicate with other environments and artifacts. These environments and everyday objects will be equipped with small, inexpensive, and low power devices having capability to communicate with each other in order to organize and coordinate their actions. Computation will be freely available everywhere allowing us to perform tasks anywhere at anytime. The individuals will be equipped with lightweight devices instead of heavy devices that condense the effectiveness of individual. Furthermore, there is increasing trend towards anytime, anywhere computing paradigm that allow user to work at home, while traveling or at any location. Due to this increasing trend and availability of hundreds of low constrained devices, it will be possible for individuals to form a mobile ad hoc computational grid by integrating piecemeal devices into a single, unified computing resource that could achieve the desired result. The purpose of study is to propose architecture for mobile ad hoc computational grid for low constraint devices in order to perform high processing tasks.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128574377","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 Dynamic Resource Allocation Optimization for SMT Processors","authors":"Hongzhou Chen, Ling-di Ping, Kuijun Lu, Xiaoning Jiang","doi":"10.1109/ICFCC.2009.47","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.47","url":null,"abstract":"The threads on simultaneous multithreading (SMT) processors compete for the common resources rather than share them, and meanwhile they take on changing program phases. It is a challenge to meet the changing resource requirements of the threads by making resource allocation according to limited pipeline information. To avoid the stagnation of resource allocation optimization in the local suboptimal resource distributions and perform quick capture on the new optimal resource distributions, this paper proposes a dynamic resource allocation optimization (DRAO) for SMT processors, which optimizes the resource allocation targeting only the throughput performance. An optimization model with consideration of both throughput and fairness performance is designed for DRAO to steer the exploitation on historical allocation and the exploration on new allocation solutions. Results from experiment show that DRAO obtains potential improvement of fairness performance as well as good improvement of throughput performance. These are attributed to the well-balanced exploitation and exploration activities.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128835011","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":"Preliminary Study of Heuristic Approach for WDM/OCDMA Switch in Future Network","authors":"G. Ii, K. Dimyati","doi":"10.1109/ICFCC.2009.124","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.124","url":null,"abstract":"This paper aims to study the design issues of a future switch and to identify the bottlenecks of the state-of-the-art technology to support the future traffic and service demand. The future switch should perform high speed switching, eliminate the implementation of buffers, transparent packet format and allows multiple user access. Thus, the development of a heuristic approach that handles multi protocol label swapping (MPLS) and supports all optical label swapping (AOLS) routing protocols via the implementation of optical code division multiple access (OCDMA) datagram is necessary. Consequently, to prepare for contention conditions, WDM can be integrated with OCDMA that offers more channels and network capacity. It harnesses enormous bandwidth by coupling multiple wavelengths into a single fiber. This should reduce the probability of packet loss due to contention. Furthermore, the orthogonal code and label swapping enhance the network throughput. Also, this paper investigates the possibility of the realization of WDM/OCDMA and the simulation results from the preliminary study are compared with the conventional approaches. Relatively, the work is aimed to characterize all components making up the router/switch that consists of the multiplexer, demultiplexer, encoder and decoder. Several relevant issues and the limitations are discussed by considering the features and requirements aforementioned.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114777535","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}
P. Samundiswary, P. Priyadarshini, Perumal Dananjayan
{"title":"Performance Evaluation of Heterogeneous Sensor Networks","authors":"P. Samundiswary, P. Priyadarshini, Perumal Dananjayan","doi":"10.1109/ICFCC.2009.119","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.119","url":null,"abstract":"Wireless sensor networks are battery-powered ad-hoc networks in which sensor nodes are scattered over a region. These nodes connect to each other and form multi-hop networks. These networks are used for various applications such as habitat monitoring, automation, and agriculture. Almost all the existing sensor networks focus on homogenous sensor networks. Homogenous sensor networks are identical sensors with equal capacity in term of sensing, computation, communication and power. But homogeneous sensor networks have poor performance in terms of energy consumption and end-to-end delay. It is also difficult to work with more than one type of sensors within a same network. So it is required to analyse the heterogeneous sensor networks (HSN) model for better performance. Simulation results prove that heterogeneous sensor networks outperform the homogeneous sensor networks in terms of energy consumption, end-to-end delay and delivery ratio with different node capability.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131281563","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":"IMS Network Architecture","authors":"M. Qadeer, A. H. Khan, J. Ansari, Sariya Waheed","doi":"10.1109/ICFCC.2009.106","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.106","url":null,"abstract":"There is a rapid growth and evolution in the area of telecommunications and network operators are expected to provide seamless integration of all communication applications on a single system. In these circumstances IMS has emerged out as a key player. IMS is basically a network architecture consisting of an IP-based core network connected to multiple access networks to provide a converged service to wireless,wireline and cable subscribers. IMS has established itself as a foundation for future wireless and wireline convergence. It provides an opportunity to build an open IP based service platform that will enable an easy and efficient deployment of new multimedia communication services mixing telecom and data services. One thing which really makes a difference is that a common IMS based service platform can be used to serve various access mechanisms such as WiMAX, WiFi, UMTS,GSM, CDMA etc. IMS fills the gap between two of the most successful communication paradigm cellular and internet technology. This paper surveys the IMS network architecture and how its various components interact with each other.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114516735","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":"Synthetic Evolution for Wheeled Robot Cognition in RF-Localization Behavior","authors":"C. K. On, J. Teo, A. Saudi","doi":"10.1109/ICFCC.2009.102","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.102","url":null,"abstract":"This paper discussed the utilization of a multi-objective approach for evolving artificial neural networks (ANNs) that act as a controller for radio frequency (RF)-localization behavior of a virtual Khepera robot simulated in a 3D, physics-based environment. The Pareto-frontier Differential Evolution (PDE) algorithm is used to generate the Pareto optimal sets of ANNs that optimize the conflicting objectives of maximizing the virtual Khepera robot’s behavior for homing towards a RF signal source and minimizing the number of hidden neurons used in its feed-forward ANNs controller. A fitness function used for mobile robot RF-localization behavior is proposed. The experimentation results showed the virtual Khepera robot was able to navigate towards signal source with using only a small number of hidden neurons. Furthermore, the Pareto-frontier solutions have been utilized for robustness testing purposes in the environment differs as that used during evolution. The results showed the PDE-EMO algorithm can be practically used in generating the required robot controllers for RF-localization behavior.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127853378","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 Genetic Algorithm for a Mobile Robot Path Planning","authors":"A. Ghorbani, S. Shiry, A. Nodehi","doi":"10.1109/ICFCC.2009.28","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.28","url":null,"abstract":"Mobile robot global path planning in a static environment is an important problem. This paper proposes a method of global path planning based on genetic algorithm to reach an optimum path for mobile robot with obstacle avoidance. In this method for decreasing the complexity, the two-dimensional coding for the path via-points was converted to one-dimensional coding and the fitness of both of the collision avoidance path and the shortest distance are integrated into a fitness function. The simulation results shows that the proposed method is accurate and effective.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133545797","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":"System of Facial Detection and Location Based on Integrated Technology","authors":"Ju-hui Wang","doi":"10.1109/ICFCC.2009.27","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.27","url":null,"abstract":"In studying digital image, face is the most important object, and the technology of facial detection is the important issues in the field of computer vision and pattern recognition.This paper comes true a complete facial detection and location system. In this paper,firstly it uses “reference white” to realize light compensation; Then it realizes the detection of candidate face using skin color , in the process of detection it is considered the influence of brightness of the hair color for skin detection;The third, the paper uses the facial features of the structure for further screening, such as shape filtering and eye’s judge; Finally it realizes facial location(eyes, eyebrows and mouth) using projection and facial proportion based on gray_level and geometry characteristic of facial image. The system uses Visual C + + to achieve and is verified in a self-designed photo library from lab, and is particularly suitable for affixed background and the face is the larger proportion of the image","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131380939","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":"Stereo Vision Tracking System","authors":"Lee Chong Wan, P. Sebastian, Yap Vooi Voon","doi":"10.1109/ICFCC.2009.113","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.113","url":null,"abstract":"Target tracking has become an area of interest in recent years. Target tracking is able to widen the perspective and view of the static camera to track a target, providing basic artificial intelligence features for robots, and serve as the platform for surveillance purpose. A tracking system is limited to a monocular vision which limits much of the information that is available in an image compared to a binocular or stereo vision. Among the advantages of stereo vision is 3D modeling of scene and depth estimation. In this work, an initial development study and implementation of stereo vision tracking system was done. In developing the stereo vision tracking system, a tracking algorithm was developed together with a depth estimation method to take advantage of the images obtained from having images from two cameras. The depth estimation was found to be 80% accurate for objects at a distance of 15 cm to 65 cm from the cameras.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134052266","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":"How Bad TCP Suffers from Packet Losses and Delays over Wireless Ad Hoc Network","authors":"M. Oo, Mazliza Othman","doi":"10.1109/ICFCC.2009.51","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.51","url":null,"abstract":"The increasing popularity of wireless networks indicates that wireless links will play an important role in future inter-networks. Among the wireless networks, wireless ad hoc networks have been popular because they are very easy to implement without using base stations. Transmission Control Protocol (TCP) and routing protocols (DSR, DSDV, AODV, etc) as well as link layer protocols are becoming as an essential part of communication between two or more communication hosts. In theory, transport protocols should be independent of the technology of the underlying network layer. However, in practice, TCP, as a standard transport protocol for Internet, is tuned for wired network and performs poorly in wireless networks. Therefore, many researchers invented the different variants of TCP over wired and wireless network. In this paper, we analyze how the variants of TCP suffer from packet losses and average end-to-end delay over each routing protocol, and measure the throughput of received packets in static and mobile ad hoc environments.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"333 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131474880","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}