Sun, 27 Jul 2008 07:38:10 BST CiteULike: s-fujii's library [372 articles] http://www.citeulike.org/user/s-fujii CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/s-fujii/article/3041801 <i>IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 26, No. 5. (2004), pp. 612-625.</i><br /><br />Model trees are an extension of regression trees that associate leaves with multiple regression models. In this paper, a method for the data-driven construction of model trees is presented, namely, the Stepwise Model Tree Induction (SMOTI) method. Its main characteristic is the induction of trees with two types of nodes: regression nodes, which perform only straight-line regression, and splitting nodes, which partition the feature space. The multiple linear model associated with each leaf is then built stepwise by combining straight-line regressions reported along the path from the root to the leaf. In this way, internal regression nodes contribute to the definition of multiple models and have a "global” effect, while straight-line regressions at leaves have only "local” effects. Experimental results on artificially generated data sets show that SMOTI outperforms two model tree induction systems, M5' and RETIS, in accuracy. Results on benchmark data sets used for studies on both regression and model trees show that SMOTI performs better than RETIS in accuracy, while it is not possible to draw statistically significant conclusions on the comparison with M5'. Model trees induced by SMOTI are generally simple and easily interpretable and their analysis often reveals interesting patterns. Top-Down Induction of Model Trees with Regression and Splitting Nodes Donato Malerba Floriana Esposito Michelangelo Ceci Annalisa Appice doi:10.1109/TPAMI.2004.1273937 IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 26, No. 5. (2004), pp. 612-625. 2008-07-25T05:59:08-00:00 2004 IEEE Transactions on Pattern Analysis and Machine Intelligence 26 5 612 625 IEEE Computer Society model-tree http://www.citeulike.org/user/s-fujii/article/3035540 <i>Int. J. Wire. Mob. Comput., Vol. 1, No. 2. (February 2006), pp. 121-130.</i> Energy efficient Chessboard Clustering and routing in heterogeneous sensor networks Xiaojiang Du Yang Xiao doi:10.1504/IJWMC.2006.012471 Int. J. Wire. Mob. Comput., Vol. 1, No. 2. (February 2006), pp. 121-130. 2008-07-23T01:06:20-00:00 2006 Int. J. Wire. Mob. Comput. 1 2 121 130 Inderscience Publishers energy-efficiency routing sensor-networks http://www.citeulike.org/user/s-fujii/article/1234665 <i>INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 2 (2004), pp. 1023-1031 vol.2.</i><br /><br />We present an autoregressive model for modelling samples autocorrelation from the same access point in WLAN location determination systems. Our work is in the context of the Horus system, which is a probabilistic WLAN location determination system. We show that the autocorrelation between consecutive samples from the same access point can be as high as 0.9. Using our model, we describe a technique to use multiple signal strength samples from each access point, taking the high autocorrelation into account, to achieve better accuracy. Implementation of the technique in the Horus system shows that the average system accuracy is increased by more than 50%. Our results show that assuming independence of samples from the same access point can lead to degraded performance as the number of samples used in the estimation algorithm is increased, due to the wrong independence assumption. We also discuss how to incorporate the new technique with other algorithms for enhancing the performance of WLAN location determination systems. Handling samples correlation in the Horus system M Youssef A Agrawala INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 2 (2004), pp. 1023-1031 vol.2. 2007-04-18T18:08:33-00:00 2004 INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies 2 1023 1031 vol.2 fingerprint horus indoor localization range-base rssi signal-strength http://www.citeulike.org/user/s-fujii/article/1249641 <i>Communications, 2004 IEEE International Conference on, Vol. 3 (2004), pp. 1360-1364 Vol.3.</i><br /><br />To our knowledge, the indoor location system which currently achieves the best performance using inexpensive off-the-shelf equipment locates a mobile within 1.5 meters with probability 77% in hallways. Even while maintaining this accuracy, the system often reports logical errors such as the mobile in the wrong cubicle of an office or even on the wrong side of a wall when broadening the domain of application to within rooms. We propose an extension of the work using the same Markov localization framework, however incorporating system dynamics (necessitating no post-processing of the output) and motion constraints which implicitly encode the physical properties of the survey area. Our system retains the advantages of its predecessor of low cost, wireless LAN connectivity and security, and large-scale deployment, however extending the survey area from simple hallways to the whole office environment, while maintaining the same precision without logical errors. Robust location using system dynamics and motion constraints C Gentile L Klein-Berndt Communications, 2004 IEEE International Conference on, Vol. 3 (2004), pp. 1360-1364 Vol.3. 2007-04-25T07:42:47-00:00 2004 Communications, 2004 IEEE International Conference on 3 1360 1364 Vol.3 fingerprint indoor localization range-base rssi signal-strength http://www.citeulike.org/user/s-fujii/article/2998356 <i>Ad Hoc Networks, Vol. 6, No. 7. (September 2008), pp. 1078-1097.</i><br /><br />In scenarios where sensors are placed randomly, redundant deployment is essential for ensuring adequate field coverage. This redundancy needs to be efficiently exploited by periodically selecting a subset of nodes (referred to as a "cover") that actively monitor the field, and putting the remaining nodes to sleep. We consider networks in which sensors are not aware of their locations or the relative directions of their neighbors. We develop several geometric and density-based tests that enable a location-unaware sensor to intelligently determine whether it should turn itself off without degrading the quality of field coverage. These tests rely on distance measurements and exchanged two-hop neighborhood information. We design an algorithm (LUC) that exploits these tests for computing covers. Based on this algorithm, we propose two distributed protocols (LUC-I and LUC-P) that periodically select covers and switch between them so as to extend the network lifetime and tolerate unexpected failures. Our protocols are highly efficient in terms of message overhead and processing complexity. We implement LUC-I in TinyOS and evaluate it using the TOSSIM simulator. Experimental results indicate that our approach significantly prolongs the network lifetime and achieves comparable performance to location-aware protocols. Location-unaware coverage in wireless sensor networks Ossama Younis Marwan Krunz Srinivasan Ramasubramanian doi:10.1016/j.adhoc.2007.10.003 Ad Hoc Networks, Vol. 6, No. 7. (September 2008), pp. 1078-1097. 2008-07-14T07:38:39-00:00 2008 Ad Hoc Networks 6 7 1078 1097 coverage-problem http://www.citeulike.org/user/s-fujii/article/2998354 <i>Ad Hoc Networks, Vol. 6, No. 7. (September 2008), pp. 1031-1050.</i><br /><br />In an adversarial environment, various kinds of attacks become possible if malicious nodes could claim fake locations that are different from their physical locations. In this paper, we propose a secure localization mechanism that detects existence of these nodes, termed as phantom nodes, without relying on any trusted entities, an approach significantly different from the existing ones. The proposed mechanism enjoys a set of nice features. First, it does not have any central point of attack. All nodes play the role of verifier, by generating local map, i.e. a view constructed based on ranging information from its neighbors. Second, this distributed and localized construction results in strong robustness against adversaries: even when the number of phantom nodes is greater than that of honest nodes, we can filter out most of the phantom nodes. Our analytical results as well as simulations under realistic noisy settings demonstrate that the proposed mechanism is effective in the presence of a large number of phantom nodes. Secure localization with phantom node detection Joengmin Hwang Tian He Yongdae Kim doi:10.1016/j.adhoc.2007.10.005 Ad Hoc Networks, Vol. 6, No. 7. (September 2008), pp. 1031-1050. 2008-07-14T07:37:24-00:00 2008 Ad Hoc Networks 6 7 1031 1050 secure-localization http://www.citeulike.org/user/s-fujii/article/2998351 <i>Computer Communications, Vol. 31, No. 12. (30 July 2008), pp. 2925-2933.</i><br /><br />Currently, most electronic toll collection (ETC) systems around the world are implemented by DSRC (dedicated short range communication) technology. However, area wide integrated MLFF (multilane free flow) road charging system is now currently on its development to replace DSRC-based ETC systems. VPS (vehicle positioning system) based ETC system is a category of location based service which tolls vehilces by determining if they move into the charging zone. It is an evolutional technology for area wide integrated road charging solution, which achieves the goal of electronic payment or electronic toll collection by a totally different scheme comparing to traditional DSRC-based technology. In this paper, the design and implementation of VPS-based ETC system is detailedly discussed, and a debit transaction VPS system field test had been practiced in the freeway of Taiwan. Design and implementation of electronic toll collection system based on vehicle positioning system techniques Wei-Hsun Lee Shian-Shyong Tseng Ching-Hung Wang doi:10.1016/j.comcom.2008.05.014 Computer Communications, Vol. 31, No. 12. (30 July 2008), pp. 2925-2933. 2008-07-14T07:34:47-00:00 2008 Computer Communications 31 12 2925 2933 positioning vehicle http://www.citeulike.org/user/s-fujii/article/2911155 <i>IEEE Transactions on Mobile Computing, Vol. 7, No. 7. (July 2008), pp. 869-883.</i> Learning Adaptive Temporal Radio Maps for Signal-Strength-Based Location Estimation Jie Yin Qiang Yang Lionel Ni doi:10.1109/TMC.2007.70764 IEEE Transactions on Mobile Computing, Vol. 7, No. 7. (July 2008), pp. 869-883. 2008-06-20T17:13:47-00:00 2008 IEEE Transactions on Mobile Computing 1536-1233 7 7 869 883 IEEE Educational Activities Department location signal-strength http://www.citeulike.org/user/s-fujii/article/2911138 <i>Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on (2005), pp. 652-655 Vol. 1.</i><br /><br />The paper presents a localization algorithm for wireless sensor network (WSN) units which estimates the spatial position of a probe unit by exploiting received signal strength information. The algorithm is particularly suitable for indoor applications where the presence of furniture, objects, walls and the induced reflection effects create a strongly non linear attenuation field map which makes ineffective the use of traditional 1/r/sup k/ theoretical signal attenuation models. The field map is learned from samples acquired during a preliminary environment exploration campaign. The performances of the developed algorithm stay at the top of its class; we experimentally verified that it is able to locate nodes with an accuracy of 1.2 m and a confidence of 50% in a MICA2 WSN. A RF map-based localization algorithm for indoor environments C Alippi A Mottarella G Vanini doi:10.1109/ISCAS.2005.1464672 Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on (2005), pp. 652-655 Vol. 1. 2008-06-20T17:05:05-00:00 2005 Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on 652 655 Vol. 1 indoor localization signal-strength http://www.citeulike.org/user/s-fujii/article/556628 <i>Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on (2004), pp. 406-414.</i><br /><br />We characterize the fundamental limits of localization using signal strength in indoor environments. Signal strength approaches are attractive because they are widely applicable to wireless sensor networks and do not require additional localization hardware. We show that although a broad spectrum of algorithms can trade accuracy for precision, none has a significant advantage in localization performance. We found that using commodity 802.11 technology over a range of algorithms, approaches and environments, one can expect a median localization error of 10 ft and 97th percentile of 30 ft. We present strong evidence that these limitations are fundamental and that they are unlikely to transcend without a fundamentally more complex environmental models or additional localization infrastructure. The limits of localization using signal strength: a comparative study E Elnahrawy Xiaoyan Li RP Martin doi:10.1109/SAHCN.2004.1381942 Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on (2004), pp. 406-414. 2006-03-19T11:57:34-00:00 2004 Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on 406 414 localization signal-strength http://www.citeulike.org/user/s-fujii/article/2911123 <i>Computer Communications, Vol. 31, No. 10. (25 June 2008), pp. 2496-2504.</i><br /><br />Localization is an important topic in wireless sensor networks because sensor nodes are randomly scattered over a region and can get connected into a network on their own. Adjusting the transmission power levels has an important impact on energy efficiency and network lifetime in wireless sensor networks. In this work, we proposed a localization protocol with an adaptive power control in wireless sensor networks. Each node can transmit beacon packets at different power levels. Whenever a node receives beacon packets transferred at different power levels, it will adaptively select a beacon packet to estimate the distance to the landmark. When a sensor node has estimated the distances to three landmarks, it can compute for its location using triangulation. Simulation results showed that the proposed algorithm can improve the error rate of localization. A localization protocol with adaptive power control in wireless sensor networks Wen-Hwa Liao Kuei-Ping Shih Yu-Chee Lee doi:10.1016/j.comcom.2008.03.020 Computer Communications, Vol. 31, No. 10. (25 June 2008), pp. 2496-2504. 2008-06-20T16:53:48-00:00 2008 Computer Communications 31 10 2496 2504 localization power sensor-networks http://www.citeulike.org/user/s-fujii/article/2911003 <i>ACM Trans. Sen. Netw., Vol. 4, No. 3. (May 2008), pp. 1-42.</i> The theory of trackability with applications to sensor networks Valentino Crespi George Cybenko Guofei Jiang doi:10.1145/1362542.1362547 ACM Trans. Sen. Netw., Vol. 4, No. 3. (May 2008), pp. 1-42. 2008-06-20T16:50:23-00:00 2008 ACM Trans. Sen. Netw. 1550-4859 4 3 1 42 ACM sensor-networks tracking http://www.citeulike.org/user/s-fujii/article/2910997 <i>(2008), pp. 361-370.</i> Challenging benchmark for location discovery in ad hoc networks: foundations and applications Davood Shamsi Farinaz Koushanfar Miodrag Potkonjak doi:10.1145/1374618.1374667 (2008), pp. 361-370. 2008-06-20T16:46:47-00:00 2008 361 370 ACM localization http://www.citeulike.org/user/s-fujii/article/2910993 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 12, No. 1. (January 2008), pp. 49-51.</i> Exploiting environmental properties for wireless localization Shu Chen Yingying Chen Wade Trappe doi:10.1145/1374512.1374528 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 12, No. 1. (January 2008), pp. 49-51. 2008-06-20T16:44:02-00:00 2008 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 12 1 49 51 ACM localization http://www.citeulike.org/user/s-fujii/article/2910990 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 12, No. 1. (January 2008), pp. 59-61.</i> UNAGI: a protocol testbed with practical smart antennas for ad hoc networks Naoya Kohmura Hikaru Mitsuhashi Masahiro Watanabe Masaki Bandai Sadao Obana Takashi Watanabe doi:10.1145/1374512.1374533 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 12, No. 1. (January 2008), pp. 59-61. 2008-06-20T16:39:07-00:00 2008 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 12 1 59 61 ACM localization http://www.citeulike.org/user/s-fujii/article/1234664 <i>Pervasive Computing and Communications, 2003. (PerCom 2003). Proceedings of the First IEEE International Conference on (2003), pp. 143-150.</i><br /><br />We present a WLAN location determination technique, the Joint Clustering technique, that uses: (1) signal strength probability distributions to address the noisy wireless channel, and (2) clustering of locations to reduce the computational cost of searching the radio map. The Joint Clustering technique reduces computational cost by more than an order of magnitude, compared to the current state of the art techniques, allowing non-centralized implementation on mobile clients. Results from 802.11-equipped iPAQ implementations show that the new technique gives user location to within 7 feet with over 90% accuracy. WLAN location determination via clustering and probability distributions MA Youssef A Agrawala Udaya Pervasive Computing and Communications, 2003. (PerCom 2003). Proceedings of the First IEEE International Conference on (2003), pp. 143-150. 2007-04-18T18:07:45-00:00 2003 Pervasive Computing and Communications, 2003. (PerCom 2003). Proceedings of the First IEEE International Conference on 143 150 signal-strength wlan http://www.citeulike.org/user/s-fujii/article/1107298 <i>Pervasive Computing (2005), pp. 116-133.</i><br /><br />Location awareness is an important capability for mobile computing. Yet inexpensive, pervasive positioning—a requirement for wide-scale adoption of location-aware computing—has been elusive. We demonstrate a radio beacon-based approach to location, called Place Lab, that can overcome the lack of ubiquity and high-cost found in existing location sensing approaches. Using Place Lab, commodity laptops, PDAs and cell phones estimate their position by listening for the cell IDs of fixed radio beacons, such as wireless access points, and referencing the beacons’ positions in a cached database. We present experimental results showing that 802.11 and GSM beacons are sufficiently pervasive in the greater Seattle area to achieve 20-30 meter median accuracy with nearly 100% coverage measured by availability in people’s daily lives. Place Lab: Device Positioning Using Radio Beacons in the Wild Anthony Lamarca Yatin Chawathe Sunny Consolvo Jeffrey Hightower Ian Smith James Scott Timothy Sohn James Howard Jeff Hughes Fred Potter Jason Tabert Pauline Powledge Gaetano Borriello Bill Schilit doi:10.1007/11428572_8 Pervasive Computing (2005), pp. 116-133. 2007-02-14T19:45:49-00:00 2005 Pervasive Computing 116 133 outdoor radio-beacon-based http://www.citeulike.org/user/s-fujii/article/2735995 <i>Ad Hoc Networks, Vol. 6, No. 2. (April 2008), pp. 307-324.</i><br /><br />One of the main issues in hybrid wireless networks is vertical handoff. Dropping probability is one of the important parameters that must be considered in planning the wireless communication systems. However, there has not been much effort in dropping rate reduction in loosely coupled hybrid wireless networks. In loosely coupled WLAN/cellular systems the system administrator of the WLAN is different from the cellular one. Therefore, in these situations, reducing the dropping probability based on classical methods such as using reserved guard channels is difficult. A handoff from a WLAN to a cellular system occurs when a multi-mode device moves out of the WLANs coverage area. This is an upward vertical handoff in a hybrid network. In this paper, we propose to employ ad hoc relaying during the upward vertical handoff in a hybrid WLAN/cellular system. Two-hop and multi-hop relaying approaches, which we propose in this paper, improve the dropping probability regardless of the number of reserved channels. Simulation results support the effectiveness of the proposed methods. Also, practical routing protocols are proposed in order to implement the suggested relaying methods. Mobile ad hoc relaying for upward vertical handoff in hybrid WLAN/cellular systems Pejman Khadivi Terence Todd Shadrokh Samavi Hossein Saidi Dongmei Zhao doi:10.1016/j.adhoc.2007.01.005 Ad Hoc Networks, Vol. 6, No. 2. (April 2008), pp. 307-324. 2008-04-30T02:54:00-00:00 2008 Ad Hoc Networks 6 2 307 324 hybrid-wireless http://www.citeulike.org/user/s-fujii/article/2735991 <i>Personal Communications, IEEE [see also IEEE Wireless Communications], Vol. 8, No. 1. (2001), pp. 40-47.</i><br /><br />The latest developments and experimentation in mobile ad hoc networks show that MANETs will be an alternative candidate in many private and public multimedia networks. Current interest in MANET systems has grown considerably because they can rapidly and economically extend the boundaries of any terrestrial network; integrating MANET and GSM offers a great number of benefits (e.g., increasing capacity, improving coverage) at the cost of increasing the complexity of the mobile terminal and its battery consumption. The objective of this article is to address new concepts in the GSM system, dealing with both standardized features as well as theoretically and technologically feasible improvements, which contribute to evolutionary changes in general. Dynamic evolution of GSM presents a platform for Universal Mobile Telecommunication System introduction and major trends in GSM development are addressed, in particular progress towards a generic platform to accommodate relaying capability in GSM cellular networks. A GSM simulation tool has been constructed for quantifying the integrated system characteristics On the relaying capability of next-generation GSM cellular networks Neonakis R Tafazolli doi:10.1109/98.904898 Personal Communications, IEEE [see also IEEE Wireless Communications], Vol. 8, No. 1. (2001), pp. 40-47. 2008-04-30T02:49:54-00:00 2001 Personal Communications, IEEE [see also IEEE Wireless Communications] 8 1 40 47 hybrid-wireless http://www.citeulike.org/user/s-fujii/article/2729614 <i>Wireless Broadband and Ultra Wideband Communications, 2007. AusWireless 2007. The 2nd International Conference on (2007), pp. 78-78.</i><br /><br />Wireless mesh networks have recently gained a lot of popularity due to their rapid deployment and instant communication capabilities. These networks comprise of somewhat static multi-radio Mesh Routers, which essentially provide connectivity between the mobile single-radio mesh clients. Special routing protocols are employed, which facilitate routing between the mesh routers as well as between the mesh routers and the mobile clients. AODV is a well known routing protocol that can discover routes on-the-fly in a mobile environment. The protocol is highly scalable and can support thousands of nodes making it an ideal protocol for wireless mesh networks. However, as the protocol was actually developed for single-radio nodes, it frequently lacks the ability to exploit the potential offered by the mesh routers and, hence, sub-optimal routing takes place in a mesh environment. This paper gives an overview of four variants of the AODV routing protocol that can potentially be used for mesh formation. In order to determine their aptness for application to hybrid wireless mesh networks, this paper presents their characteristics and functionality, and then provides a comparison and discussion of their respective merits and drawbacks. Performance Comparison of Reactive Routing Protocols for Hybrid Wireless Mesh Networks S Khan AA Pirzada M Portmann doi:10.1109/AUSWIRELESS.2007.55 Wireless Broadband and Ultra Wideband Communications, 2007. AusWireless 2007. The 2nd International Conference on (2007), pp. 78-78. 2008-04-28T10:38:40-00:00 2007 Wireless Broadband and Ultra Wideband Communications, 2007. AusWireless 2007. The 2nd International Conference on 78 78 hybrid-wireless routing http://www.citeulike.org/user/s-fujii/article/2716843 <i>International Journal of Wireless Information Networks (July 2001), pp. 177-187.</i><br /><br />The number of mobile devices connecting to networks independently of a fixed point of attachment is increasing. These wireless networks differ in bandwidth, size and location of the coverage area, access costs and network characteristics. Mobile multimedia devices such as PDA's, palmtops and laptops will also vary greatly in size and processing power. The common denominator however, is that all these devices will require the optimal delivery of networked multimedia data. One interesting problem is the delay imposed upon mobile receivers when switching between wireless cells. We provide a solution to this in the form of an extension of Mobile IP's hand-off algorithm. Our solution involves the exploitation of mobility prediction to predict a mobile terminal's future location based on its previous history (i.e., the last cell that it has been in) and for the media stream to be already present and cached by next cells base station ready for receiving by the mobile device. We cater specifically for continuous media applications, which can be especially effected by severe degradation in quality due to movement between cells. We present the results of a series of simulations of the Mobile IP++ protocol, which demonstrate the effectiveness of the ad-hoc protocol when mobile hosts move in predictable patterns between cells. Minimizing the Handoff Latency in Ad-Hoc Networks When Streaming Media to Mobile Devices K Curran International Journal of Wireless Information Networks (July 2001), pp. 177-187. 2008-04-25T06:22:48-00:00 2001 International Journal of Wireless Information Networks 1068-9605 177 187 Springer ad-hoc-network handoff http://www.citeulike.org/user/s-fujii/article/2716738 <i>Wireless Communications, IEEE Transactions on, Vol. 6, No. 10. (2007), pp. 3589-3599.</i><br /><br />Mobility tracking based on data from wireless cellular networks is a key challenge that has been recently investigated both from a theoretical and practical point of view. This paper proposes Monte Carlo techniques for mobility tracking in wireless communication networks by means of received signal strength indications. These techniques allow for accurate estimation of mobile station's (MS) position and speed. The command process of the MS is represented by a first-order Markov model which can take values from a finite set of acceleration levels. The wide range of acceleration changes is covered by a set of preliminary determined acceleration values. A particle filter and a Rao-Blackwellised particle filter are proposed and their performance is evaluated both over synthetic and real data. A comparison with an extended Kalman filter (EKF) is performed with respect to accuracy and computational complexity. With a small number of particles the RBPF gives more accurate results than the PF and the EKF. A posterior Cramer Rao lower bound (PCRLB) is calculated and it is compared with the filters' root- mean-square error performance. Mobility Tracking in Cellular Networks Using Particle Filtering L Mihaylova D Angelova S Honary DR Bull CN Canagarajah B Ristic doi:10.1109/TWC.2007.05912 Wireless Communications, IEEE Transactions on, Vol. 6, No. 10. (2007), pp. 3589-3599. 2008-04-25T05:10:32-00:00 2007 Wireless Communications, IEEE Transactions on 6 10 3589 3599 cellular-networks mobility http://www.citeulike.org/user/s-fujii/article/920511 <i>Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE, Vol. 6 (2001), pp. 3673-3680 vol.6.</i><br /><br />Recently, research for wireless ATM systems has progressed effectively to extend broadband communication networks to the wireless area. In wireless ATM, the radius of a cell becomes smaller and causes frequent handover. This causes low QoS and the disconnection of the call if there are insufficient channels for handover. In order to prevent this, this paper suggests a handover algorithm that can guarantee quality of service (QoS) easily, and do channel assignment effectively. By considering the fact that most users have a constant movement pattern, the channels needed for handover can be reserved, so that the required QoS is maintained during handover. The suggested algorithm decreases the dropping probability of handover calls and makes the channel allocation schemes more efficient A mobility prediction handover algorithm for effective channel assignment in wireless ATM Hoon-Ki Kim Jae-Il Jung doi:10.1109/GLOCOM.2001.966367 Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE, Vol. 6 (2001), pp. 3673-3680 vol.6. 2006-10-31T14:28:54-00:00 2001 Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE 6 3673 3680 vol.6 mobility-prediction http://www.citeulike.org/user/s-fujii/article/2712529 <i>Wirel. Netw., Vol. 11, No. 5. (September 2005), pp. 757-774.</i> A framework for seamless roaming across heterogeneous next generation wireless networks Nirmala Shenoy Wirel. Netw., Vol. 11, No. 5. (September 2005), pp. 757-774. 2008-04-24T09:27:43-00:00 2005 Wirel. Netw. 1022-0038 11 5 757 774 Kluwer Academic Publishers roaming http://www.citeulike.org/user/s-fujii/article/2712518 <i>J. Parallel Distrib. Comput., Vol. 65, No. 8. (August 2005), pp. 963-982.</i> Handoff management in wireless data networks using topography-aware mobility prediction Alaaeldin Sleem Anup Kumar doi:10.1016/j.jpdc.2004.12.006 J. Parallel Distrib. Comput., Vol. 65, No. 8. (August 2005), pp. 963-982. 2008-04-24T09:22:08-00:00 2005 J. Parallel Distrib. Comput. 0743-7315 65 8 963 982 Academic Press, Inc. mobility-prediction http://www.citeulike.org/user/s-fujii/article/2712505 <i>(2007), pp. 209-216.</i> A mobility prediction based relay deployment framework for conserving power in manets Aravindhan Venkateswaran Venkatesh Sarangan Thomas La Porta Raj Acharya doi:10.1145/1298126.1298164 (2007), pp. 209-216. 2008-04-24T09:19:33-00:00 2007 209 216 ACM mobility-prediction http://www.citeulike.org/user/s-fujii/article/2712388 <i>Mob. Netw. Appl., Vol. 6, No. 4. (August 2001), pp. 351-360.</i> Wireless ad hoc multicast routing with mobility prediction Sung-Ju Lee William Su Mario Gerla Mob. Netw. Appl., Vol. 6, No. 4. (August 2001), pp. 351-360. 2008-04-24T09:01:09-00:00 2001 Mob. Netw. Appl. 6 4 351 360 Kluwer Academic Publishers mobility-prediction routing http://www.citeulike.org/user/s-fujii/article/2712379 <i>(2005), pp. 144-151.</i> Impact of mobility prediction on the temporal stability of MANET clustering algorithms Aravindhan Venkateswaran Venkatesh Sarangan Natarajan Gautam Raj Acharya doi:10.1145/1089803.1089979 (2005), pp. 144-151. 2008-04-24T08:59:41-00:00 2005 144 151 ACM mobility-prediction http://www.citeulike.org/user/s-fujii/article/1571204 <i>(2005), pp. 10-20.</i> Entropy-based knowledge spreading and application to mobility prediction Jean-Marc Fran\ccois Guy Leduc doi:10.1145/1095921.1095924 (2005), pp. 10-20. 2007-08-17T07:27:49-00:00 2005 10 20 ACM Press mobility-prediction http://www.citeulike.org/user/s-fujii/article/2712331 <i>Ad Hoc Networks, Vol. 6, No. 2. (April 2008), pp. 168-194.</i><br /><br />The ad hoc networks are completely autonomous wireless networks where all the users are mobile. These networks do not work on any infrastructure and the mobiles communicate either directly or via other nodes of the network by establishing routes. These routes are prone to frequent ruptures because of nodes mobility. If the future movement of the mobile can be predicted in a precise way, the resources reservation can be made before be asked, which enables the network to provide a better QoS. In this aim, we propose a virtual dynamic topology, which on one hand, will organize the network as well as possible and decreases the impact of mobility, and on the other hand, is oriented user mobility prediction. Our prediction scheme uses the evidence theory of Dempster-Shafer in order to predict the future position of the mobile by basing itself on relevant criteria. These ones are related to mobility and network operation optimisation. The proposed scheme is flexible and can be extended to a general framework. To show the relevance of our scheme, we combine it with a routing protocol. Then, we implemented the prediction-oriented topology and the prediction scheme which performs on it. We implemented also a mobility prediction based routing protocol. Simulations are made according to a set of elaborate scenarios. A cluster based mobility prediction scheme for ad hoc networks Lyes Dekar Hamamache Kheddouci doi:10.1016/j.adhoc.2006.11.002 Ad Hoc Networks, Vol. 6, No. 2. (April 2008), pp. 168-194. 2008-04-24T08:50:50-00:00 2008 Ad Hoc Networks 6 2 168 194 ad-hoc-network mobility-prediction http://www.citeulike.org/user/s-fujii/article/1020627 <i>Wireless Communications, IEEE [see also IEEE Personal Communications], Vol. 11, No. 4. (2004), pp. 16-28.</i><br /><br />Next-generation wireless systems are envisioned to have an IP-based infrastructure with the support of heterogeneous access technologies. One of the research challenges for next generation all-IP-based wireless systems is the design of intelligent mobility management techniques that take advantage of IP-based technologies to achieve global roaming among various access technologies. Next-generation wireless systems call for the integration and interoperation of mobility management techniques in heterogeneous networks. In this article the current state of the art for mobility management in next-generation all-IP-based wireless systems is presented. The previously proposed solutions based on different layers are reviewed, and their qualitative comparisons are given. A new wireless network architecture for mobility management is introduced, and related open research issues are discussed in detail. A survey of mobility management in next-generation all-IP-based wireless systems IF Akyildiz Jiang Xie S Mohanty doi:10.1109/MWC.2004.1325888 Wireless Communications, IEEE [see also IEEE Personal Communications], Vol. 11, No. 4. (2004), pp. 16-28. 2006-12-31T12:55:35-00:00 2004 Wireless Communications, IEEE [see also IEEE Personal Communications] 11 4 16 28 mobility-management survey http://www.citeulike.org/user/s-fujii/article/926012 <i>INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, Vol. 1 (2005), pp. 161-171 vol. 1.</i><br /><br />In wireless sensor networks (WSNs), sensor location plays a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the information provided by these beacon nodes. In this paper, we show that efficient location discovery can be achieved in sensor networks without using beacons. We propose a beacon-less location discovery scheme, based on the following observations: in practice, it is quite common that sensors are deployed in groups, i.e., sensors are put into n groups, and sensors in the same group are deployed together at the same deployment point (the deployment point is different from the sensors' final resident location). Sensors from the same group can land in different locations, and those locations usually follow a probability distribution that can be known a priori. With this prior deployment knowledge, we show that sensors can discover their locations by observing the group memberships of its neighbors. We model the location discovery problem as a statistical estimation problem, and we use the maximum likelihood estimation method to estimate the location. We have conducted experiments to evaluate our scheme. A beacon-less location discovery scheme for wireless sensor networks Lei Fang Wenliang Du Peng Ning doi:10.1109/INFCOM.2005.1497888 INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, Vol. 1 (2005), pp. 161-171 vol. 1. 2006-11-02T21:05:30-00:00 2005 INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE 1 161 171 vol. 1 localization sensor-networks http://www.citeulike.org/user/s-fujii/article/2712025 <i>Personal, Indoor and Mobile Radio Communications, 2006 IEEE 17th International Symposium on (2006), pp. 1-8.</i><br /><br />This paper proposes a link quality-based hybrid routing (LQHR) protocol for wireless ad hoc networks. LQHR takes account of link quality such as SNR between adjacent nodes and the link utilization level of each node. In LQHR, each node maintains routing information produced by OLSR, which is a proactive routing protocol for ad hoc networks. When a source makes a communication request, it finds a route to the destination node on the basis of the link quality. We implemented LQHR on an experimental network, where laptop PCs were arranged on the same floor of a building, and audio-video streams were transmitted along a route selected by LQHR. To evaluate the effectiveness of LQHR in audio-video transmission, we compared application-level QoS of LQHR with that of the standard OLSR in the presence of another traffic flow in the network. As a result, we found that the routes selected by LQHR can provide shorter transmission delays and lower loss ratios in the transmission of the audio-video streams than those selected by the standard OLSR LQHR: A Link Quality-based Hybrid Routing Protocol for Wireless Ad Hoc Networks Ken Nakaoka Makoto Oba Shuji Tasaka doi:10.1109/PIMRC.2006.254161 Personal, Indoor and Mobile Radio Communications, 2006 IEEE 17th International Symposium on (2006), pp. 1-8. 2008-04-24T07:33:25-00:00 2006 Personal, Indoor and Mobile Radio Communications, 2006 IEEE 17th International Symposium on 1 8 link-quality routing http://www.citeulike.org/user/s-fujii/article/2705934 <i>Wireless Pervasive Computing, 2006 1st International Symposium on (2006), 6 pp..</i><br /><br />Routing paths in mobile ad hoc networks are easily disrupted due to the mobility of nodes. Therefore, it is desirable to find a routing path such that all edges in the path are long-lived. Based on the ad hoc on-demand distance vector routing (AODV) protocol, we propose an AODV-RSS (AODV with received signal strength) routing protocol such that connectivities of links in the route found can sustain longer. The AODV-RSS algorithm uses the received signal strength, RSS9 and the received signal strength changing rate, ARSS, to predict the link available time, LAT. Using the LAT as a constraint, our method will find out a satisfying routing path. Simulation results show that our routing algorithm can greatly improve the quality of the routing path in route connection time, and route reestablishment frequency. Long-lived path routing with received signal strength for ad hoc networks Ruay-Shiung Chang Shing-Jiuan Leu doi:10.1109/ISWPC.2006.1613588 Wireless Pervasive Computing, 2006 1st International Symposium on (2006), 6 pp.. 2008-04-23T06:19:07-00:00 2006 Wireless Pervasive Computing, 2006 1st International Symposium on 6 pp. routing http://www.citeulike.org/user/s-fujii/article/2705532 <i>Electronics Letters, Vol. 39, No. 5. (2003), pp. 485-486.</i><br /><br />An enhanced link stability estimation model for ad hoc wireless networks is presented. In the comparison of three models, the routing with the proposed model finds a route that has the longest lifetime with little increase in hop-length. Especially, the route has two times longer lifetime than the shortest path route. Signal strength-based link stability estimation in ad hoc wireless networks Geunhwi Lim Kwangwook Shim Jin Kim H Yoon doi:10.1049/el:20030287 Electronics Letters, Vol. 39, No. 5. (2003), pp. 485-486. 2008-04-23T05:00:50-00:00 2003 Electronics Letters 39 5 485 486 ad-hoc-network http://www.citeulike.org/user/s-fujii/article/303893 <i>(2005), pp. 17-20.</i> Signal Strength-Based Routing Protocol for Mobile Ad Hoc Networks San-Yuan Wang Jia-Yu Liu Chun-Chien Huang Mao-Yuan Kao Yi-Ho Li doi:10.1109/AINA.2005.311 (2005), pp. 17-20. 2005-08-25T14:01:32-00:00 2005 17 20 IEEE Computer Society manet routing http://www.citeulike.org/user/s-fujii/article/1571141 <i>IEEE Transactions on Mobile Computing, Vol. 4, No. 3. (May 2005), pp. 285-296.</i><br /><br />Member-Nirupama Bulusu and Senior Member-Andrey V. Savkin and Member-Sanjay Jha Node Localization Using Mobile Robots in Delay-Tolerant Sensor Networks Pubudu Pathirana doi:10.1109/TMC.2005.43 IEEE Transactions on Mobile Computing, Vol. 4, No. 3. (May 2005), pp. 285-296. 2007-08-17T06:31:57-00:00 2005 IEEE Transactions on Mobile Computing 1536-1233 4 3 285 296 IEEE Educational Activities Department localization sensor-networks http://www.citeulike.org/user/s-fujii/article/2681067 <i>(2004)</i> Location Discovery Andreas Savvides Mani Srivastava (2004) 2008-04-17T08:35:06-00:00 2004 A Johon wiley & sons, inc., publication localization survey http://www.citeulike.org/user/s-fujii/article/2680931 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 6, No. 3. (July 2002), pp. 67-78.</i> Location errors in wireless embedded sensor networks: sources, models, and effects on applications Sasha Slijepcevic Seapahn Megerian Miodrag Potkonjak doi:10.1145/581291.581301 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 6, No. 3. (July 2002), pp. 67-78. 2008-04-17T07:31:20-00:00 2002 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 6 3 67 78 ACM location-error sensor-networks http://www.citeulike.org/user/s-fujii/article/2678466 <i>ACM Trans. Sen. Netw., Vol. 3, No. 2. (June 2007)</i> An analysis of unreliability and asymmetry in low-power wireless links Marco Bhaskar Krishnamachari doi:10.1145/1240226.1240227 ACM Trans. Sen. Netw., Vol. 3, No. 2. (June 2007) 2008-04-16T16:25:07-00:00 2007 ACM Trans. Sen. Netw. 1550-4859 3 2 ACM link http://www.citeulike.org/user/s-fujii/article/1652091 <i>ACM Trans. Sen. Netw., Vol. 3, No. 3. (August 2007)</i> Collaborative broadcasting and compression in cluster-based wireless sensor networks Anh Hoang Mehul Motani doi:10.1145/1267060.1267065 ACM Trans. Sen. Netw., Vol. 3, No. 3. (August 2007) 2007-09-13T14:43:09-00:00 2007 ACM Trans. Sen. Netw. 1550-4859 3 3 ACM Press broadcast cluster sensor-networks http://www.citeulike.org/user/s-fujii/article/2678444 <i>ACM Trans. Sen. Netw., Vol. 3, No. 4. (October 2007)</i> Localization using boundary sensors: An analysis based on graph theory Yunhui Zheng David Brady Pankaj Agarwal doi:10.1145/1281492.1281496 ACM Trans. Sen. Netw., Vol. 3, No. 4. (October 2007) 2008-04-16T16:15:43-00:00 2007 ACM Trans. Sen. Netw. 1550-4859 3 4 ACM boundary localization http://www.citeulike.org/user/s-fujii/article/2678441 <i>ACM Trans. Sen. Netw., Vol. 4, No. 1. (January 2008), pp. 1-31.</i> Sensor localization in concave environments Chen Wang Li Xiao doi:10.1145/1325651.1325654 ACM Trans. Sen. Netw., Vol. 4, No. 1. (January 2008), pp. 1-31. 2008-04-16T16:14:29-00:00 2008 ACM Trans. Sen. Netw. 1550-4859 4 1 1 31 ACM localization http://www.citeulike.org/user/s-fujii/article/926097 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 10, No. 1. (January 2006), pp. 1-12.</i> Localization on the pushpin computing sensor network using spectral graph drawing and mesh relaxation Michael Broxton Joshua Lifton Joseph Paradiso doi:10.1145/1119759.1119760 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 10, No. 1. (January 2006), pp. 1-12. 2006-11-02T22:51:56-00:00 2006 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 10 1 1 12 ACM Press localization sensor-networks http://www.citeulike.org/user/s-fujii/article/2678428 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 2. (April 2007), pp. 45-46.</i> CAESAR: an urban location service for VANETs Francesco Giudici doi:10.1145/1282221.1282228 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 2. (April 2007), pp. 45-46. 2008-04-16T16:08:02-00:00 2007 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 11 2 45 46 ACM location-service http://www.citeulike.org/user/s-fujii/article/2678426 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 2. (April 2007), pp. 14-28.</i> Simultaneous adaptive localization of a wireless sensor network Koushil Sreenath Frank Lewis Dan Popa doi:10.1145/1282221.1282223 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 2. (April 2007), pp. 14-28. 2008-04-16T16:07:10-00:00 2007 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 11 2 14 28 ACM localization sensor-networks http://www.citeulike.org/user/s-fujii/article/2678424 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 3. (July 2007), pp. 71-83.</i> Predicting link quality using supervised learning in wireless sensor networks Yong Wang Margaret Martonosi Li-Shiuan Peh doi:10.1145/1317425.1317434 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 3. (July 2007), pp. 71-83. 2008-04-16T16:05:43-00:00 2007 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 11 3 71 83 ACM learning link-quality sensor-networks http://www.citeulike.org/user/s-fujii/article/2678423 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 3. (July 2007), pp. 48-58.</i> An algorithm for fast, model-free tracking indoors Aiyou Chen Cristina Harko Diane Lambert Phil Whiting doi:10.1145/1317425.1317431 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 3. (July 2007), pp. 48-58. 2008-04-16T16:04:58-00:00 2007 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 11 3 48 58 ACM indoor tracking http://www.citeulike.org/user/s-fujii/article/2678418 <i>Computer Communications, Vol. 31, No. 6. (18 April 2008), pp. 1053-1054.</i> Advanced location-based services Miguel Labrador Katina Michael Axel Küpper doi:10.1016/j.comcom.2008.01.033 Computer Communications, Vol. 31, No. 6. (18 April 2008), pp. 1053-1054. 2008-04-16T16:00:13-00:00 2008 Computer Communications 31 6 1053 1054 location-service http://www.citeulike.org/user/s-fujii/article/2678414 <i>Computer Communications, Vol. 31, No. 6. (18 April 2008), pp. 1055-1066.</i><br /><br />Many techniques have been developed to perform indoor location. Each strategy has its own advantages and drawbacks, with the application demanding location information the main determinant of the system to be used. In this paper, a system is presented that serves location to innovative services for elderly and disabled people, ranging from alarm and monitoring to support for navigation and leisure. The system uses ZigBee and ultrasound to fulfill the application requirements, differing in this respect from all other existing systems. ZUPS (ZigBee and ultrasound positioning system) provides wide multicell coverage, easy extension, robustness even in crowded scenarios, different levels of precision depending on the user's profile and service requirements (from a few centimeters to meters), limited infrastructure requirements, simple calibration, and cost-effectiveness. The system has been evaluated from the technical, functional, and usability standpoints, with satisfactory results, and its suitability has also been demonstrated in a residence for people with disabilities located in Zaragoza, Spain. Location-based services for elderly and disabled people A Marco R Casas J Falco H Gracia JI Artigas A Roy doi:10.1016/j.comcom.2007.12.031 Computer Communications, Vol. 31, No. 6. (18 April 2008), pp. 1055-1066. 2008-04-16T15:57:51-00:00 2008 Computer Communications 31 6 1055 1066 location-service