Mobile Network Research Papers - Academia.edu (original) (raw)

1999, Personal Communications, IEEE

ince their emergence in the 1970s, wireless networks have become increasingly popular in the computing industry. This is particularly true within the past decade, which has seen wireless networks being adapted to enable mobility. There are currently two variations of mobile wireless networks. The first is known as the infrastructured network (i.e., a network with fixed and wired gateways). The bridges for these networks are known as base stations. A mobile unit within these networks connects to, and communicates with, the nearest base station that is within its communication radius. As the mobile travels out of range of one base station and into the range of another, a "handoff" occurs from the old base station to the new, and the mobile is able to continue communication seamlessly throughout the network. Typical applications of this type of network include office wireless local area networks (WLANs).

2002, Proceedings of the 9th ACM conference on …

Distributed Sensor Networks (DSNs) are ad-hoc mobile networks that include sensor nodes with limited computation and communication capabilities. DSNs are dynamic in the sense that they allow addition and deletion of sensor nodes after deployment to grow the network or replace failing and unreliable nodes. DSNs may be deployed in hostile areas where communication is monitored and nodes are subject to capture and surreptitious use by an adversary. Hence DSNs require cryptographic protection of communications, sensorcapture detection, key revocation and sensor disabling. In this paper, we present a key-management scheme designed to satisfy both operational and security requirements of DSNs. The scheme includes selective distribution and revocation of keys to sensor nodes as well as node re-keying without substantial computation and communication capabilities. It relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes. The security and network connectivity characteristics supported by the key-management scheme are discussed and simulation experiments presented.

1999, … international conference on Mobile …

Large-scale networks of wireless sensors are becoming an active topic of research. Advances in hardware technology and engineering design have led to dramatic reductions in size, power consumption and cost for digital circuitry, wireless communications and Micro ElectroMechanical Systems (MEMS). This has enabled very compact, autonomous and mobile nodes, each containing one or more sensors, computation and communication capabilities, and a power supply. The missing ingredient is the networking and applications layers needed to harness this revolutionary capability into a complete system. We review the key elements of the emergent technology of "Smart Dust" and outline the research challenges they present to the mobile networking and systems community, which must provide coherent connectivity to large numbers of mobile network nodes co-located within a small volume.

2005, Proceedings of the 2005 …

Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the general category of Delay Tolerant Networks. There are many real networks that follow this paradigm, for example, wildlife tracking sensor networks, military networks, inter-planetary networks, etc. In this context, conventional routing schemes would fail.

2001, IEEE [see also IEEE Wireless …

Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of two prominent ondemand routing protocols for mobile ad hoc networks -Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV). A detailed simulation model with MAC and physical layer models is used to study interlayer interactions and their performance implications. We demonstrate that even though DSR and AODV share a similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials are analyzed using varying network load, mobility and network size. Based on the observations, we make recommendations about how the performance of either protocol can be improved.

2002, … international symposium on Mobile ad hoc …

Network wide broadcasting in Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. Considering its wide use as a building block for other network layer protocols, the MANET community needs to standardize a single methodology that efficiently delivers a packet from one node to all other network nodes. Despite a considerable number of proposed broadcasting schemes, no comprehensive comparative analysis has been previously done. This paper provides such analysis by classifying existing broadcasting schemes into categories and simulating a subset of each category, thus supplying a condensed but comprehensive side by side comparison. The simulations are designed to pinpoint, in each category, specific failures to network conditions that are relevant to MANETs, e.g., bandwidth congestion and dynamic topologies. In addition, protocol extensions using adaptive responses to network conditions are proposed, implemented and analyzed for one broadcasting scheme that performs well in the comparative study.

2002, Mobile Networks and Applications

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept; only a subset of nodes forwards the multicast packets via scoped flooding. It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.

2001, Communications Magazine, IEEE

Most ad hoc mobile devices today operate on batteries. Hence, power consumption becomes an important issue. To maximize the lifetime of ad hoc mobile networks, the power consumption rate of each node must be evenly distributed, and the overall transmission power for each connection request must be minimized. These two objectives cannot be satisfied simultaneously by employing routing algorithms proposed in previous work. In this article we present a new power-aware routing protocol to satisfy these two constraints simultaneously; we also compare the performance of different types of power-related routing algorithms via simulation. Simulation results confirm the need to strike a balance in attaining service availability performance of the whole network vs. the lifetime of ad hoc mobile devices.

2005

Pocket Switched Networks (PSN) make use of both human mobility and local/global connectivity in order to transfer data between mobile users' devices. This falls under the Delay Tolerant Networking (DTN) space, focusing on the use of opportunistic networking. One key problem in PSN is in designing forwarding algorithms which cope with human mobility patterns. We present an experiment measuring fortyone humans' mobility at the Infocom 2005 conference. The results of this experiment are similar to our previous experiments in corporate and academic working environments, in exhibiting a power-law distribution for the time between node contacts. We then discuss the implications of these results on the design of forwarding algorithms for PSN.

2001, Wireless Networks

Wireless networking has witnessed an explosion of interest from consumers in recent years for its applications in mobile and personal communications. As wireless networks become an integral component of the modern communication infrastructure, energy efficiency will be an important design consideration due to the limited battery life of mobile terminals. Power conservation techniques are commonly used in the hardware design of such systems. Since the network interface is a significant consumer of power, considerable research has been devoted to low-power design of the entire network protocol stack of wireless networks in an effort to enhance energy efficiency. This paper presents a comprehensive summary of recent work addressing energy efficient and low-power design within all layers of the wireless network protocol stack.

2009, Arxiv preprint arXiv: …

2012, Proceedings of the 10th …

With the recent advent of 4G LTE networks, there has been increasing interest to better understand the performance and power characteristics, compared with 3G/WiFi networks. In this paper, we take one of the first steps in this direction.

2003, Wireless Networks

The random waypoint model is a commonly used mobility model for simulations of wireless communication networks. By giving a formal description of this model in terms of a discrete-time stochastic process, we investigate some of its fundamental stochastic properties with respect to: (a) the transition length and time of a mobile node between two waypoints, (b) the spatial distribution of nodes, (c) the direction angle at the beginning of a movement transition, and (d) the cell change rate if the model is used in a cellular-structured system area.

2009, Journal of Economic Geography

This article illustrates the contribution of mobile inventors and networks of inventors to the diffusion of knowledge across firms and within cities or states. It is based upon an original data set on US inventors' patent applications at the European Patent Office, in the fields of drugs, biotechnology and organic chemistry. The study combines the methodology originally proposed by Jaffe et al. (1993, Quarterly Journal of Economics, 108: 577-598) with tools from social network analysis, in order to evaluate extent of the localization of knowledge flows, as measured by patent citations. After controlling for inventors' mobility and for the resulting co-invention network, the residual effect of spatial proximity on knowledge diffusion is found to be greatly reduced. We argue that the most fundamental reason why geography matters in constraining the diffusion of knowledge is that mobile researchers are not likely to relocate in space, so that their co-invention network is also localized. In the light of these results, we revisit common interpretations of localized knowledge flows as externalities.

2002, International Journal of High Performance Computing Applications

Distributed cognition of dynamic processes is commonly observed in mobile groups of animates like schools of fish, hunting lions, or in human teams for sports or military maneuvers. This paper presents methods for dynamic distributed cognition using an ad hoc mobile network of microsensors to detect, identify and track targets in noisy environments. We develop off-line algorithms for aggregating the most appropriate knowledge abstractions into semantic information, which is then used for on-line fusion of relevant attributes observed by local clusters in the sensor network.

2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)

An ad hoc mobile network is a collection of nodes, each of which communicates over wireless channels and is capable of movement. Wireless nodes have the unique capability of transmission at different power levels. As the transmission power is varied, a tradeoff exists between the number of hops from source to destination and the overall bandwidth available to individual nodes. Because both battery life and channel bandwidth are limited resources in mobile networks, it is important to ascertain the effects different transmission powers have on the overall performance of the network. This paper explores the nature of this transmission power tradeoff in mobile networks to determine the optimum node density for delivering the maximum number of data packets. It is shown that there does not exist a global optimum density, but rather that, to achieve this maximum, the node density should increase as the rate of node movement increases.

2003, Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '03

In wireless ad hoc networks, capacity can be traded for delay. This tradeoff has been the subject of a number of studies, mainly concentrating on the two extremes: either minimizing the delay or maximizing the capacity. However, in between these extremes, there are schemes that allow instantiations of various degrees of this tradeoff. Infostations, which offer geographically intermittent coverage at high speeds, are one such an example. Indeed, through the use of the Infostation networking paradigm, the capacity of a mobile network can be increased at the expense of delay. We propose to further extend the Infostation concept by integrating it with the ad hoc networking technology. We refer to this networking model as the Shared Wireless Infostation Model (SWIM). SWIM allows additional improvement in the capacity-delay tradeoff through a moderate increase in the storage requirements. To demonstrate how SWIM can be applied to solve a practical problem, we use the example of a biological information acquisition system -radiotagged whales -as nodes in an ad hoc network. We derive an analytical formula for the distribution of end-to-end delays and calculate the storage requirements. We further extend SWIM by allowing multi-tiered operation; which in our biological information acquisition system could be realized through seabirds acting as mobile data collection nodes.

2000, Personal …

Wireless access to Internet services will become typical, rather than the exception as it is today. Such a vision presents great demands on mobile networks. Mobile IP represents a simple and scalable global mobility solution but lacks the support for fast handoff control and paging found in cellular telephony networks. In contrast, second-and third-generation cellular systems offer seamless mobility support but are built on complex and costly connection-oriented networking infrastructure that lacks the inherent flexibility, robustness, and scalability found in IP networks. In this article we present Cellular IP, a micro-mobility protocol that provides seamless mobility support in limited geographical areas. Cellular IP, which incorporates a number of important cellular system design principles such as paging in support of passive connectivity, is built on a foundation of IP forwarding, minimal signaling, and soft-state location management. We discuss the design, implementation, and evaluation of a Cellular IP testbed developed at Columbia University over the past several years. Built on a simple, low-cost, plug-and-play systems paradigm, Cellular IP software enables the construction of arbitrary-sized access networks scaling from picocellular to metropolitan area networks. The source code for Cellular IP is freely available from the Web (comet.columbia.edu/cellularip).

2006

The impressive penetration of 802.11-based wireless networks in many metropolitan areas around the world offers, for the first time, the opportunity of a "grassroots" wireless Internet service provided by users who "open up" their 802.11 (Wi-Fi) access points in a controlled manner to mobile clients. While there are many business, legal, and policy issues to be ironed out for this vision to become reality, we are concerned in this paper with an important technical question surrounding such a system: can such an unplanned network service provide reasonable performance to network clients moving in cars at vehicular speeds?

2009

Simulating human mobility is important in mobile networks because many mobile devices are either attached to or controlled by humans and it is very hard to deploy real mobile networks whose size is controllably scalable for performance evaluation. Lately various measurement studies of human walk traces have discovered several significant statistical patterns of human mobility. Namely these include truncated power-law distributions of flights, pause-times and inter-contact times, fractal way-points, and heterogeneously defined areas of individual mobility. Unfortunately, none of existing mobility models effectively captures all of these features. This paper presents a new mobility model called SLAW (Self-similar Least Action Walk) that can produce synthetic walk traces containing all these features. This is by far the first such model. Our performance study using using SLAW generated traces indicates that SLAW is effective in representing social contexts present among people sharing common interests or those in a single community such as university campus, companies and theme parks. The social contexts are typically common gathering places where most people visit during their daily lives such as student unions, dormitory, street malls and restaurants. SLAW expresses the mobility patterns involving these contexts by fractal waypoints and heavy-tail flights on top of the waypoints. We verify through simulation that SLAW brings out the unique performance features of various mobile network routing protocols.

2004, Sensor and Ad Hoc …

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from source to destination, or such a path is highly unstable and may break soon after it has been discovered. In... more

2005, … of Embedded Security …

In vehicular ad hoc networks (VANET), it is possible to locate and track a vehicle based on its transmissions, during communication with other vehicles or the road-side infrastructure. This type of tracking leads to threats on the location privacy of the vehicle's user. In this paper, we study the problem of providing location privacy in VANET by allowing vehicles to prevent tracking of their broadcast communications. We first, identify the unique characteristics of VANET that must be considered when designing suitable location privacy solutions. Based on these observations, we propose a location privacy scheme called CARAVAN, and evaluate the privacy enhancement achieved under some existing standard constraints of VANET applications, and in the presence of a global adversary. Vehicle Trusted entity Untrusted entity Other Data Sources (Police, Vehicle Manufacture) Vehicle Sensor and Database Road Side Unit (RSU) On-Board Unit (OBU) V2I communication Registration Authority (RA) Location Server Location Based Service (LBS) Provider (SP x ) Vehicle V2I communication V2V communication Semi-Trusted entity

2003

The proliferation of mobile devices and the pervasiveness of wireless technology have provided a major impetus to replicate the network-based service discovery technologies in wireless and mobile networks. However, existing service discovery protocols and delivery mechanisms fall short of accommodating the complexities of the ad-hoc environment. They also place emphasis on device capabilities as services rather than device independent software services, making them unsuitable for m-commerce oriented scenarios. Konark is a service discovery and delivery protocol designed specifically for ad-hoc, peer-to-peer networks, and targeted towards device independent services in general and m-commerce oriented software services in particular. It has two major aspects -service discovery and service delivery. For discovery, Konark uses a completely distributed, peer-to-peer mechanism that provides each device the ability to advertise and discover services in the network. The approach towards service description is XML based. It includes a description template that allows services to be described in a human and software understandable forms. A micro-HTTP server present on each device handles service delivery, which is based on SOAP. Konark provides a framework for connecting isolated services offered by proximal pervasive devices over a wireless medium.

2002, … Engineering Education and Life Long Learning

Learners can command an increasing range of mobile technologies that have the potential to support learning anytime anywhere, but also to disrupt the carefully managed environment of the classroom. This paper outlines a theory of learning as conversation that can provide a framework for the design of mobile networked technology for learning. It describes a prototype device based on a pen tablet computer with camera, phone and wireless LAN connection, combined with software to support learning actions, descriptions and conversations. Such devices raise both opportunities and challenges for classroom education. Educational Technology and Distance Learning (CETADL). The focus of his research is the application of studies of human cognition and social interaction to the design of computerbased learning environments and personal technologies.

2005

We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geographic routing protocols. This graph has the following... more

2004

In the near future, the advent of large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be upon us. However, using controlled node mobility to improve communication performance is a capability that the mobile networking community has not yet investigated. In this paper, we study mobility as a network control primitive. More specifically, we present the first mobility control scheme for improving communication performance in such networks. Our scheme is completely distributed, requiring each node to possess only local information. Our scheme is self-adaptive, being able to transparently encompass several modes of operation, each respectively improving power efficiency for one unicast flow, multiple unicast flows, and many-to-one concast flows. We provide extensive evaluations on the feasibility of mobility control, showing that controlled mobility can improve network performance in many scenarios. This work constitutes a novel application of distributed control to networking in which underlying network communication serves as input to local control rules that guide the system toward a global objective.

2005, Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking - WDTN '05

Wireless and mobile network technologies often impose severe limitations on the availability of resources, resulting in poor and often unsatisfactory performance of the commonly used wireless networking protocols. For instance, power and memory/storage constraints of miniaturized network nodes reduce the throughput capacity and increase the network latency. Through various approaches and technological advances, researchers attempt to somehow compensate for such hardware limitations. However, this is not always necessary. Sometimes, the required performance of such networks does not need to adhere to the level of services that would be required for performance-critical applications. For example, for some applications of sensor networks, minimal latency is not a critical factor and it could be traded off for a more limited resource, such as energy or throughput. Such networks are termed delay-tolerant networks. Thus, to reduce the energy expenditure, transmission range of such sensor nodes would be quite short, leading to network topologies in which the average number of neighbors of the network nodes is very small. If the sensor nodes are mobile, then most of the time a node has no neighbors; only infrequently another node migrates into its neighborhood. This means that the classical networking approach of store-and-forward would not work well, as there is nearly never an intact path between a source and a destination. Several routing protocols have been proposed for this type of networking environment, one example is the Shared * Wireless Infostation Model (SWIM), where a packet propagates through the network by being copied (rather than forwarded) from a node to a node, as links are sporadically created. The goal is that one of the copies of the packet reaches the destination. SWIM is an example of the way that non-critical performance could be traded off for insufficient resources, such as the tradeoffs between energy, delay, storage, capacity, and processing complexity. In this paper, we examine some of these tradeoffs, exposing the ways in which resources could be saved by compromising on the level of performance, as to satisfy the particular limitations of network technologies.

2011, PLOS One

After the emergence of the H1N1 influenza in 2009, some countries responded with travel-related controls during the early stage of the outbreak in an attempt to contain or slow down its international spread. These controls along with selfimposed travel limitations contributed to a decline of about 40% in international air traffic to/from Mexico following the international alert. However, no containment was achieved by such restrictions and the virus was able to reach pandemic proportions in a short time. When gauging the value and efficacy of mobility and travel restrictions it is crucial to rely on epidemic models that integrate the wide range of features characterizing human mobility and the many options available to public health organizations for responding to a pandemic. Here we present a comprehensive computational and theoretical study of the role of travel restrictions in halting and delaying pandemics by using a model that explicitly integrates air travel and short-range mobility data with high-resolution demographic data across the world and that is validated by the accumulation of data from the 2009 H1N1 pandemic. We explore alternative scenarios for the 2009 H1N1 pandemic by assessing the potential impact of mobility restrictions that vary with respect to their magnitude and their position in the pandemic timeline. We provide a quantitative discussion of the delay obtained by different mobility restrictions and the likelihood of containing outbreaks of infectious diseases at their source, confirming the limited value and feasibility of international travel restrictions. These results are rationalized in the theoretical framework characterizing the invasion dynamics of the epidemics at the metapopulation level. Citation: Bajardi P, Poletto C, Ramasco JJ, Tizzoni M, Colizza V, et al. (2011) Human Mobility Networks, Travel Restrictions, and the Global Spread of 2009 H1N1 Pandemic. PLoS ONE 6(1): e16591.

2000, Journal of Communications and Networks

Large-scale networks of wireless sensors are becoming increasingly tractable. Advances in hardware technology and engineering design have led to dramatic reductions in size, power consumption and cost for digital circuitry, wireless communications and Micro ElectroMechanical Systems (MEMS). This has enabled very compact, autonomous and mobile nodes, each containing one or more sensors, computation and communication capabilities, and a power supply. The missing ingredient is the networking and applications layers needed to harness this revolutionary capability into a complete system. We review the key elements of the emergent technology of "Smart Dust" and outline the research challenges they present to the mobile networking and systems community, which must provide coherent connectivity to large numbers of mobile network nodes co-located within a small volume.

2008, Proceedings of the …

1997, Surface Science Reports

During this reporting period we have continued to perform different kinds of simulations on the interaction of charged particles with solid surfaces. For these calculations we have set up simulations codes based on time dependent density functional theory. Using such methods, basic properties of the solid such as, e.g., the density of states are only represented correctly in the model if large systems with large amounts of memory are available.

2004, Performance Evaluation

This paper explores a model for the operation of an ad hoc mobile network. The model incorporates incentives for users to act as transit nodes on multi-hop paths and to be rewarded with their own ability to send traffic. The paper explores consequences of the model by means of fluid-level simulations of a network and illustrates the way in which network resources are allocated to users according to their geographical position.

2010, IEEE Sensors Journal

An online GPRS-Sensors Array for air pollution monitoring has been designed, implemented, and tested. The proposed system consists of a Mobile Data-Acquisition Unit (Mobile-DAQ) and a fixed Internet-Enabled Pollution Monitoring Server (Pollution-Server). The Mobile-DAQ unit integrates a single-chip microcontroller, air pollution sensors array, a General Packet Radio Service Modem (GPRS-Modem), and a Global Positioning System Module (GPS-Module). The Pollution-Server is a high-end personal computer application server with Internet connectivity. The Mobile-DAQ unit gathers air pollutants levels (CO, NO2, and SO2), and packs them in a frame with the GPS physical location, time, and date. The frame is subsequently uploaded to the

2005, IEEE Wireless Communications

2006, Journal of Cell Biology

the paracortex, where concomitant CD4 T cell activation occurred. Therefore, NK cells form a reactive but low mobile network in a strategic area of the LN where they can receive infl ammatory signals, interact with DCs, and regulate... more

2007, IEEE Pervasive Computing

Early mobiscopes arose directly from widely available sensing modalities in networked devices. Examples include image sensors in mobile phones, GPS in phones and vehicles, and the increasingly diverse telemetry available in vehicles. We... more

2000, Wireless Communications and …

2004, Consumer Electronics, IEEE Transactions on

M2M Wireless communication of various machines and devices in mobile networks is a fast growing business and application area in industry, maintenance business, customer service, security and banking areas. This paper presents design and implementation of remote control system by means of GSM cellular communication network. The design integrates the device to be controlled, the microcontroller, and the GSM module so that it can be used for a wide range of applications. Detailed description and implementation of each design element are presented. To verify the principle operation of the M2M design, two home applications are experimentally tested using PC-based environment 1 .

1989, IEEE Journal on Selected Areas in Communications

2006, Proceedings of the 1st …

1998, IEEE Personal Communications

This article summarizes the results of the BARWAN project, which focused on enabling truly useful mobile networking across an extremely wide variety of real-world networks and mobile devices. We present the overall architecture, summarize key results, and discuss four broad lessons learned along the way. The architecture enables seamless roaming in a single logical overlay network composed of many heterogeneous (mostly wireless) physical networks, and provides significantly better TCP performance for these networks. It also provides complex scalable and highly available services to enable powerful capabilities across a very wide range of mobile devices, and mechanisms for automated discovery and configuration of localized services. Four broad themes arose from the project: 1) the power of dynamic adaptation as a generic solution to heterogeneity, 2) the importance of cross-layer information, such as the exploitation of TCP semantics in the link layer,

1999, IEEE Internet Computing

Internet-based mobile ad hoc networking is an emerging technology that supports self-organizing, mobile networking infrastructures. Essentially a "mobile routing infrastructure," such networks offer several advantages for future... more

2001

+HOVLQNL 8QLYHUVLW\ RI 7HFKQRORJ\ )LQODQG NLUVLYLUUDQWDXV#KXWIL Jouni Markkula 8QLYHUVLW\ RI -\YlVN\Ol )LQODQG PDUNNXOD#M\XIL Artem Garmash 8QLYHUVLW\ RI -\YlVN\Ol )LQODQG DUW\RPJDUPDVK#WLWXM\XIL Vagan Terziyan 8QLYHUVLW\ RI -\YlVN\Ol )LQODQG YDJDQ#LWM\XIL Jari Veijalainen 8QLYHUVLW\ RI -\YlVN\Ol YHLMDODL#FVM\XIL Artem Katanosov 8QLYHUVLW\ RI -\YlVN\Ol )LQODQG DUWHPNDWDVRQRY#WLWXM\XIL Henry Tirri 8QLYHUVLW\ RI +HOVLQNL )LQODQG WLUUL#FVKHOVLQNLIL $EVWUDFW 0RELOH

2001, Computer Networks

The ability to quickly deploy new protocols, and provide flexibility to both applications and network administrators has been an oft-cited reason for active networks to be seriously examined. This paper describes an architecture and implementation that provides dynamic installation of network services and flexibility to active code. An example of weighted fair queuing being installed dynamically into a running network is examined.

2006

Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detection problems. However, it is challenging due to the complexities of the indoor radio propagation characteristics exacerbated by the mobility of the user. A common practice is to mechanically generate a table showing the radio signal strength at different known locations in the building. A mobile user's location at an arbitrary point in the building is determined by measuring the signal strength at the location in question and determining the location by referring to the above table using a LMSE (least mean square error) criterion. Obviously, this is a very tedious and time consuming task. This paper proposes a novel and automated location determination method called ARIADNE. Using a two dimensional construction floor plan and only a single actual signal strength measurement, ARIADNE generates an estimated signal strength map comparable to those generated manually by actual measurements. Given the signal measurements for a mobile, a proposed clustering algorithm searches that signal strength map to determine the current mobile's location. The results from ARIADNE are comparable and may even be superior to those from existing localization schemes.

2003, … , 2003. VTC 2003-Spring. The 57th …

Abslracf-The Intelligent Transportation Systems ITS cause a in a suitable way (i.e., voice). The rigor of these applicasignificant passion since the appearance of new Inter-Vehicles tions requires the establishment of real time... more

2010, IEEE Transactions on Mobile Computing

2001, Proceedings of the …

We present the ConnecTable, a new mobile, networked and context-aware information appliance that provides affordances for pen-based individual and cooperative work as well as for the seamless transition between the two. In order to dynamically enlarge an interaction area for the purpose of shared use, a flexible coupling of displays has been realized that overcomes the restrictions of display sizes and borders. Two ConnecTable displays dynamically form a homogeneous display area when moved close to each other. The appropriate triggering signal comes from built-in sensors allowing users to temporally combine their individual displays to a larger shared one by a simple physical movement in space. Connected ConnecTables allow their users to work in parallel on an ad-hoc created shared workspace as well as exchanging information by simply shuffling objects from one display to the other. We discuss the user interface and related issues as well as the software architecture. We also present the physical realization of the ConnecTables.

2009, SIAM Journal on Optimization