Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.

17-19 Oct. 2005

Filter Results

Displaying Results 1 - 25 of 174
  • Sub-network mobility analysis in wireless sensor networks

    Publication Year: 2005, Page(s):483 - 488
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    We propose the special kind of the mobility so called sub-network mobility for wireless sensor networks. In the sub-network mobility, the strongly coupled nodes, which are attached to the same object, move together passively as the object moves. Strongly coupled nodes require a different mobility scheme from the conventional mobility mechanism due to the characteristic that the relative positions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network diversification-enabling innovation in network architecture and services

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    The rise and growth of the Internet is one of the great technology success stories of the twentieth century. Unfortunately, the size and scope of the public Internet now makes the introduction and deployment of new network innovations very difficult, leading many to observe that the core technology at the heart of the Internet has become ossified. While solutions too many of the IP protocol's limi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing the user perceived delay of interactive TCP connections using a dynamic priority approach

    Publication Year: 2005, Page(s):421 - 427
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (146 KB) | HTML iconHTML

    Many interactive applications require continuous user interaction, for example ssh and many Web applications. The TCP connections created by these applications are therefore in a class called interactive. When interactive applications suffer from packet loss, the packet retransmission time severely increases the user perceived delay. This work introduces a dynamic priority RED queue (DPRQ) algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Future of wireless networks

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (93 KB)

    The wireless industry is undergoing a transition. We see the evolution from cellular 2G to 3G standards, the migration from circuit to packet applications, and the procession of voice to data. We also see the industry incorporating new wireless access technologies such as WiFi and WiMAX. All of this is occurring in a market place where voice subscriber penetration levels in many parts of the world... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packetization of 3D progressive meshes for streaming over lossy networks

    Publication Year: 2005, Page(s):415 - 420
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    In this paper, we consider the problem of packetizing progressive 3D geometry models for streaming over a lossy network. We adopt a graph-theoretic approach to model packetization of progressive 3D models, with the goal of minimizing dependencies among packets. We show that this packetization problem is strongly NP-complete, and we propose two packing heuristics. Our experiments show that both heu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modified random way-point model equalized for the node crowding effect

    Publication Year: 2005, Page(s):49 - 54
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1271 KB) | HTML iconHTML

    The problem of crowding of nodes in the center of the simulation area in the random way-point mobility model for ad hoc networks is addressed in this paper. A novel method is proposed to make the distribution of nodes uniform. This is achieved by making the pause time of the nodes dependent on their pause location. Closed form expressions for the pause times as functions of spatial coordinates are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Roaming, hand-off and services continuity for voice services in converged wireless networks

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    The success of Wi-Fi and emergence of Wi-MAX creates exciting technology and business challenges for the communication industry. Roaming, seamless voice and data hand-offs, in conjunction with continuity of voice services such as messaging, push-to-talk, and voicemail, are posing the next technology and business challenges. Services convergence among Wi-Fi, Wi-MAX, and cellular networks is creatin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A handover management scheme for mobile IPv6 networks

    Publication Year: 2005, Page(s):43 - 48
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (153 KB) | HTML iconHTML

    Mobile IPv6 provides IP layer mobility management for IPv6 networks. Despite many advantages it offers in comparison to Mobile IPv4, handover management still remains an issue for Mobile IPv6. For real-time connections, the handover latency and signaling overhead incurred by the protocol may become significant. This paper presents a new method named crossover MAP based hierarchical mobile IPv6 (XM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packet delay estimation for ad hoc networks

    Publication Year: 2005, Page(s):289 - 296
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    Network throughput and end-to-end delay time are two important parameters in the design and the evaluation of routing protocols for wireless ad hoc networks. Network throughput and routing protocols have been studied for some time. To be able to estimate the end-to-end delay time, the process induced by the random position of every node has to be known, that is, a mobility model for the nodes has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance studies of networked video-on-demand systems

    Publication Year: 2005, Page(s):387 - 392
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (223 KB) | HTML iconHTML

    In a multimedia service such as video-on-demand system, video streaming requires allocation of several communication channels. The overall cost of establishing a video-on-demand system also includes the channel cost. Several caching and batching schemes have been proposed in literature for the optimal utilization of these channels. A viewer is served with a mix of main and small (e.g. advertisemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (123 KB) | HTML iconHTML

    In WDM rings, determining minimum number of ADMs is NP-hard. The best known algorithm namely, breadth first least interference (BFLI) heuristic gives optimal results in only 77% cases. In this paper, we analyze the problem and suggest a new set covering formulation for minimizing the number of ADMs in WDM rings and use best first search algorithm (A*) with the help of a heuristic (hLB) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Grid based two transmission range strategy for MANETs

    Publication Year: 2005, Page(s):235 - 240
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    In a mobile ad hoc network (MANET), it becomes practically viable to use virtual infrastructures to improve energy efficiency. The square-based infrastructure divides the network area into squares of the same size. Fourand eight-directional forwarding are two popular forwarding methods in the square-based infrastructure. In four-directional (or eight-directional) forwarding, packets can be forward... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A VoIP emergency services architecture and prototype

    Publication Year: 2005, Page(s):523 - 528
    Cited by:  Papers (8)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    Providing emergency services in VoIP networks are vital to the success of VoIP. It not only presents design and implementation challenges, but also gives an opportunity to enhance the existing emergency call handling infrastructure. We propose an architecture to deliver emergency services in SIP-based VoIP networks, which can accommodate PSTN calls through PSTN to SIP gateways. Our architecture ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic behavior of random constant scanning worms

    Publication Year: 2005, Page(s):339 - 344
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (133 KB) | HTML iconHTML

    This paper discusses modeling and simulation issues associated with the stochastic behavior of a special type of a computer worm called a random constant scanning (RCS) worm. Although these worms propagate by randomly scanning network addresses to find hosts that are susceptible to infection, traditional RCS worm models are fundamentally deterministic. A density-dependent Markov jump process model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient data retrieving in distributed data-streaming environments

    Publication Year: 2005, Page(s):583 - 588
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    In a potential distributed application, automobile tracking system (ATS), automobile location data is continuously generated, kept in a distributed manner. As large amount of traffic will be incurred during search process, it is critical to construct an efficient overlay multicast structure for the ATS so as to distribute traffic to all the physical links evenly, as well as balance the load among ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable scheduling algorithm to avoid conflicts in switch-memory-switch routers

    Publication Year: 2005, Page(s):57 - 64
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    Although output queued (OQ) switches are prominent for their high performance, they are not easy to implement due to the high speedup requirement. Using a special scheduling algorithm in the first stage switch, a more scalable switch-memory-switch (SMS) architecture can emulate an OQ switch, where cells must be transferred from the inputs to the shared memories per time slot without arrival and de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient forwarding of symbolically addressed geocast messages

    Publication Year: 2005, Page(s):77 - 83
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    Geocast is used to send messages to all hosts located in a geographic area. This target area can be defined either by geometric figures like polygons or by symbolic addresses like city names or room numbers. Geographic routing algorithms, which forward messages based on geographic information, can be used to forward geocast messages. If routing of symbolically addressed messages is based on geomet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting disconnection operations through cooperative hoarding

    Publication Year: 2005, Page(s):35 - 42
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    Mobile clients often need to operate while disconnected from the network due to limited battery life and network coverage. Hoarding supports this by fetching frequently accessed data into clients' local caches prior to disconnection. Existing work on hoarding have focused on improving data accessibility for individual mobile clients. However, due to storage limitations, mobile clients may not be a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving H.264 video transmission in 802.11e EDCA

    Publication Year: 2005, Page(s):381 - 386
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    Multimedia streaming over wired network, such as the Internet, has been popular now for quite some time. Further, as the bandwidth of wireless technologies have increased, consideration has only recently turned to delivering video over wireless networks. Meanwhile, an emerging new video compression standard namely H.264 is widely accepted. The H.264 standard outperforms all previous video compress... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bandwidth allocation framework for adaptive multimedia traffic with flexible time adaptability in wireless and mobile networks

    Publication Year: 2005, Page(s):437 - 442
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    Next generation wireless networks are expected to support multi-class variable bandwidth real-time multimedia applications. High user mobility and inherent instability of wireless channels makes quality of service (QoS) provisioning a challenging issue in wireless networks. In this paper, we propose a novel resource management scheme, FATP, for QoS provisioning in wireless networks for adaptive mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deployable overlay network for defense against distributed SYN flood attacks

    Publication Year: 2005, Page(s):407 - 412
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    Distributed denial-of-service attacks on public servers have recently become more serious. To assure that network services will not be interrupted, we need faster and more accurate defense mechanisms against malicious traffic, especially SYN floods. But single point defense (ex. firewalls) lacks a scalability to catch up the increase of the attack traffic. In this paper, we introduce a distributed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On fair scheduling in heterogeneous link aggregated services

    Publication Year: 2005, Page(s):199 - 205
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    Provisioning quality of service (QoS) across an aggregate of transmission entities (e.g., link aggregation) or processing elements (e.g. network processors) is a challenging problem. The difficulty lies in simultaneously satisfying fairness to flows (with different bandwidth requirements) and ensuring minimized intra-flow reordering. This problem is crucial to many applications (that utilize paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time video over wireless ad-hoc networks

    Publication Year: 2005
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (33 KB) | HTML iconHTML

    In this paper we investigate important issue for real-time video over wireless ad-hoc networks on different layers. Many error control methods for this approach use multiple streams and multipath routing. Thus the new proactive, link-state routing protocol have been developed, where the protocol finds the available route in the network and also it will not cause any interruption in the video traff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CA-RTO: a contention-adaptive retransmission timeout

    Publication Year: 2005, Page(s):179 - 184
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    We show that TCP timers, based solely on RTT estimations and measurements, cannot capture with precision the level of flow contention. We notice that increased contention may stabilize RTT variation, minimize the deviation and, in turn, shorten the timeout. We show that this behavior is undesirable indeed, since it leads to unfair resource utilization. We propose CA-RTO, an algorithm that incorpor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-aware connected dominating set construction in mobile ad hoc networks

    Publication Year: 2005, Page(s):229 - 234
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB) | HTML iconHTML

    Connected dominating set (CDS) has been used widely in mobile ad hoc networks by numerous routing, broadcast, and time synchronization protocols. Although computing minimum CDS is known to be NP-hard, many distributed protocols have been proposed to construct a small CDS. However, these protocols are either too complicated, need non-local information, are not adaptive to topology changes, or fail ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.