By Topic

Networks, 2007. ICON 2007. 15th IEEE International Conference on

Date 19-21 Nov. 2007

Filter Results

Displaying Results 1 - 25 of 113
  • [Front cover]

    Publication Year: 2007 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (389 KB)  
    Freely Available from IEEE
  • [Front cover]

    Publication Year: 2007
    Save to Project icon | Request Permissions | PDF file iconPDF (1308 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2007 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (300 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2007 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (384 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2007 , Page(s): 1 - 18
    Save to Project icon | Request Permissions | PDF file iconPDF (142 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 2007 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | PDF file iconPDF (68 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 2007 , Page(s): 1 - 41
    Save to Project icon | Request Permissions | PDF file iconPDF (213 KB)  
    Freely Available from IEEE
  • [Teaser abstract]

    Publication Year: 2007
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (325 KB)  

    Presents abstracts of presentations from the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Breaker page]

    Publication Year: 2007 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (93 KB)  
    Freely Available from IEEE
  • [Teaser abstract]

    Publication Year: 2007
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (317 KB)  

    Presents abstracts of presentations from the conference proceedings. View full abstract»

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

    Publication Year: 2007 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (27 KB)  
    Freely Available from IEEE
  • Information for authors

    Publication Year: 2007 , Page(s): 1 - 3
    Save to Project icon | Request Permissions | PDF file iconPDF (212 KB)  
    Freely Available from IEEE
  • Information for authors

    Publication Year: 2007 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (83 KB)  
    Freely Available from IEEE
  • [Opinion]

    Publication Year: 2007 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (130 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Staff or society listings

    Publication Year: 2007 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (88 KB)  
    Freely Available from IEEE
  • Reviewer and referee listings

    Publication Year: 2007 , Page(s): 1 - 3
    Save to Project icon | Request Permissions | PDF file iconPDF (98 KB)  
    Freely Available from IEEE
  • [Teaser abstract]

    Publication Year: 2007
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (119 KB)  

    Presents abstracts of presentations from the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Keynote Speech]

    Publication Year: 2007
    Save to Project icon | Request Permissions | PDF file iconPDF (116 KB)  
    Freely Available from IEEE
  • [Advertisements]

    Publication Year: 2007 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (133 KB)  
    Freely Available from IEEE
  • [Advertisements]

    Publication Year: 2007 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (868 KB)  
    Freely Available from IEEE
  • Node Localisation in Wireless Ad Hoc Networks

    Publication Year: 2007 , Page(s): 1 - 6
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (222 KB) |  | HTML iconHTML  

    Wireless ad hoc networks often require a method for estimating their nodes' locations. Typically this is achieved by the use of pair-wise measurements between nodes and their neighbours, where a number of nodes already accurately know their location and the remaining nodes must calculate theirs using these known locations. Typically, a minimum mean square estimate (MMSE), or a maximum likelihood estimate (MLE) is used to generate the unknown node locations, making use of range estimates derived from measurements between the nodes. In this paper we investigate the efficacy of using radio frequency, received signal strength (RSS) measurements for the accurate location of the transmitting nodes over long ranges. We show with signal strength measurements from three or more wireless probes in noisy propagation conditions, that by using a weighted MMSE approach we can obtain significant improvements in the variance of the location estimate over both the standard MMSE and MLE approaches. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a Cache Scheme to Detect Misbehaving Nodes in Mobile Ad-Hoc Networks

    Publication Year: 2007 , Page(s): 7 - 12
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (317 KB) |  | HTML iconHTML  

    This paper presents a hardware based cache scheme to detect misbehaving nodes in mobile ad hoc network. In this scheme, the hardware monitors the activities of the upper-layer software and reports the misbehavior of the software to other mobile nodes in the network. The hardware cache stores the identity information of recently received packets. The detection mechanism uses the cache to detect packet dropping and packet misrouting. The simulation results show that the cache scheme can detect nearly 100% misbehaving nodes with nearly 0% false positive in the packet dropping scenario. In the packet misrouting scenario, the detection has nearly 0% false positive and more than 90% detection rate. The detection result could be used by other nodes to protect the network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong Stochastic Stability for MANET Mobility Models

    Publication Year: 2007 , Page(s): 13 - 18
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (360 KB) |  | HTML iconHTML  

    At the core of any MANET simulation is a mobility model. To help ensure reliable simulation results, it is of interest to know if the mobility model is stable: Will time-averaged measurements of "mobility model events" converge? For example, does the time-averaged distance between a pair of nodes converge as simulation time increases? In this paper, we study the stability of a class of discrete Random Waypoint Mobility Models (RWMMs). This class includes the classic Random Waypoint Mobility Model. We show that each mobility model in this class satisfies a pointwise ergodic theorem (a generalized strong law of large numbers); thus, all bounded time-averaged measurements of mobility model events converge with probability one. A corollary of this ergodic theorem shows that each mobility model in this class also possesses a time-stationary regime. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Separating Route Control and Data Flows in Multi-radio Multi-hop Ad Hoc Network

    Publication Year: 2007 , Page(s): 19 - 24
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (164 KB) |  | HTML iconHTML  

    Ad hoc networks typically require a significant amount of routing and control information to be distributed in a timely and reliable manner throughout the network, particularly in dynamic environments. As traffic levels increase and the network becomes more heavily congested, there is an increased probability that these critical packets are lost, resulting in obsolete control information being used to make important decisions. This would further compound the problem of network congestion and lead to a very rapid loss of connectivity and throughput. Given this, we argue the solutions to these problems should not rely on putting extra bandwidth on a radio interface. Instead, we should exploit the use of multiple radios to ensure the route can be firmly established. In this paper, we propose a multi-radio solution which reserves one radio channel exclusively for routing. Our simulation results have demonstrated that using a separate radio for routing protocol would dramatically improve reliability in heavily loaded ad hoc wireless networks, thereby effectively alleviating the impact of network congestion. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • History-based route selection for reactive ad hoc routing protocols

    Publication Year: 2007 , Page(s): 25 - 30
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (174 KB) |  | HTML iconHTML  

    Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart. View full abstract»

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