Sumathy Vembu - Academia.edu (original) (raw)
Related Authors
National Institute of Technology, Calicut
Uploads
Papers by Sumathy Vembu
ICTACT Journal on Communication Technology, 2010
Providing efficient and scalable service provisioning in Mobile Ad Hoc Network (MANET) is a big r... more Providing efficient and scalable service provisioning in Mobile Ad Hoc Network (MANET) is a big research challenge. In adaptive service provisioning mechanism an adaptive election procedure is used to select a coordinator node. The role of a service coordinator is crucial in any distributed directory based service provisioning scheme. The existing coordinator election schemes use either the nodeID or a hash function to choose the coordinator. In these schemes, the leader changes are more frequent due to node mobility. We propose an adaptive scheme that makes use of an eligibility factor that is calculated based on the distance to the zone center, remaining battery power and average speed to elect a core node that change according to the network dynamics. We also retain the node with the second highest priority as a backup node. Our algorithm is compared with the existing solution by simulation and the result shows that the core node selected by us is more stable and hence reduces the number of handoffs. This in turn improves the service delivery performance by increasing the packet delivery ratio and decreasing the delay, the overhead and the forwarding cost.
International Journal of Communication Systems
Designing an efficient key establishment scheme is of great importance to the data security in Wi... more Designing an efficient key establishment scheme is of great importance to the data security in Wireless Sensor Networks. The traditional cryptographic techniques are impractical in Wireless Sensor Networks because of associated high energy and computational overheads. This algorithm supports the establishment of three types of keys for each sensor node, an individual key shared with the base station, a pair wise key shared with neighbor sensor node, and a group key that is shared by all the nodes in the network. The algorithm used for establishing and updating these keys are energy efficient and minimizes the involvement of the base station. Polynomial function is used in the study to calculate the keys during initialization, membership change and key compromise. Periodically the key will be updated. To overcome the problem of energy insufficiency and memory storage and to provide adequate security, the energy efficient scheme is proposed. It works well in undefined deployment environment. Unauthorized nodes should not be allowed to establish communication with network nodes. This scheme when compared with other existing schemes has a very low overhead in computation, communication and storage.
ICTACT Journal on Communication Technology, 2010
Providing efficient and scalable service provisioning in Mobile Ad Hoc Network (MANET) is a big r... more Providing efficient and scalable service provisioning in Mobile Ad Hoc Network (MANET) is a big research challenge. In adaptive service provisioning mechanism an adaptive election procedure is used to select a coordinator node. The role of a service coordinator is crucial in any distributed directory based service provisioning scheme. The existing coordinator election schemes use either the nodeID or a hash function to choose the coordinator. In these schemes, the leader changes are more frequent due to node mobility. We propose an adaptive scheme that makes use of an eligibility factor that is calculated based on the distance to the zone center, remaining battery power and average speed to elect a core node that change according to the network dynamics. We also retain the node with the second highest priority as a backup node. Our algorithm is compared with the existing solution by simulation and the result shows that the core node selected by us is more stable and hence reduces the number of handoffs. This in turn improves the service delivery performance by increasing the packet delivery ratio and decreasing the delay, the overhead and the forwarding cost.
International Journal of Communication Systems
Designing an efficient key establishment scheme is of great importance to the data security in Wi... more Designing an efficient key establishment scheme is of great importance to the data security in Wireless Sensor Networks. The traditional cryptographic techniques are impractical in Wireless Sensor Networks because of associated high energy and computational overheads. This algorithm supports the establishment of three types of keys for each sensor node, an individual key shared with the base station, a pair wise key shared with neighbor sensor node, and a group key that is shared by all the nodes in the network. The algorithm used for establishing and updating these keys are energy efficient and minimizes the involvement of the base station. Polynomial function is used in the study to calculate the keys during initialization, membership change and key compromise. Periodically the key will be updated. To overcome the problem of energy insufficiency and memory storage and to provide adequate security, the energy efficient scheme is proposed. It works well in undefined deployment environment. Unauthorized nodes should not be allowed to establish communication with network nodes. This scheme when compared with other existing schemes has a very low overhead in computation, communication and storage.