Learn More
Standard embeded sensor nework models emphasize energy efficiency and distributed decision-making by considering untethered and unattended sensors. To this we add two constraints the possibility of sensor failure and the fact that each sensor must tradeoff its own resource consumption with overall network objectives. In this paper, we develop an analytical(More)
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishable power resources, both path length and path energy cost are important metrics affecting sensor lifetime. In this paper, we model the formation of length and energy constrained(More)
Key predistribution is a well-known technique for ensuring secure communication via encryption among sensors deployed in an ad-hoc manner to form a sensor network. In this paper, we propose a novel 2-Phase technique for key predistribution based on a combination of inherited and random key assignments from the given key pool to individual sensor nodes. We(More)
We develop a strategic model of information acquisition in networks where agents pay for all the pieces of information they acquire, including those through indirect links. The cost of information depends on the value of the information itself and the distance it traverses in the network. We consider two possibilities: (i) costs of information increase with(More)
Computer Science and technology have been driving scientific innovations, expanding the Information Technology sector and increasing productivity in all economic sectors for the last few decades, thus contributing significantly to the economic output of the U.S. Each sector of this country, ranging from national security to everyday life, is enormously(More)
Stepping-stone is the most popular way used to attack other computers. Some insiders use stepping-stone to launch their attacks pretending to be outsiders. In this paper, we propose a novel algorithm to detect stepping-stone insider attacks through comparing outgoing and incoming connections. We modify the existing packet matching algorithm by introducing(More)
Key pre-distribution is a well-known technique for ensuring secure communication among sensors deployed in an ad-hoc manner to form a sensor network. Secure paths can be established between any two sensors, where adjacent sensors on the path share a (predistributed) secret key. Several results have been presented recently on random key predistribution(More)