Current Search: Wu, Bing. (x)
-
-
Title
-
Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets.
-
Creator
-
Wu, Bing., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
-
Abstract/Description
-
In mobile ad hoc wireless networks (MANET), due to host mobility, broadcasting is expected to be frequently used to find a route to a particular host, to page a host, and to alarm all hosts. A straightforward broadcasting by flooding is usually very costly and results in substantial redundancy and more energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected dominating set (CDS) is a promising approach, where...
Show moreIn mobile ad hoc wireless networks (MANET), due to host mobility, broadcasting is expected to be frequently used to find a route to a particular host, to page a host, and to alarm all hosts. A straightforward broadcasting by flooding is usually very costly and results in substantial redundancy and more energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected dominating set (CDS) is a promising approach, where only nodes inside CDS need to relay the broadcast packet. Wu and Li proposed a simple distributed algorithm for calculating CDS in MANET. In general, nodes inside CDS consume more energy to handle various bypass traffics than nodes outside the set. To prolong the life span of each node and, hence, the network by balancing the energy consumption in the system, nodes should be alternated in being chosen to form a CDS. Activity scheduling deals with the way to rotate the role of each node among a set of given operation modes. In thesis I propose to apply power-aware CDS notions to broadcasting and activity scheduling. I also introduce distance rule and extended rules to further reduce broadcasting energy consumption. The effectiveness of the proposed method are confirmed through my simulation experiment.
Show less
-
Date Issued
-
2002
-
PURL
-
http://purl.flvc.org/fcla/dt/12958
-
Subject Headings
-
Mobile computing, Wireless communication systems, Electronic digital computers--Power supply
-
Format
-
Document (PDF)
-
-
Title
-
Key management in mobile ad hoc networks.
-
Creator
-
Wu, Bing., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
-
Abstract/Description
-
In mobile ad hoc networks (MANETs), providing secure communications is a big challenge due to unreliable wireless media, host mobility and lack of infrastructure. Usually, cryptographic techniques are used for secure communications in wired networks. Symmetric and asymmetric cryptography have their advantages and disadvantages. In fact, any cryptographic means is ineffective if its key management is weak. Key management is also a central aspect for security in mobile ad hoc networks. In...
Show moreIn mobile ad hoc networks (MANETs), providing secure communications is a big challenge due to unreliable wireless media, host mobility and lack of infrastructure. Usually, cryptographic techniques are used for secure communications in wired networks. Symmetric and asymmetric cryptography have their advantages and disadvantages. In fact, any cryptographic means is ineffective if its key management is weak. Key management is also a central aspect for security in mobile ad hoc networks. In MANETs, the computational load and complexity for key management are strongly subject to restriction by the node's available resources and the dynamic nature of network topology. We proposed a secure and efficient key management framework (SEKM) for MANETs. SEKM builds a PKI by applying a secret sharing scheme and using an underlying multicast server groups. In SEKM, each server group creates a view of the certificate authority (CA) and provides certificate update service for all nodes, including the servers themselves. Motivated by the distributed key management service, we introduced k-Anycast concept and proposed three k-anycast routing schemes for MANETs. k-anycast is proposed to deliver a packet to any threshold k members of a set of hosts. Our goal is to reduce the routing control messages and network delay to reach any k servers. The first scheme is called controlled flooding. The second scheme, called component-based scheme I, is to form multiple components such that each component has at least k members. The third scheme, called component-based scheme II, in which the membership a component maintains is relaxed to be less than k. Collaborative and group-oriented applications in MANETs is an active research area. Group key management is a central building block in securing group communications in MANETs. However, group key management for large and dynamic groups in MANETs is a difficult problem. We propose a simple and efficient group key management scheme that we named SEGK for MANETs, which is based on n-party Diffie-Hellman (DH). The basic idea of our scheme is that a physical multicast tree is formed in MANETs for efficiency. To achieve fault tolerance, double multicast trees are constructed and maintained. A group coordinator computes and distributes intermediate keying materials to all members through multicast tree links. All group members take turns acting as group coordinator and distributing the workload of group rekeying during any change of group membership. Every group member computes the group key in a distributed manner.
Show less
-
Date Issued
-
2006
-
PURL
-
http://purl.flvc.org/fcla/dt/12234
-
Subject Headings
-
Electronic commerce--Technological innovations, Mobile commerce--Technological innovations, Wireless communication systems--Management, Mobile communication systems--Management
-
Format
-
Document (PDF)