Sat, 05 Jul 2008 12:44:33 BST CiteULike: erl's watchlist http://www.citeulike.org/user/erl/watchlist CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/pratap/article/2515940 <i>Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE (2007), pp. 814-818.</i><br /><br />Power allocation strategies are devised to maximize the network lifetime of amplify-and-forward (AF) cooperative networks. The paper considers the scenario where one source and multiple partners cooperate to transmit messages to the destination. The powers emitted by the users are subject to the SNR requirement at the destination. First, the power allocation strategy that demands the minimum instantaneous aggregate transmit power of all cooperating partners is described and analyzed. The optimal solution results in a form of selective relaying; namely, the user with the best channel condition is selected to help in relaying the message. However, this instantaneous power minimization strategy does not necessarily maximize the lifetime of battery-limited systems. Then, three AF cooperative schemes were proposed to exploit the channel state information (CSI), the residual battery energy and the QoS requirement. It is shown that the network lifetime can be extended considerably by taking all these three factors into account. Lifetime Maximization for Amplify-and-Forward Cooperative Networks Wan-Jen Huang Yao-Win Hong CCJ Kuo doi:10.1109/WCNC.2007.155 Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE (2007), pp. 814-818. 2008-03-11T17:43:50-00:00 2007 Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE 814 818 cooperativenetworks network wireless http://www.citeulike.org/user/pratap/article/2504305 <i>Wireless Communications, IEEE Transactions on, Vol. 5, No. 6. (2006), pp. 1547-1557.</i><br /><br />Cooperative diversity, which employs multiple nodes for the simultaneous relaying of a given packet in wireless ad hoc networks, has been shown to be an effective means of improving diversity, and, hence, mitigating the detrimental effects of multipath fading. However, in previously proposed cooperative diversity schemes, it has been assumed that coordination among the relays allows for accurate symbol-level timing synchronization at the destination and orthogonal channel allocation, which can be quite costly in terms of signaling overhead in mobile ad hoc networks, which are often defined by their lack of a fixed infrastructure and the difficulty of centralized control. In this paper, cooperative diversity schemes are considered that do not require symbol-level timing synchronization or orthogonal channelization between the relays employed. In the process, a novel minimum mean-squared error (MMSE) receiver is designed for combining disparate inputs in the multiple-relay channel. Outage probability calculations and simulation results demonstrate the not unexpected significant performance gains of the proposed schemes over single-hop transmission, and, more importantly, demonstrate performance comparable to schemes requiring accurate symbol-level synchronization and orthogonal channelization. Asynchronous cooperative diversity Shuangqing Wei DL Goeckel MC Valenti doi:10.1109/TWC.2006.1638675 Wireless Communications, IEEE Transactions on, Vol. 5, No. 6. (2006), pp. 1547-1557. 2008-03-10T19:56:41-00:00 2006 Wireless Communications, IEEE Transactions on 5 6 1547 1557 cooperativenetworks network wireless http://www.citeulike.org/user/pratap/article/2373463 <i>Sensor and Ad Hoc Communications and Networks, 2006. SECON '06. 2006 3rd Annual IEEE Communications Society on, Vol. 1 (2006), pp. 296-305.</i><br /><br />We give a rigorous mathematical analysis of a game-theoretic MAC protocol for wireless networks. We begin with a wireless communication network in which n selfish nodes (agents), which might have different perceived utilities, contend for access on a common wireless communication channel. We first formulate this distributed multiple access problem in terms of a one-shot random access game, and characterize the Nash equilibria of the game. We then look at the asymptotic properties of the system as n rarr infin. When all nodes are identical, the best possible bounds on the rate of convergence of the asymptotic packet arrivals and the channel throughput are given. The analysis of the asymptotic packet arrivals in the heterogeneous case concludes the paper The Analysis of a Game Theoretic MAC Protocol for Wireless Networks H Inaltekin S Wicker doi:10.1109/SAHCN.2006.288434 Sensor and Ad Hoc Communications and Networks, 2006. SECON '06. 2006 3rd Annual IEEE Communications Society on, Vol. 1 (2006), pp. 296-305. 2008-02-14T11:39:24-00:00 2006 Sensor and Ad Hoc Communications and Networks, 2006. SECON '06. 2006 3rd Annual IEEE Communications Society on 1 296 305 gametheory network wireless http://www.citeulike.org/user/pratap/article/2386889 <i>(2007)</i> An Efficient Relay Selection Algorithm for Cooperative Networks Kuy Hwang Young Ko (2007) 2008-02-15T17:15:51-00:00 2007 cooperativenetworks http://www.citeulike.org/user/pratap/article/2386897 <i>IEEE Wireless Communications, Vol. 13, No. 4. (Aug 2006)</i><br /><br />This article outlines one way to address these problems by using the notion of cooperation between wireless nodes. In cooperative communications, multiple nodes in a wireless network work together to form a virtual antenna array. Using cooperation, it is possible to exploit the spatial diversity of the traditional MIMO techniques without each node necessarily having multiple antennas. Multihop networks use some form of cooperation by enabling intermediate nodes to forward the message from source to destination. However, cooperative communication techniques described in this article are fundamentally different in that the relaying nodes can forward the information fully or in part. Also the destination receives multiple versions of the message from the source, and one or more relays and combines these to obtain a more reliable estimate of the transmitted signal as well as higher data rates. The main advantages of cooperative communications are presented. Cooperative Wireless Communication: a cross layer approach Pei Liu Zhifeng Tao Elza Erkip Shivendra Panwar IEEE Wireless Communications, Vol. 13, No. 4. (Aug 2006) 2008-02-15T17:15:51-00:00 2006 IEEE Wireless Communications 13 4 cooperativenetworks cross-layer http://www.citeulike.org/user/pratap/article/2386899 <i>Comput. Networks, Vol. 52, No. 2. (2008), pp. 360-383.</i><br /><br />We survey recent results on wireless networks that are based on analogies with various branches of Physics. We address, among others, the problems of optimally arranging the flow of traffic in wireless sensor networks, finding minimum-cost routes, performing load balancing, optimizing and analyzing cooperative transmissions, calculating the capacity, finding routes that avoid bottlenecks, and developing distributed anycasting protocols. The results are based on establishing analogies between wireless networks and settings from various branches of Physics, such as Electrostatics, Optics, Percolation theory, Diffusion, and others. Many of the results we present hinge on the assumption that the network is massive, i.e., it consists of so many nodes that it can be described in terms of a novel macroscopic view. The macroscopic view is not as detailed as the standard microscopic one, but nevertheless contains enough details to permit a meaningful optimization. Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics S Toumpis Comput. Networks, Vol. 52, No. 2. (2008), pp. 360-383. 2008-02-15T17:15:51-00:00 2008 Comput. Networks 52 2 360 383 Elsevier North-Holland, Inc. computing network http://www.citeulike.org/user/pratap/article/2386900 <i>Comput. Networks, Vol. 49, No. 3. (2005), pp. 299-324.</i><br /><br />We consider various relaying strategies for wireless networks by comparatively examining direct transmission, conventional relaying, and the novel concepts of cooperative relaying. The latter build on two inherent benefits of relaying systems: the spatial diversity offered by the relay channel, and the ability to exploit the broadcast nature of the wireless medium. Studied cooperative protocols include adaptive decode-and-forward schemes as a simple extension of conventional store-and-forward relaying systems, and more complex decode-and-reencoding schemes that realize distributed coding strategies. We provide a unifying analysis for the tractable two-hop case, before extending the consideration to multi-hop scenarios. The analysis is conducted from the perspective of communication over fading channels under limited bandwidth, energy, and end-to-end delay; main parameters include propagation loss, network geometry, and targeted end-to-end spectral efficiency. Main results indicate that (i) cooperative relaying provides attractive benefits for wireless systems whenever temporal and frequency diversity are scarce or not exploited, (ii) using just two hops is reasonable for many practical scenarios, and (iii) the advantages of the studied relaying schemes decrease for higher desired end-to-end spectral efficiency. Cooperative multi-hop transmission in wireless networks Patrick Herhold Ernesto Zimmermann Gerhard Fettweis Comput. Networks, Vol. 49, No. 3. (2005), pp. 299-324. 2008-02-15T17:15:51-00:00 2005 Comput. Networks 49 3 299 324 Elsevier North-Holland, Inc. no-tag http://www.citeulike.org/user/pratap/article/2479281 <i>(20 Jul 2007)</i><br /><br />In this paper, we present the results from over-the-air experiments of a complete implementation of an amplify and forward cooperative communications system. Our custom OFDM-based physical layer uses a distributed version of the Alamouti block code, where the relay sends one branch of Alamouti encoded symbols. First we show analytically and experimentally that amplify and forward protocols are unaffected by carrier frequency offsets at the relay. This result allows us to use a conventional Alamouti receiver without change for the distributed relay system. Our full system implementation shows gains up to 5.5dB in peak power constrained networks. Thus, we can conclusively state that even the simplest form of relaying can lead to significant gains in practical implementations. Building a Cooperative Communications System Patrick Murphy Ashutosh Sabharwal Behnaam Aazhang (20 Jul 2007) 2008-03-06T16:15:23-00:00 2007 cooperativenetworks http://www.citeulike.org/user/pratap/article/910385 <i>Communications Magazine, IEEE, Vol. 42, No. 10. (2004), pp. 74-80.</i><br /><br />Transmit diversity generally requires more than one antenna at the transmitter. However, many wireless devices are limited by size or hardware complexity to one antenna. Recently, a new class of methods called cooperative communication has been proposed that enables single-antenna mobiles in a multi-user environment to share their antennas and generate a virtual multiple-antenna transmitter that allows them to achieve transmit diversity. This article presents an overview of the developments in this burgeoning field. Cooperative communication in wireless networks A Nosratinia TE Hunter A Hedayat Communications Magazine, IEEE, Vol. 42, No. 10. (2004), pp. 74-80. 2006-10-23T19:34:26-00:00 2004 Communications Magazine, IEEE 42 10 74 80 cooperativenetworks tutorial http://www.citeulike.org/user/pratap/article/2504242 <i>Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on, Vol. 3 (2007), pp. III-157-III-160.</i><br /><br />Relaying is often advocated for improving system performance by enhancing spatial diversity in wireless networks. In this paper, we address the issue of energy tradeoff made by relay nodes between transmitting their own data and forwarding other nodes' information in fading channels. We first propose a power control policy in a two-node relay network under which total energy consumption across both nodes is minimized while meeting both outage probability requirements. Based on this power control algorithm, we consider the problem of forming optimal partial coalitions of relays in an N node system subject to selfish constraints: A node participates in a relay pair (or chain) if and only if the energy cost of relaying is lower than the cost of direct transmission by the node to the destination itself. We develop a simple (1,2)-polynomial time bi-criteria approximation for this NP-hard problem. The energy cost provided by the approximation is at most that of the optimal relay pairing, while the constraints are violated by at most a factor of two. The running time of the approximation algorithm is polynomial, as it requires the solution of a relaxed linear programming instance of the original integer programming problem Energy Efficient Relaying and Coalition-Forming in Relay Networks R Kannan Shuangqing Wei doi:10.1109/ICASSP.2007.366496 Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on, Vol. 3 (2007), pp. III-157-III-160. 2008-03-10T19:39:01-00:00 2007 Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on 3 III-157 III-160 cooperativenetworks http://www.citeulike.org/user/pratap/article/1242600 <i>Oikos, Vol. 116, No. 5. (May 2007), pp. 723-727.</i><br /><br />Although scientists typically insist that their research is very exciting and adventurous when they talk to laymen and prospective students, the allure of this enthusiasm is too often lost in the predictable, stilted structure and language of their scientific publications. I present here, a top-10 list of recommendations for how to write consistently boring scientific publications. I then discuss why we should and how we could make these contributions more accessible and exciting. How to write consistently boring scientific literature Kaj Sand-Jensen doi:10.1111/j.2007.0030-1299.15674.x Oikos, Vol. 116, No. 5. (May 2007), pp. 723-727. 2007-04-22T00:13:56-00:00 2007 Oikos 0030-1299 116 5 723 727 Blackwell Publishing no-tag http://www.citeulike.org/user/pratap/article/555179 <i>(1999)</i><br /><br />When n identical randomly located nodes, each capable of transmitting at W bits/sec and using a fixed range, form a wireless network, the throughput (n) obtainable by each node for a randomly chosen destination is ( W p n log n ) bits/sec under a non-interference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission's range is optimally chosen, the bit-distance product that can be transported by the network per second... Capacity of wireless networks P Gupta P Kumar (1999) 2006-03-17T02:06:31-00:00 1999 network wireless http://www.citeulike.org/user/pratap/article/361091 <i>Communications Magazine, IEEE, Vol. 43, No. 9. (2005), pp. S23-S30.</i><br /><br />Wireless mesh networks (WMNs) have emerged as a key technology for next-generation wireless networking. Because of their advantages over other wireless networks, WMNs are undergoing rapid progress and inspiring numerous applications. However, many technical issues still exist in this field. In order to provide a better understanding of the research challenges of WMNs, this article presents a detailed investigation of current state-of-the-art protocols and algorithms for WMNs. Open research issues in all protocol layers are also discussed, with an objective to spark new research interests in this field. A survey on wireless mesh networks IF Akyildiz Xudong Wang doi:10.1109/MCOM.2005.1509968 Communications Magazine, IEEE, Vol. 43, No. 9. (2005), pp. S23-S30. 2005-10-21T21:32:24-00:00 2005 Communications Magazine, IEEE 43 9 S23 S30 mesh network survey wireless http://www.citeulike.org/user/pratap/article/892491 <i>(2006), pp. 358-365.</i> Hot topic: physical-layer network coding Shengli Zhang Soung Liew Patrick Lam doi:10.1145/1161089.1161129 (2006), pp. 358-365. 2006-10-11T08:57:48-00:00 2006 358 365 ACM Press coding network wireless http://www.citeulike.org/user/pratap/article/111698 <i>Isis, Vol. 81, No. 4. (1990), pp. 638-662.</i> The Ph.D. Machine: Building on the Collegiate Base Robert Kohler Isis, Vol. 81, No. 4. (1990), pp. 638-662. 2005-03-02T17:09:29-00:00 1990 Isis 81 4 638 662 gradschool research science http://www.citeulike.org/user/pratap/article/405907 <i>Proceedings of the IEEE, Vol. 77, No. 2. (1989), pp. 257-286.</i><br /><br />This tutorial provides an overview of the basic theory of hidden Markov models (HMMs) as originated by L.E. Baum and T. Petrie (1966) and gives practical details on methods of implementation of the theory along with a description of selected applications of the theory to distinct problems in speech recognition. Results from a number of original sources are combined to provide a single source of acquiring the background required to pursue further this area of research. The author first reviews the theory of discrete Markov chains and shows how the concept of hidden states, where the observation is a probabilistic function of the state, can be used effectively. The theory is illustrated with two simple examples, namely coin-tossing, and the classic balls-in-urns system. Three fundamental problems of HMMs are noted and several practical techniques for solving these problems are given. The various types of HMMs that have been studied, including ergodic as well as left-right models, are described A tutorial on hidden Markov models and selected applications in speech recognition LR Rabiner doi:10.1109/5.18626 Proceedings of the IEEE, Vol. 77, No. 2. (1989), pp. 257-286. 2005-11-23T14:41:21-00:00 1989 Proceedings of the IEEE 77 2 257 286 markov model review tutorial http://www.citeulike.org/user/pratap/article/158906 <i>Commun. ACM, Vol. 48, No. 4. (April 2005), pp. 27-31.</i> Is computer science science? Peter Denning doi:10.1145/1053291.1053309 Commun. ACM, Vol. 48, No. 4. (April 2005), pp. 27-31. 2005-04-12T08:43:06-00:00 2005 Commun. ACM 0001-0782 48 4 27 31 ACM Press computing research science http://www.citeulike.org/user/pratap/article/311339 <i>J. ACM, Vol. 16, No. 1. (January 1969), pp. 3-12.</i> One Man's View of Computer Science RW Hamming doi:10.1145/321495.321497 J. ACM, Vol. 16, No. 1. (January 1969), pp. 3-12. 2005-09-04T05:11:40-00:00 1969 J. ACM 0004-5411 16 1 3 12 ACM Press computing lecture research http://www.citeulike.org/user/pratap/article/549289 <i>Commun. ACM, Vol. 21, No. 10. (October 1978), pp. 847-857.</i> Implementing Quicksort programs Robert Sedgewick doi:10.1145/359619.359631 Commun. ACM, Vol. 21, No. 10. (October 1978), pp. 847-857. 2006-03-13T05:47:33-00:00 1978 Commun. ACM 0001-0782 21 10 847 857 ACM Press algorithms programming sorting http://www.citeulike.org/user/pratap/article/950990 <i>Commun. ACM, Vol. 4, No. 7. (July 1961)</i> Algorithm 64: Quicksort CAR Hoare doi:10.1145/366622.366644 Commun. ACM, Vol. 4, No. 7. (July 1961) 2006-11-18T17:09:18-00:00 1961 Commun. ACM 0001-0782 4 7 ACM Press algorithms programming sorting http://www.citeulike.org/user/pratap/article/467100 <i>Commun. ACM, Vol. 17, No. 12. (December 1974), pp. 667-673.</i><br /><br />1974 ACM Turing Award Lecture [The Turing Award citation read by Bernard A. Galler, chairman of the 1974 Turing Award Committee, on the presentation of this lecture on November 11 at the ACM Annual Conference in San Diego.] The A.M. Turing Award of the ACM is presented annually by the ACM to an individual selected for his contributions of a technical nature made to the computing community. In particular, these contributions should have had significant influence on a major segment of the computer field. "The 1974 A.M. Turing Award is presented to Professor Donald E. Knuth of Stanford University for a number of major contributions to the analysis of algorithms and the design of programming languages, and in particular for his most significant contributions to the 'art of computer programming' through his series of well-known books. The collections of techniques, algorithms and relevant theory in these books have served as a focal point for developing curricula and as an organizing influence on computer science." Such a formal statement cannot put into proper perspective the role which Don Knuth has been playing in computer science, and in the computer industry as a whole. It has been my experience with respect to the first recipient of the Turing Award, Professor Alan J. Perlis, that at every meeting in which he participates he manages to provide the insight into the problems being discussed that becomes the focal point of discussion for the rest of the meeting. In a very similar way, the vocabulary, the examples, the algorithms, and the insight that Don Knuth has provided in his excellent collection of books and papers have begun to find their way into a great many discussions in almost every area of the field. This does not happen easily. As every author knows, even a single volume requires a great deal of careful organization and hard work. All the more must we appreciate the clear view and the patience and energy which Knuth must have bad to plan seven volumes and to set about implementing his plan so carefully and thoroughly. It is significant that this award and the others that he has been receiving are being given to him after three volumes of his work have been published. We are clearly ready to signal to everyone our appreciation of Don Knuth for his dedication and his contributions to our discipline. I am very pleased to have chaired the Committee that has chosen Don Knuth to receive the 1974 A.M. Turing Award of the ACM. Computer programming as an art Donald Knuth doi:10.1145/361604.361612 Commun. ACM, Vol. 17, No. 12. (December 1974), pp. 667-673. 2006-01-17T15:10:24-00:00 1974 Commun. ACM 0001-0782 17 12 667 673 ACM Press programming http://www.citeulike.org/user/pratap/article/935995 <i></i><br /><br />Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such networks, namely the coverage problem, in which we would like to determine whether a region of interest is sufficiently covered by a given set of sensors. This problem is motivated by monitoring applications in sensor networks, as well as robustness concerns and protocol requirements. We show that the coverage problem and some of its variants can be treated in a unified manner using suitable generalizations of the Voronoi diagram. As a result, we are able to give algorithms that have better runtimes than those proposed in previous works (see, e.g., [5, 6]). Our approach also yields efficient algorithms for coverage problems where the sensing region of a sensor is an ellipse or an Lpball, where p >= 1. On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams Anthony So Yinyu Ye 2006-11-08T02:19:49-00:00 voronoi wsn http://www.citeulike.org/user/pratap/article/265124 <i>Wireless Networks, Vol. 11, No. 4. (July 2005), pp. 401-417.</i> Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks Anand Srinivas Eytan Modiano doi:10.1007/s11276-005-1765-0 Wireless Networks, Vol. 11, No. 4. (July 2005), pp. 401-417. 2005-07-26T13:17:17-00:00 2005 Wireless Networks 1022-0038 11 4 401 417 Kluwer Academic Publishers energy manet routing http://www.citeulike.org/user/pratap/article/210436 <i>(7 March 1986)</i> You and Your Research RW Hamming (7 March 1986) 2005-05-25T15:05:44-00:00 1986 research http://www.citeulike.org/user/pratap/article/212642 <i>Behaviour & Information Technology, Vol. 23, No. 1. (January 2004), pp. 33-41.</i> Why are mobile phones annoying? Andrew Monk Jenni Carroll Sarah Parker Mark Blythe Behaviour & Information Technology, Vol. 23, No. 1. (January 2004), pp. 33-41. 2005-05-27T07:17:51-00:00 2004 Behaviour & Information Technology 23 1 33 41 Taylor & Francis behaviour cellphone http://www.citeulike.org/user/pratap/article/949560 <i>(December 1999), pp. 201-290.</i> Voronoi Diagrams - Aurenhammer, Klein F Aurenhammer R Klein (December 1999), pp. 201-290. 2006-11-16T23:37:56-00:00 1999 201 290 Elsevier Publishing House geometry voronoi wireless http://www.citeulike.org/user/pratap/article/935904 <i>Wirel. Commun. Mob. Comput., Vol. 6, No. 2. (March 2006), pp. 247-258.</i><br /><br />In this paper, we propose a general algorithm (based on an unified framework for both routing and geocasting problems), in which message is forwarded to exactly those neighbors which may be best choices for a possible position of destination (using the appropriate criterion). We then propose and discuss new VD-GREEDY and CH-MFR methods and define R-DIR, modified version of existing directional methods. In VD-GREEDY method, these neighbors are determined by intersecting the Voronoi diagram of neighbors with the circle (or rectangle) of possible positions of destination, while the portion of the convex hull of neighboring nodes is analogously used in the CH-MFR method. Routing and geocasting algorithms differ only inside the circle/rectangle. The proposed methods may be also used for the destination search phase allowing the application of different routing schemes after the exact position of destination is discovered. VD-GREEDYand CH-MFR algorithms are loop free, and have smaller flooding rate (with similar success rate) compared to directional method.We proposed to use dominating set concept to reduce flooding ratio significantly, with a marginal impact on success rate and hop count. Simulations, involving the proposed and some known algorithms, are performed for two basic scenarios, one for geocasting and reactive routing, and the other for proactive routing, and both showed that our methods have higher success rate and lower flooding rate compared to existing methods. Voronoi diagram and convex hull based geocasting and routing in wireless networks: Research Articles Ivan Stojmenovic Anand Ruhil DK Lobiyal doi:10.1002/wcm.v6:2 Wirel. Commun. Mob. Comput., Vol. 6, No. 2. (March 2006), pp. 247-258. 2006-11-07T22:30:41-00:00 2006 Wirel. Commun. Mob. Comput. 1530-8669 6 2 247 258 John Wiley and Sons Ltd. geometry routing voronoi wireless http://www.citeulike.org/user/pratap/article/935900 <i>(2003)</i><br /><br />A wireless sensor network is a special kind of ad-hoc network with distributed sensing and processing capability that can be used in a wide range of applications, such as environmental monitoring, industrial applications and precision agriculture. Despite their potential applications, such networks have particular features imposed by resource restrictions, such as low computational power, reduced bandwidth and specially limited power source. In case of a network with a high density of sensor nodes, some problems may arise such as the intersection of sensing area, redundant data, communication interference, and energy waste. A management application is necessary to make the most of network resources. On the other hand, a high-density network can introduce a fault-tolerant mechanism, increase precision, and provide multi-resolution data. The network density control depends on the application. In this paper, we propose a method to set up which nodes should be turned off or on. The management may take the sensor node out of service temporally. Our design uses a Voronoi Diagram, which decomposes the space into regions around each node. That schema could be used in a management architecture for a wireless sensor network. Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach Marcos Luiz Linnyer Ruiz Antonio Loureiro Antonio Fernandes Jos&\#233; (2003) 2006-11-07T22:23:57-00:00 2003 IEEE Computer Society scheduling voronoi wsn http://www.citeulike.org/user/pratap/article/761552 <i>Amer. Math. Monthly, Vol. 100, No. 7. (1993), pp. 644-656.</i> Ramanujan---for lowbrows Bruce Berndt S Bhargava Amer. Math. Monthly, Vol. 100, No. 7. (1993), pp. 644-656. 2006-07-16T23:01:58-00:00 1993 Amer. Math. Monthly 100 7 644 656 history mathematics http://www.citeulike.org/user/pratap/article/309395 <i>PLoS Med, Vol. 2, No. 8. (August 2005)</i><br /><br />SUMMARY: There is increasing concern that most current published research findings are false. The probability that a research claim is true may depend on study power and bias, the number of other studies on the same question, and, importantly, the ratio of true to no relationships among the relationships probed in each scientific field. In this framework, a research finding is less likely to be true when the studies conducted in a field are smaller; when effect sizes are smaller; when there is a greater number and lesser preselection of tested relationships; where there is greater flexibility in designs, definitions, outcomes, and analytical modes; when there is greater financial and other interest and prejudice; and when more teams are involved in a scientific field in chase of statistical significance. Simulations show that for most study designs and settings, it is more likely for a research claim to be false than true. Moreover, for many current scientific fields, claimed research findings may often be simply accurate measures of the prevailing bias. In this essay, I discuss the implications of these problems for the conduct and interpretation of research. Why most published research findings are false. JP Ioannidis doi:10.1371/journal.pmed.0020124 PLoS Med, Vol. 2, No. 8. (August 2005) 2005-08-31T19:31:16-00:00 2005 PLoS Med 1549-1676 2 8 research review http://www.citeulike.org/user/pratap/article/493478 <i>Bull. London Math. Soc., Vol. 29, No. 3. (1997), pp. 257-279.</i><br /><br />The article is an extended version of a lecture given in Oxford in May 1995 at the invitation of the London Mathematical Society and the British Society for the History of Mathematics. It comprehensively evokes the interplay among these three topics over a century, with concentration on the first half, 1895--1945, and sketchy indications about the second half, 1945--1995. The article provides overall figures for the first half, and an extensive overview of important references on each of these topics covering the whole century. The history begins with two key topics: analytic continuation and nowhere differentiability of continuous functions, and concerns various topics of function theory in complex analysis and harmonic analysis. It includes an account of the development of Brownian motion in mathematics and physics. Brownian motion is considered to be of growing importance and has become a central subject. It is shown that Brownian motion provides a precise language for stating important results on analytic continuation of Taylor series and examples of nowhere differentiable continuous functions and other counterexamples. Further applications to Taylor series and analytic functions and to Fourier series in contemporary mathematics are outlined and some open questions are posed. A century of interplay between Taylor series, Fourier series and Brownian motion Jean-Pierre Kahane doi:10.1112/S0024609396002913 Bull. London Math. Soc., Vol. 29, No. 3. (1997), pp. 257-279. 2006-02-03T13:30:16-00:00 1997 Bull. London Math. Soc. 29 3 257 279 history mathematics http://www.citeulike.org/user/pratap/article/467627 <i>Bayesian Analysis, Vol. 1, No. 1. (July 2005), pp. 1-40.</i> When did Bayesian Inference become "Bayesian"? Stephen Fienberg Bayesian Analysis, Vol. 1, No. 1. (July 2005), pp. 1-40. 2006-01-18T00:08:31-00:00 2005 Bayesian Analysis 1 1 1 40 history mathematics statistics http://www.citeulike.org/user/pratap/article/774906 <i>Nature, Vol. 427, No. 6972. (22 January 2004), pp. 297-297.</i> A meeting with Enrico Fermi Freeman Dyson doi:10.1038/427297a Nature, Vol. 427, No. 6972. (22 January 2004), pp. 297-297. 2006-07-26T18:36:22-00:00 2004 Nature 427 6972 297 297 history physics http://www.citeulike.org/user/pratap/article/949526 <i></i> Rules for Referees Bernard Forscher 2006-11-16T22:24:29-00:00 referee research review http://www.citeulike.org/user/pratap/article/770635 <i>IEEE Computer, Vol. 23, No. 4. (1990), pp. 65-71.</i><br /><br />The task of the referee is to evaluate in a timely manner a paper for publication in a specific journal or conference proceedings. This involves determining if the work presented is correct, if the problem studied and the results obtained are new and significant, if the quality of the presentation is satisfactory or can be made so, and what revisions and changes to the paper are necessary and/or desirable. The evaluation must be with regard to the coverage and degree of selectivity of the... The Task of the Referee Alan Smith IEEE Computer, Vol. 23, No. 4. (1990), pp. 65-71. 2006-07-24T02:26:15-00:00 1990 IEEE Computer 23 4 65 71 referee research review http://www.citeulike.org/user/pratap/article/497540 <i>(8 May 2003)</i><br /><br />Recently we discovered (<a href="/abs/cond-mat/0212043">cond-mat/0212043</a>) that the majority of scientific citations are copied from the lists of references used in other papers. Here we show that a model, in which a scientist picks three random papers, cites them,and also copies a quarter of their references accounts quantitatively for empirically observed citation distribution. Simple mathematical probability, not genius, can explain why some papers are cited a lot more than the other. Copied citations create renowned papers? MV Simkin VP Roychowdhury (8 May 2003) 2006-02-08T03:43:47-00:00 2003 research http://www.citeulike.org/user/pratap/article/941244 <i>SIGCHI Bull., Vol. 29, No. 3. (July 1997), pp. 20-22.</i> How to get a Ph.D. and have a life, too Richard Baker doi:10.1145/264853.264863 SIGCHI Bull., Vol. 29, No. 3. (July 1997), pp. 20-22. 2006-11-13T15:09:58-00:00 1997 SIGCHI Bull. 0736-6906 29 3 20 22 ACM Press gradschool research http://www.citeulike.org/user/pratap/article/949259 <i>Technical report (27 July 2004)</i> Principles of Effective Research Michael Nielsen Technical report (27 July 2004) 2006-11-16T17:19:00-00:00 2004 Technical report gradschool research http://www.citeulike.org/user/pratap/article/108496 <i>(1998), pp. 181-190.</i> Power-aware routing in mobile ad hoc networks Suresh Singh Mike Woo CS Raghavendra doi:10.1145/288235.288286 (1998), pp. 181-190. 2005-03-01T18:07:22-00:00 1998 181 190 ACM Press manet routing http://www.citeulike.org/user/pratap/article/945421 <i>Gatech Newsletter, No. Spring 2001. (2001)</i> The Different Faces of Mentoring RW Schafer Gatech Newsletter, No. Spring 2001. (2001) 2006-11-15T23:18:10-00:00 2001 Gatech Newsletter Spring 2001 gradschool research http://www.citeulike.org/user/pratap/article/945352 <i>Wireless Communications and Mobile Computing, Vol. 2, No. 5. (2002), pp. 483-502.</i><br /><br />In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models and realistic movements of the mobile users (i.e. a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e. entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e. group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding on a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated. Copyright © 2002 John Wiley & Sons, Ltd. A survey of mobility models for ad hoc network research Tracy Camp Jeff Boleng Vanessa Davies doi:10.1002/wcm.72 Wireless Communications and Mobile Computing, Vol. 2, No. 5. (2002), pp. 483-502. 2006-11-15T22:58:46-00:00 2002 Wireless Communications and Mobile Computing 2 5 483 502 manet mobility model http://www.citeulike.org/user/pratap/article/945349 <i>Control Systems Magazine, IEEE, Vol. 19, No. 1. (1999), pp. 102-108.</i> A student's guide to research DS Bernstein doi:10.1109/MCS.1999.745776 Control Systems Magazine, IEEE, Vol. 19, No. 1. (1999), pp. 102-108. 2006-11-15T22:49:40-00:00 1999 Control Systems Magazine, IEEE 19 1 102 108 gradschool research http://www.citeulike.org/user/pratap/article/945345 <i>Potentials, IEEE, Vol. 24, No. 3. (2005), pp. 11-45.</i><br /><br />This article is a collection of tips and an overview of the process through which all graduate students pass during their journey. Before starting a graduate program, it is important to realize that this is a long-term investment in career. Once the students are in graduate school, it is necessary to structure their personal life to fit the demands of the program. A graduate program starts by the choice of the advisor during the first year. Sometimes this is done even before the student is accepted into the program. During the program, interaction with the colleagues and professors is necessary. Getting to know them is essential to the program and to the life. Reading may not be enough. Read, analyze, criticize, discuss, implement. During reading note making is good. A good practice is to have a printed copy of the paper and annotate the thoughts and observations on it. Establishing the schedule with deadlines and trying to follow it. Participating in conferences and scientific events is essential. Organizing the thoughts and discussion with the colleagues drive out the fear. Students should produce at least one paper for a good conference that it will pave the way for success. This can be considered the minimal requirement to emphasize the importance/relevance of the thesis. The successful grad student MM Moro VP Braganholo AC Nacul MR Fornari Potentials, IEEE, Vol. 24, No. 3. (2005), pp. 11-45. 2006-11-15T22:42:23-00:00 2005 Potentials, IEEE 24 3 11 45 gradschool research http://www.citeulike.org/user/pratap/article/945342 <i>Frontiers in Education Conference, 1999. FIE '99. 29th Annual, Vol. 2 (1999), pp. 12D7/12-12D7/16 vol.2.</i><br /><br />In the College of Engineering and Architecture at North Dakota State University (NDSU), the authors have implemented a new course in research methods for their Ph.D. students. The general theme of the course is the elimination of all barriers to graduate student achievement that exist apart from the main task of learning and achieving within a research specialty. The student acquires the information and tools necessary to be successful: (i) in accomplishing the formalities of the degree programs; and (ii) in starting and sustaining research. As a class, engineering research philosophies, methods and ethics are studied. The student-advisor relationship is explored and help in formation of the student thesis committee is offered. Literature searches are introduced, and a philosophy of entering a specialty area is explored. This course has the potential for increasing graduate student retention and reducing overall faculty workload. As yet, this course is in its initial stages of development and results are preliminary, but the authors' hopes are high Research methods for the graduate student DA Rogers DA Smith Frontiers in Education Conference, 1999. FIE '99. 29th Annual, Vol. 2 (1999), pp. 12D7/12-12D7/16 vol.2. 2006-11-15T22:37:28-00:00 1999 Frontiers in Education Conference, 1999. FIE '99. 29th Annual 2 12D7/12 12D7/16 vol.2 gradschool research http://www.citeulike.org/user/pratap/article/945332 <i>Wireless Communications and Mobile Computing, Vol. 6, No. 7. (2006), pp. 917-931.</i><br /><br />In this work we address the issue of deafness and hidden terminal problem in mobile ad hoc networks (MANETs) using directional antennas. To minimize these effects, we propose a MAC protocol for directional Antennas (MDA) which employs a novel enhanced directional network allocation vector (EDNAV) scheme and an efficient technique of diametrically opposite directions (DOD) transmission of RTS and CTS packets. We compare MDA with IEEE 802.11 and two recently proposed directional MAC (DMAC) schemes and results show that MDA outperforms these protocols in the majority of scenarios investigated. We also point out that the performance does depend on the network topology and the traffic pattern. Copyright © 2006 John Wiley & Sons, Ltd. Minimizing the effect of deafness and hidden terminal problem in wireless ad hoc networks using directional antennas Hrishikesh Gossain Carlos Cordeiro Dharma Agrawal doi:10.1002/wcm.429 Wireless Communications and Mobile Computing, Vol. 6, No. 7. (2006), pp. 917-931. 2006-11-15T22:18:16-00:00 2006 Wireless Communications and Mobile Computing 6 7 917 931 directional_antennas hidden_terminal manet wireless http://www.citeulike.org/user/pratap/article/361086 <i>Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on, Vol. 2 (2005), pp. 60-63 vol.2.</i><br /><br />The wireless mesh network has been an emerging technology in recent years. Because the transmission medium used in networking backhaul APs is radio, the wireless mesh network is not only easy and cost effective in deployment, but also has good scalability in coverage area and capacity. The IEEE 802.11 MAC protocol has been adopted as the de-facto medium access control. In this paper, we assess the fitness of the IEEE 802.11 over wireless mesh networks. We focus on the question: Does the backhaul networking of a wireless mesh network have the capability to support multimedia transport? The backhaul must guarantee the throughput and the latency. Furthermore, the QoS guarantee is required for multimedia applications. We contend that it is really necessary to consider what the key is to be changed in the IEEE 802.11 so that it can adapt the IEEE 802.11 MAC protocol to wireless mesh networks. Through the study of existing solutions, we analyze the previous work and sketch the contours of the directions to achieve our goal in this article. IEEE 802.11 MAC protocol over wireless mesh networks: problems and perspectives Tzu-Jane Tsai Ju-Wei Chen Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on, Vol. 2 (2005), pp. 60-63 vol.2. 2005-10-21T21:14:47-00:00 2005 Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on 2 60 63 vol.2 80211 mac meshnetworks wireless http://www.citeulike.org/user/pratap/article/361101 <i>Wireless Communications and Networking Conference, 2005 IEEE, Vol. 4 (2005), pp. 2051-2056 Vol. 4.</i><br /><br />Multiple channels are available for use in IEEE 802.11. Multiple channels can increase the available network capacity, but require new protocols to exploit the available capacity. This paper studies the problem of improving the capacity of multi-channel wireless networks by using multiple interfaces. We consider the scenario when multiple interfaces are available, but the number of available interfaces is lesser than the number of available channels. We provide a classification of interface assignment strategies, and propose a new strategy that does not require modifications to IEEE 802.11. We also identify routing heuristics that are suitable for use with the proposed interface assignment strategy. Routing and interface assignment in multi-channel multi-interface wireless networks P Kyasanur NH Vaidya Wireless Communications and Networking Conference, 2005 IEEE, Vol. 4 (2005), pp. 2051-2056 Vol. 4. 2005-10-21T22:25:54-00:00 2005 Wireless Communications and Networking Conference, 2005 IEEE 4 2051 2056 Vol. 4 80211 multi-channel routing wireless http://www.citeulike.org/user/pratap/article/108495 <i>(2004), pp. 114-128.</i><br /><br />We present a new metric for routing in multi-radio, multi-hop wireless networks. We focus on wireless networks with stationary nodes, such as community wireless networks.The goal of the metric is to choose a high-throughput path between a source and a destination. Our metric assigns weights to individual links based on the Expected Transmission Time (ETT) of a packet over the link. The ETT is a function of the loss rate and the bandwidth of the link. The individual link weights are combined into a path metric called Weighted Cumulative ETT (WCETT) that explicitly accounts for the interference among links that use the same channel. The WCETT metric is incorporated into a routing protocol that we call Multi-Radio Link-Quality Source Routing.We studied the performance of our metric by implementing it in a wireless testbed consisting of 23 nodes, each equipped with two 802.11 wireless cards. We find that in a multi-radio environment, our metric significantly outperforms previously-proposed routing metrics by making judicious use of the second radio. Routing in multi-radio, multi-hop wireless mesh networks Richard Draves Jitendra Padhye Brian Zill doi:10.1145/1023720.1023732 (2004), pp. 114-128. 2005-03-01T18:05:23-00:00 2004 114 128 ACM Press meshnetworks multi-hop multi-radio routing wireless http://www.citeulike.org/user/pratap/article/352517 <i>(2005), pp. 185-199.</i><br /><br />Over the past few years, wireless networking technologies have made vast forays into our daily lives. Today, one can find 802.11 hardware and other personal wireless technology employed at homes, shopping malls, coffee shops and airports. Present-day wireless network deployments bear two important properties: they are unplanned, with most access points (APs) deployed by users in a spontaneous manner, resulting in highly variable AP densities; and they are unmanaged, since manually configuring and managing a wireless network is very complicated. We refer to such wireless deployments as being chaotic.In this paper, we present a study of the impact of interference in chaotic 802.11 deployments on end-client performance. First, using large-scale measurement data from several cities, we show that it is not uncommon to have tens of APs deployed in close proximity of each other. Moreover, most APs are not configured to minimize interference with their neighbors. We then perform trace-driven simulations to show that the performance of end-clients could suffer significantly in chaotic deployments. We argue that end-client experience could be significantly improved by making chaotic wireless networks self-managing. We design and evaluate automated power control and rate adaptation algorithms to minimize interference among neighboring APs, while ensuring robust end-client performance. Self-management in chaotic wireless deployments Aditya Akella Glenn Judd Srinivasan Seshan Peter Steenkiste doi:10.1145/1080829.1080849 (2005), pp. 185-199. 2005-10-17T02:17:08-00:00 2005 185 199 ACM Press 80211 deployment management wireless http://www.citeulike.org/user/pratap/article/365117 <i>(2005), pp. 269-277.</i><br /><br />Currently, large-scale deployments of mesh networks are being planned for Philadelphia as well as other cities. The performance of such networks has never been examined through simulation or through any other means. In this paper we perform detailed simulations of mesh networks in several urban environments and evaluate the performance of these networks. The simulations utilize realistic ray-tracing and other propagation models. The mobility of nodes is based on models derived from several movement and time use surveys including the US Department of Labor's recent time use study that includes travel diaries from over 20,000 people. Basic performance issues such as connectivity, capacity, and several application oriented performance metrics as a function of the density infrastructure (base stations and fix wireless relays) are examined. It is found that a high density infrastructure is required to achieve reasonable coverage, in particular, the density must be higher than is currently considered by most deployments. While allowing mobile nodes to act as relays improves coverage, it does not necessarily improve the performance received by the application. It is found that in general, there is a significant difference between the fraction of nodes that are able to communicate with a base station and the fraction of nodes that received acceptable application layer performance. Performance of urban mesh networks Vinay Sridhara Jonghyun Kim Stephan Bohacek doi:10.1145/1089444.1089492 (2005), pp. 269-277. 2005-10-26T03:41:24-00:00 2005 269 277 ACM Press meshnetworks performance