Mobile object location discovery in unpredictable environments

Emerging mobile and ubiquitous computing environments present hard challenges to software engineering. The use of mobile code has been suggested as a natural fit for simplifing software development for these environments. However, the task of discovering mobile code location becomes a problem in unpredictable environments when using existing strategies, designed with fixed and relatively stable networks in mind. This paper introduces AMOS, a mobile code platform augmented with a structured overlay network. We demonstrate how the location discovery strategy of AMOS has better reliability and scalability properties than existing approaches, with minimal communication overhead. Finally, we demonstrate how AMOS can provide autonomous distribution of effort fairly throughout a network using probabilistic methods that requires no global knowledge of host capabilities

Multicast Routing Algorithms and Failure Analyses for Low Earth Orbit Satellite Communication Networks

In the rapidly changing environment of mobile communications, the importance of the mobile satellite (e,g,, low earth orbit satellites (LEOsats)) networks will increase due to their global visibility and connection. Multicasting is an effective communication method in terms of frequency spectrum usage for a LEO network. It is devised to provide lower network traffic (i,e,, one-to-many transmissions). This research examines the system performance of two dissimilar terrestrially-based multicasting protocols: the Distance Vector Multicast Routing Protocol (DVMRP) and the On Demand Multicast Routing Protocol (ODMRP). These two protocols are simulated in large group membership density and in the presence of satellite failures. Two different algorithms are developed and used to select critical satellites for degrading a LEO network constellation. The simulation results show that the ODMRP protocol successfully reconfigured routes in large group membership density areas and in satellite failure conditions. Results also show that the ODMRP provided reliable packet delivery. However, ODMRP showed an enormous end-to-end delay in severe satellite failure conditions. This result is attributable to the delayed route refreshing procedure of ODMRP. In contrast, the DVMRP suffered from broken routes and complexity in the large group membership density and in satellite failure conditions. It had a smaller packet delivery ratio than the ODMRP (approximately 85,5% versus 98,9% for the 80 user case). The DVMRP showed scalable and stable end-to-end delay under multiple failed satellite conditions. The large group membership density and the multiple satellite failure conditions provide a more complete assessment for these two protocols

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Survey And New Approach In Service Discovery And Advertisement For Mobile Ad Hoc Networks.

Service advertisement and discovery is an important component for mobile adhoc communications and collaboration in ubiquitous computing environments. The ability to discover services offered in a mobile adhoc network is the major prerequisite for effective usability of these networks. This paper aims to classify and compare existing Service Discovery (SD) protocols for MANETs by grouping them based on their SD strategies and service information accumulation strategies, and to propose an efficient approach for addressing the inherent issues