#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2010

2013

- This year (0)
- Last 5 years (4)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Levon H. Aslanyan, Hakob Aslanyan, Hamid Khosravi
- Ninth International Conference on Computerâ€¦
- 2013

Wireless sensor hubs generally consist of three main parts, communication subsystem, processing subsystem and sensing subsystem, normally communication subsystem consume most of energy of a typicalâ€¦ (More)

- Hakob Aslanyan, Pierre Leone, JosÃ© D. P. Rolim
- SEA
- 2010

In this paper, we consider wireless sensor networks where nodes have random and changeable mobility patterns. We study the problem where a particular node, called the base station, collects the dataâ€¦ (More)

- Hakob Aslanyan, JosÃ© D. P. Rolim
- 2010 IEEE/IFIP International Conference onâ€¦
- 2010

Interference minimization problem in wireless sensor and ad-hoc networks are considered. That is to assign a transmission radius to each node of a network, to make it connected and at the same timeâ€¦ (More)

- Hakob Aslanyan, JosÃ© D. P. Rolim
- ArXiv
- 2013

Quantitative characterization of randomly roving agents in Agent Based Intrusion Detection Environment (ABIDE) is studied. Formula simplifications regarding known results and publications are given.â€¦ (More)

- Hakob Aslanyan
- ArXiv
- 2011

More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper. Introduction The greedy heuristic is the most used for optimizationâ€¦ (More)

- Hakob Aslanyan, JosÃ© D. P. Rolim
- ArXiv
- 2011

Quantitative characterization of randomly roving agents in wireless sensor networks (WSN) is studied. Below t he formula simplifications, regarding the known results and publications, it is shownâ€¦ (More)

- Ara Alexanyan, Hakob Aslanyan, JosÃ© D. P. Rolim
- 2013 IEEE International Conference on Pervasiveâ€¦
- 2013

In this article we expose a new field of application of such a classical method of computational group theory as the Sims' algorithm. We introduce a symmetric block encryption scheme based on aâ€¦ (More)

- Hakob Aslanyan
- ArXiv
- 2011

Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers.â€¦ (More)

- Hakob Aslanyan
- ArXiv
- 2011

Abstract: Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to assign a transmission power to each node of a network such that the network is connectedâ€¦ (More)

- Hakob Aslanyan, Tigran Tonoyan, JosÃ© D. P. Rolim
- 2013 21st International Conference on Softwareâ€¦
- 2013

We consider the minimum radiation path problem in areas with wireless heterogeneous networks. Namely, given a set of spatially distributed wireless transmitters, it is required to find a trajectoryâ€¦ (More)

- â€¹
- 1
- â€º