Location tracking in mobile ad hoc networks using particle filters

Mobile ad hoc networks (MANETs) are dynamic networks formed on-the-fly as mobile nodes move in and out of each others' transmission ranges. In general, the mobile ad hoc networking model makes no assumption that nodes know their own locations. However, recent research shows that location-awareness can be beneficial to fundamental tasks such as routing and energy-conservation. On the other hand, the cost and limited energy resources associated with common, low-cost mobile nodes prohibits them from carrying relatively expensive and power-hungry location-sensing devices such as GPS. This paper proposes a mechanism that allows non-GPS-equipped nodes in the network to derive their approximated locations from a limited number of GPS-equipped nodes. In our method, all nodes periodically broadcast their estimated location, in terms of a compressed particle filter distribution. Non-GPS nodes estimate the distance to their neighbors by measuring the received signal strength of incoming messages. A particle filter is then used to estimate the approximated location, along with a measure of confidence, from the sequence of distance estimates. Simulation studies show that our solution is capable of producing good estimates equal or better than the existing localization methods such as APS-Euclidean for the more difficult scenario when the network connectivity is low.     

影响用户换手机的关键因素及其效应研究——基于中国移动西安分公司的样本数据

影响用户换手机的因素有客观因素和主观因素,本研究基于中国移动西安分公司的用户信息数据,根据用户的实际消费和相关非线性多元回归理论,探索了影响用户换手机的客观因素及其效应。研究发现:较长的总通话次数、较大的平均流量和较小的手机屏幕(在用手机)等因素能促进用户换手机;换手机的主要驱动力不是经济能力的差异而是在用手机的屏幕大小;用户的年龄差异对是否换手机的影响可以忽略;城乡标识对是否换手机的影响显著,用户品牌的影响不显著。另外,手机捆绑销售方式的存在,本研究最后站在制造商和运营商的角度,根据以上影响效果给出了提高手机制造商和运营商竞争力的相关建议。     

Topology control in the mobile ad hoc networks in order to intensify energy conservation

Although studied for years, due to their dynamic nature, research in the field of mobile ad hoc networks (MANETs) has remained a vast area of interest. Since once distributed, there will be less to no plausibility of recharge, energy conservation has become one of the pressing concerns regarding this particular type of network. In fact, one of the main obligations of designers is to make efficient use of these scarce resources. There has been tremendous work done in different layers of protocol stack in order to intensify energy conservation. To date, numerous topology control algorithms have been proposed, however, only a few have used meta-heuristics such as genetic algorithms, neural networks and/or learning automata to overcome this issue. On the other hand, since nodes are mobile and thus in a different spatial position, as time varies, we can expect that by regulating time intervals between topology controls, one may prolong the network’s lifetime. The main initiative of this paper is to intensify energy conservation in a mobile ad hoc network by using weighted and learning automata based algorithms. The learning automata, regulates time intervals between which the topology controls are done. The represented learning automata based algorithm uses its learning ability to find appropriate time-intervals so that the nodes would regulate the energy needed in order to exchange the information to their neighbors, accordingly. Moreover, at first we have represented two weighted based algorithms which extend two prominent protocols, namely K-Neigh and LMST. Then these algorithms are combined with a learning based algorithm which regulates time intervals between which the topology controls are done. In comparison with approaches that are based on periodic topology controls, proposed approach shows enhanced results. On the other hand, considering the learning ability of the learning automata based algorithms, composition of the aforementioned algorithms has been proven to be enhanced, in the respect of energy consumed per data transmitted, over those compared with.     

Distributed caching over heterogeneous mobile networks

Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a local cache and share it with other users they meet, e.g., via Bluetooth or WiFi. The storage capacity of mobile devices is typically limited; therefore, identifying which content a user should store in her cache is a fundamental problem in the operation of any such content distribution system. In this work we propose Psephos, a novel mechanism for determining the caching policy of each mobile user. Psephos is fully distributed: users compute their own policies individually, in the absence of a central authority. Moreover, it is designed for a heterogeneous environment, in which demand for content, access to resources, and mobility characteristics may vary across different users. Most importantly, the caching policies computed by our mechanism are optimal: we show that Psephos maximizes the system’s social welfare. To the best of our knowledge, our work is the first to address caching with heterogeneity in a fully distributed manner.     

A tight bound on the number of mobile servers to guarantee transferability among dominating configurations

In this paper, we propose a new framework to provide continuous services to users by a collection of mobile servers distributed over an interconnection network. We model those mobile servers as a subset of nodes, and assume that a user can receive the service if at least one adjacent node (including itself) plays the role of a server; i.e., we assume that the service could not be routed via the interconnection network. The main results obtained in this paper are summarized as follows: For the class of trees consisting of n nodes, ⌊n/2⌋ mobile servers are sometimes necessary and always sufficient to realize continuous services by the mobile servers, and for the class of Hamiltonian graphs with n nodes, ⌈(n+1)/3⌉ mobile servers are sometimes necessary and always sufficient.     

An Interactive, Similarity Increasing Algorithm for Random Strings with Applications to Key Agreement in ad hoc Networks

A central problem in distributed computing and telecommunications is the establishment of common knowledge between two computing entities. An immediate use of such common knowledge is in the initiation of a secure communication session between two entities because the two entities may use this common knowledge to produce a secret key for use with some symmetric cipher. The dynamic establishment of shared information (e.g., secret key) between two entities is particularly important in networks with no predetermined structure such as wireless mobile ad hoc networks. In such networks, nodes establish and terminate communication sessions dynamically with other nodes which may have never been encountered before to somehow exchange information which will enable them to subsequently communicate in a secure manner. In this paper we give and theoretically analyze a protocol that enables two entities initially possessing a string each to securely eliminate inconsistent bit positions, obtaining strings with a larger percentage of similarities. Our analysis involves the modeling of the operation of the protocol with a discrete random process amenable to approximation with a continuous differential equation belonging to the class of Abel's differential equations of the first kind, whose solution involves Lambert's W function.     

Energy aware proactive optimized link state routing in mobile ad-hoc networks

In this paper we develop a novel energy aware routing approach for mobile ad hoc network (MANET) problems. The approach is based on using Optimized Link State Routing Protocol. Our Energy Aware OLSR labeled as OLSR_EA measures and predicts per-interval energy consumptions using the well-known Auto-Regressive Integrated Moving Average time series method. We develop a composite energy cost, by considering transmission power consumption and residual energy of each node, and use this composite energy index as the routing metric. Our extensive ns2 simulation experiments show that OLSR_EA substantially prolongs the network lifetime and saves total energy used in MANET. In our experiments we considered different scenarios considering a variety of traffic loads, node mobilities, homogeneous power consumption, and heterogeneous power consumption. Simulation results also confirm that OLSR_EA improves the traffic balance between nodes, and packet delivery ratio in higher node speed. We further develop characteristics of OLSR_EA in power-wise heterogeneous MANET to achieve efficient energy preserving performance.     

Cover-Free Families and Topology-Transparent Scheduling for MANETs

We examine the combinatorial requirements of topology-transparent transmission schedules in a mobile ad hoc network (MANET). Specifically, if each of the N nodes has at most D active neighbors, we require the schedule to guarantee a collision-free transmission to each neighbor. This requirement is met by a cover-free family. We show that existing constructions for topology-transparent schedules correspond to an orthogonal array. Moreover, we show that Steiner systems support the largest number of nodes for a given schedule length. Both of these combinatorial objects are special cases of cover-free families. Analytically and numerically, we examine slot guarantees, expected throughput, and normalized expected throughput for systems of small strength, exploring the sensitivity of the response to D. Expected throughput provides a better performance metric than the minimum throughput results obtained earlier. The impact of a more realistic model of acknowledgments is also examined. The extension of the schedule to multiple frames returns us to the orthogonal arrays. The very density of Steiner systems that afforded an improvement over orthogonal arrays in one frame impedes the best extension to more frames.     

Toward a Reliable and Resilient Mobile Wireless Architecture

Abstract

Hybrid mobile wireless architectures that combine the advantages of ad hoc (mobile nodes) and cellular models provide “communications-on-the-move” services with enhanced flexibility and stability. In this article, we investigate the resiliency of such architectures by considering strategies for optimal deployment (number and location) of backup routers that would ensure reliable performance in such interdependent mobile systems.     

A Study of the Connectivity Over Time Behavior of On-Demand Ad Hoc Path Selection Schemes

Selecting the most appropriate path between each pair of nodes in an ad hoc network is an issue with major impact on network performance. Many schemes were proposed and compared in the literature, using various criteria. However, the connectivity over time behavior of these schemes, which is important to some practical applications, was not well studied, especially with regards to the terrain type. In this work we use simulation to study this aspect of network performance. We demonstrate that a different connectivity requirement and a different time horizon may dictate a different scheme to use. We also demonstrate that path selection schemes are not equally sensitive to the terrain.     

弹性需求下城市公交网络服务的优化

对具有弹性需求的城市公交网络系统进行了票价结构与发车频率组合的优化。考虑到公交定价和发车频率会影响乘客需求以及乘客对路径的选择行为,将这一问题描述为一个双层规划问题,上层是寻求社会福利最大的优化问题;下层考虑了乘客的出行选择行为,为弹性需求下乘客在城市公交网络上流量分布的随机用户平衡分配模型。鉴于双层规划问题的非凸性,运用模拟退火算法对模型进行求解,并给出一个仿真算例说明提出的模型和算法的合理性。     

Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization

Two distributed algorithms are described that enable all users connected over a network to cooperatively solve the problem of minimizing the sum of all users’ objective functions over the intersection of all users’ constraint sets, where each user has its own private nonsmooth convex objective function and closed convex constraint set, which is the intersection of a number of simple, closed convex sets. One algorithm enables each user to adjust its estimate using the proximity operator of its objective function and the metric projection onto one constraint set randomly selected from a number of simple, closed convex sets. The other determines each user’s estimate using the subdifferential of its objective function instead of the proximity operator. Investigation of the two algorithms’ convergence properties for a diminishing step-size rule revealed that, under certain assumptions, the sequences of all users generated by each of the two algorithms converge almost surely to the same solution. It also showed that the rate of convergence depends on the step size and that a smaller step size results in quicker convergence. The results of numerical evaluation using a nonsmooth convex optimization problem support the convergence analysis and demonstrate the effectiveness of the two algorithms.     

Sink移动的无线传感网中高连通性密钥预分配方案研究

在Sink移动的无线传感器网络中,安全性和连通性是密钥预分配方案研究中的两个难点.根据节点间安全通信的设计原理,移动Sink节点与传感器节点按一定概率进行安全通信,当网络规模较大时存在大量节点无法与移动Sink节点进行通信,从而降低整个网络的数据收集率.针对这一问题,基于算法N-PGPS为网络提供安全通信的前提下,提出了一种基于树的密钥预分配方案IN-PGPS.该方案以移动Sink节点为根节点,与其通信范围内的传感器节点构成一颗局部树,以此提高传感器节点与移动Sink节点连通的概率、提高网络连通性.分析结果表明,与已有的密钥预分配方案相比,IN-PGPS方案有效提高了网络的连通性.     

Equitable transit charges for multiadministration telecommunications networks

We study a multi-administration telecommunications network that is an abstraction of an international network. The nodes represent separate telecommunications administrations that are linked such that alternately-routed calls go through one tandem administration. The cost of the group of circuits between a pair of administrations is borne by them; and when a call between the pair is alternately routed through the tandem node, then the two administrations share the call revenue and pay transit fees to the tandem administration. The numbers of circuits between the administrations are selected to yield a least-cost network that provides a desired level of service, in terms of blocking probabilities, over an entire day. We address the problem of determining transit charges for the alternately-routed calls that are equitable for all of the administrations. Our approach is to derive such charges by equating the system-optimal circuit group sizes to certain hypothetical administration-optimal circuit group sizes. This approach may be of use in other system design problems involving cost sharing among several companies.This research was supported in part by Grant AFOSR 84-0367.     

The gossip problem

A very simple solution can be given to the gossip problem [1] which may be formulated as follows: There are n gossips each of which knows some gossip not known to the others. They communicate by telephone, and whenever one gossip calls another, they tell each other all they know at that time. How many calls are required before each gossip knows everything?     

Dynamic shortest path problems with time-varying costs

This paper concerns the problem of finding shortest paths from one node to all other nodes in networks for which arc costs can vary with time, each arc has a transit time, and parking with a corresponding time-varying cost is allowed at the nodes. The transit times can also take negative values. A general labeling method, as well as several implementations, are presented for finding shortest paths and detecting negative cycles under the assumption that arc traversal costs are piecewise linear and node parking costs are piecewise constant.     

On Cost Allocation in Hub-Like Networks

We consider telecommunication network design in which each pair of nodes can communicate via a direct link and the communication flow can be delivered through any path in the network. The cost of flow through each link is discounted if and only if the amount of flow exceeds a certain threshold. This exploitation of economies of scale encourages the concentration of flows and use of relatively small number of links. We will call such networks hub-like networks. The cost of services delivered through a hub-like network is distributed among its users who may be individuals or organizations with possibly conflicting interests. The cooperation of these users is essential for the exploitation of economies of scale. Consequently, there is a need to find a fair distribution of the cost of providing the service among users of such network. In order to describe this cost allocation problem we formulate the associated cooperative game, to be referred to as the hub-like game. Special attention is paid to users' contribution to economies of scale. We then demonstrate that certain cost allocation solutions (the core and the nucleolus of the hub-like game), which provide users with the incentive to cooperate, can be efficiently characterized.     

Optimal dispatching strategy on an airline network after a schedule perturbation

It often happens that one or more aeroplanes from an airline fleet are taken out of operation for technical reasons and the airline has to operate on the existing network with a reduced number of planes. This paper presents the results of an effort to define a new ad hoc schedule for this situation, so that the total passenger delay on an airline network is minimized. A network is formed, in which nodes represent flights on a given airline network, and arcs are the total time losses on individual flights. The problem of determining a new routing and scheduling plan for the airline fleet is solved by branch and-bound methods. A numerical example illustrates the efficiency of the model.     

Discrete Mobile Centers

Abstract. We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a variable subset of the nodes as cluster centers. This subset has the property that (1) balls of the given radius centered at the chosen nodes cover all the others and (2) the number of centers selected is a constant-factor approximation of the minimum possible. As the nodes move, an event-based kinetic data structure updates the clustering as necessary. This kinetic data structure is shown to be responsive, efficient, local, and compact. The produced cover is also smooth, in the sense that wholesale cluster re-arrangements are avoided. This clustering algorithm is distributed in nature and can enable numerous applications in ad hoc wireless networks, where mobile devices must be interconnected to perform various tasks collaboratively.     

A biobjective optimization model for routing in mobile ad hoc networks

In this paper, the problem of finding optimal paths in mobile ad hoc networks is addressed. More specifically, a novel bicriteria optimization model, which allows the energy consumption and the link stability of mobile nodes to be taken into account simultaneously, is presented. In order to evaluate the validity of the proposed model, a greedy approach is devised. Some preliminary computational experiments have been carried out, in a simulation environment. The numerical results are very encouraging, showing the correctness of the proposed model. Indeed, the selection of a shorter route leads to a more stable route, but to a greater energy consumption. On the other hand, if longer routes are selected the route fragility is increased, but the average energy consumption is reduced.