View All Items

Title: An uncertainty-aware reputation system in mobile networks: analysis and applications.
Creator: Li, Feng., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Many emerging mobile networks aim to provide wireless network services without relying on any infrastructure. The main challenge in these networks comes from their self-organized and distributed nature. There is an inherent reliance on collaboration among the participants in order to achieve the aimed functionalities. Therefore, establishing and quantifying trust, which is the driving force for collaboration, is important for applications in mobile networks. This dissertation focuses on...
Show moreMany emerging mobile networks aim to provide wireless network services without relying on any infrastructure. The main challenge in these networks comes from their self-organized and distributed nature. There is an inherent reliance on collaboration among the participants in order to achieve the aimed functionalities. Therefore, establishing and quantifying trust, which is the driving force for collaboration, is important for applications in mobile networks. This dissertation focuses on evaluating and quantifying trust to stimulate collaboration in mobile networks, introducing uncertainty concepts and metrics, as well as providing the various analysis and applications of uncertainty-aware reputation systems. Many existing reputation systems sharply divide the trust value into right or wrong, thus ignoring another core dimension of trust: uncertainty. As uncertainty deeply impacts a node's anticipation of others' behavior and decisions during interaction, we include it in the reputation system. Specifically, we use an uncertainty metric to directly reflect a node's confidence in the sufficiency of its past experience, and study how the collection of trust information may affect uncertainty in nodes' opinions. Higher uncertainty leads to higher transaction cost and reduced acceptance of communication. We exploit mobility to efficiently reduce uncertainty and to speed up trust convergence. We also apply the new reputation system to enhance the analysis of the interactions among mobile nodes, and present three sample uncertainty-aware applications. We integrate the uncertainty-aware reputation model with game theory tools, and enhance the analysis on interactions among mobile nodes., Instead of reactively protecting the mobile networks from existing attacks as in the traditional security paradigms, the analysis in this dissertation gives more insights on nodes' rationality in the interaction, which will enable the mechanism design in mobile networks to be security and incentive compatible. Moreover, we present three sample applications, in which we clearly identify the challenges, specifically formalize the problems, and cleverly employ the uncertainty mitigation schemes. These applications show that the uncertainty definition and mitigation schemes can benefit a broad range of applications, including fields such as security, network services, and routing.
Show less
Date Issued: 2009
PURL: http://purl.flvc.org/FAU/210520
Subject Headings: Wireless communication systems, Security measures, Wireless communication systems, Technological innovations, Computer network architectures, Mobile computing, Ad hoc networks (Computer networks), Security measures
Format: Document (PDF)

Title: A study on Bluetooth and mobile IP/CDPD technologies: Performance considerations and EMI/RFI implications.
Creator: Sivaraks, Jesada., Florida Atlantic University, Neelakanta, Perambur S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: What have been envisaged and focused in the research as deliberated in this dissertation, refer to certain state-of-the-art perspectives of modern wireless telecommunications. Specifically, the objectives and scope of the research efforts carried out include systematic analyses of two major wireless technologies, namely, the Bluetooth(TM) and the CDPD system. The relevant tasks undertaken refer to analytical modeling, experimental studies and simulations pertinent to the performance...
Show moreWhat have been envisaged and focused in the research as deliberated in this dissertation, refer to certain state-of-the-art perspectives of modern wireless telecommunications. Specifically, the objectives and scope of the research efforts carried out include systematic analyses of two major wireless technologies, namely, the Bluetooth(TM) and the CDPD system. The relevant tasks undertaken refer to analytical modeling, experimental studies and simulations pertinent to the performance considerations of the test systems subjected to EMI/RFI influences. The following can be enumerated as the specific research endeavors pursued and completed: (1) Identification of performance implications in the Bluetooth(TM) and CDPD wireless transmissions subjected to EMI/RFI ambients. (2) A comprehensive presentation on the system description, performance requirements, protocol issues and operational environments of the two wireless technologies under study. (3) Development of analytically tractable models, which describe the extent of EMI/RFI on the Bluetooth(TM) operations and provide expressions to compute the transmission impairments involved in terms of the associated packet losses. (4) Modeling of CDPD performance and deducing the statistics of data packets seizing the free AMPS channels. The associated results offer compatible simulations to deduce the data packet blocking probability. The enhancement of such blocking caused by any impulse-like noise invading the system is also modeled. (5) Proposals for methods towards EMI solutions through adopting novel shielding in the wireless systems. The aforesaid efforts are comprehensively addressed supplemented with appropriate background details and literature survey. In conclusion, the scope of the present study is discussed and possible open-questions for future study are identified.
Show less
Date Issued: 2001
PURL: http://purl.flvc.org/fcla/dt/11946
Subject Headings: Bluetooth technology, Mobile computing, CDPD (Standard), Electromagnetic interference
Format: Document (PDF)

Title: Secure routing in wireless sensor networks.
Creator: Ibriq, Jamil, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This research addresses communication security in the highly constrained wireless sensor environment. The goal of the research is twofold: (1) to develop a key management scheme that provides these constrained systems with the basic security requirements and evaluate its effectiveness in terms of scalability, efficiency, resiliency, connectivity, and flexibility, and (2) to implement this scheme on an appropriate routing platform and measure its efficiency., The proposed key management scheme...
Show moreThis research addresses communication security in the highly constrained wireless sensor environment. The goal of the research is twofold: (1) to develop a key management scheme that provides these constrained systems with the basic security requirements and evaluate its effectiveness in terms of scalability, efficiency, resiliency, connectivity, and flexibility, and (2) to implement this scheme on an appropriate routing platform and measure its efficiency., The proposed key management scheme is called Hierarchical Key Establishment Scheme (HIKES). In HIKES, the base station, acting as the central trust authority, empowers randomly selected sensors to act as local trust authorities, authenticating on its behalf the cluster members and issuing to them all secret keys necessary to secure their communications. HIKES uses a novel key escrow scheme that enables any sensor node selected as a cluster head to generate all the cryptographic keys needed to authenticate other sensors within its cluster. This scheme localizes secret key issuance and reduces the communication cost with the base station. The key escrow scheme also provides the HIKES with as large an addressing mechanism as needed. HIKES also provides a one-step broadcast authentication mechanism. HIKES provides entity authentication to every sensor in the network and is robust against most known attacks. We propose a hierarchical routing mechanism called Secure Hierarchical Energy-Efficient Routing protocol (SHEER). SHEER implements HIKES, which provides the communication security from the inception of the network. SHEER uses a probabilistic broadcast mechanism and a three-level hierarchical clustering architecture to improve the network energy performance and increase its lifetime., Simulation results have shown that HIKES provides an energy-efficient and scalable solution to the key management problem. Cost analysis shows that HIKES is computationally efficient and has low storage requirement. Furthermore, high degree of address flexibility can be achieved in HIKES. Therefore, this scheme meets the desired criteria set forth in this work. Simulation studies also show that SHEER is more energy-efficient and has better scalability than the secure version of LEACH using HIKES.
Show less
Date Issued: 2007
PURL: http://purl.flvc.org/FAU/42771
Subject Headings: Sensor networks, Security measures, Ad hoc networks (Computer networks), Security measures, Wireless communication systems, Security measures, Wireless communication systems, Technological innovations, Mobile computing
Format: Document (PDF)

Title: Routing in mobile ad-hoc wireless networks.
Creator: Li, Hailan., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks are lack of wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in small connected dominating set subnetwork. We propose a simple and...
Show moreThis thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks are lack of wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in small connected dominating set subnetwork. We propose a simple and efficient distributed algorithm for calculating connected dominating set in a given un-directed ad hoc network, then evaluate the proposed algorithm through simulation. We also discuss connected dominating set update/recalculation algorithms when the topology of the ad hoc network changes. We also explore the possible extension of using hierarchical connected dominating set. The shortest path routing and the dynamic source routing, which are based on the connected dominating set subnetwork, are discussed.
Show less
Date Issued: 1999
PURL: http://purl.flvc.org/fcla/dt/15695
Subject Headings: Mobile computing, Computer algorithms, Computer networks
Format: Document (PDF)

Title: Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets.
Creator: Wu, Bing., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In mobile ad hoc wireless networks (MANET), due to host mobility, broadcasting is expected to be frequently used to find a route to a particular host, to page a host, and to alarm all hosts. A straightforward broadcasting by flooding is usually very costly and results in substantial redundancy and more energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected dominating set (CDS) is a promising approach, where...
Show moreIn mobile ad hoc wireless networks (MANET), due to host mobility, broadcasting is expected to be frequently used to find a route to a particular host, to page a host, and to alarm all hosts. A straightforward broadcasting by flooding is usually very costly and results in substantial redundancy and more energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected dominating set (CDS) is a promising approach, where only nodes inside CDS need to relay the broadcast packet. Wu and Li proposed a simple distributed algorithm for calculating CDS in MANET. In general, nodes inside CDS consume more energy to handle various bypass traffics than nodes outside the set. To prolong the life span of each node and, hence, the network by balancing the energy consumption in the system, nodes should be alternated in being chosen to form a CDS. Activity scheduling deals with the way to rotate the role of each node among a set of given operation modes. In thesis I propose to apply power-aware CDS notions to broadcasting and activity scheduling. I also introduce distance rule and extended rules to further reduce broadcasting energy consumption. The effectiveness of the proposed method are confirmed through my simulation experiment.
Show less
Date Issued: 2002
PURL: http://purl.flvc.org/fcla/dt/12958
Subject Headings: Mobile computing, Wireless communication systems, Electronic digital computers--Power supply
Format: Document (PDF)

Title: Object recognition on Android mobil platform using speeded up robust features.
Creator: Tyagi, Vivek K., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In recent years there has been great interest in implementing object recognition frame work on mobile phones. This has stemmed from the fact the advances in object recognition algorithm and mobile phone capabilities have built a congenial ecosystem. Application developers on mobile platforms are trying to utilize the object recognition technology to build better human computer interfaces. This approach is in the nascent phase and proper application framework is required. In this thesis, we...
Show moreIn recent years there has been great interest in implementing object recognition frame work on mobile phones. This has stemmed from the fact the advances in object recognition algorithm and mobile phone capabilities have built a congenial ecosystem. Application developers on mobile platforms are trying to utilize the object recognition technology to build better human computer interfaces. This approach is in the nascent phase and proper application framework is required. In this thesis, we propose a framework to overcome design challenges and provide an evaluation methodology to assess the system performance. We use the emerging Android mobile platform to implement and test the framework. We performed a case study using the proposal and reported the test result. This assessment will help developers make wise decisions about their application design. Furthermore, the Android API developers could use this information to provide better interfaces to the third party developers. The design and evaluation methodology could be extended to other mobile platforms for a wider consumer base.
Show less
Date Issued: 2010
PURL: http://purl.flvc.org/FAU/2683531
Subject Headings: Mobile computing, Application software, Development, Object-oriented programming (Computer software), Pattern recognition systems, Development
Format: Document (PDF)

Title: Mobility pattern-based routing algorithm for mobile ad hoc wireless networks.
Creator: Vyas, Nirav., Florida Atlantic University, Mahgoub, Imad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks lack wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a Location is a frequently used approach, where the searching space for a route is reduced to smaller zone by defining request zone and expected zone. We propose a mobility pattern based algorithm...
Show moreThis thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks lack wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a Location is a frequently used approach, where the searching space for a route is reduced to smaller zone by defining request zone and expected zone. We propose a mobility pattern based algorithm to reduce the overhead, then evaluate the proposed algorithm through simulation. We have implemented two mobility patterns into Location Aided Routing, namely, leading movement and random walk type mobility patterns. We have developed simulation model for each mobility pattern, using SES/Workbench. The performance is measured in terms of overhead of the network. We also discuss various routing algorithms such as dynamic source routing, zone routing protocol, associativity based routing protocol and ad hoc on demand distance vector routing.
Show less
Date Issued: 2000
PURL: http://purl.flvc.org/fcla/dt/12662
Subject Headings: Mobile computing, Wireless communication systems, Computer algorithms
Format: Document (PDF)

Title: Mobility management in voice over IP networks.
Creator: Sugunan, Shiby., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Wireless Internet access has recently gained significant attention as wireless/mobile communications and networking become widespread. Voice over IP service is likely to play a key role in the convergence of IP based Internet and mobile cellular networks. The mobility management performance for Mobile IP and Session Initiation Protocol is the focus of this thesis. After illustrating the operation of the protocols, the discrete event simulator, Network Simulator 2 (ns2), is used to compare the...
Show moreWireless Internet access has recently gained significant attention as wireless/mobile communications and networking become widespread. Voice over IP service is likely to play a key role in the convergence of IP based Internet and mobile cellular networks. The mobility management performance for Mobile IP and Session Initiation Protocol is the focus of this thesis. After illustrating the operation of the protocols, the discrete event simulator, Network Simulator 2 (ns2), is used to compare the performance of the two protocols. The comparison of the protocols is done by comparing average end-to-end delay and the ratio of the number of packets received to the number of packets originally sent (Packet Delivery Fraction). The impact of mobility is analyzed by studying the performance of the protocols, for various mobility scenarios. The effect of an increase in the number of nodes and increase in velocity of the mobile node on the performance of the Mobile IP and SIP is compared. The performance of the Mobile IP and SIP is compared by measuring the performance metrics of the two protocols for similar simulations. The results obtained as a result of the simulations leads us to some interesting conclusions.
Show less
Date Issued: 2004
PURL: http://purl.flvc.org/fcla/dt/13113
Subject Headings: Internet telephony, Wireless Internet, Mobile computing, TCP/IP (Computer network protocol)
Format: Document (PDF)

Title: Location management for mobile Internet protocols.
Creator: Shah, Jigar Vireshkumar., Florida Atlantic University, Mahgoub, Imad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In this present computer age, cellular technology and portable computers are becoming an integral part of day to day life. Each computer user wants to access the computing resources, irrespective of the location. Because of this need the computing paradigm "Mobile Computing" has assumed a primary role in modern computer communication technology. There are different Internet protocols proposed for Mobile Computing. In the present research, we study the Internet Engineering Task Force (IETF)...
Show moreIn this present computer age, cellular technology and portable computers are becoming an integral part of day to day life. Each computer user wants to access the computing resources, irrespective of the location. Because of this need the computing paradigm "Mobile Computing" has assumed a primary role in modern computer communication technology. There are different Internet protocols proposed for Mobile Computing. In the present research, we study the Internet Engineering Task Force (IETF) Mobile IPv6 (new version of current IPv4 protocol). We have developed simulation program using Scientific and Engineering Software (SES/workbench) and studied three mobility patterns namely Travelling Salesman, Pop-Up and Boring Professor for the performance study of Mobile IPv6. Performance of Mobile IPv6 is measured in terms of utilization and overhead and compared with Mobile IPv4 and Basic Triangular Routing (BTR). It has been observed that Mobile IPv6 scheme has better route optimization than the other schemes when Mobile node's movement from one network to another network is less frequent. But, when the movement of the Mobile node is more frequent then Basic Triangular Routing scheme outperformed the Mobile IPv6 scheme.
Show less
Date Issued: 1999
PURL: http://purl.flvc.org/fcla/dt/15683
Subject Headings: Mobile computing, TCP/IP (Computer network protocol), Mobile communication systems
Format: Document (PDF)

Title: Local construction of connected dominating sets in wireless ad hoc networks.
Creator: Dai, Fei., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Wireless ad hoc networks are infrastructure-less multi-hop networks consisting of mobile (such as in mobile ad hoc networks) or stationary (such as in wireless sensor networks) wireless devices. These networks involve several challenges, including limited bandwidth and energy resources, frequent topology changes, and a lack of central control. Local acting, self-organizing, and self-healing algorithms (also called localized algorithms) are essential to the design of wireless ad hoc networks....
Show moreWireless ad hoc networks are infrastructure-less multi-hop networks consisting of mobile (such as in mobile ad hoc networks) or stationary (such as in wireless sensor networks) wireless devices. These networks involve several challenges, including limited bandwidth and energy resources, frequent topology changes, and a lack of central control. Local acting, self-organizing, and self-healing algorithms (also called localized algorithms) are essential to the design of wireless ad hoc networks. A connected dominating set (CDS) is frequently used in wireless ad hoc networks as a virtual backbone to support efficient routing, service discovery, and area monitoring. In addition, efficient broadcasting (i.e., finding a small set of forward nodes to ensure full delivery) can be viewed as forming a CDS on-the-fly. The periodically maintained virtual backbone is called a static CDS, and the temporarily formed forward node set is called a dynamic CDS. For efficiency and robustness, the ideal CDS construction algorithm is lightweight, has fast convergence, and minimizes the CDS size. This dissertation focuses on providing a generic framework to unify localized CDS construction schemes, including both static and dynamic CDS constructions, for wireless ad hoc networks. The goal is to provide insights on how to form a small CDS (forward node set) in dynamic networks with affordable overhead and high robustness. A classification of CDS construction algorithms for wireless ad hoc networks has been provided at the beginning. An efficient scheme, called Rule K, has been proposed for static CDS construction. Rule K achieves a probabilistic constant upper bound on the expected CDS size, which is currently the best known performance guarantee for localized CDS algorithms. Rule K has been extended to a unified framework, called the coverage condition, which contains most existing localized virtual backbone construction and efficient broadcast algorithms as its special cases. The coverage condition has been further extended to construct a k-connected k-dominating set for higher robustness, and integrated in an iterative process that further reduces the CDS size while maintaining the same level of robustness.
Show less
Date Issued: 2005
PURL: http://purl.flvc.org/fcla/dt/12144
Subject Headings: Wireless communication systems, Electronic digital computers--Power supply, Mobile computing, Sensor networks
Format: Document (PDF)

Title: Label routing protocol: A new cross-layer protocol for multi-hop ad hoc wireless network.
Creator: Wang, Yu., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Compared to the traditional wireless network, the multi-hop ad hoc wireless network (simply called ad hoc networks) is self-configurable, dynamic, and distributed. During the past few years, many routing protocols have been proposed for this particular network environment. While in wired and optical networks, multi-protocol label switching (MPLS) has clearly shown its advantages in routing and switching such as flexibility, high efficiency, scalability, and low cost, however MPLS is complex...
Show moreCompared to the traditional wireless network, the multi-hop ad hoc wireless network (simply called ad hoc networks) is self-configurable, dynamic, and distributed. During the past few years, many routing protocols have been proposed for this particular network environment. While in wired and optical networks, multi-protocol label switching (MPLS) has clearly shown its advantages in routing and switching such as flexibility, high efficiency, scalability, and low cost, however MPLS is complex and does not consider the mobility issue for wireless networks, especially for ad hoc networks. This thesis migrates the label concept into the ad hoc network and provides a framework for the efficient Label Routing Protocol (LRP) in such a network. The MAC layer is also optimized with LRP for shorter delay, power saving, and higher efficiency. The simulation results show that the delay is improved significantly with this cross-layer routing protocol.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13321
Subject Headings: Computer network protocols, Wireless communication systems, Mobile computing, Computer algorithms, MPLS standard, Operating systems (Computers)
Format: Document (PDF)

Title: Evaluation of usage scenarios in Mobile People Architecture.
Creator: Shang, Hongtao., Florida Atlantic University, Mahgoub, Imad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: With the explosive growth of the Internet and other types of networks, such as cell phones and pager networks, more and more people expect to communicate with each other personally anywhere and at anytime. This thesis studies a new architecture Mobile People Architecture (MPA) proposed by MosquitoNet research group at Stanford University, which is designed to put people, rather than the devices that people use, at the endpoints of communication session. Three usage scenarios in MPA are...
Show moreWith the explosive growth of the Internet and other types of networks, such as cell phones and pager networks, more and more people expect to communicate with each other personally anywhere and at anytime. This thesis studies a new architecture Mobile People Architecture (MPA) proposed by MosquitoNet research group at Stanford University, which is designed to put people, rather than the devices that people use, at the endpoints of communication session. Three usage scenarios in MPA are simulated using SES/Workbench. The Response Time and the Update Cost are used to evaluate the performance of above scenarios. The advantages and disadvantages of different scenarios are also analyzed and discussed in this thesis.
Show less
Date Issued: 1999
PURL: http://purl.flvc.org/fcla/dt/15742
Subject Headings: TCP/IP (Computer network protocol), Mobile computing, Internetworking (Telecommunication)
Format: Document (PDF)

Title: Enabling access for mobile devices to the web services resource framework.
Creator: Mangs, Jan Christian., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The increasing availability of Web services and grid computing has made easier the access and reuse of different types of services. Web services provide network accessible interfaces to application functionality in a platform-independent manner. Developments in grid computing have led to the efficient distribution of computing resources and power through the use of stateful web services. At the same time, mobile devices as a platform of computing have become a ubiquitous, inexpensive, and...
Show moreThe increasing availability of Web services and grid computing has made easier the access and reuse of different types of services. Web services provide network accessible interfaces to application functionality in a platform-independent manner. Developments in grid computing have led to the efficient distribution of computing resources and power through the use of stateful web services. At the same time, mobile devices as a platform of computing have become a ubiquitous, inexpensive, and powerful computing resource. Concepts such as cloud computing has pushed the trend towards using grid concepts in the internet domain and are ideally suited for internet-supported mobile devices. Currently, there are a few complete implementations that leverage mobile devices as a member of a grid or virtual organization. This thesis presents a framework that enables the use of mobile devices to access stateful Web services on a Globus-based grid. To illustrate the presented framework, a user-friendly mobile application has been created that utilizes the framework libraries do to demonstrate the various functionalities that are accessible from any mobile device that supports Java ME.
Show less
Date Issued: 2008
PURL: http://purl.flvc.org/FAU/186290
Subject Headings: User interfaces (Computer systems), Data structures (Computer science), Mobile computing, Security measures, Mobile communication systems, Computational grids (Computer systems)
Format: Document (PDF)

Title: Connected Dominating Set in Wireless Ad Hoc Networks: Variations with Applications.
Creator: Yang, Shuhui, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Wireless ad hoc networks (or simply ad hoc networks) are infrastructureless multihop networks consisting of mobile or stationary wireless devices, which include mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). These networks are characterized by limited bandwidth and energy resources, frequent topology changes, and a lack of central control. These characteristics lead to the research challenges of ad hoc networks. The algorithms designed for ad hoc networks should be...
Show moreWireless ad hoc networks (or simply ad hoc networks) are infrastructureless multihop networks consisting of mobile or stationary wireless devices, which include mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). These networks are characterized by limited bandwidth and energy resources, frequent topology changes, and a lack of central control. These characteristics lead to the research challenges of ad hoc networks. The algorithms designed for ad hoc networks should be localized, selforganizing, and energy efficient. A connected dominating set (CDS) is frequently used in ad hoc networks as a virtual backbone to support efficient routing, service discovery, and area monitoring. In addition, efficient broadcasting (i.e., finding a small set of forward nodes to ensure full delivery) can be viewed as forming a CDS on-the-fly. The periodically maintained virtual backbone is called a static CDS, and the temporarily formed forward node set is called a dynamk CDS. For efficiency and robustness, the ideal CDS construction algorithm is lightweight, has fast convergence, and minimizes the CDS size. Recently, due to some specific applications and new techniques, the concept of a connected dominating set can be modified or further extended for more efficient usage. This dissertation focuses on the variations with applications of the connected dominating set, designing new concepts, and developing new algorithms for them. A review of CDS construction algorithms for ad hoc networks has been provided at the beginning. An efficient scheme, called Rule K, has been proposed for static CDS construction. Rule K achieves a probabilistic constant upper bound on the expected CDS size, which is currently the best known performance guarantee for localized CDS algorithms. Several CDS algorithms are extended to generate the extended CDS, which exploits the cooperative communication technique to further reduce the size of CDS. A k-coverage set is developed for higher robustness. With the equipment of directional antennas , the transmission can be restricted to some certain directions to reduce interference and energy consumption. The corresponding directional CDS is discussed. Finally, a wireless sensor and actor network (WSAN) is introduced and localized algorithms are designed for it.
Show less
Date Issued: 2007
PURL: http://purl.flvc.org/fau/fd/FA00012580
Subject Headings: Computer network protocols, Wireless communication systems--Design and construction, Mobile computing, Computer algorithms
Format: Document (PDF)

Title: Campus driver assistant on an Android platform.
Creator: Zankina, Iana., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: College campuses can be large, confusing, and intimidating for new students and visitors. Finding the campus may be easy using a GPS unit or Google Maps directions, but this is not the case when you are actually on the campus. There is no service that provides directional assistance for the campus itself. This thesis proposes a driver assistant application running on an Android platform that can direct drivers to different buildings and parking lots in the campus. The application's user...
Show moreCollege campuses can be large, confusing, and intimidating for new students and visitors. Finding the campus may be easy using a GPS unit or Google Maps directions, but this is not the case when you are actually on the campus. There is no service that provides directional assistance for the campus itself. This thesis proposes a driver assistant application running on an Android platform that can direct drivers to different buildings and parking lots in the campus. The application's user interface lets the user select a user type, a campus, and a destination through use of drop down menus and buttons. Once the user submits the needed information, then the next portion of the application runs in the background. The app retrieves the Campus Map XML created by the mapping tool that was constructed for this project. The XML data containing all the map elements is then parsed and stored in a hierarchal data structure. The resulting objects are then used to construct a campus graph, on which an altered version of Dijkstra's Shortest Path algorithm is executed. When the path to the destination has been discovered, the campus map with the computed path overlaid is displayed on the user's device, showing the route to the desired destination.
Show less
Date Issued: 2012
PURL: http://purl.flvc.org/FAU/3359159
Subject Headings: Mobile computing, Software engineering, Application software, Development
Format: Document (PDF)

Title: Asset identification using image descriptors.
Creator: Friedel, Reena Ursula., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Asset management is a time consuming and error prone process. Information Technology (IT) personnel typically perform this task manually by visually inspecting assets to identify misplaced assets. If this process is automated and provided to IT personnel it would prove very useful in keeping track of assets in a server rack. A mobile based solution is proposed to automate this process. The asset management application on the tablet captures images of assets and searches an annotated database...
Show moreAsset management is a time consuming and error prone process. Information Technology (IT) personnel typically perform this task manually by visually inspecting assets to identify misplaced assets. If this process is automated and provided to IT personnel it would prove very useful in keeping track of assets in a server rack. A mobile based solution is proposed to automate this process. The asset management application on the tablet captures images of assets and searches an annotated database to identify the asset. We evaluate the matching performance and speed of asset matching using three different image feature descriptors. Methods to reduce feature extraction and matching complexity were developed. Performance and accuracy tradeoffs were studied, domain specific problems were identified, and optimizations for mobile platforms were made. The results show that the proposed methods reduce complexity of asset matching by 67% when compared to the matching process using unmodified image feature descriptors.
Show less
Date Issued: 2012
PURL: http://purl.flvc.org/FAU/3342051
Subject Headings: Data mining, Technological innovations, Mobile computing, User-centered system design, Application software, Development
Format: Document (PDF)

Title: Adaptive on-demand routing protocol for mobile ad hoc networks.
Creator: Omer, Ismail., Florida Atlantic University, Mahgoub, Imad, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Existing MANET routing protocols can be classified into three categories: On-demand, Proactive, and Proactive-On-demand hybrid protocols. This dissertation presents a novel hybrid MANET routing protocol, Adaptive On-demand MANET Routing (AOMAR) protocol. AOMAR borrowed the concepts of temporal location updates in operating systems and cache memories to reconstruct broken routes. Each route entry in a mobile host will have a reference field that is set to indicate whether the route is used...
Show moreExisting MANET routing protocols can be classified into three categories: On-demand, Proactive, and Proactive-On-demand hybrid protocols. This dissertation presents a novel hybrid MANET routing protocol, Adaptive On-demand MANET Routing (AOMAR) protocol. AOMAR borrowed the concepts of temporal location updates in operating systems and cache memories to reconstruct broken routes. Each route entry in a mobile host will have a reference field that is set to indicate whether the route is used within a certain period of time called refresh time. Using the refresh time parameter and the route reference field, AOMAR behavior can be controlled to behave as pure On-demand, Adaptive, or history related Proactive protocol. The three versions of AOMAR, On-demand, Adaptive and Proactive, have been simulated using different network sizes, loads and mobility patterns. Three performance metrics---throughput, delay and overhead---are collected. The results show that AOMAR on-demand has the same pattern of results when compared with other exiting on-demand protocols. On-demand AOMAR shows better performance when compared to Adaptive AOMAR for simulation sessions with uniform workloads. On the other hand Adaptive AOMAR outperforms On-demand AOMAR for simulation sessions with non-uniform workloads. Proactive AOMAR reconstructs recently used routes that have broken. Therefore, its routing overhead results change with the change of the network loads and mobility rates. This is not the case for traditional proactive protocols. Proactive AOMAR has lower control overhead and saves the bandwidth when compared with traditional existing proactive routing protocols. In addition to developing and simulating AOMAR, a new mobility model is proposed. Synchronized Random Direction Model of Motion with Constant Speed (SRDMCS) is a model that is suitable to emulate objects that move in random directions with a constant speed and within a certain area of movement. A new formula, Movement Related Update (MRU), is proposed and implemented. In MRU, the refresh period parameter value is linked to the network mobility level. Using MRU in the simulation gives AOMAR a third dimension such that the protocol not only adapts with how frequently the routes are used and how frequently they are broken, but also with how dynamic the network is.
Show less
Date Issued: 2001
PURL: http://purl.flvc.org/fcla/dt/11972
Subject Headings: Mobile computing, Computer network protocols, Wireless communication systems
Format: Document (PDF)

Wireless communication systems (7)	+ -
Computer algorithms (4)	+ -
Application software (3)	+ -
Computer network protocols (3)	+ -
Development (3)	+ -

Security measures (3)	+ -
TCP/IP (Computer network protocol) (3)	+ -
Technological innovations (3)	+ -
Ad hoc networks (Computer networks) (2)	+ -
Electronic digital computers--Power supply (2)	+ -
Mobile communication systems (2)	+ -
Sensor networks (2)	+ -
Bluetooth technology (1)	+ -
CDPD (Standard) (1)	+ -
Computational grids (Computer systems) (1)	+ -
Computer network architectures (1)	+ -
Computer networks (1)	+ -
Data mining (1)	+ -
Data structures (Computer science) (1)	+ -
Electromagnetic interference (1)	+ -
Internet telephony (1)	+ -
Internetworking (Telecommunication) (1)	+ -
MPLS standard (1)	+ -
Object-oriented programming (Computer software) (1)	+ -
Operating systems (Computers) (1)	+ -
Pattern recognition systems (1)	+ -
Software engineering (1)	+ -
User interfaces (Computer systems) (1)	+ -
User-centered system design (1)	+ -

Android (Electronic resource). (1)	+ -
Android. (1)	+ -

College of Engineering and Computer Science (17)	+ -
Florida Atlantic University (11)	+ -
Wu, Jie (5)	+ -
Mahgoub, Imad (4)	+ -
Ilyas, Mohammad (2)	+ -

Dai, Fei. (1)	+ -
Friedel, Reena Ursula. (1)	+ -
Ibriq, Jamil (1)	+ -
Li, Feng. (1)	+ -
Li, Hailan. (1)	+ -
Mangs, Jan Christian. (1)	+ -
Neelakanta, Perambur S. (1)	+ -
Omer, Ismail. (1)	+ -
Shah, Jigar Vireshkumar. (1)	+ -
Shang, Hongtao. (1)	+ -
Sivaraks, Jesada. (1)	+ -
Sugunan, Shiby. (1)	+ -
Tyagi, Vivek K. (1)	+ -
Vyas, Nirav. (1)	+ -
Wang, Yu. (1)	+ -
Wu, Bing. (1)	+ -
Yang, Shuhui (1)	+ -
Zankina, Iana. (1)	+ -

Search In

Sort Results By:

Narrow results by:

Collection

Topical Subject

Title as Subject

Genre

Type of Resource

Language

Creator

Format

Owner