By Topic

Computers and Communication, 2003. (ISCC 2003). Proceedings. Eighth IEEE International Symposium on

Date 30 June-3 July 2003

Filter Results

Displaying Results 1 - 25 of 217
  • Variable structure control in active queue management for TCP with ECN

    Publication Year: 2003 , Page(s): 1005 - 1011 vol.2
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1189 KB) |  | HTML iconHTML  

    It has been shown that the TCP connections through the congested routers can be modeled as a feedback dynamic system. In this paper, we design a variable structure (VS) based control scheme in active queue management (AQM) supporting explicit congestion notification (ECN). By analyzing the robustness and performance of the control scheme for nonlinear TCP/AQM model, we show that the proposed design has good performance and robustness with respect to the uncertainties of the round-trip time (RTT) and the number of active TCP sessions, which are central to the notion of AQM. Implementation issues are discussed and ns simulations are provided to validate the design and compare its performance to other peer schemes' in different scenarios. The results show that the proposed design significantly outperforms the peer AQM schemes in terms of packet loss ratio, throughput and buffer fluctuation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self adjustable CHOKe: an active queue management algorithm for congestion control and fair bandwidth allocation

    Publication Year: 2003 , Page(s): 1018 - 1025 vol.2
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (320 KB) |  | HTML iconHTML  

    Queue management and congestion control are very important to the robustness and fairness of the Internet. In this paper, a new queue management algorithm, termed self adjustable choke (SAC) is proposed to achieve both fairness and congestion control in an Internet router. It is based on the well-known RED algorithm and a recently proposed CHOKe algorithm. The SAC scheme has kept the advantages of simplicity and lower processing cost of RED and CHOKe, while solving their unfair bandwidth allocation properties. In particular, the SAC scheme treats TCP and UDP flows differently, and can adaptively adjust its parameters according to the current traffic status. As a result, using the SAC, bandwidth is distributed evenly among different flows, no matter how different these flows are. This will be demonstrated and compared to CHOKe using experimental results under various traffic scenarios. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ordered H-BLAST for MIMO/OFDM systems over multipath channels

    Publication Year: 2003 , Page(s): 481 - 485 vol.1
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (274 KB) |  | HTML iconHTML  

    This paper addresses an OFDM/MIMO coded system where multiple data sub-streams are encoded separately and transmitted in parallel. If successive interference cancellation (SIC) across sub-streams is to be used at the receiver, to minimize error propagation (EP), it is recommended to decode a full sub-stream before cancellation to utilize the powerfulness of channel coding. For the same reason, it is also recommended to process the different sub-streams in an order that matches their reception quality. While this is always possible in flat fading channels, it is not straightforward in multipath channels where different modulation symbols have different channel qualities due to frequency selectivity. This paper addresses this problem and introduces an ordering scheme for coded systems that significantly improves system performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of fast routers advertisement on mobile IPv6 handovers

    Publication Year: 2003 , Page(s): 557 - 562 vol.1
    Cited by:  Papers (9)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (264 KB) |  | HTML iconHTML  

    Mobile Ipv6 protocols are retrofit of mobility onto the next generation Internet (IPv6) protocols. Many of the original IPv6 protocols have inbuilt timing mechanisms which aim at ensuring fairness of access to media and signaling efficiency. The effects of these timers on mobile IPv6 traffic has been found to significantly affect application traffic on these networks. One proposal to remove unnecessary timers in neighbor discovery is called fast router advertisement (FastRA). This paper presents performance comparisons of FastRA with unmodified neighbor discovery in mobile IPv6 environments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance enhancement of smooth handoff in mobile IP by reducing packets disorder

    Publication Year: 2003 , Page(s): 149 - 154 vol.1
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (269 KB) |  | HTML iconHTML  

    Smooth handoff was introduced in mobile IP to overcome this problem of packet loss during handoff. However, smooth handoff causes packets sequence disruption during packet forwarding procedure, which may result in degradation of network performance in higher layer protocol. In this paper, we discuss the impact of receiving out-of-sequence packets by the mobile node on TCP and UDP applications and we propose a technique, which minimizes the arrival of out-of-sequence packets to the mobile node. This technique anticipates forwarding of packets from the current foreign agent to the new one while the mobile node initiates its handoff. To evaluate our solution, we use the unstable time period (UTP) when the packet sequence could be mis-ordered. We show that the unstable period in our solution is very low than the unstable time period in classical smooth handoff. Furthermore, we also show that our solution reduces the considerably out-of-sequence packets generated by smooth handoff. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SERAN: a new protocol to hide an equipment in ad hoc networks

    Publication Year: 2003 , Page(s): 356 - 361 vol.1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (247 KB) |  | HTML iconHTML  

    The fourth generation wireless network represents the next generation of mobile networks. These networks include ad-hoc networks that are characterized as autonomous and independent of any existing infrastructure. One of the major problems of these networks is the security of data and equipment. Data should be confidential, and the equipments should also be protected for saving energy, or for isolation of a congestioned node, etc. In this study we propose a new protocol SERAN (security equipment protocol in routing in ad hoc networks), which permits to hide an equipment in ad hoc networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A client-based handoff mechanism for mobile IPv6 wireless networks

    Publication Year: 2003 , Page(s): 563 - 568 vol.1
    Cited by:  Papers (6)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (274 KB) |  | HTML iconHTML  

    Mobile IP enables mobile computers to roam transparently in any network. However, the current proposed protocol specification does not support a suitable handoff mechanism to allow a mobile computer to change its point of attachment from one network to another. This paper describes a handoff mechanism for mobile host, which makes use of Internet protocol version 6 (IPv6) and mobile IP without the need to introduce a new mobility management protocol or make changes to the network infrastructure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of task allocation in a cluster-based sensor network

    Publication Year: 2003 , Page(s): 329 - 334 vol.1
    Cited by:  Papers (10)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (301 KB) |  | HTML iconHTML  

    Sensor networks have recently gained a lot of attention from the research community. Sensors are significantly resource-constrained devices and last till the depletion of their batteries. Sensor networks typically have a large number of nodes. To ensure scalability sensor networks are often partitioned into clusters, each managed by a cluster head (gateway). Efficient management of a sensor network for extending the lifetime of the network is among the prominent areas of research in this domain. While most of the previous research focused on the optimal use of sensor's energy, very little attention has been paid to the efficiency of energy usage at the gateway. Tasks need to be allocated to gateways in such a way that maximizes the life of these cluster-heads and eventually the whole network. In this paper, we present an optimization scheme for task allocation to gateways. The task allocation problem is modeled as a zero-one nonlinear program. Simulation results show that substantial energy savings can be obtained with the proposed method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AMCA: an active-based multicast congestion avoidance algorithm

    Publication Year: 2003 , Page(s): 747 - 754 vol.2
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (621 KB) |  | HTML iconHTML  

    Many works have addressed the issue of congestion control for multicast communications and the problem is known to be highly complex. Scalability, responsiveness, stability and fairness with TCP are some of the required properties. In this paper, we present a congestion avoidance scheme for bulk data distribution called AMCA (active-based multicast congestion avoidance algorithm) that tries to meet these properties. We use the active networking technology to perform on a per-section dialogue to probe for available bandwidth along a multicast tree. The solution uses the RTT variations experienced by every branch to estimate the congestion situation in the multicast tree. The physical multicast tree is also used to appropriately aggregate the RTT variations at intermediate nodes before they reach the source. Simulations show that AMCA converges, makes use of the available bandwidth and reacts rapidly to dynamic changes while being TCP-fair. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new dual-mode approach to blind equalization of QAM signals

    Publication Year: 2003 , Page(s): 277 - 281 vol.1
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (326 KB) |  | HTML iconHTML  

    The dual-mode CMA-assisted decision adjusted modulus algorithm (CADAMA) has been proved to be a very effective way of equalizing non-minimum phase channels blindly [Axford RA, et al., 1996]. However, it still suffers from a slow convergence when applies to the higher order QAMS. In this paper, we propose a new dual mode method for blind equalization of QAM signals, which achieves a faster convergence compared to the CADAMA. The simulation results show the better convergence rate of the proposed algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two distributed reactive MPLS traffic engineering mechanisms for throughput optimization in best effort MPLS networks

    Publication Year: 2003 , Page(s): 379 - 384 vol.1
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (479 KB) |  | HTML iconHTML  

    This paper describes a scalable distributed reactive MPLS traffic engineering system, which can be used for throughput optimization of best effort traffic in IP networks. The load rebalancing in the system is realized either by path rerouting or by multi path balancing. To prevent the system from routing oscillations, the distributed traffic engineering units coordinate the load rebalancing actions by using routing update messages. It is shown by simulation, that the reactive MPLS traffic engineering system performs well in great networks and optimizes the network throughput dramatically compared to shortest path routing. The path rerouting and multi path balancing approach reach comparable results while the multi path balancing performs slightly better in the presented scenario. To evaluate the reactive MPLS traffic engineering approaches in realistic network scenarios, a scalable rate based simulation environment is used. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A 32-bit SoPC implementation of a P5

    Publication Year: 2003 , Page(s): 504 - 507 vol.1
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (272 KB) |  | HTML iconHTML  

    This paper details a system on a programmable chip (SoPC) implementation of a 2.5 Gbps programmable point-to-point-protocol processor (P5) on an FPGA. 32-bit pipelined PPP receiver and transmitter dedicated packet processor circuits are implemented. The Leon processor core is embedded in the system and provides a programmable platform for PPP control protocols including LCP's and NCP's and application specific embedded software. An AMBA bus interface is used to interlink the Leon processor to the hardware packet processing unit and presents a standard interface allowing for easy retargeting to other processor platforms. Complex memory control is implemented to enable the microprocessor to handle the extreme data rate of the P5. The high-level system breakdown is described and synthesis results for Altera FPGA technology are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the issues of IP traceback for IPv6 and mobile IPv6

    Publication Year: 2003 , Page(s): 582 - 587 vol.1
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (249 KB) |  | HTML iconHTML  

    As the Internet becomes pervasive, the vulnerability of some fundamental design aspects of the Internet has also become significant. Among which, denial-of-service (DoS) and distributed DoS (DDoS) pose significant problems, as they are disruptive to the useful traffics and are hard to prevent. One solution consists in instituting accountability, which hold the attackers accountable for the attack. The key issue is to identify the real sources of the attacks and attackers use spoofed IP address to hide their actual network location. However, the Internet architecture does not provide intrinsic support for identifying the real sources of IP packets. Numerous mechanisms have been proposed to traceback the real sources. Most of such networks have been addressing the IP version 4. In this paper, we address the issues of IP traceback in the context of IPv6 and mobile IPv6. This paper provides a detailed analysis of these issues and problems. The main problem lies with the transformations that are introduced by IPv6 and mobile IPv6 protocols, namely tunneling and addresses manipulation. We then propose a solution, including new ICMPv6 messages for traceback co-ordination, to facilitate the traceback mechanism. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A secure network access protocol (SNAP)

    Publication Year: 2003 , Page(s): 809 - 814 vol.2
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (285 KB) |  | HTML iconHTML  

    Both the size, and the interconnectivity of computer networks are increasing tremendously. However, the possibility of an attack compromising the network is also increasing, making the network security critical. Strong authentication protocols are needed to restrict network access to only authorised users. Most existing protocols for authentication and network access are based on centralised authentication using one authentication server or certificate authority that is unconditionally trusted. Despite the use of strong authentication mechanisms, the process is between the user and a single authentication entity. In these protocols, the decision to authenticate or grant service to users is controlled by this single entity. Centralised authentication protocols suffer certain drawbacks. In this paper, a new protocol secure network access protocol (SNAP) is proposed. SNAP increases network security and availability by distributing the trust between several authentication entities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new end-to-end measurement method for estimating available bandwidth

    Publication Year: 2003 , Page(s): 1393 - 1400 vol.2
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (313 KB) |  | HTML iconHTML  

    We present an original end-to-end available bandwidth measurement method, called SMART (statistics measurement for avail-bw by random train). It resolves some of the problems common for many types of existing probing methods, e.g. the long latency and large probe traffic. Contrary to traditional estimates of available bandwidth, SMART is not a methodology based on packet dispersion in packet pair or packet train, but a completely new methodology in the light of probability and statistics. The fundamental idea is to send very small packets at random moment and calculate the proportion of minimal delay ion total test samples. To reach this purpose, we redefine the available bandwidth based on probability and statistics. We have evaluated our method in controlled and reproducible environment using NS2, and the simulations show our method is accurate, efficient, quick and non-intrusive. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Promoting watermark performance by using energy reallocation

    Publication Year: 2003 , Page(s): 783 - 788 vol.2
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (674 KB) |  | HTML iconHTML  

    In this paper, we propose a so called energy reallocation scheme to promote watermarking robustness while not at the expense of imperceptibility which is desired to be resolved in the research area. The watermark strength is reallocated in a complementary manner such as to enhance the watermarked image quality by 3 dB not at the expense of watermark robustness. The complementary watermarks are embedded at adjacency positions to take advantage from the locally correlated attacks, e.g. smoothing and sharpening. To derive the reference modification bound for each DCT component, an attacking simulation scheme based on the spatial domain, JND is employed. The experimental study shows our method can gain about 3 dB benefit in PSNR beyond the single watermark with double strength method. And, our method can even compete in the extracted watermark quality with the latter. These results also show that the neighboring arrangement for the complementary watermarks locating indeed provides enhancement in watermark extraction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power efficient system for sensor networks

    Publication Year: 2003 , Page(s): 837 - 842 vol.2
    Cited by:  Papers (6)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (242 KB) |  | HTML iconHTML  

    We propose a power efficient system architecture that exploits the characteristics of sensor networks in order to decrease the power consumption in the network. The primary characteristic of sensor networks is that the destination of all the data packets in the network is a central data collector, which is usually denoted as access point (AP), has unlimited transmission power and energy whereas the sensor nodes have one battery energy to remain alive fro several years. Our system uses the AP to directly synchronize and explicitly schedule the nodes' transmissions over time division multiple access (TDMA) time slots. Simulations performed in TOSSIM, a simulation environment for the TinyOS, show that the battery lifetime of the network with this scheme can be increased to 1-2 years from 10 days that can be obtained from a general random access network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pipelined maximal size matching scheduling algorithms for CIOQ switches

    Publication Year: 2003 , Page(s): 521 - 526 vol.1
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (390 KB) |  | HTML iconHTML  

    In this paper, we propose new pipelined request-grant-accept (RGA) and request-grant (RG) maximal size matching (MSM) algorithms to achieve speedup in combined input and output queueing (CIOQ) switches. To achieve a speedup factor S, in the proposed pipelined RGA/RG MSM algorithms, we pipeline operations of finding S matching in S scheduling cycles based on the observation that all matched inputs/outputs will not be used in later iterations in the same scheduling cycle. We show that our pipelined RGA/RG MSM algorithms reduce the scheduling time constraint by SI/(I+S-1), where I is the number of iterations allowed in each scheduling cycle. Taking the example of pipelined PIM, we evaluate the performance of the proposed algorithms by simulation. Simulation results have shown that pipelined PIM for CIOQ switches with speedup of 2 under both Bernoulli and bursty arrivals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay spread estimation for wireless communication systems

    Publication Year: 2003 , Page(s): 282 - 287 vol.1
    Cited by:  Papers (7)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (295 KB) |  | HTML iconHTML  

    In this paper, average frequency correlation and root-mean-squared (rms) delay spread estimation for wireless communication systems are described. A practical algorithm for averaged channel frequency correlation estimation, which can be used for measuring frequency selectivity, is given. Average rms delay spread of the channel is obtained directly from the channel frequency correlation estimate without obtaining the channel power delay profile (PDP). Analytical relations between channel frequency correlation and assuming an exponentially decaying PDP derives rms delay spread value. Robustness of the proposed rms delay spread estimation method for other PDPs is evaluated. An orthogonal frequency division multiplexing (OFDM) based wireless communication system is considered for evaluating the performance of the proposed algorithm. It is observed that proposed channel frequency correlation and rms delay spread estimation algorithms work very well in various environments with different PDPs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and performance evaluation of a flexible and efficient server assisted signature protocol

    Publication Year: 2003 , Page(s): 1239 - 1244 vol.2
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (280 KB) |  | HTML iconHTML  

    One method to reduce the computational costs of generating public key signatures on constrained devices is to get help from a verifiable server. In this paper, we propose a (verifiable) server assisted signature protocol, which is the first one that totally eliminates public key operations for the ordinary user. Our protocol is also more efficient and flexible in terms of storage since unlike previous ones the user does not need to save the server's signature to prove it's cheating. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput achievable with no relaying in a mobile interference network

    Publication Year: 2003 , Page(s): 641 - 645 vol.1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (336 KB) |  | HTML iconHTML  

    We consider a network of n sender/receiver pairs placed randomly in a region of unit area. Network capacity or maximum throughput is defined as the highest rate that can be achieved by each sender/receiver pair over a long period of time. It is known that without using relays (i.e., via only direct communication), the maximum throughput is less than O(1), that is, strictly decays as n increases. The network capacity without relaying for static or mobile networks is not known. However, a known lower bound on this capacity if O[(log (n))/n]. Our goal is to find a higher achievable rate. We show, by demonstrating a simple coding and scheduling scheme that uses mobility, that O[(log (n))/(n1-β)] is achievable, where β > 0 is a constant that depends on the power attenuation factor in the wireless medium. For example, when power decays as d-4 with distance d, O[(log (n))/(n.25)] is achievable. We assume channels to be AWGN interference channels throughput this work. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Certified email: design and implementation of a new optimistic protocol

    Publication Year: 2003 , Page(s): 828 - 833 vol.2
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (343 KB) |  | HTML iconHTML  

    Nowadays email has become the most widely used means in daily communication on the net and is increasingly used in place of ordinary mail. Certified email protocols aim to provide additional properties to the standard email service. In this paper we provide a novel optimistic protocol for certified email satisfying nine of the most important properties usually considered in the literature. We give a formal description of the protocol with the input/output automation (IOA) framework and provide a prototype implementation for the Windows platform. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Securing group management in IPv6 with cryptographically generated addresses

    Publication Year: 2003 , Page(s): 588 - 593 vol.1
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (265 KB) |  | HTML iconHTML  

    Concurrently, group membership management in IP multicast and anycast can be abused in order to launch denial-of-service (DoS) attacks. The root of the problem is that routers cannot determine if a given host is authorized to join group. We propose a solution for Ipv6-based on group cryptographically generated addresses (G-CGA). These addresses have characteristics of statistical uniqueness and cryptographic verifiability that lend themselves to severely limiting certain classes of DoS attacks. Our scheme is fully distributed and does not require any trusted third party or pre-established security association between the routers and the hosts. This is not only a huge gain in terms of scalability, reliability and overhead, but also in terms of privacy. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended expedited forwarding: the in-time PHB group

    Publication Year: 2003 , Page(s): 291 - 298 vol.1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (305 KB) |  | HTML iconHTML  

    This paper presents a new set of forwarding behaviors that fits rate-adaptive and delay-sensitive applications with limited loss tolerance. We consider an application to have limited loss tolerance if it needs loss-free forwarding of specific packets up to a certain rate. The new set of forwarding behaviors are attractive for developing real-time applications for the Internet. In particular, such applications can be designed to use reserved forwarding capacity efficiently and compete for more bandwidth while being fair to best-effort traffic. To provide the new set of forwarding behaviors, we define a scheduling mechanism that can be implemented efficiently. Through simulations, we show that this mechanism supports the defined forwarding behaviors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient energy aware clusterhead formation infrastructure protocol for MANETs

    Publication Year: 2003 , Page(s): 203 - 208 vol.1
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2611 KB)  

    In this paper, we propose a novel cluster-based infrastructure creation protocol, namely: warning energy aware clusterhead (WEAC). WEAC establishes a dynamic wireless mobile infrastructure. As in all cluster-based infrastructure protocols, in the WEAC protocol, a mobile node is elected from a set of nominees to act as a temporary base station for a period of time within its zone. We study the characteristics and performance of the WEAC protocol by means of simulation. It is shown that the WEAC protocol scales well to large networks of mobile stations, and it outperforms other routing energy saving amongst the network. The WEAC protocol would facilitate the development of a comprehensive and promising framework for quality of service (QoS) management in wireless mobile ad hoc networks once the proper integration of the MAC protocol with the routing and call admission control mechanisms is established. At that time, it would lay the groundwork for assigning bandwidth, and/or implementing priorities, and hence for QoS-based routing by conveying the quality of a path prior to call setup. View full abstract»

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