rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Security schemes for wireless sensor networks with mobile sink
  name:
    name part: Rasheed, Amar Adnan.
    role:
      role term: creator
  name:
    name part: Mahapatra, Rabi N.
    role:
      role term: thesis advisor.
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: txu
    date issued: 2011
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource.
  abstract: Mobile sinks are vital in many wireless sensor applications for efficient data collection, data querying, and localized sensor reprogramming. Mobile sinks prolong the lifetime of a sensor network. However, when sensor networks with mobile sinks are deployed in a hostile environment, security became a critical issue. They become exposed to varieties of malicious attacks. Thus, anti threats schemes and security services, such as mobile sink's authentication and pairwise key establishment, are essential components for the secure operation of such networks. Due to the sensors, limited resources designing efficient security schemes with low communication overhead to secure communication links between sensors and MS (Mobile Sink) is not a trivial task. In addition to the sensors limited resources, sink mobility required frequent exchange of cryptography information between the sensors and MS each time the MS updates its location which imposes extra communication overhead on the sensors. In this dissertation, we consider a number of security schemes for WSN (wireless sensor network) with MS. The schemes offer high network's resiliency and low communication overhead against nodes capture, MS replication and wormhole attacks. We propose two schemes based on the polynomial pool scheme for tolerating nodes capture: the probabilistic generation key pre-distribution scheme combined with polynomial pool scheme, and the Q-composite generation key scheme combined with polynomial pool scheme. The schemes ensure low communication overhead and high resiliency. For anti MS replication attack scheme, we propose the multiple polynomial pools scheme that provide much higher resiliency to MS replication attack as compared to the single polynomial pool approach. Furthermore, to improve the network resiliency against wormhole attack, two defensive mechanisms were developed according to the MS mobility type. In the first technique, MS uses controlled mobility. We investigate the problem of us…
  note: by Amar Adnan Rasheed.
  note: "Major Subject: Computer Science"
  note: Title from author supplied metadata (automated record created 2011-08-09 15:09:44).
  note: Electronic resource.
  note: Doctor of Philosophy Texas A&M University 2010 http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7844
  note: Includes bibliographical references.
  note: Text (Dissertation)
  subject:
    topic: Major computer science
  subject:
    topic: Mobile Sensor Networks
  subject:
    topic: Key Pre-Distribution Schemes
  subject:
    topic: Pairwise Key Establishment in Sensor Networks
  subject:
    topic: Wireless Sensor Network
  subject:
    topic: Data Collection Schemes in Sensor Networks
  identifier: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7844
  record info:
    record content source: TXA
    record creation date: 110819
    record change date: 20151202142323.0
    record identifier: in00002713381