Kee-Bum Kim

Learn More
Wireless sensor networks (WSNs) are highly vulnerable to attacks for the limitation of constrained resource and communicating via wireless links, especially running in a hostile environment such as battlefields. In such situation, an adversary may capture any node compromising critical security data including keys used for confidentiality and(More)
The proliferation of research on target detection and tracking in wireless sensor networks has kindled development of tracking continuous objects such as fires, biochemical material diffusion. In this paper, we propose an energy efficient algorithm that detects and monitors a moving event region by selecting only a subset of nodes near object boundaries.(More)
Though the security of wireless sensor networks (WSNs) has been studied deeply, the inside attacks still are very difficult to defend. The inside attacks are not detectable with only the classic cryptographic techniques and the attacks mainly include two types of attack: exceptional message attack and abnormal behavior attack. In this paper, we present an(More)
Till current date in majority books on algorithm and research papers, they talk about height of a binary tree in terms like height balanced binary tree. In this paper the notion of width of a binary tree has been introduced and later the recursive algorithm based on the traversal techniques of the binary tree is given. Later the iterative version of(More)
  • 1