Kalai Kalaichelvan

Learn More
Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless(More)
Software evolution and reuse is more likely to receive higher payoff if high-level artifacts—such as architectures and designs—can be reused and can guide low-level component reuse. In practice, however, high-level artifacts are often not appropriately captured. This paper presents an approach to capturing and assessing software architectures for evolution(More)
Ad hoc, actuator and sensor wireless networks normally have critical connectivity properties before becoming fault intolerant. Existing algorithms for testing k-connectivity are centralized. In this article, we introduce localized algorithms for testing A-connectivity. In localized protocols, each node makes its own decision based on the information(More)
Software architectures are often claimed to be robust. However, there is no explicit and concrete definition of software architecture robustness. This paper gives a definition of software architecture robustness and presents a set of architecture metrics that were applied to real-time telecommunications software for the evaluation of robustness. The purpose(More)
This paper presents a case study of a software project in the maintenance phase. The case study was based on a sample of modules, representing about 1.3 million lines of code, from a very large telecommunications system. Software quality models were developed to predict the number of faults expected from the coding through operations phases. Since modules(More)
Depth First Search (DFS) and position based routing algorithms were proposed in literature. These are localized algorithms that guarantee the delivery for connected ad hoc and sensor wireless networks modeled by arbitrary graphs, including inaccurate location information for a destination node. This paper first optimizes an existing DFS based routing scheme(More)
Depth First Search (DFS) and position-based routing algorithms were proposed in literature. These are localised algorithms that guarantee the delivery for connected ad hoc and sensor wireless networks modelled by arbitrary graphs, including inaccurate location information for a destination node. This article first optimises an existing DFS-based routing(More)
Most existing network layer protocols in ad hoc and sensor networks require the use of topological or geographical knowledge of neighboring nodes in order to make proper decisions. Such protocols obtain this knowledge following the unit disk graph model, whereby two nodes are neighbors if and only if the distance between them is at most R, where R is the(More)