A. Kulaib, Raed M. Shubair, Mahmoud Al-Qutayri, J. Ng
{"title":"An overview of localization techniques for Wireless Sensor Networks","authors":"A. Kulaib, Raed M. Shubair, Mahmoud Al-Qutayri, J. Ng","doi":"10.1109/INNOVATIONS.2011.5893810","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893810","url":null,"abstract":"Localization of sensor nodes is an important aspect in Wireless Sensor Networks (WSNs). This paper presents an overview of the major localization techniques for WSNs. These techniques are classified into centralized and distributed depending on where the computational effort is carried out. The paper concentrates on the factors that need to be considered when selecting a localization technique. The advantages and limitation of various techniques are also discussed. Finally, future research directions and challenges are highlighted.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","volume":"70 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":"116252077","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":"Improved neural network-based recognition of irises with sector and block partitioning","authors":"F. Sibai","doi":"10.1109/INNOVATIONS.2011.5893819","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893819","url":null,"abstract":"High performance biometrics helps in reliably identifying persons for access authorization and other purposes. Iris recognition is very effective in identifying persons due to the iris' unique features and the protection of the iris from the environment and aging. We focus on the design and training of a feed-forward artificial neural network for high-performance iris recognition and investigate the impact of various image data partitioning techniques on the recognition accuracy of the biometric system. Several iris image data partitioning techniques are proposed and explored. Simulation results reveal that 100% recognition accuracies with sector and block data partitioning techniques can be reached, improving on our prior work results [18].","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","volume":"11 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":"126409012","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}
K. Kamel, Noor Tubaiz, Osama AlKoky, Zaher AlAghbari
{"title":"Toward forming an effective team using social network","authors":"K. Kamel, Noor Tubaiz, Osama AlKoky, Zaher AlAghbari","doi":"10.1109/INNOVATIONS.2011.5893839","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893839","url":null,"abstract":"In this paper, we propose an algorithm for selecting a team of experts from a social network, which is represented by a weighted undirected graph. Each node in the graph represents an individual who has one or more skills. Different individuals can have the same skill but they might differ in their level of expertise (e.g., novice, medium, or expert). The communication cost between two individuals (nodes) is represented by the weight of the common edge (or path). The objective is to create an effective team that can carry out a specific task. The task is represented as a set of skills with specific level of expertise for each skill. An effective solution should suggest a set of individuals (nodes) who collectively meet the level of skillfulness required and at the same time guarantee low communication cost. We implemented the proposed algorithm and ran many simulation experiments to measure the cost effectiveness of the proposed algorithm.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","volume":"28 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":"121942763","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":"The distance-to-mean broadcast method for vehicular wireless communication systems","authors":"M. Slavik, I. Mahgoub, F. Sibai","doi":"10.1109/INNOVATIONS.2011.5893852","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893852","url":null,"abstract":"Broadcast is a critical component in embedded communications systems. Some vehicular network (VANET) applications in particular use broadcast communications extensively. Statistical broadcast methods offer an efficient means of propagating broadcast messages in this context due to their low overhead and high efficiency.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","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":"115972324","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":"Distributing resource intensive mobile web services","authors":"F. Alshahwan, K. Moessner, F. Carrez","doi":"10.1109/INNOVATIONS.2011.5893861","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893861","url":null,"abstract":"One of the goals that can be achieved by providing adaptive web services from mobile hosts is to allow continuous service provisioning. However, there are limitations in terms of complexity and size of the services that may be executed on mobile hosts. In this paper, two steps are taken towards providing adaptive web services from resource limited mobile devices. The first step is to investigate mechanisms that facilitate distributing the execution of mobile web services; the main mechanisms are offloading and migration. The second step is to integrate these mechanisms with available web service architectures to produce an extended mobile web service framework. In this case we integrated them with both SOAP as well as REST. The paper describes the offloading and migration mechanisms as well as the implementation of a prototype that allows performance evaluation of both extended frameworks. To investigate the load and performance of the distributed services, the prototype implements resource intensive applications. The results presented show that basing distributed mobile-hosted services on REST is more suitable than using SOAP as underlying web service infrastructure.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","volume":"13 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":"115044204","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}
Zaib Imran, Saba Ziauddin Bhatti, Anam Tahir, M. Khan
{"title":"Self-optimizing resource management in High Throughput Computing Systems","authors":"Zaib Imran, Saba Ziauddin Bhatti, Anam Tahir, M. Khan","doi":"10.1109/INNOVATIONS.2011.5893847","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893847","url":null,"abstract":"High Throughput Computing (HTC) Systems like Condor face the challenge of delivering high throughput in face of rapidly evolving environments. The key to this lies in optimum utilization of available resources and various algorithms have been proposed to achieve this. In mathematical optimization theory, the Simplex algorithm is used to provide optimal solutions to linear programming problems while considering the system's defining constraints. Simplex algorithm has been successfully used over the years to deliver self-optimization to systems requiring maximum output. This work proposes that integrating Simplex algorithm into Condor's resource management framework can instill self-optimizing capabilities in the HTC. The results not only improve the performance with a higher throughput, but also lead to the greater user satisfaction.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","volume":"43 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":"125737982","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 new approach to emotion recognition","authors":"Majdi Dammak, M. Ben Ammar, A. Alimi","doi":"10.1109/INNOVATIONS.2011.5893798","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893798","url":null,"abstract":"In recent years, there has been a growing interest in improving all aspects of the interaction between humans and computers. It is proved that to succeed an intelligent interaction between human and machine, computer must be able to interact naturally as possible, exactly like human-human communication. Humans interact specially with speech, but he can add other way like body gestures and looks, to better display its emotions. Emotions can be expressed by visual, vocal, and other physiological means. In this paper, based on body gestures, we discuss a new intelligent approach to detect user emotion.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","volume":"30 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":"125827225","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 fault tolerant architecture for web services","authors":"Sareh Aghaei, M. Khayyambashi, M. Nematbakhsh","doi":"10.1109/INNOVATIONS.2011.5893867","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893867","url":null,"abstract":"Web services are increasingly used to integrate and build business application on the internet. Failure of web services is not acceptable in many situations such as online banking, so fault tolerance is a key challenge of web services. Web service architecture still lacks facilities to support fault tolerance. This paper proposes a fault tolerant architecture for web services by increasing the reliability and availability, the architecture is based on application-level and transport-level logging of requests and replies, N-Version and active replication techniques. The proposed architecture is client transparent and provides fault tolerance even for requests being processed at the time of server failure.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","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":"129384154","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}
Sharifa Al Khanjari, B. Arafeh, K. Day, N. Alzeidi
{"title":"An adaptive bandwidth borrowing-based Call Admission Control scheme for multi-class service wireless cellular networks","authors":"Sharifa Al Khanjari, B. Arafeh, K. Day, N. Alzeidi","doi":"10.1109/INNOVATIONS.2011.5893853","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893853","url":null,"abstract":"This work describes an adaptive Call Admission Control (CAC) scheme for multi-class service wireless cellular networks. The proposed scheme uses complete sharing approach of the available bandwidth among all traffic classes. The proposed adaptive CAC is achieved through call bandwidth borrowing and call preemption techniques based on the priorities of the traffic classes. The CAC scheme achieves the QoS in each class through mechanisms for call bandwidth degradation, and call bandwidth upgrading based on Min-Max and Max-Min policies for fair resource deallocation and allocation. The simulation results of the proposed adaptive CAC scheme show the strength and effectiveness of our proposed scheme compared to other schemes.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","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":"127520744","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}
Sofian Hamad, Hadi Noureddine, Nazar Radhi, I. Shah, H. Al-Raweshidy
{"title":"Efficient flooding based on node position for mobile ad hoc network","authors":"Sofian Hamad, Hadi Noureddine, Nazar Radhi, I. Shah, H. Al-Raweshidy","doi":"10.1109/INNOVATIONS.2011.5893809","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2011.5893809","url":null,"abstract":"Flooding is widely used by the routing protocols as the operation to propagate update packets in the network. The basic flooding is shown to cause high retransmissions, packet collisions and media congestion that can significantly degrades the network performance. Knowing the geographical position of the mobile nodes can assist the protocol to reduce the number of retransmissions, enhancing therefore, the protocol performance. In this paper, we propose an Efficient Flooding Algorithm that makes use of the nodes' position to rebroadcast the packets and efficiently disseminate the control traffic in the network. The proposed algorithm is applied on the route discovery process of Ad-hoc On Demand Distance Vector (AODV) protocol to reduce the number of propagating Route Request (RREQ) messages. The simulation results shows that our scheme reduces the routing overhead of AODV protocol by 38%.","PeriodicalId":173102,"journal":{"name":"2011 International Conference on Innovations in Information Technology","volume":"16 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":"130632457","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}