Sun, 27 Jul 2008 07:54:02 BST CiteULike: erl's library [28 articles] http://www.citeulike.org/user/erl/order/to_read CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/erl/article/902188 <i>Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on, Vol. 1 (2000), pp. 444-453 vol.1.</i><br /><br />With the rapid progress of high-speed network technology, the communication speed between hosts will reach Gbit/s. So it is important to investigate the traditional TCP/IP protocol stack to find out whether it is suitable for high-speed communication and can provide QoS or not. Based on this consideration, the LINUX TCP/IP stack's structure, the buffer management, the procedures for sending and receiving data, and the interaction with the OS are analyzed in this paper. A probing node method is proposed to investigate the internal structure of the stack. With this method, the throughput of the stack, the time consuming of each layer and the queuing of the IP layer at high speed are tested. Our experiments show that the throughput of the TCP/IP stack of LINUX can reach 360 Mbit/s at the sending side and 150 Mbit/s when the local host device is used for bi-directional operation, the protocol stack can he improved to support higher speed; the percentages of the various costs of the TCP/IP protocol suite have changed greatly, zero-copy and zero-scan techniques cannot improve the performance dramatically; there is no queuing at the receiving side of the IP layer, so FCFS (first come first served scheduler) is enough, but a more sophisticated packet scheduler such as WFQ (weighted fair queuing) is needed at the sending layer of the IP layer to provide QoS in the future Analysis and evaluation of the TCP/IP protocol stack of LINUX Guo Chuanxiong Zheng Shaoren Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on, Vol. 1 (2000), pp. 444-453 vol.1. 2006-10-17T19:14:06-00:00 2000 Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on 1 444 453 vol.1 rerouting_time_and_queueing http://www.citeulike.org/user/erl/article/696022 <i>Advanced Information Networking and Applications, 2006. AINA 2006. 20th International Conference on, Vol. 1 (2006), pp. 741-746.</i><br /><br />In this work, we present a Cross-Layer Forwarding Strategy (CLFS), which is based on the cooperation between the new IEEE 802.11e MAC protocol (EDCA) and the On-Demand AODV routing protocol. The proposal aims to minimize the number of Forwarding nodes (FN) by hop, in the network. By this way, we decrease the contention amount and we improve the medium utilization. The selection of FN is based on maximum battery level and queue occupancy. These informations are injected into routing requests and replies crossing nodes in the network. Then, each node is able to select the FN that will participate in path establishment. In order to maintain a fair node capability, the forwarding procedure is dynamically distributed and assigned to nodes in the network. Moreover, an Adaptive Transmission Opportunity (ATXOP) mechanism, is derived from the EDCA. It aims to share the transmission channel fairly according to traffic load of nodes. We demonstrate that CLFS has good network performance, specially in term of throughput, that can be significantly improved. Moreover, it achieves a high degree of fairness among applications. A cross-layer feature for an efficient forwarding strategy in wireless ad hoc networks L Romdhani C Bonnet Advanced Information Networking and Applications, 2006. AINA 2006. 20th International Conference on, Vol. 1 (2006), pp. 741-746. 2006-06-14T17:21:09-00:00 2006 Advanced Information Networking and Applications, 2006. AINA 2006. 20th International Conference on 1 741 746 sota_in_cross_layer_routing http://www.citeulike.org/user/erl/article/695080 <i>SIGCOMM Comput. Commun. Rev., Vol. 34, No. 1. (January 2004), pp. 69-74.</i> Opportunistic routing in multi-hop wireless networks Sanjit Biswas Robert Morris doi:10.1145/972374.972387 SIGCOMM Comput. Commun. Rev., Vol. 34, No. 1. (January 2004), pp. 69-74. 2006-06-13T18:02:15-00:00 2004 SIGCOMM Comput. Commun. Rev. 0146-4833 34 1 69 74 ACM Press sota_in_cross_layer_routing http://www.citeulike.org/user/erl/article/695078 <i>(2002)</i><br /><br />This report addresses the problem of using directional antennas in ad hoc routing. Although the problems with utilizing directional antennas have been visited in the past, the research has been confined mostly to issues related to medium access control. To determine whether directional antennas are beneficial to ad hoc networks, it is necessary to evaluate the impact of directional antennas on the performance of routing protocols as well. In this report, we evaluate the performance of a... Ad Hoc Routing Using Directional Antennas R Choudhury N Vaidya (2002) 2006-06-13T18:00:57-00:00 2002 sota_in_cross_layer_routing http://www.citeulike.org/user/erl/article/695072 <i>Wireless Communications, IEEE [see also IEEE Personal Communications], Vol. 12, No. 1. (2005), pp. 3-11.</i><br /><br />Recently, in an effort to improve the performance of wireless networks, there has been increased interest in protocols that rely on interactions between different layers. However, such cross-layer design can run at cross purposes with sound and longer-term architectural principles, and lead to various negative consequences. This motivates us to step back and reexamine holistically the issue of cross-layer design and its architectural ramifications. We contend that a good architectural design leads to proliferation and longevity, and illustrate this with some historical examples. Even though the wireless medium is fundamentally different from the wired one, and can offer undreamt of modalities of cooperation, we show that the conventional layered architecture is a reasonable way to operate wireless networks, and is in fact optimal up to an order. However the temptation and perhaps even the need to optimize by incorporating cross-layer adaptation cannot be ignored, so we examine the issues involved. We show that unintended cross-layer interactions can have undesirable consequences on overall system performance. We illustrate them by certain cross-layer schemes loosely based on recent proposals. We attempt to distill a few general principles for cross-layer design. Moreover, unbridled cross-layer design can lead to spaghetti design, which can stifle further innovation and be difficult to upkeep. At a critical time when wireless networks may be on the cusp of massive proliferation, the architectural considerations may be paramount. We argue that it behooves us to exercise caution while engaging in cross-layer design. A cautionary perspective on cross-layer design V Kawadia PR Kumar Wireless Communications, IEEE [see also IEEE Personal Communications], Vol. 12, No. 1. (2005), pp. 3-11. 2006-06-13T17:48:48-00:00 2005 Wireless Communications, IEEE [see also IEEE Personal Communications] 12 1 3 11 sota_in_cross_layer_routing http://www.citeulike.org/user/erl/article/635472 <i></i><br /><br />We suggest a simple cross-layer feedback mechanism from the Medium Access Control (MAC) layer to the Address Resolution Protocol (ARP) module which can improve the performance of Mobile Ad hoc Network (MANET) routing protocols. It involves allowing the MAC layer of a mobile node to learn of the IP to MAC address mapping of nodes from broadcast packets that it receives. We show that allowing the MAC layer to create ARP table entries leads to dramatic improvements in route acquisition times using ... Improving the Performance of MANET Routing Protocols using Cross-Layer Feedback Srinath Perur Leena Wadia Sridhar Iyer 2006-05-15T10:02:10-00:00 sota_in_cross_layer_routing http://www.citeulike.org/user/erl/article/2587773 <i>Communications, 2004 IEEE International Conference on, Vol. 7 (2004), pp. 4050-4056 Vol.7.</i><br /><br />A prerequisite for a widespread and successful deployment of proactive ad-hoc networking technology is its ability to provide easy access to the Internet. Normally, proactive routing protocols provide routing messages that establish default routes to ensure connectivity for outgoing IPv4 packets destined for the Internet. However, mechanisms to ensure connectivity for incoming IPv4 packets from the Internet are yet poorly documented in published material. Possible solutions include implementing a modified mobile IPv4 foreign agent (MIP-FA) or network address translation (NAT) on each Internet gateway node in the ad hoc network. In this paper we discuss different strategies for providing Internet access to proactive ad hoc networks. We also describe problems experienced in our lab test-bed with default routes under the condition of site multi-homing. Based on this experience, we propose working solutions for Internet access from proactive ad hoc networks. Internet connectivity for multi-homed proactive ad hoc networks PE Engelstad A Tonnesen A Hafslund G Egeland doi:10.1109/ICC.2004.1313311 Communications, 2004 IEEE International Conference on, Vol. 7 (2004), pp. 4050-4056 Vol.7. 2008-03-25T22:34:47-00:00 2004 Communications, 2004 IEEE International Conference on 7 4050 4056 Vol.7 gw_positioning http://www.citeulike.org/user/erl/article/2966687 <i>Communications, 2007. ICC '07. IEEE International Conference on (2007), pp. 4955-4960.</i><br /><br />In this paper, we address the problem of gateway placement for throughput optimization in multi-hop wireless mesh networks. Assume that each mesh node in the mesh network has a traffic demand. Given the number of gateways need to be deployed (denoted by k) and the interference model in the network, we study where to place exactly k gateways in the mesh network such that the total throughput is maximized while it also ensures a certain fairness among all mesh nodes. We propose a novel grid-based gateway deployment method using a cross-layer throughput optimization. Our proposed method can also be extended to work with multi-channel and multi-radio mesh networks. Simulation result demonstrates that our method can effectively exploit the resources available and perform much better than random and fixed deployment methods. Gateway Placement for Throughput Optimization in Wireless Mesh Networks Fan Li Yu Wang Xiang-Yang Li doi:10.1109/ICC.2007.818 Communications, 2007. ICC '07. IEEE International Conference on (2007), pp. 4955-4960. 2008-07-05T22:34:21-00:00 2007 Communications, 2007. ICC '07. IEEE International Conference on 4955 4960 gw_positioning http://www.citeulike.org/user/erl/article/384370 <i>Wireless Communications, IEEE [see also IEEE Personal Communications], Vol. 10, No. 5. (2003), pp. 8-14.</i><br /><br />Wireless mesh networks are an alternative technology for last-mile broadband Internet access. In WMNs, similar to ad hoc networks, each user node operates not only as a host but also as a router; user packets are forwarded to and from an Internet-connected gateway in multihop fashion. The meshed topology provides good reliability, market coverage, and scalability, as well as low upfront investments. Despite the recent startup surge in WMNs, much research remains to be done before WMNs realize their full potential. This article tackles the problem of determining the exact capacity of a WMN. The key concept we introduce to enable this calculation is the bottleneck collision domain, defined as the geographical area of the network that bounds from above the amount of data that can be transmitted in the network. We show that for WMNs the throughput of each node decreases as O(1/n), where n is the total number of nodes in the network. In contrast with most existing work on ad hoc network capacity, we do not limit our study to the asymptotic case. In particular, for a given topology and the set of active nodes, we provide exact upper bounds on the throughput of any node. The calculation can be used to provision the network, to ensure quality of service and fairness. The theoretical results are validated by detailed simulations. The nominal capacity of wireless mesh networks Jangeun Jun ML Sichitiu Wireless Communications, IEEE [see also IEEE Personal Communications], Vol. 10, No. 5. (2003), pp. 8-14. 2005-11-09T00:21:25-00:00 2003 Wireless Communications, IEEE [see also IEEE Personal Communications] 10 5 8 14 gw_positioning http://www.citeulike.org/user/erl/article/620447 <i>Military Communications Conference, 2001. MILCOM 2001. Communications for Network-Centric Operations: Creating the Information Force. IEEE, Vol. 2 (2001), pp. 1008-1013 vol.2.</i><br /><br />Traditional wireless ad hoc medium access control (MAC) protocols often utilize control frames such as request-to-send (RTS), clear-to-send (CTS) and acknowledgement (ACK) to reliably deliver unicast data. However, little effort has been given to improve the reliable delivery of broadcast data. Often, broadcast data are transmitted blindly without any consideration of hidden terminals. In this paper, we proposed a novel MAC protocol, broadcast medium window (BMW) that reliably delivers broadcast data. MAC reliable broadcast in ad hoc networks K Tang M Gerla doi:10.1109/MILCOM.2001.985991 Military Communications Conference, 2001. MILCOM 2001. Communications for Network-Centric Operations: Creating the Information Force. IEEE, Vol. 2 (2001), pp. 1008-1013 vol.2. 2006-05-09T12:17:25-00:00 2001 Military Communications Conference, 2001. MILCOM 2001. Communications for Network-Centric Operations: Creating the Information Force. IEEE 2 1008 1013 vol.2 smf http://www.citeulike.org/user/erl/article/2397362 <i>SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 3. (July 2007), pp. 1-11.</i> Evaluation of distributed cover set algorithms in mobile ad hoc network for simplified multicast forwarding Joseph Macker Ian Downard Justin Dean Brian Adamson doi:10.1145/1317425.1317426 SIGMOBILE Mob. Comput. Commun. Rev., Vol. 11, No. 3. (July 2007), pp. 1-11. 2008-02-19T05:45:04-00:00 2007 SIGMOBILE Mob. Comput. Commun. Rev. 1559-1662 11 3 1 11 ACM smf http://www.citeulike.org/user/erl/article/1895994 <i>Military Communications Conference, 2004. MILCOM 2004. IEEE, Vol. 3 (2004), pp. 1429-1436 Vol. 3.</i><br /><br />In this paper we address the problem of providing full connectivity to disconnected ground MANET nodes by dynamically placing unmanned aerial vehicles (UAVs) to act as relay nodes. We provide a heuristic algorithm to find the minimal number of such aerial vehicles required to provide fall connectivity and find the corresponding locations for these aerial platforms (UAVs). We also track the movement of the ground nodes and update the location of the UAVs. We describe a communication framework that enables the ground nodes to communicate with its peer ground nodes as well as the UAVs that act as relay nodes. The communication architecture is designed to work with existing MANET routing protocols. Providing full connectivity in large ad-hoc networks by dynamic placement of aerial platforms K Chandrashekar MR Dekhordi JS Baras Military Communications Conference, 2004. MILCOM 2004. IEEE, Vol. 3 (2004), pp. 1429-1436 Vol. 3. 2007-11-10T20:47:35-00:00 2004 Military Communications Conference, 2004. MILCOM 2004. IEEE 3 1429 1436 Vol. 3 gw_positioning http://www.citeulike.org/user/erl/article/333422 <i>(2001), pp. 61-69.</i> Capacity of Ad Hoc wireless networks Jinyang Li Charles Blake Douglas De Couto Hu Lee Robert Morris doi:10.1145/381677.381684 (2001), pp. 61-69. 2005-09-28T00:13:46-00:00 2001 61 69 ACM Press gw_positioning http://www.citeulike.org/user/erl/article/384368 <i>(2003), pp. 55-65.</i> Throughput capacity of random ad hoc networks with infrastructure support Ula? Kozat Leandros Tassiulas doi:10.1145/938985.938992 (2003), pp. 55-65. 2005-11-09T00:19:57-00:00 2003 55 65 ACM Press gw_positioning http://www.citeulike.org/user/erl/article/939442 <i>Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on, Vol. 2 (2005), pp. 701-704.</i><br /><br />A novel cross-layer routing technique was proposed for ad hoc networks with multi-rate mechanism based on node monitoring information. Combining SNR measure on physical layer and delay estimate on MAC layer, we propose a routing metric which selects the route with wide bandwidth, lower delay and less congestion. The routing technique is shown to improve performance of ad hoc network significantly. A novel cross-layer routing scheme of ad hoc networks with multi-rate mechanism Guangsong Yang Mingbo Xiao Huihuang Chen Yan Yao Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on, Vol. 2 (2005), pp. 701-704. 2006-11-10T15:10:14-00:00 2005 Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on 2 701 704 sota_in_cross_layer_routing http://www.citeulike.org/user/erl/article/884497 <i>Computers and Communications, 2005. ISCC 2005. Proceedings. 10th IEEE Symposium on (2005), pp. 16-21.</i><br /><br />A key element for MANET performance is the routing protocol. Surprisingly, little effort has been devoted up to now to analyzing the impact of routing protocol parameter settings on MANET performance. We define and study in detail the route change latency (RCL) after link failures, a critical performance metric in a non-static ad-hoc scenario, and its dependence on routing protocol parameter settings and implementation issues using OLSR. We experiment with a set of OLSR settings in a real network environment and derive its potential effect in a generic situation, showing that end-to-end connectivity can be enhanced using different parameter settings from the default ones. Improving performance of a real ad-hoc network by tuning OLSR parameters C Gomez D Garcia J Paradells Computers and Communications, 2005. ISCC 2005. Proceedings. 10th IEEE Symposium on (2005), pp. 16-21. 2006-10-05T09:49:11-00:00 2005 Computers and Communications, 2005. ISCC 2005. Proceedings. 10th IEEE Symposium on 16 21 rerouting_time_and_queueing http://www.citeulike.org/user/erl/article/303894 <i>World of Wireless Mobile and Multimedia Networks, 2005. WoWMoM 2005. Sixth IEEE International Symposium on a (2005), pp. 286-292.</i><br /><br />Ad-hoc wireless networks with multi-rate radios (such as 802.11a, b, g) require a new class of MAC/PHY aware metrics that take into account factors such as physical-layer link speed and MAC-layer channel congestion. Conventional "layer 3" ad-hoc routing algorithms typically make routing decisions based on the minimum hop-count (MH). Use of the MH metric leads to selection of paths with few hops but one or more of these hops may turn out to be low-speed radio links due to adaptive rate selection at the physical layer. In this paper, we investigate a new cross-layer routing metric that takes into account both physical layer link speed as well as estimated channel congestion, thus aiming to minimize end-to-end delay that includes both transmission and access times. The proposed "PARMA" routing metric will thus help spread the traffic across the "good links and nodes" in the network, increasing network capacity and reducing packet loss and delay. This paper presents the design and implementation of the proposed PARMA metric for proactive ad-hoc routing protocols such as DSDV. DSDV modifications for incorporating the MAC/PHY aware metric into an ns-2 simulation model are given. Simulation results for typical multi-rate 802.11 ad-hoc network scenarios show that the proposed cross-layer PHY/MAC aware metric achieves significantly higher network throughput and decreases network congestion by selecting paths with high bit-rate links while also avoiding areas of MAC congestion. PARMA: A PHY/MAC Aware Routing Metric for Ad-Hoc Wireless Networks with Multi-Rate Radios Suli Zhao Zhibin Wu A Acharya D Raychaudhuri World of Wireless Mobile and Multimedia Networks, 2005. WoWMoM 2005. Sixth IEEE International Symposium on a (2005), pp. 286-292. 2005-08-25T14:03:14-00:00 2005 World of Wireless Mobile and Multimedia Networks, 2005. WoWMoM 2005. Sixth IEEE International Symposium on a 286 292 sota_in_cross_layer_routing